Cover Image

Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Tran-The, Hung, Gupta, Sunil, Rana, Santu, Venkatesh, Svetha
Format:	Preprint
Published:	2022
Subjects:	Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Bayesian Optimistic Optimisation with Exponentially Decaying Regret
by: Tran-The, Hung, et al.
Published: (2021)

Sub-linear Regret Bounds for Bayesian Optimisation in Unknown Search Spaces
by: Tran-The, Hung, et al.
Published: (2020)

Trading Convergence Rate with Computational Budget in High Dimensional Bayesian Optimization
by: Tran-The, Hung, et al.
Published: (2019)

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

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

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

On the convergence rate of noisy Bayesian Optimization with Expected Improvement
by: Wang, Jingyi, et al.
Published: (2025)

Novel Kernel Models and Exact Representor Theory for Neural Networks Beyond the Over-Parameterized Regime
by: Shilton, Alistair, et al.
Published: (2024)

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

A Unified Framework for Entropy Search and Expected Improvement in Bayesian Optimization
by: Cheng, Nuojin, et al.
Published: (2025)

An Efficient Spatial Branch-and-Bound Algorithm for Global Optimization of Gaussian Process Posterior Mean Functions
by: Tang, Wei-Ting, et al.
Published: (2026)

Variational Entropy Search for Adjusting Expected Improvement
by: Cheng, Nuojin, et al.
Published: (2024)

Distributed Online Bandit Nonconvex Optimization with One-Point Residual Feedback via Dynamic Regret
by: Hua, Youqing, et al.
Published: (2024)

Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback
by: Barakat, Anas, et al.
Published: (2026)

Achieving Better Local Regret Bound for Online Non-Convex Bilevel Optimization
by: Jia, Tingkai, et al.
Published: (2026)

Logarithmic Regret for Unconstrained Submodular Maximization Stochastic Bandit
by: Zhou, Julien, et al.
Published: (2024)

Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives
by: Sahinoglu, Emre, et al.
Published: (2025)

Reinforcement Learning and Regret Bounds for Admission Control
by: Weber, Lucas, et al.
Published: (2024)

Modified Meta-Thompson Sampling for Linear Bandits and Its Bayes Regret Analysis
by: Li, Hao, et al.
Published: (2024)

Online Convex Optimization with Heavy Tails: Old Algorithms, New Regrets, and Applications
by: Liu, Zijian
Published: (2025)

Tight Regret Bounds for Bayesian Optimization in One Dimension
by: Scarlett, Jonathan
Published: (2018)

Shuffling Momentum Gradient Algorithm for Convex Optimization
by: Tran, Trang H., et al.
Published: (2024)

Regret Bounds for Episodic Risk-Sensitive Linear Quadratic Regulator
by: Xu, Wenhao, et al.
Published: (2024)

Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities
by: Su, Yuexin, et al.
Published: (2025)

Wasserstein Distributionally Robust Regret Optimization
by: Fiechtner, Lukas-Benedikt, et al.
Published: (2025)

Learning Decentralized Linear Quadratic Regulators with $\sqrt{T}$ Regret
by: Ye, Lintao, et al.
Published: (2022)

Frequentist Regret Analysis of Gaussian Process Thompson Sampling via Fractional Posteriors
by: Roy, Somjit, et al.
Published: (2026)

Identification and Adaptive Control of Markov Jump Systems: Sample Complexity and Regret Bounds
by: Sattar, Yahya, et al.
Published: (2021)

Asymptotically Optimal Regret for Black-Box Predict-then-Optimize
by: Tan, Samuel, et al.
Published: (2024)

Small Gradient Norm Regret for Online Convex Optimization
by: Gao, Wenzhi, et al.
Published: (2026)

Low-Complexity Algorithm for Restless Bandits with Imperfect Observations
by: Liu, Keqin, et al.
Published: (2021)

Wasserstein Barycenter Gaussian Process based Bayesian Optimization
by: Candelieri, Antonio, et al.
Published: (2025)

Provable Complexity Improvement of AdaGrad over SGD: Upper and Lower Bounds in Stochastic Non-Convex Optimization
by: Jiang, Ruichen, et al.
Published: (2024)

Improved Regret Bound for Safe Reinforcement Learning via Tighter Cost Pessimism and Reward Optimism
by: Yu, Kihyun, et al.
Published: (2024)

Parameter-Free Algorithms for Performative Regret Minimization under Decision-Dependent Distributions
by: Park, Sungwoo, et al.
Published: (2024)

Sharper Guarantees for Misspecified Kernelized Bandit Optimization
by: Maran, Davide, et al.
Published: (2026)

On the Stochastic (Variance-Reduced) Proximal Gradient Method for Regularized Expected Reward Optimization
by: Liang, Ling, et al.
Published: (2024)

Adaptivity and Universality: Problem-dependent Universal Regret for Online Convex Optimization
by: Zhao, Peng, et al.
Published: (2025)

Near-Optimal Algorithms for Group Distributionally Robust Optimization and Beyond
by: Soma, Tasuku, et al.
Published: (2022)

Enhanced Bayesian Optimization via Preferential Modeling of Abstract Properties
by: A V, Arun Kumar, et al.
Published: (2024)