:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Iwazaki, Shogo, Takeno, Shion
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2502.06363
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Near-Optimal Algorithm for Non-Stationary Kernelized Bandits
by: Iwazaki, Shogo, et al.
Published: (2024)

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)

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

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

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

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

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

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

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

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

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

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

Variance-Dependent Regret Bounds for Non-stationary Linear Bandits
by: Wang, Zhiyong, et al.
Published: (2024)

Regret Tail Characterization of Optimal Bandit Algorithms with Generic Rewards
by: Panda, Subhodip, et al.
Published: (2026)

Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards
by: Tajdini, Artin, et al.
Published: (2025)

How Does Variance Shape the Regret in Contextual Bandits?
by: Jia, Zeyu, et al.
Published: (2024)

Batch Ensemble for Variance Dependent Regret in Stochastic Bandits
by: Cassel, Asaf, et al.
Published: (2024)

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

Optimal Dynamic Regret by Transformers for Non-Stationary Reinforcement Learning
by: Chen, Baiyuan, et al.
Published: (2025)

Variance-Dependent Regret Lower Bounds for Contextual Bandits
by: He, Jiafan, et al.
Published: (2025)

Catoni-Style Change Point Detection for Regret Minimization in Non-Stationary Heavy-Tailed Bandits
by: Genalti, Gianmarco, et al.
Published: (2025)

Optimal Regret for Single Index Bandits
by: Dey, Devdan, et al.
Published: (2026)

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

Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits
by: Di, Qiwei, et al.
Published: (2023)

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

Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimization
by: Tran-The, Hung, et al.
Published: (2022)

Prior Diffusiveness and Regret in the Linear-Gaussian Bandit
by: Zhu, Yifan, et al.
Published: (2026)

Distributionally Robust Active Learning for Gaussian Process Regression
by: Takeno, Shion, et al.
Published: (2025)

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

Optimal Regret for Policy Optimization in Contextual Bandits
by: Levy, Orin, et al.
Published: (2026)

Unbiased Stochastic Optimization for Gaussian Processes on Finite Dimensional RKHS
by: Shoham, Neta, et al.
Published: (2025)

Adaptive RKHS Fourier Features for Compositional Gaussian Process Models
by: Shi, Xinxing, et al.
Published: (2024)

Contextual Bandits with Non-Stationary Correlated Rewards for User Association in MmWave Vehicular Networks
by: He, Xiaoyang, et al.
Published: (2024)

Improved Regret Bounds for Bandits with Expert Advice
by: Cesa-Bianchi, Nicolò, et al.
Published: (2024)

Predictive Control and Regret Analysis of Non-Stationary MDP with Look-ahead Information
by: Zhang, Ziyi, et al.
Published: (2024)

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

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

Optimal Rates and Saturation for Noiseless Kernel Ridge Regression
by: Long, Jihao, et al.
Published: (2024)

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