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 Inderjit S. Dhillon, Inderjit S Dhillon, Prateek Jain
12 papers
· 2011–2018
· NeurIPS, JMLR, AISTATS
Hide ▲
Cost-Sensitive Learning with Noisy Labels
JMLR 2018
Alternating Minimization for Regression Problems with Vector-valued Outputs
NeurIPS 2015
Predtron: A Family of Online Algorithms for General Prediction Problems
NeurIPS 2015
On Iterative Hard Thresholding Methods for High-dimensional M-Estimation
NeurIPS 2014
Prediction and Clustering in Signed Networks: A Local to Global Perspective
JMLR 2014
Learning with Noisy Labels
NeurIPS 2013
On Robust Estimation of High Dimensional Generalized Linear Models
IJCAI 2013
Perturbation based Large Margin Approach for Ranking
AISTATS 2012
Greedy Algorithms for Structurally Constrained High Dimensional Problems
NeurIPS 2011
Nearest Neighbor based Greedy Coordinate Descent
NeurIPS 2011
On NDCG Consistency of Listwise Ranking Methods
AISTATS 2011
Orthogonal Matching Pursuit with Replacement
NeurIPS 2011
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