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. 2010.05673
  4. Cited By
Is Plug-in Solver Sample-Efficient for Feature-based Reinforcement
  Learning?
v1v2 (latest)

Is Plug-in Solver Sample-Efficient for Feature-based Reinforcement Learning?

12 October 2020
Qiwen Cui
Lin F. Yang
    OffRL
ArXiv (abs)PDFHTML

Papers citing "Is Plug-in Solver Sample-Efficient for Feature-based Reinforcement Learning?"

8 / 8 papers shown
Title
Offline Reinforcement Learning with Differentiable Function
  Approximation is Provably Efficient
Offline Reinforcement Learning with Differentiable Function Approximation is Provably Efficient
Ming Yin
Mengdi Wang
Yu Wang
OffRL
141
12
0
03 Oct 2022
Policy Learning for Robust Markov Decision Process with a Mismatched
  Generative Model
Policy Learning for Robust Markov Decision Process with a Mismatched Generative Model
J. Li
Zhaolin Ren
Dong Yan
Hang Su
Jun Zhu
141
7
0
13 Mar 2022
On the Power of Multitask Representation Learning in Linear MDP
On the Power of Multitask Representation Learning in Linear MDP
Rui Lu
Gao Huang
S. Du
83
29
0
15 Jun 2021
Sample-Efficient Reinforcement Learning for Linearly-Parameterized MDPs
  with a Generative Model
Sample-Efficient Reinforcement Learning for Linearly-Parameterized MDPs with a Generative Model
Bingyan Wang
Yuling Yan
Jianqing Fan
104
20
0
28 May 2021
Optimal Uniform OPE and Model-based Offline Reinforcement Learning in
  Time-Homogeneous, Reward-Free and Task-Agnostic Settings
Optimal Uniform OPE and Model-based Offline Reinforcement Learning in Time-Homogeneous, Reward-Free and Task-Agnostic Settings
Ming Yin
Yu Wang
OffRL
106
19
0
13 May 2021
Nearly Horizon-Free Offline Reinforcement Learning
Nearly Horizon-Free Offline Reinforcement Learning
Zhaolin Ren
Jialian Li
Bo Dai
S. Du
Sujay Sanghavi
OffRL
83
49
0
25 Mar 2021
Exponential Lower Bounds for Batch Reinforcement Learning: Batch RL can
  be Exponentially Harder than Online RL
Exponential Lower Bounds for Batch Reinforcement Learning: Batch RL can be Exponentially Harder than Online RL
Andrea Zanette
OffRL
206
71
0
14 Dec 2020
Minimax Sample Complexity for Turn-based Stochastic Game
Minimax Sample Complexity for Turn-based Stochastic Game
Qiwen Cui
Lin F. Yang
77
23
0
29 Nov 2020
1