ResearchTrend.AI
Variational Regret Bounds for Reinforcement Learning
v1v2v3 (latest)

Variational Regret Bounds for Reinforcement Learning

Pratik Gajane
R. Ortner
P. Auer
ArXiv (abs)PDFHTML

Papers citing "Variational Regret Bounds for Reinforcement Learning"

5 / 5 papers shown
Title
A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal, and Parameter-free
A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal, and Parameter-free
Yifang Chen
Chung-Wei Lee
Haipeng Luo
Chen-Yu Wei
130
134
0
03 Feb 2019
Selecting Near-Optimal Approximate State Representations in Reinforcement Learning
Selecting Near-Optimal Approximate State Representations in Reinforcement Learning
R. Ortner
Odalric-Ambrym Maillard
D. Ryabko
143
27
0
12 May 2014
Online Learning in Markov Decision Processes with Adversarially Chosen Transition Probability Distributions
Online Learning in Markov Decision Processes with Adversarially Chosen Transition Probability Distributions
Yasin Abbasi-Yadkori
Peter L. Bartlett
Csaba Szepesvári
97
86
0
12 Mar 2013
Regret Bounds for Restless Markov Bandits
Regret Bounds for Restless Markov Bandits
R. Ortner
D. Ryabko
P. Auer
Rémi Munos
96
117
0
12 Sep 2012
REGAL: A Regularization based Algorithm for Reinforcement Learning in Weakly Communicating MDPs
REGAL: A Regularization based Algorithm for Reinforcement Learning in Weakly Communicating MDPs
Peter L. Bartlett
Ambuj Tewari
93
286
0
09 May 2012