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

Andrew J. Wagenmaker et al. (2022)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2022-07-12

- view
  - electronic edition @ mlr.press (open access)
- export record
  dblp key:
  - conf/icml/WagenmakerCSDJ22a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icml/WagenmakerCSDJ22a
Andrew J. Wagenmaker, Yifang Chen, Max Simchowitz, Simon S. Du, Kevin G. Jamieson:
Reward-Free RL is No Harder Than Reward-Aware RL in Linear Markov Decision Processes. ICML 2022: 22430-22456

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.