regret bound

The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond COLT 2011 A Computational Decision Theory for Interactive Assistants NeurIPS 2010 Contextual Multi-Armed Bandits AISTATS 2010 Efficient Reductions for Imitation Learning AISTATS 2010 Near-optimal Regret Bounds for Reinforcement Learning JMLR 2010 Non-Stochastic Bandit Slate Problems NeurIPS 2010 Online Markov Decision Processes under Bandit Feedback NeurIPS 2010 Parametric Bandits: The Generalized Linear Case NeurIPS 2010 Regret Bounds and Minimax Policies under Partial Monitoring JMLR 2010 Regret Bounds for Gaussian Process Bandit Problems AISTATS 2010 Adapting to the Shifting Intent of Search Queries NeurIPS 2009 A Parameter-free Hedging Algorithm NeurIPS 2009 Learning Permutations with Exponential Weights JMLR 2009 Monte Carlo Sampling for Regret Minimization in Extensive Games NeurIPS 2009 Multi-Label Prediction via Compressed Sensing NeurIPS 2009 On Stochastic and Worst-case Models for Investing NeurIPS 2009 Algorithms for Infinitely Many-Armed Bandits NeurIPS 2008 Mind the Duality Gap: Logarithmic regret algorithms for online optimization NeurIPS 2008 Near-optimal Regret Bounds for Reinforcement Learning NeurIPS 2008 Online Optimization in X-Armed Bandits NeurIPS 2008 On the Generalization Ability of Online Strongly Convex Programming Algorithms NeurIPS 2008 Randomized Online PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension JMLR 2008 Sparse Online Learning via Truncated Gradient NeurIPS 2008 Adaptive Online Gradient Descent NeurIPS 2007 From External to Internal Regret JMLR 2007