paper-with-me

Papers

Regret Analysis of Posterior Sampling-Based Expected Improvement for Bayesian Optimization

2025-07-13 · Shion Takeno, Yu Inatsu, Masayuki Karasuyama, Ichiro Takeuchi arxiv

Bayesian optimization is a powerful tool for optimizing an expensive-to-evaluate black-box function. In particular, the effectiveness of expected improvement (EI) has been demonstrated in a wide range of applications. However, theoretical analyses of EI are limited compared with other theoretically established algorithms. This paper analyzes a randomized variant of EI, which evaluates the EI from the maximum of the posterior sample path. We show that this posterior sampling-based random EI achieves the sublinear Bayesian cumulative regret bounds under the assumption that the black-box function follows a Gaussian process. Finally, we demonstrate the effectiveness of the proposed method through numerical experiments.

📄 PDF Abstract BibTeX arXiv:2507.09828

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Finite-Time Regret Analysis of Retry-Aware Bandits

2026-05-20 · Bingkui Tong, Junpei Komiyama, Soichiro Nishimori, Paavo Parmas arxiv

We study a stochastic bandit algorithm motivated by retry-aware objectives that value the best outcome among multiple attempts, such as pass@$k$ and max@$k$. Given a posterior over arm values, ReMax chooses a sampling di…

Reinforcement Learning

Bayesian Learning in Episodic Zero-Sum Games

2026-03-21 · Chang-Wei Yueh, Andy Zhao, Ashutosh Nayyar, Rahul Jain arxiv

We study Bayesian learning in episodic, finite-horizon zero-sum Markov games with unknown transition and reward models. We investigate a posterior algorithm in which each player maintains a Bayesian posterior over the ga…

On Frequentist Regret of Linear Thompson Sampling

2020-06-11 · Nima Hamidi, Mohsen Bayati

This paper studies the stochastic linear bandit problem, where a decision-maker chooses actions from possibly time-dependent sets of vectors in $\mathbb{R}^d$ and receives noisy rewards. The objective is to minimize regr…

Thompson Sampling

Analysis and Design of Thompson Sampling for Stochastic Partial Monitoring

2020-06-17 · NeurIPS 2020 12 · Taira Tsuchiya, Junya Honda, Masashi Sugiyama

We investigate finite stochastic partial monitoring, which is a general model for sequential learning with limited feedback. While Thompson sampling is one of the most promising algorithms on a variety of online decision…

Decision MakingThompson Sampling

Thompson Sampling for Infinite-Horizon Discounted Decision Processes

2024-05-14 · Daniel Adelman, Cagla Keceli, Alba V. Olivares-Nadal

We model a Markov decision process, parametrized by an unknown parameter, and study the asymptotic behavior of a sampling-based algorithm, called Thompson sampling. The standard definition of regret is not always suitabl…

Thompson Sampling