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. 1911.01871
  4. Cited By
On Online Learning in Kernelized Markov Decision Processes

On Online Learning in Kernelized Markov Decision Processes

4 November 2019
Sayak Ray Chowdhury
Aditya Gopalan
    OffRL
ArXivPDFHTML

Papers citing "On Online Learning in Kernelized Markov Decision Processes"

5 / 5 papers shown
Title
Efficient Model-Based Reinforcement Learning Through Optimistic Thompson Sampling
Efficient Model-Based Reinforcement Learning Through Optimistic Thompson Sampling
Jasmine Bayrooti
Carl Henrik Ek
Amanda Prorok
125
0
0
07 Oct 2024
Why is Posterior Sampling Better than Optimism for Reinforcement
  Learning?
Why is Posterior Sampling Better than Optimism for Reinforcement Learning?
Ian Osband
Benjamin Van Roy
BDL
74
257
0
01 Jul 2016
Safe Exploration in Finite Markov Decision Processes with Gaussian
  Processes
Safe Exploration in Finite Markov Decision Processes with Gaussian Processes
M. Turchetta
Felix Berkenkamp
Andreas Krause
58
186
0
15 Jun 2016
Finite-Time Analysis of Kernelised Contextual Bandits
Finite-Time Analysis of Kernelised Contextual Bandits
Michal Valko
N. Korda
Rémi Munos
I. Flaounas
N. Cristianini
106
271
0
26 Sep 2013
Gaussian Processes for Sample Efficient Reinforcement Learning with
  RMAX-like Exploration
Gaussian Processes for Sample Efficient Reinforcement Learning with RMAX-like Exploration
T. Jung
Peter Stone
GP
OffRL
40
33
0
31 Jan 2012
1