ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2005.12900
  4. Cited By
Breaking the Sample Size Barrier in Model-Based Reinforcement Learning
  with a Generative Model

Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model

26 May 2020
Gen Li
Yuting Wei
Yuejie Chi
Yuxin Chen
ArXivPDFHTML

Papers citing "Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model"

18 / 18 papers shown
Title
Primal-Dual Sample Complexity Bounds for Constrained Markov Decision Processes with Multiple Constraints
Max Buckley
Konstantinos Papathanasiou
Andreas Spanopoulos
45
0
0
09 Mar 2025
A Survey of Reinforcement Learning for Optimization in Automation
A Survey of Reinforcement Learning for Optimization in Automation
Ahmad Farooq
Kamran Iqbal
OffRL
79
1
0
13 Feb 2025
Span-Based Optimal Sample Complexity for Average Reward MDPs
Span-Based Optimal Sample Complexity for Average Reward MDPs
M. Zurek
Yudong Chen
18
6
0
22 Nov 2023
Distributionally Robust Model-based Reinforcement Learning with Large
  State Spaces
Distributionally Robust Model-based Reinforcement Learning with Large State Spaces
Shyam Sundhar Ramesh
Pier Giuseppe Sessa
Yifan Hu
Andreas Krause
Ilija Bogunovic
OOD
26
10
0
05 Sep 2023
Settling the Sample Complexity of Online Reinforcement Learning
Settling the Sample Complexity of Online Reinforcement Learning
Zihan Zhang
Yuxin Chen
Jason D. Lee
S. Du
OffRL
90
21
0
25 Jul 2023
High-probability sample complexities for policy evaluation with linear
  function approximation
High-probability sample complexities for policy evaluation with linear function approximation
Gen Li
Weichen Wu
Yuejie Chi
Cong Ma
Alessandro Rinaldo
Yuting Wei
OffRL
13
6
0
30 May 2023
A Finite Sample Complexity Bound for Distributionally Robust Q-learning
A Finite Sample Complexity Bound for Distributionally Robust Q-learning
Shengbo Wang
Nian Si
Jose H. Blanchet
Zhengyuan Zhou
OOD
OffRL
16
22
0
26 Feb 2023
Near Sample-Optimal Reduction-based Policy Learning for Average Reward
  MDP
Near Sample-Optimal Reduction-based Policy Learning for Average Reward MDP
Jinghan Wang
Meng-Xian Wang
Lin F. Yang
16
14
0
01 Dec 2022
Minimax-Optimal Multi-Agent RL in Markov Games With a Generative Model
Minimax-Optimal Multi-Agent RL in Markov Games With a Generative Model
Gen Li
Yuejie Chi
Yuting Wei
Yuxin Chen
17
18
0
22 Aug 2022
Best Policy Identification in Linear MDPs
Best Policy Identification in Linear MDPs
Jerome Taupin
Yassir Jedra
Alexandre Proutière
21
3
0
11 Aug 2022
Near-Optimal Sample Complexity Bounds for Constrained MDPs
Near-Optimal Sample Complexity Bounds for Constrained MDPs
Sharan Vaswani
Lin F. Yang
Csaba Szepesvári
14
32
0
13 Jun 2022
A Statistical Analysis of Polyak-Ruppert Averaged Q-learning
A Statistical Analysis of Polyak-Ruppert Averaged Q-learning
Xiang Li
Wenhao Yang
Jiadong Liang
Zhihua Zhang
Michael I. Jordan
21
15
0
29 Dec 2021
Quantum Algorithms for Reinforcement Learning with a Generative Model
Quantum Algorithms for Reinforcement Learning with a Generative Model
Daochen Wang
Aarthi Sundaram
Robin Kothari
Ashish Kapoor
M. Rötteler
14
26
0
15 Dec 2021
Sample Complexity of Robust Reinforcement Learning with a Generative
  Model
Sample Complexity of Robust Reinforcement Learning with a Generative Model
Kishan Panaganti
D. Kalathil
80
69
0
02 Dec 2021
Robustness and sample complexity of model-based MARL for general-sum
  Markov games
Robustness and sample complexity of model-based MARL for general-sum Markov games
Jayakumar Subramanian
Amit Sinha
Aditya Mahajan
14
8
0
05 Oct 2021
Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
Gen Li
Changxiao Cai
Ee
Yuting Wei
Yuejie Chi
OffRL
15
75
0
12 Feb 2021
Model-Based Multi-Agent RL in Zero-Sum Markov Games with Near-Optimal
  Sample Complexity
Model-Based Multi-Agent RL in Zero-Sum Markov Games with Near-Optimal Sample Complexity
K. Zhang
Sham Kakade
Tamer Bacsar
Lin F. Yang
16
119
0
15 Jul 2020
$Q$-learning with Logarithmic Regret
QQQ-learning with Logarithmic Regret
Kunhe Yang
Lin F. Yang
S. Du
19
59
0
16 Jun 2020
1