conftrace_

regret bound

1926 papers

Explore in graph

Also known as

RB

Co-occurring keywords

online learning (1777) multi-armed bandit (1098) contextual bandit (381) stochastic optimization (1060) reinforcement learning (4352) online algorithm (445) upper confidence bound (197) markov decision process (790) thompson sampling (237) online convex optimization (165)

Papers

Efficient Reductions for Imitation Learning AISTATS 2010
Non-Stochastic Bandit Slate Problems NIPS 2010
Parametric Bandits: The Generalized Linear Case NIPS 2010
Near-optimal Regret Bounds for Reinforcement Learning JMLR 2010
A Computational Decision Theory for Interactive Assistants NIPS 2010
Online Markov Decision Processes under Bandit Feedback NIPS 2010
A Parameter-free Hedging Algorithm NIPS 2009
Learning Permutations with Exponential Weights JMLR 2009
Adapting to the Shifting Intent of Search Queries NIPS 2009
On Stochastic and Worst-case Models for Investing NIPS 2009
Near-optimal Regret Bounds for Reinforcement Learning NIPS 2008
On the Generalization Ability of Online Strongly Convex Programming Algorithms NIPS 2008
Randomized Online PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension JMLR 2008
Online Optimization in X-Armed Bandits NIPS 2008
Algorithms for Infinitely Many-Armed Bandits NIPS 2008
Mind the Duality Gap: Logarithmic regret algorithms for online optimization NIPS 2008
Optimistic Linear Programming gives Logarithmic Regret for Irreducible MDPs NIPS 2007
Adaptive Online Gradient Descent NIPS 2007
The Epoch-Greedy Algorithm for Multi-armed Bandits with Side Information NIPS 2007
From External to Internal Regret JMLR 2007
The Price of Bandit Information for Online Optimization NIPS 2007
Logarithmic Online Regret Bounds for Undiscounted Reinforcement Learning NIPS 2006
Randomized PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension NIPS 2006
No-regret Algorithms for Online Convex Programs NIPS 2006
The Sample Complexity of Exploration in the Multi-Armed Bandit Problem JMLR 2004