Imagen de Portada

Gaussian Process Upper Confidence Bound Achieves Nearly-Optimal Regret in Noise-Free Gaussian Process Bandits

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Iwazaki, Shogo
Formato:	Preprint
Publicado:	2025
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

Nearly-Optimal Algorithm for Adversarial Kernelized Bandits
por: Iwazaki, Shogo
Publicado: (2026)

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

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

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

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

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

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

Regret Bounds for Noise-Free Cascaded Kernelized Bandits
por: Li, Zihan, et al.
Publicado: (2022)

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

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

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

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

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

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

Vector Optimization with Gaussian Process Bandits
por: Korkmaz, İlter Onat, et al.
Publicado: (2024)

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

Near-optimal Per-Action Regret Bounds for Sleeping Bandits
por: Nguyen, Quan, et al.
Publicado: (2024)

One Good Source is All You Need: Near-Optimal Regret for Bandits under Heterogeneous Noise
por: Bhat, Amith, et al.
Publicado: (2026)

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

Achieving Optimal Static and Dynamic Regret Simultaneously in Bandits with Deterministic Losses
por: Qian, Jian, et al.
Publicado: (2026)

Near-Optimal Regret in Linear MDPs with Aggregate Bandit Feedback
por: Cassel, Asaf, et al.
Publicado: (2024)

The Vizier Gaussian Process Bandit Algorithm
por: Song, Xingyou, et al.
Publicado: (2024)

Multimodal Bandits: Regret Lower Bounds and Optimal Algorithms
por: Réveillard, William, et al.
Publicado: (2025)

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

Time-Varying Gaussian Process Bandits with Unknown Prior
por: Ziomek, Juliusz, et al.
Publicado: (2024)

Bayesian Analysis of Combinatorial Gaussian Process Bandits
por: Sandberg, Jack, et al.
Publicado: (2023)

Error Bounds For Gaussian Process Regression Under Bounded Support Noise With Applications To Safety Certification
por: Reed, Robert, et al.
Publicado: (2024)

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

Adaptive Prior Selection in Gaussian Process Bandits with Thompson Sampling
por: Sandberg, Jack, et al.
Publicado: (2025)

Exploiting Concavity Information in Gaussian Process Contextual Bandit Optimization
por: Li, Kevin, et al.
Publicado: (2025)

Near-Optimal Regret for Efficient Stochastic Combinatorial Semi-Bandits
por: Ye, Zichun, et al.
Publicado: (2025)

Near-Optimal Regret for Distributed Adversarial Bandits: A Black-Box Approach
por: Qiu, Hao, et al.
Publicado: (2026)

Likelihood-Free Gaussian Process for Regression
por: Shikuri, Yuta
Publicado: (2020)

Achieving Constant Regret in Linear Markov Decision Processes
por: Zhang, Weitong, et al.
Publicado: (2024)

Near-Optimal Regret for KL-Regularized Multi-Armed Bandits
por: Ji, Kaixuan, et al.
Publicado: (2026)

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

No-Regret Learning of Nash Equilibrium for Black-Box Games via Gaussian Processes
por: Han, Minbiao, et al.
Publicado: (2024)