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. 2102.06296
  4. Cited By
No-Regret Algorithms for Time-Varying Bayesian Optimization
v1v2 (latest)

No-Regret Algorithms for Time-Varying Bayesian Optimization

11 February 2021
Xingyu Zhou
Ness B. Shroff
ArXiv (abs)PDFHTML

Papers citing "No-Regret Algorithms for Time-Varying Bayesian Optimization"

5 / 5 papers shown
Title
Lower Bounds for Time-Varying Kernelized Bandits
Lower Bounds for Time-Varying Kernelized Bandits
Xu Cai
Jonathan Scarlett
64
1
0
22 Oct 2024
A Simple Approach for Non-stationary Linear Bandits
A Simple Approach for Non-stationary Linear Bandits
Peng Zhao
Lijun Zhang
Yuan Jiang
Zhi Zhou
61
85
0
09 Mar 2021
Weighted Linear Bandits for Non-Stationary Environments
Weighted Linear Bandits for Non-Stationary Environments
Yoan Russac
Claire Vernade
Olivier Cappé
130
108
0
19 Sep 2019
On Kernelized Multi-armed Bandits
On Kernelized Multi-armed Bandits
Sayak Ray Chowdhury
Aditya Gopalan
116
460
0
03 Apr 2017
Time-Varying Gaussian Process Bandit Optimization
Time-Varying Gaussian Process Bandit Optimization
Ilija Bogunovic
Jonathan Scarlett
Volkan Cevher
103
98
0
25 Jan 2016
1