regret bound

Regret Lower Bound and Optimal Algorithm in Dueling Bandit Problem COLT 2015 Regret Lower Bound and Optimal Algorithm in Finite Stochastic Partial Monitoring NeurIPS 2015 Revenue Optimization against Strategic Buyers NeurIPS 2015 Risk and Regret of Hierarchical Bayesian Learners ICML 2015 Safe Policy Search for Lifelong Reinforcement Learning with Sublinear Regret ICML 2015 Second-Order Non-Stationary Online Learning for Regression JMLR 2015 Stochastic Online Greedy Learning with Semi-bandit Feedbacks NeurIPS 2015 Surrogate regret bounds for generalized classification performance metrics ACML 2015 The Hedge Algorithm on a Continuum ICML 2015 The Pareto Regret Frontier for Bandits NeurIPS 2015 Thompson Sampling for Learning Parameterized Markov Decision Processes COLT 2015 Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits AISTATS 2015 Adaptivity and Optimism: An Improved Exponentiated Gradient Algorithm ICML 2014 A Drifting-Games Analysis for Online Learning and Applications to Boosting NeurIPS 2014 A second-order bound with excess losses COLT 2014 Bandit Convex Optimization: Towards Tight Bounds NeurIPS 2014 Bayesian Multi-Scale Optimistic Optimization AISTATS 2014 Bounded Regret for Finite-Armed Structured Bandits NeurIPS 2014 Combinatorial Partial Monitoring Game with Linear Feedback and Its Applications ICML 2014 Delay-Tolerant Algorithms for Asynchronous Distributed Online Learning NeurIPS 2014 Discovering, Learning and Exploiting Relevance NeurIPS 2014 Efficient learning by implicit exploration in bandit problems with side observations NeurIPS 2014 Efficient Partial Monitoring with Prior Information NeurIPS 2014 Extreme bandits NeurIPS 2014 Follow the Leader If You Can, Hedge If You Must JMLR 2014