Cover Image

Regret Analysis for Randomized Gaussian Process Upper Confidence Bound

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Takeno, Shion, Inatsu, Yu, Karasuyama, Masayuki
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

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)

Bayesian Optimization of Robustness Measures under Input Uncertainty: A Randomized Gaussian Process Upper Confidence Bound Approach
by: Inatsu, Yu
Published: (2025)

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

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

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

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

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

Active learning for level set estimation under input uncertainty and its extensions
by: Inatsu, Yu, et al.
Published: (2019)

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

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

Pareto-frontier Entropy Search with Variational Lower Bound Maximization
by: Ishikura, Masanori, et al.
Published: (2025)

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

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

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

Data-Driven Upper Confidence Bounds with Near-Optimal Regret for Heavy-Tailed Bandits
by: Tamás, Ambrus, et al.
Published: (2024)

Improved Regret Bounds of (Multinomial) Logistic Bandits via Regret-to-Confidence-Set Conversion
by: Lee, Junghyun, et al.
Published: (2023)

Gaussian Process Upper Confidence Bounds in Distributed Point Target Tracking over Wireless Sensor Networks
by: Liu, Xingchi, et al.
Published: (2024)

Learning Attributed Graphlets: Predictive Graph Mining by Graphlets with Trainable Attribute
by: Shinji, Tajima, et al.
Published: (2024)

Exact Subgraph Isomorphism Network with Mixed $L_{0,2}$ Norm Constraint for Predictive Graph Mining
by: Kojima, Taiga, et al.
Published: (2025)

Information-Theoretic Bayesian Optimization for Bilevel Optimization Problems
by: Kanayama, Takuya, et al.
Published: (2025)

Distributionally Robust Safe Sample Elimination under Covariate Shift
by: Hanada, Hiroyuki, et al.
Published: (2024)

Finite-Time Logarithmic Bayes Regret Upper Bounds
by: Atsidakou, Alexia, 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)

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

Bayesian Optimization for Simultaneous Selection of Machine Learning Algorithms and Hyperparameters on Shared Latent Space
by: Ishikawa, Kazuki, et al.
Published: (2025)

On Improved Regret Bounds In Bayesian Optimization with Gaussian Noise
by: Wang, Jingyi, et al.
Published: (2024)

An Upper Confidence Bound Approach to Estimating the Maximum Mean
by: Kun, Zhang, et al.
Published: (2024)

Hierarchical Upper Confidence Bounds for Constrained Online Learning
by: Baheri, Ali
Published: (2024)

Inference with the Upper Confidence Bound Algorithm
by: Khamaru, Koulik, et al.
Published: (2024)

Randomized Confidence Bounds for Stochastic Partial Monitoring
by: Heuillet, Maxime, et al.
Published: (2024)

Posterior Sampling Reinforcement Learning with Gaussian Processes for Continuous Control: Sublinear Regret Bounds for Unbounded State Spaces
by: Flynn, Hamish, et al.
Published: (2026)

Confidence Sequences for Generalized Linear Models via Regret Analysis
by: Clerico, Eugenio, et al.
Published: (2025)

Regret Lower Bounds for Learning Linear Quadratic Gaussian Systems
by: Ziemann, Ingvar, et al.
Published: (2022)

No-Regret Thompson Sampling for Finite-Horizon Markov Decision Processes with Gaussian Processes
by: Bayrooti, Jasmine, et al.
Published: (2025)

Causal Bandit Over Unknown Graphs: Upper Confidence Bounds With Backdoor Adjustment
by: Zhao, Yijia, et al.
Published: (2025)

Q-Learning with Shift-Aware Upper Confidence Bound in Non-Stationary Reinforcement Learning
by: Bui, Ha Manh, et al.
Published: (2025)

No-Regret Gaussian Process Optimization of Time-Varying Functions
by: Mauduit, Eliabelle, et al.
Published: (2025)

Online-to-PAC Conversions: Generalization Bounds via Regret Analysis
by: Lugosi, Gábor, et al.
Published: (2023)