Skip to content
conftrace_

regret bound

2,284 papers

Explore in graph

Also known as

RB

Co-occurring keywords · papers mentioning both

online learning (732) multi-armed bandit (650) contextual bandit (211) reinforcement learning (189) stochastic optimization (172) online algorithm (153) upper confidence bound (143) markov decision process (137) thompson sampling (127) online convex optimization (116)

Papers

Optimistic Linear Programming gives Logarithmic Regret for Irreducible MDPs NeurIPS 2007 Progressive mixture rules are deviation suboptimal NeurIPS 2007 The Epoch-Greedy Algorithm for Multi-armed Bandits with Side Information NeurIPS 2007 The Price of Bandit Information for Online Optimization NeurIPS 2007 Logarithmic Online Regret Bounds for Undiscounted Reinforcement Learning NeurIPS 2006 No-regret Algorithms for Online Convex Programs NeurIPS 2006 Randomized PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension NeurIPS 2006 The Sample Complexity of Exploration in the Multi-Armed Bandit Problem JMLR 2004 Using Confidence Bounds for Exploitation-Exploration Trade-offs JMLR 2002