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. 2008.07737
  4. Cited By
Provably Efficient Reward-Agnostic Navigation with Linear Value
  Iteration

Provably Efficient Reward-Agnostic Navigation with Linear Value Iteration

18 August 2020
Andrea Zanette
A. Lazaric
Mykel J. Kochenderfer
Emma Brunskill
ArXivPDFHTML

Papers citing "Provably Efficient Reward-Agnostic Navigation with Linear Value Iteration"

19 / 19 papers shown
Title
When is Agnostic Reinforcement Learning Statistically Tractable?
When is Agnostic Reinforcement Learning Statistically Tractable?
Zeyu Jia
Gene Li
Alexander Rakhlin
Ayush Sekhari
Nathan Srebro
OffRL
32
5
0
09 Oct 2023
Policy Finetuning in Reinforcement Learning via Design of Experiments
  using Offline Data
Policy Finetuning in Reinforcement Learning via Design of Experiments using Offline Data
Ruiqi Zhang
Andrea Zanette
OffRL
OnRL
40
7
0
10 Jul 2023
Does Sparsity Help in Learning Misspecified Linear Bandits?
Does Sparsity Help in Learning Misspecified Linear Bandits?
Jialin Dong
Lin F. Yang
25
1
0
29 Mar 2023
Improved Sample Complexity for Reward-free Reinforcement Learning under
  Low-rank MDPs
Improved Sample Complexity for Reward-free Reinforcement Learning under Low-rank MDPs
Yuan Cheng
Ruiquan Huang
J. Yang
Yitao Liang
OffRL
41
8
0
20 Mar 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
34
18
0
22 Aug 2022
On the Statistical Efficiency of Reward-Free Exploration in Non-Linear
  RL
On the Statistical Efficiency of Reward-Free Exploration in Non-Linear RL
Jinglin Chen
Aditya Modi
A. Krishnamurthy
Nan Jiang
Alekh Agarwal
38
25
0
21 Jun 2022
BYOL-Explore: Exploration by Bootstrapped Prediction
BYOL-Explore: Exploration by Bootstrapped Prediction
Z. Guo
S. Thakoor
Miruna Pislar
Bernardo Avila-Pires
Florent Altché
...
Yunhao Tang
Michal Valko
Rémi Munos
M. G. Azar
Bilal Piot
22
68
0
16 Jun 2022
Provably Efficient Causal Model-Based Reinforcement Learning for
  Systematic Generalization
Provably Efficient Causal Model-Based Reinforcement Learning for Systematic Generalization
Mirco Mutti
Ric De Santi
Emanuele Rossi
J. Calderón
Michael M. Bronstein
Marcello Restelli
28
14
0
14 Feb 2022
Sample-Efficient Reinforcement Learning with loglog(T) Switching Cost
Sample-Efficient Reinforcement Learning with loglog(T) Switching Cost
Dan Qiao
Ming Yin
Ming Min
Yu-Xiang Wang
43
28
0
13 Feb 2022
Reinforcement Learning in Linear MDPs: Constant Regret and
  Representation Selection
Reinforcement Learning in Linear MDPs: Constant Regret and Representation Selection
Matteo Papini
Andrea Tirinzoni
Aldo Pacchiano
Marcello Restelli
A. Lazaric
Matteo Pirotta
19
18
0
27 Oct 2021
Provable Benefits of Actor-Critic Methods for Offline Reinforcement
  Learning
Provable Benefits of Actor-Critic Methods for Offline Reinforcement Learning
Andrea Zanette
Martin J. Wainwright
Emma Brunskill
OffRL
29
115
0
19 Aug 2021
A Simple Reward-free Approach to Constrained Reinforcement Learning
A Simple Reward-free Approach to Constrained Reinforcement Learning
Sobhan Miryoosefi
Chi Jin
11
29
0
12 Jul 2021
The Power of Exploiter: Provable Multi-Agent RL in Large State Spaces
The Power of Exploiter: Provable Multi-Agent RL in Large State Spaces
Chi Jin
Qinghua Liu
Tiancheng Yu
26
50
0
07 Jun 2021
Cautiously Optimistic Policy Optimization and Exploration with Linear
  Function Approximation
Cautiously Optimistic Policy Optimization and Exploration with Linear Function Approximation
Andrea Zanette
Ching-An Cheng
Alekh Agarwal
32
52
0
24 Mar 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
Bellman Eluder Dimension: New Rich Classes of RL Problems, and
  Sample-Efficient Algorithms
Bellman Eluder Dimension: New Rich Classes of RL Problems, and Sample-Efficient Algorithms
Chi Jin
Qinghua Liu
Sobhan Miryoosefi
OffRL
35
215
0
01 Feb 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
26
71
0
14 Dec 2020
Reward-Free Exploration for Reinforcement Learning
Reward-Free Exploration for Reinforcement Learning
Chi Jin
A. Krishnamurthy
Max Simchowitz
Tiancheng Yu
OffRL
112
194
0
07 Feb 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
135
135
0
09 Dec 2019
1