mlsanityData to 14 Oct 2026

Bayesian Optimization over Bounded Domains with the Beta Product Kernel

arXiv 2506.16316 ↗First posted 19 Jun 2025cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Bayesian optimization with Gaussian processes (GP) is commonly used to optimize black-box functions. The Mat'ern and the Radial Basis Function (RBF) covariance functions are used frequently, but they do not make any assumptions about the domain of the function, which may limit their applicability in bounded domains. To address the limitation, we introduce the Beta kernel, a non-stationary kernel induced by a product of Beta distribution density functions. Such a formulation allows our kernel to naturally model functions on bounded domains. We present statistical evidence supporting the hypothesis that the kernel exhibits an exponential eigendecay rate, based on empirical analyses of its spectral properties across different settings. Our experimental results demonstrate the robustness of the Beta kernel in modeling functions with optima located near the faces or vertices of the unit hypercube. The experiments show that our kernel consistently outperforms a wide range of kernels, including the well-known Mat'ern and RBF, in different problems, including synthetic function optimization and the compression of vision and language models.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 20 of its 49 references that are in the map. First posted on arXiv 19 Jun 2025.

Builds on

20 of 49 references.

References · 20

  1. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  3. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  4. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,148
  5. 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,682
  6. 2020DeBERTa: Decoding-enhanced BERT with Disentangled Attentioncited by 2,181
  7. 2018GPyTorch: Blackbox Matrix-Matrix Gaussian Process Inference with GPU Accelerationcited by 609
  8. 2020On Information Gain and Regret Bounds in Gaussian Process Banditscited by 158
  9. 2013Gaussian Process Kernels for Pattern Discovery and Extrapolationcited by 132
  10. 2023LoSparse: Structured Compression of Large Language Models based on Low-Rank and Sparse Approximationcited by 104
  11. 2024Vanilla Bayesian Optimization Performs Great in High Dimensionscited by 92
  12. 2017Lower Bounds on Regret for Noisy Gaussian Process Bandit Optimizationcited by 78
8 more
  1. 2014Input Warping for Bayesian Optimization of Non-stationary Functionscited by 67
  2. 2018BOCK : Bayesian Optimization with Cylindrical Kernelscited by 65
  3. 2017Non-Stationary Spectral Kernelscited by 38
  4. 2018Approximation beats concentration? An approximation view on inference with smooth radial kernelscited by 33
  5. 2020On Lower Bounds for Standard and Robust Gaussian Process Bandit Optimizationcited by 31
  6. 2018Tight Regret Bounds for Bayesian Optimization in One Dimensioncited by 20
  7. 2022Non-Stationary Spatial Modelingcited by 13
  8. 2023A Corrected Expected Improvement Acquisition Function Under Noisy Observationscited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.