dblp.uni-trier.dewww.uni-trier.de

Ambuj Tewari

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
11EEPeter L. Bartlett, Varsha Dani, Thomas P. Hayes, Sham Kakade, Alexander Rakhlin, Ambuj Tewari: High-Probability Regret Bounds for Bandit Online Linear Optimization. COLT 2008: 335-342
10EEJacob Abernethy, Peter L. Bartlett, Alexander Rakhlin, Ambuj Tewari: Optimal Stragies and Minimax Lower Bounds for Online Convex Games. COLT 2008: 415-424
9EESham M. Kakade, Shai Shalev-Shwartz, Ambuj Tewari: Efficient bandit algorithms for online multiclass prediction. ICML 2008: 440-447
8EESham M. Kakade, Karthik Sridharan, Ambuj Tewari: On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization. NIPS 2008: 793-800
7EESham M. Kakade, Ambuj Tewari: On the Generalization Ability of Online Strongly Convex Programming Algorithms. NIPS 2008: 801-808
2007
6EEAmbuj Tewari, Peter L. Bartlett: Bounded Parameter Markov Decision Processes with Average Reward Criterion. COLT 2007: 263-277
5EEAmbuj Tewari, Peter L. Bartlett: Optimistic Linear Programming gives Logarithmic Regret for Irreducible MDPs. NIPS 2007
2006
4EEPeter L. Bartlett, Ambuj Tewari: Sample Complexity of Policy Search with Known Dynamics. NIPS 2006: 97-104
2005
3EEAmbuj Tewari, Peter L. Bartlett: On the Consistency of Multiclass Classification Methods. COLT 2005: 143-157
2004
2EEPeter L. Bartlett, Ambuj Tewari: Sparseness Versus Estimating Conditional Probabilities: Some Asymptotic Results. COLT 2004: 564-578
2002
1EEAmbuj Tewari, Utkarsh Srivastava, P. Gupta: A Parallel DFA Minimization Algorithm. HiPC 2002: 34-40

Coauthor Index

1Jacob Abernethy [10]
2Peter L. Bartlett [2] [3] [4] [5] [6] [10] [11]
3Varsha Dani [11]
4P. Gupta [1]
5Thomas P. Hayes [11]
6Sham M. Kakade (Sham Kakade) [7] [8] [9] [11]
7Alexander Rakhlin [10] [11]
8Shai Shalev-Shwartz [9]
9Karthik Sridharan [8]
10Utkarsh Srivastava [1]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)