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

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2405.06363
  4. Cited By
Projection by Convolution: Optimal Sample Complexity for Reinforcement
  Learning in Continuous-Space MDPs

Projection by Convolution: Optimal Sample Complexity for Reinforcement Learning in Continuous-Space MDPs

10 May 2024
Davide Maran
Alberto Maria Metelli
Matteo Papini
Marcello Restelli
ArXiv (abs)PDFHTMLGithub

Papers citing "Projection by Convolution: Optimal Sample Complexity for Reinforcement Learning in Continuous-Space MDPs"

2 / 2 papers shown
Local Linearity: the Key for No-regret Reinforcement Learning in
  Continuous MDPs
Local Linearity: the Key for No-regret Reinforcement Learning in Continuous MDPsNeural Information Processing Systems (NeurIPS), 2024
Davide Maran
Alberto Maria Metelli
Matteo Papini
Marcello Restelli
277
4
0
31 Oct 2024
Provably Adaptive Average Reward Reinforcement Learning for Metric Spaces
Provably Adaptive Average Reward Reinforcement Learning for Metric SpacesConference on Uncertainty in Artificial Intelligence (UAI), 2024
Avik Kar
Rahul Singh
251
1
0
25 Oct 2024
1
Page 1 of 1