|
Search the dblp DataBase
Ambuj Tewari:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Peter L. Bartlett, Ambuj Tewari
Sparseness Versus Estimating Conditional Probabilities: Some Asymptotic Results. [Citation Graph (0, 0)][DBLP] COLT, 2004, pp:564-578 [Conf]
- Ambuj Tewari, Peter L. Bartlett
On the Consistency of Multiclass Classification Methods. [Citation Graph (0, 0)][DBLP] COLT, 2005, pp:143-157 [Conf]
- Ambuj Tewari, Utkarsh Srivastava, P. Gupta
A Parallel DFA Minimization Algorithm. [Citation Graph (0, 0)][DBLP] HiPC, 2002, pp:34-40 [Conf]
- Ambuj Tewari, Peter L. Bartlett
Bounded Parameter Markov Decision Processes with Average Reward Criterion. [Citation Graph (0, 0)][DBLP] COLT, 2007, pp:263-277 [Conf]
- Peter L. Bartlett, Ambuj Tewari
Sample Complexity of Policy Search with Known Dynamics. [Citation Graph (0, 0)][DBLP] NIPS, 2006, pp:97-104 [Conf]
Optimal Stragies and Minimax Lower Bounds for Online Convex Games. [Citation Graph (, )][DBLP]
High-Probability Regret Bounds for Bandit Online Linear Optimization. [Citation Graph (, )][DBLP]
Efficient bandit algorithms for online multiclass prediction. [Citation Graph (, )][DBLP]
Stochastic methods for l1 regularized loss minimization. [Citation Graph (, )][DBLP]
Optimistic Linear Programming gives Logarithmic Regret for Irreducible MDPs. [Citation Graph (, )][DBLP]
On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization. [Citation Graph (, )][DBLP]
On the Generalization Ability of Online Strongly Convex Programming Algorithms. [Citation Graph (, )][DBLP]
Applications of strong convexity--strong smoothness duality to learning with matrices [Citation Graph (, )][DBLP]
Learning Exponential Families in High-Dimensions: Strong Convexity and Sparsity [Citation Graph (, )][DBLP]
On the Finite Time Convergence of Cyclic Coordinate Descent Methods [Citation Graph (, )][DBLP]
Online Learning: Random Averages, Combinatorial Parameters, and Learnability [Citation Graph (, )][DBLP]
Search in 0.019secs, Finished in 0.020secs
|