Conference paper · 2025 · Open access
Gaussian Process Upper Confidence Bound Achieves Nearly-Optimal Regret in Noise-Free Gaussian Process Bandits
neural information processing systems, 73394–73417 · Published 1 January 2025 · DOI 10.52202/085713-2210
In brief
“Gaussian Process Upper Confidence Bound Achieves Nearly-Optimal Regret in Noise-Free Gaussian Process Bandits” is a 2025 conference paper by Shogo Iwazaki, published in neural information processing systems. OpenAlex counts 12 citations as of 19 November 2026, which puts it in the top 8% of works published in 2025 by citations. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 12
- Most cited in
- 2026 (10)
- Field-weighted impact
- 11.22
- References
- 19
- Authors
- 1
Abstract
We study the noise-free Gaussian Process (GP) bandits problem, in which the learner seeks to minimize regret through noise-free observations of the black-box objective function lying on the known reproducing kernel Hilbert space (RKHS). Gaussian process upper confidence bound (GP-UCB) is the well-known GP-bandits algorithm whose query points are adaptively chosen based on the GP-based upper confidence bound score. Although several existing works have reported the practical success of GP-UCB, the current theoretical results indicate its suboptimal performance. However, GP-UCB tends to perform well empirically compared with other nearly optimal noise-free algorithms that rely on a non-adaptive sampling scheme of query points. This paper resolves this gap between theoretical and empirical performance by showing the nearly optimal regret upper bound of noise-free GP-UCB. Specifically, our analysis shows the first constant cumulative regret in the noise-free settings for the squared exponential kernel and Matérn kernel with some degree of smoothness.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Iwazaki, S. (2025). Gaussian Process Upper Confidence Bound Achieves Nearly-Optimal Regret in Noise-Free Gaussian Process Bandits. neural information processing systems, 73394–73417. https://doi.org/10.52202/085713-2210
MLA 9
Iwazaki, Shogo. “Gaussian Process Upper Confidence Bound Achieves Nearly-Optimal Regret in Noise-Free Gaussian Process Bandits.” neural information processing systems, 2025, pp. 73394–73417. https://doi.org/10.52202/085713-2210.
Chicago
Iwazaki, Shogo. 2025. “Gaussian Process Upper Confidence Bound Achieves Nearly-Optimal Regret in Noise-Free Gaussian Process Bandits.” neural information processing systems: 73394–73417. https://doi.org/10.52202/085713-2210.
Harvard
Iwazaki, S. (2025) ‘Gaussian Process Upper Confidence Bound Achieves Nearly-Optimal Regret in Noise-Free Gaussian Process Bandits’, neural information processing systems, pp. 73394–73417. doi:10.52202/085713-2210.
IEEE
S. Iwazaki, “Gaussian Process Upper Confidence Bound Achieves Nearly-Optimal Regret in Noise-Free Gaussian Process Bandits,” neural information processing systems, pp. 73394–73417, 2025, doi: 10.52202/085713-2210.
BibTeX
@inproceedings{iwazaki2025gaussian,
title = {{Gaussian Process Upper Confidence Bound Achieves Nearly-Optimal Regret in Noise-Free Gaussian Process Bandits}},
author = {Iwazaki, Shogo},
booktitle = {neural information processing systems},
year = {2025},
pages = {73394--73417},
doi = {10.52202/085713-2210},
url = {https://doi.org/10.52202/085713-2210}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
- Gaussian process bandits
- regret bounds
- reproducing kernel Hilbert space
- Gaussian kernel
- Matérn kernel
- black-box optimization
Work with this paper
Most-cited papers in Decision Sciences
- The PRISMA 2020 statement: an updated guideline for reporting systematic reviewsMatthew James Page, Joanne E. McKenzie, Patrick M. Bossuyt and 23 more · BMJ · 2021 · 144,919 citations
- Evaluating Structural Equation Models with Unobservable Variables and Measurement ErrorClaes Fornell, David F. Larcker · Journal of Marketing Research · 1981 · 118,336 citations
- Cutoff criteria for fit indexes in covariance structure analysis: Conventional criteria versus new alternativesLi‐tze Hu, Peter M. Bentler · Structural Equation Modeling A Multidisciplinary Journal · 1999 · 117,461 citations
- Common method biases in behavioral research: A critical review of the literature and recommended remedies.Philip M. Podsakoff, SCOTT B. MACKENZIE, Jeong Yeon Lee and 1 more · Journal of Applied Psychology · 2003 · 89,248 citations
- Preferred reporting items for systematic reviews and meta-analyses: the PRISMA statementDavid Moher, Alessandro Liberati, Jennifer Tetzlaff and 2 more · BMJ · 2009 · 85,524 citations
Questions about this paper
How do I cite this paper in APA style?
Iwazaki, S. (2025). Gaussian Process Upper Confidence Bound Achieves Nearly-Optimal Regret in Noise-Free Gaussian Process Bandits. neural information processing systems, 73394–73417. https://doi.org/10.52202/085713-2210
How many times has this paper been cited?
12 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.
Who wrote this paper?
Shogo Iwazaki.
What is the DOI of this paper?
10.52202/085713-2210, permanently at https://doi.org/10.52202/085713-2210. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.