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

Contextual Bandit Algorithms with Supervised Learning Guarantees AISTATS 2011
A Finite-Time Analysis of Multi-armed Bandits Problems with Kullback-Leibler Divergences COLT 2011
The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond COLT 2011
Active Learning Ranking from Pairwise Preferences with Almost Optimal Query Complexity NIPS 2011
Committing Bandits NIPS 2011
On the Universality of Online Mirror Descent NIPS 2011
Learning Eigenvectors for Free NIPS 2011
Prediction strategies without loss NIPS 2011
Improved Algorithms for Linear Stochastic Bandits NIPS 2011
PAC-Bayesian Analysis of Contextual Bandits NIPS 2011
Contextual Gaussian Process Bandit Optimization NIPS 2011
Stochastic convex optimization with bandit feedback NIPS 2011
Improved Regret Guarantees for Online Smooth Convex Optimization with Bandit Feedback AISTATS 2011
-Armed Bandits JMLR 2011
Sparsity Regret Bounds for Individual Sequences in Online Linear Regression COLT 2011
Adaptive Hedge NIPS 2011
Bandits, Query Learning, and the Haystack Dimension COLT 2011
Monotone multi-armed bandit allocations COLT 2011
Greedy Model Averaging NIPS 2011
Newtron: an Efficient Bandit algorithm for Online Multiclass Prediction NIPS 2011
Selecting the State-Representation in Reinforcement Learning NIPS 2011
Regret Bounds for the Adaptive Control of Linear Quadratic Systems COLT 2011
Regret Bounds for Gaussian Process Bandit Problems AISTATS 2010
Regret Bounds and Minimax Policies under Partial Monitoring JMLR 2010
Contextual Multi-Armed Bandits AISTATS 2010