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. 2203.06297
  4. Cited By
Instance-Dependent Regret Analysis of Kernelized Bandits

Instance-Dependent Regret Analysis of Kernelized Bandits

12 March 2022
S. Shekhar
T. Javidi
ArXivPDFHTML

Papers citing "Instance-Dependent Regret Analysis of Kernelized Bandits"

4 / 4 papers shown
Title
Open Problem: Tight Bounds for Kernelized Multi-Armed Bandits with
  Bernoulli Rewards
Open Problem: Tight Bounds for Kernelized Multi-Armed Bandits with Bernoulli Rewards
Marco Mussi
Simone Drago
Alberto Maria Metelli
24
1
0
08 Jul 2024
On the Sublinear Regret of GP-UCB
On the Sublinear Regret of GP-UCB
Justin Whitehouse
Zhiwei Steven Wu
Aaditya Ramdas
8
12
0
14 Jul 2023
Gaussian Process Bandit Optimization with Few Batches
Gaussian Process Bandit Optimization with Few Batches
Zihan Li
Jonathan Scarlett
GP
131
47
0
15 Oct 2021
Bayesian Multi-Scale Optimistic Optimization
Bayesian Multi-Scale Optimistic Optimization
Ziyun Wang
B. Shakibi
L. Jin
Nando de Freitas
80
95
0
27 Feb 2014
1