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 Baekjin Kim, Young Jung, Yuntian Deng
4 papers
· 2019–2022
· NeurIPS, AISTATS, UAI
Hide ▲
Weighted Gaussian Process Bandits for Non-stationary Environments
AISTATS 2022
On the Equivalence between Online and Private Learnability beyond Binary Classification
NeurIPS 2020
Randomized Exploration for Non-Stationary Stochastic Linear Bandits
UAI 2020
On the Optimality of Perturbations in Stochastic and Adversarial Multi-armed Bandit Problems
NeurIPS 2019
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