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. 2011.04019
  4. Cited By
Sparse Feature Selection Makes Batch Reinforcement Learning More Sample
  Efficient

Sparse Feature Selection Makes Batch Reinforcement Learning More Sample Efficient

8 November 2020
Botao Hao
Yaqi Duan
Tor Lattimore
Csaba Szepesvári
Mengdi Wang
    OffRL
ArXivPDFHTML

Papers citing "Sparse Feature Selection Makes Batch Reinforcement Learning More Sample Efficient"

12 / 12 papers shown
Title
Information-Theoretic State Variable Selection for Reinforcement
  Learning
Information-Theoretic State Variable Selection for Reinforcement Learning
Charles Westphal
Stephen Hailes
Mirco Musolesi
26
3
0
21 Jan 2024
Does Sparsity Help in Learning Misspecified Linear Bandits?
Does Sparsity Help in Learning Misspecified Linear Bandits?
Jialin Dong
Lin F. Yang
22
1
0
29 Mar 2023
Relative Sparsity for Medical Decision Problems
Relative Sparsity for Medical Decision Problems
Samuel J. Weisenthal
Sally W. Thurston
Ashkan Ertefaie
27
2
0
29 Nov 2022
Provably Efficient Reinforcement Learning in Partially Observable
  Dynamical Systems
Provably Efficient Reinforcement Learning in Partially Observable Dynamical Systems
Masatoshi Uehara
Ayush Sekhari
Jason D. Lee
Nathan Kallus
Wen Sun
OffRL
49
31
0
24 Jun 2022
Provable Benefits of Representational Transfer in Reinforcement Learning
Provable Benefits of Representational Transfer in Reinforcement Learning
Alekh Agarwal
Yuda Song
Wen Sun
Kaiwen Wang
Mengdi Wang
Xuezhou Zhang
OffRL
21
33
0
29 May 2022
Representation Learning for Online and Offline RL in Low-rank MDPs
Representation Learning for Online and Offline RL in Low-rank MDPs
Masatoshi Uehara
Xuezhou Zhang
Wen Sun
OffRL
53
126
0
09 Oct 2021
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
Gen Li
Yuxin Chen
Yuejie Chi
Yuantao Gu
Yuting Wei
OffRL
24
28
0
17 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-Xiang Wang
OffRL
32
19
0
13 May 2021
Provably Efficient Reinforcement Learning with Linear Function
  Approximation Under Adaptivity Constraints
Provably Efficient Reinforcement Learning with Linear Function Approximation Under Adaptivity Constraints
Chi Jin
Zhuoran Yang
Zhaoran Wang
OffRL
122
166
0
06 Jan 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
21
71
0
14 Dec 2020
Offline Reinforcement Learning: Tutorial, Review, and Perspectives on
  Open Problems
Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problems
Sergey Levine
Aviral Kumar
George Tucker
Justin Fu
OffRL
GP
340
1,960
0
04 May 2020
Double Reinforcement Learning for Efficient Off-Policy Evaluation in
  Markov Decision Processes
Double Reinforcement Learning for Efficient Off-Policy Evaluation in Markov Decision Processes
Nathan Kallus
Masatoshi Uehara
OffRL
38
181
0
22 Aug 2019
1