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. 2309.09457
  4. Cited By
Exploring and Learning in Sparse Linear MDPs without Computationally
  Intractable Oracles

Exploring and Learning in Sparse Linear MDPs without Computationally Intractable Oracles

18 September 2023
Noah Golowich
Ankur Moitra
Dhruv Rohatgi
ArXivPDFHTML

Papers citing "Exploring and Learning in Sparse Linear MDPs without Computationally Intractable Oracles"

2 / 2 papers shown
Title
Exploration is Harder than Prediction: Cryptographically Separating
  Reinforcement Learning from Supervised Learning
Exploration is Harder than Prediction: Cryptographically Separating Reinforcement Learning from Supervised Learning
Noah Golowich
Ankur Moitra
Dhruv Rohatgi
OffRL
35
4
0
04 Apr 2024
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
1