Cover Image

Near-Optimal Algorithm for Non-Stationary Kernelized Bandits

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Iwazaki, Shogo, Takeno, Shion
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Improved Regret Analysis in Gaussian Process Bandits: Optimality for Noiseless Reward, RKHS norm, and Non-Stationary Variance
by: Iwazaki, Shogo, et al.
Published: (2025)

Nearly-Optimal Algorithm for Adversarial Kernelized Bandits
by: Iwazaki, Shogo
Published: (2026)

On Regret Bounds of Thompson Sampling for Bayesian Optimization
by: Takeno, Shion, et al.
Published: (2026)

Gaussian Process Upper Confidence Bound Achieves Nearly-Optimal Regret in Noise-Free Gaussian Process Bandits
by: Iwazaki, Shogo
Published: (2025)

Tighter Regret Lower Bound for Gaussian Process Bandits with Squared Exponential Kernel in Hypersphere
by: Iwazaki, Shogo
Published: (2026)

Optimal-Point Variance Reduction For Bayesian Optimization With Regret Guarantee
by: Takeno, Shion
Published: (2026)

Dose-finding design based on level set estimation in phase I cancer clinical trials
by: Seno, Keiichiro, et al.
Published: (2025)

Improved Regret Bounds for Gaussian Process Upper Confidence Bound in Bayesian Optimization
by: Iwazaki, Shogo
Published: (2025)

High-dimensional Nonparametric Contextual Bandit Problem
by: Iwazaki, Shogo, et al.
Published: (2025)

Active Learning for Level Set Estimation Using Randomized Straddle Algorithms
by: Inatsu, Yu, et al.
Published: (2024)

Regret Analysis for Randomized Gaussian Process Upper Confidence Bound
by: Takeno, Shion, et al.
Published: (2024)

Randomized Kriging Believer for Parallel Bayesian Optimization with Regret Bounds
by: Sugiura, Shuhei, et al.
Published: (2026)

Near-Optimal Regret in Adversarial Kernel Bandits
by: Zhang, Yu-Jie, et al.
Published: (2026)

Online Learning of Whittle Indices for Restless Bandits with Non-Stationary Transition Kernels
by: Shisher, Md Kamran Chowdhury, et al.
Published: (2025)

Non-Stationary Lipschitz Bandits
by: Nguyen, Nicolas, et al.
Published: (2025)

Posterior Sampling-Based Bayesian Optimization with Tighter Bayesian Regret Bounds
by: Takeno, Shion, et al.
Published: (2023)

Regret Analysis of Posterior Sampling-Based Expected Improvement for Bayesian Optimization
by: Takeno, Shion, et al.
Published: (2025)

Fooling Algorithms in Non-Stationary Bandits using Belief Inertia
by: Mendelson, Gal, et al.
Published: (2025)

A Practical Algorithm for Feature-Rich, Non-Stationary Bandit Problems
by: Loh, Wei Min, et al.
Published: (2026)

Clus-UCB: A Near-Optimal Algorithm for Clustered Bandits
by: Gore, Aakash, et al.
Published: (2025)

Adaptive Smooth Non-Stationary Bandits
by: Suk, Joe
Published: (2024)

Safe Distributionally Robust Feature Selection under Covariate Shift
by: Hanada, Hiroyuki, et al.
Published: (2026)

Nearly Optimal Algorithms for Contextual Dueling Bandits from Adversarial Feedback
by: Di, Qiwei, et al.
Published: (2024)

Non-Stationary Bandit Learning via Predictive Sampling
by: Liu, Yueyang, et al.
Published: (2022)

Smooth Non-Stationary Bandits
by: Jia, Su, et al.
Published: (2023)

Incentivized Exploration of Non-Stationary Stochastic Bandits
by: Chakraborty, Sourav, et al.
Published: (2024)

Non-Stationary Latent Auto-Regressive Bandits
by: Trella, Anna L., et al.
Published: (2024)

On The Complexity of Best-Arm Identification in Non-Stationary Linear Bandits
by: Maynard-Zhang, Leo, et al.
Published: (2026)

Non-Stationary Restless Multi-Armed Bandits with Provable Guarantee
by: Hung, Yu-Heng, et al.
Published: (2025)

Constrained Feedback Learning for Non-Stationary Multi-Armed Bandits
by: Li, Shaoang, et al.
Published: (2025)

Partition Tree Weighting for Non-Stationary Stochastic Bandits
by: Veness, Joel, et al.
Published: (2025)

Near Optimal Pure Exploration in Logistic Bandits
by: Rivera, Eduardo Ochoa, et al.
Published: (2024)

Non-Stationary Dueling Bandits Under a Weighted Borda Criterion
by: Suk, Joe, et al.
Published: (2024)

Weighted Sequential Bayesian Inference for Non-Stationary Linear Contextual Bandits
by: Werge, Nicklas, et al.
Published: (2023)

Effect of Random Learning Rate: Theoretical Analysis of SGD Dynamics in Non-Convex Optimization via Stationary Distribution
by: Yoshida, Naoki, et al.
Published: (2024)

Nearly Minimax Optimal Regret for Multinomial Logistic Bandit
by: Lee, Joongkyu, et al.
Published: (2024)

Nearly Minimax Optimal Submodular Maximization with Bandit Feedback
by: Tajdini, Artin, et al.
Published: (2023)

Adaptive Requesting in Decentralized Edge Networks via Non-Stationary Bandits
by: Zhuang, Yi, et al.
Published: (2026)

Statistical Complexity and Optimal Algorithms for Non-linear Ridge Bandits
by: Rajaraman, Nived, et al.
Published: (2023)

Laplacian Kernelized Bandit
by: Wu, Shuang, et al.
Published: (2026)