"Reward-Free RL is No Harder Than Reward-Aware RL in Linear Markov Decision ..."

Andrew Wagenmaker et al. (2022)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2022-04-05

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-2201-11206
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2201-11206
Andrew Wagenmaker, Yifang Chen, Max Simchowitz, Simon S. Du, Kevin Jamieson:
Reward-Free RL is No Harder Than Reward-Aware RL in Linear Markov Decision Processes. CoRR abs/2201.11206 (2022)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.