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. 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
ArXivPDFHTML

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

4 / 4 papers shown
Title
Optimal Order Simple Regret for Gaussian Process Bandits
Optimal Order Simple Regret for Gaussian Process Bandits
Sattar Vakili
N. Bouziani
Sepehr Jalali
A. Bernacchia
Da-shan Shiu
75
54
0
20 Aug 2021
A Domain-Shrinking based Bayesian Optimization Algorithm with
  Order-Optimal Regret Performance
A Domain-Shrinking based Bayesian Optimization Algorithm with Order-Optimal Regret Performance
Sudeep Salgia
Sattar Vakili
Qing Zhao
73
34
0
27 Oct 2020
Provably Efficient Reinforcement Learning with Linear Function
  Approximation
Provably Efficient Reinforcement Learning with Linear Function Approximation
Chi Jin
Zhuoran Yang
Zhaoran Wang
Michael I. Jordan
86
557
0
11 Jul 2019
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
182
273
0
26 Sep 2013
1