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. 2105.08024
  4. Cited By
Sample-Efficient Reinforcement Learning Is Feasible for Linearly
  Realizable MDPs with Limited Revisiting

Sample-Efficient Reinforcement Learning Is Feasible for Linearly Realizable MDPs with Limited Revisiting

17 May 2021
Gen Li
Yuxin Chen
Yuejie Chi
Yuantao Gu
Yuting Wei
    OffRL
ArXivPDFHTML

Papers citing "Sample-Efficient Reinforcement Learning Is Feasible for Linearly Realizable MDPs with Limited Revisiting"

14 / 14 papers shown
Title
Horizon-Free Regret for Linear Markov Decision Processes
Horizon-Free Regret for Linear Markov Decision Processes
Zihan Zhang
Jason D. Lee
Yuxin Chen
Simon S. Du
33
3
0
15 Mar 2024
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
25
6
0
30 May 2023
Reinforcement Learning with Function Approximation: From Linear to
  Nonlinear
Reinforcement Learning with Function Approximation: From Linear to Nonlinear
Jihao Long
Jiequn Han
24
5
0
20 Feb 2023
Sample Efficient Deep Reinforcement Learning via Local Planning
Sample Efficient Deep Reinforcement Learning via Local Planning
Dong Yin
S. Thiagarajan
N. Lazić
Nived Rajaraman
Botao Hao
Csaba Szepesvári
20
4
0
29 Jan 2023
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
30
18
0
22 Aug 2022
A Few Expert Queries Suffices for Sample-Efficient RL with Resets and
  Linear Value Approximation
A Few Expert Queries Suffices for Sample-Efficient RL with Resets and Linear Value Approximation
P. Amortila
Nan Jiang
Dhruv Madeka
Dean Phillips Foster
13
5
0
18 Jul 2022
Computationally Efficient PAC RL in POMDPs with Latent Determinism and
  Conditional Embeddings
Computationally Efficient PAC RL in POMDPs with Latent Determinism and Conditional Embeddings
Masatoshi Uehara
Ayush Sekhari
Jason D. Lee
Nathan Kallus
Wen Sun
58
6
0
24 Jun 2022
Target Network and Truncation Overcome The Deadly Triad in $Q$-Learning
Target Network and Truncation Overcome The Deadly Triad in QQQ-Learning
Zaiwei Chen
John-Paul Clarke
S. T. Maguluri
18
19
0
05 Mar 2022
Perturbational Complexity by Distribution Mismatch: A Systematic
  Analysis of Reinforcement Learning in Reproducing Kernel Hilbert Space
Perturbational Complexity by Distribution Mismatch: A Systematic Analysis of Reinforcement Learning in Reproducing Kernel Hilbert Space
Jihao Long
Jiequn Han
25
6
0
05 Nov 2021
Breaking the Sample Complexity Barrier to Regret-Optimal Model-Free
  Reinforcement Learning
Breaking the Sample Complexity Barrier to Regret-Optimal Model-Free Reinforcement Learning
Gen Li
Laixi Shi
Yuxin Chen
Yuejie Chi
OffRL
37
50
0
09 Oct 2021
Model-free Representation Learning and Exploration in Low-rank MDPs
Model-free Representation Learning and Exploration in Low-rank MDPs
Aditya Modi
Jinglin Chen
A. Krishnamurthy
Nan Jiang
Alekh Agarwal
OffRL
102
78
0
14 Feb 2021
Efficient Learning in Non-Stationary Linear Markov Decision Processes
Efficient Learning in Non-Stationary Linear Markov Decision Processes
Ahmed Touati
Pascal Vincent
34
29
0
24 Oct 2020
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
Gen Li
Yuting Wei
Yuejie Chi
Yuxin Chen
26
124
0
26 May 2020
Optimism in Reinforcement Learning with Generalized Linear Function
  Approximation
Optimism in Reinforcement Learning with Generalized Linear Function Approximation
Yining Wang
Ruosong Wang
S. Du
A. Krishnamurthy
132
135
0
09 Dec 2019
1