ResearchTrend.AI
On the Convergence of Monte Carlo UCB for Random-Length Episodic MDPs
v1v2 (latest)

On the Convergence of Monte Carlo UCB for Random-Length Episodic MDPs

Zixuan Dong
Che Wang
George Andriopoulos
ArXiv (abs)PDFHTML

Papers citing "On the Convergence of Monte Carlo UCB for Random-Length Episodic MDPs"

10 / 10 papers shown
Title
Finite-Sample Analysis of the Monte Carlo Exploring Starts Algorithm for Reinforcement Learning
Finite-Sample Analysis of the Monte Carlo Exploring Starts Algorithm for Reinforcement Learning
Suei-Wen Chen
Keith Ross
Pierre Youssef
60
1
0
03 Oct 2024
Online Learning of Decision Trees with Thompson Sampling
Online Learning of Decision Trees with Thompson Sampling
Ayman Chaouki
Jesse Read
Albert Bifet
72
2
0
09 Apr 2024
Slowly Changing Adversarial Bandit Algorithms are Efficient for Discounted MDPs
Slowly Changing Adversarial Bandit Algorithms are Efficient for Discounted MDPs
Ian A. Kash
L. Reyzin
Zishun Yu
105
0
0
18 May 2022
On the Convergence of Reinforcement Learning with Monte Carlo Exploring Starts
On the Convergence of Reinforcement Learning with Monte Carlo Exploring Starts
Jun Liu
33
15
0
21 Jul 2020
On the Convergence of the Monte Carlo Exploring Starts Algorithm for Reinforcement Learning
On the Convergence of the Monte Carlo Exploring Starts Algorithm for Reinforcement Learning
Che Wang
Shuhan Yuan
Kai Shao
George Andriopoulos
40
12
0
10 Feb 2020
Provably Efficient Reinforcement Learning with Linear Function Approximation
Provably Efficient Reinforcement Learning with Linear Function Approximation
Chi Jin
Zhuoran Yang
Zhaoran Wang
Michael I. Jordan
113
561
0
11 Jul 2019
On the convergence of optimistic policy iteration for stochastic shortest path problem
On the convergence of optimistic policy iteration for stochastic shortest path problem
Yuanlong Chen
37
7
0
27 Aug 2018
Minimax Regret Bounds for Reinforcement Learning
Minimax Regret Bounds for Reinforcement Learning
M. G. Azar
Ian Osband
Rémi Munos
101
778
0
16 Mar 2017
Unifying Count-Based Exploration and Intrinsic Motivation
Unifying Count-Based Exploration and Intrinsic Motivation
Marc G. Bellemare
S. Srinivasan
Georg Ostrovski
Tom Schaul
D. Saxton
Rémi Munos
195
1,487
0
06 Jun 2016
Asymptotic Behavior of Minimal-Exploration Allocation Policies: Almost Sure, Arbitrarily Slow Growing Regret
Asymptotic Behavior of Minimal-Exploration Allocation Policies: Almost Sure, Arbitrarily Slow Growing Regret
Wesley Cowan
M. Katehakis
145
14
0
12 May 2015

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.