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. 2210.02087
  4. Cited By
Bilinear Exponential Family of MDPs: Frequentist Regret Bound with
  Tractable Exploration and Planning

Bilinear Exponential Family of MDPs: Frequentist Regret Bound with Tractable Exploration and Planning

5 October 2022
Reda Ouhamma
D. Basu
Odalric-Ambrym Maillard
    OffRL
ArXivPDFHTML

Papers citing "Bilinear Exponential Family of MDPs: Frequentist Regret Bound with Tractable Exploration and Planning"

3 / 3 papers shown
Title
Provably Efficient Reinforcement Learning with Multinomial Logit Function Approximation
Provably Efficient Reinforcement Learning with Multinomial Logit Function Approximation
Long-Fei Li
Yu-Jie Zhang
Peng Zhao
Zhi-Hua Zhou
101
4
0
17 Jan 2025
Provable and Practical: Efficient Exploration in Reinforcement Learning
  via Langevin Monte Carlo
Provable and Practical: Efficient Exploration in Reinforcement Learning via Langevin Monte Carlo
Haque Ishfaq
Qingfeng Lan
Pan Xu
A. R. Mahmood
Doina Precup
Anima Anandkumar
Kamyar Azizzadenesheli
BDL
OffRL
28
20
0
29 May 2023
Reinforcement Learning in the Wild with Maximum Likelihood-based Model
  Transfer
Reinforcement Learning in the Wild with Maximum Likelihood-based Model Transfer
Hannes Eriksson
D. Basu
Tommy Tram
Mina Alibeigi
Christos Dimitrakakis
21
1
0
18 Feb 2023
1