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. 2302.11634
  4. Cited By
Provably Efficient Reinforcement Learning via Surprise Bound

Provably Efficient Reinforcement Learning via Surprise Bound

22 February 2023
Hanlin Zhu
Ruosong Wang
Jason D. Lee
    OffRL
ArXivPDFHTML

Papers citing "Provably Efficient Reinforcement Learning via Surprise Bound"

6 / 6 papers shown
Title
On the Limited Representational Power of Value Functions and its Links
  to Statistical (In)Efficiency
On the Limited Representational Power of Value Functions and its Links to Statistical (In)Efficiency
David Cheikhi
Daniel Russo
OffRL
47
0
0
11 Mar 2024
Efficient Prompt Caching via Embedding Similarity
Efficient Prompt Caching via Embedding Similarity
Hanlin Zhu
Banghua Zhu
Jiantao Jiao
RALM
28
9
0
02 Feb 2024
On Representation Complexity of Model-based and Model-free Reinforcement
  Learning
On Representation Complexity of Model-based and Model-free Reinforcement Learning
Hanlin Zhu
Baihe Huang
Stuart Russell
OffRL
33
3
0
03 Oct 2023
Exploring and Learning in Sparse Linear MDPs without Computationally
  Intractable Oracles
Exploring and Learning in Sparse Linear MDPs without Computationally Intractable Oracles
Noah Golowich
Ankur Moitra
Dhruv Rohatgi
22
5
0
18 Sep 2023
Theoretical Hardness and Tractability of POMDPs in RL with Partial
  Online State Information
Theoretical Hardness and Tractability of POMDPs in RL with Partial Online State Information
Ming Shi
Yingbin Liang
Ness B. Shroff
31
2
0
14 Jun 2023
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