ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2406.15250
  4. Cited By
Open Problem: Order Optimal Regret Bounds for Kernel-Based Reinforcement
  Learning

Open Problem: Order Optimal Regret Bounds for Kernel-Based Reinforcement Learning

21 June 2024
Sattar Vakili
    OffRL
ArXiv (abs)PDFHTML

Papers citing "Open Problem: Order Optimal Regret Bounds for Kernel-Based Reinforcement Learning"

1 / 1 papers shown
Title
Kernel-Based Function Approximation for Average Reward Reinforcement
  Learning: An Optimist No-Regret Algorithm
Kernel-Based Function Approximation for Average Reward Reinforcement Learning: An Optimist No-Regret Algorithm
Sattar Vakili
Julia Olkhovskaya
108
0
0
30 Oct 2024
1