Ambuj Tewari
103 papers · 2006–2026 · 11 venues · across top CS/AI venues
This profile combines several different researchers. Authors are keyed by name, and this name's papers fall into 25 separate collaboration groups - the largest holds only 22% of them. Pick the group below that matches the researcher you mean. How a shared name is split.
Achievements are not shown for a combined profile - each one describes a single researcher's record, which this is not.
Which Ambuj Tewari?
12 groups of papers that share co-authors internally but none with each other - each most likely a different researcher. Pick one to see its papers.
with Vinod Raman, UNIQUE SUBEDI, Ananth Raman
15 papers
· 2022–2025
· NeurIPS, COLT, ALT
Hide ▲
A Unified Theory of Supervised Online Learnability
ALT 2025
Generation through the lens of learning theory
COLT 2025
On the Benefits of Active Data Collection in Operator Learning
ICML 2025
The Complexity of Sequential Prediction in Dynamical Systems
L4DC 2025
A Characterization of Multioutput Learnability
JMLR 2024
Apple Tasting: Combinatorial Dimensions and Minimax Rates
COLT 2024
Multiclass Online Learnability under Bandit Feedback
ALT 2024
Online Classification with Predictions
NeurIPS 2024
Online Infinite-Dimensional Regression: Learning Linear Operators
ALT 2024
Online Learning with Set-valued Feedback
COLT 2024
Smoothed Online Classification can be Harder than Batch Classification
NeurIPS 2024
Multiclass Online Learning and Uniform Convergence
COLT 2023
On Proper Learnability between Average- and Worst-case Robustness
NeurIPS 2023
On the Learnability of Multilabel Ranking
NeurIPS 2023
Online Agnostic Multiclass Boosting
NeurIPS 2022
13 papers whose co-authors appear nowhere else under this name
A Characterization of List Language Identification in the Limit
COLT 2026
Conformal Contextual Robust Optimization
AISTATS 2024
Sequence Length Independent Norm-Based Generalization Bounds for Transformers
AISTATS 2024
Variational Inference with Coverage Guarantees in Simulation-Based Inference
ICML 2024
Learning in online MDPs: is there a price for handling the communicating case?
UAI 2023
What You See May Not Be What You Get: UCB Bandit Algorithms Robust to ε-Contamination
UAI 2020
Generalization Bounds in the Predict-then-Optimize Framework
NeurIPS 2019
Beyond the Hazard Rate: More Perturbation Algorithms for Adversarial Multi-armed Bandits
JMLR 2018
But How Does It Work in Theory? Linear SVM with Random Features
NeurIPS 2018
Action Centered Contextual Bandits
NeurIPS 2017
Feature Clustering for Accelerating Parallel Coordinate Descent
NeurIPS 2012
Improved Regret Guarantees for Online Smooth Convex Optimization with Bandit Feedback
AISTATS 2011
Learning Exponential Families in High-Dimensions: Strong Convexity and Sparsity
AISTATS 2010