activity
20212026
most citedA conjectural asymptotic formula for multiplicative chaos in number theory

2 citations · 3 across the 20 of their papers we have counts for

collaborators
Showing cs.LGShow all

11 papers · 1 filter

cs.LG2024

Multiclass Transductive Online Learning

Steve Hanneke, Vinod Raman, Amirreza Shaeiri +1

We consider the problem of multiclass transductive online learning when the number of labels can be unbounded. Previous works by Ben-David et al. [1997] and Hanneke et al. [2023b]…

cs.LG2024

Smoothed Online Classification can be Harder than Batch Classification

Vinod Raman, Unique Subedi, Ambuj Tewari

We study online classification under smoothed adversaries. In this setting, at each time point, the adversary draws an example from a distribution that has a bounded density with r…

cs.LG2024

The Complexity of Sequential Prediction in Dynamical Systems

Vinod Raman, Unique Subedi, Ambuj Tewari

We study the problem of learning to predict the next state of a dynamical system when the underlying evolution function is unknown. Unlike previous work, we place no parametric ass…

cs.LG2023

Apple Tasting: Combinatorial Dimensions and Minimax Rates

Vinod Raman, Unique Subedi, Ananth Raman +1

In online binary classification under \emph{apple tasting} feedback, the learner only observes the true label if it predicts ``1". First studied by \cite{helmbold2000apple}, we rev…

cs.LG2023

Multiclass Online Learnability under Bandit Feedback

Ananth Raman, Vinod Raman, Unique Subedi +2

We study online multiclass classification under bandit feedback. We extend the results of Daniely and Helbertal [2013] by showing that the finiteness of the Bandit Littlestone dime…

cs.LG2023

A Combinatorial Characterization of Supervised Online Learnability

Vinod Raman, Unique Subedi, Ambuj Tewari

We study the online learnability of hypothesis classes with respect to arbitrary, but bounded loss functions. No characterization of online learnability is known at this level of g…

cs.LG2023

Online Learning with Set-Valued Feedback

Vinod Raman, Unique Subedi, Ambuj Tewari

We study a variant of online multiclass classification where the learner predicts a single label but receives a \textit{set of labels} as feedback. In this model, the learner is pe…

cs.LG2023

On the Learnability of Multilabel Ranking

Vinod Raman, Unique Subedi, Ambuj Tewari

Multilabel ranking is a central task in machine learning. However, the most fundamental question of learnability in a multilabel ranking setting with relevance-score feedback remai…

cs.LG2023

Multiclass Online Learning and Uniform Convergence

Steve Hanneke, Shay Moran, Vinod Raman +2

We study multiclass classification in the agnostic adversarial online learning setting. As our main result, we prove that any multiclass concept class is agnostically learnable if…

cs.LG2023

A Characterization of Multioutput Learnability

Vinod Raman, Unique Subedi, Ambuj Tewari

We consider the problem of learning multioutput function classes in the batch and online settings. In both settings, we show that a multioutput function class is learnable if and o…

cs.LG2022

On Proper Learnability between Average- and Worst-case Robustness

Vinod Raman, Unique Subedi, Ambuj Tewari

Recently, Montasser et al. [2019] showed that finite VC dimension is not sufficient for proper adversarially robust PAC learning. In light of this hardness, there is a growing effo…