Preprint · 2026 · Open access
Constraint-Bound Agnostic Bayesian Optimization: One Model for All Thresholds
arXiv (Cornell University) · Published 26 July 2026 · DOI 10.48550/arxiv.2607.23448
In brief
“Constraint-Bound Agnostic Bayesian Optimization: One Model for All Thresholds” is a 2026 preprint by Jin Wang and 2 co-authors, published in arXiv (Cornell University). OpenAlex counts 0 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 0
- References
- 30
- Authors
- 3
Abstract
Expensive constrained optimization problems in real-world industry design often involve constraint thresholds that are difficult to determine in advance. Engineers may need to adjust constraint thresholds to explore different feasibility-performance trade-offs, requiring solutions under a wide range of threshold settings. However, existing constrained Bayesian optimization methods treat each threshold configuration independently, leading to repeated optimization and failing to exploit the shared relationship among continuously varying thresholds. To address this challenge, we propose constraint-bound agnostic Bayesian optimization (CBA-BO), a learning-based framework that learns a parametric constraint model mapping thresholds to optimal solutions. Once learned, CBA-BO directly predicts solutions for arbitrary unseen threshold configurations without additional optimization, with a one-step Bayesian optimization refinement further improving solution quality. Experiments on benchmark and engineering problems demonstrate that CBA-BO learns a transferable threshold-solution mapping, enabling efficient prediction and optimization for arbitrary threshold queries. An intent-guided constraint-bound recommendation mechanism is further developed to improve objective performance while satisfying user-specified constraint preferences.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Wang, J., Lin, X., & Wang, H. (2026). Constraint-Bound Agnostic Bayesian Optimization: One Model for All Thresholds. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2607.23448
MLA 9
Wang, Jin, et al. “Constraint-Bound Agnostic Bayesian Optimization: One Model for All Thresholds.” arXiv (Cornell University), 2026. https://doi.org/10.48550/arxiv.2607.23448.
Chicago
Wang, Jin, Xi Lin, and Handing Wang. 2026. “Constraint-Bound Agnostic Bayesian Optimization: One Model for All Thresholds.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2607.23448.
Harvard
Wang, J., Lin, X. and Wang, H. (2026) ‘Constraint-Bound Agnostic Bayesian Optimization: One Model for All Thresholds’, arXiv (Cornell University). doi:10.48550/arxiv.2607.23448.
IEEE
J. Wang, X. Lin, and H. Wang, “Constraint-Bound Agnostic Bayesian Optimization: One Model for All Thresholds,” arXiv (Cornell University), 2026, doi: 10.48550/arxiv.2607.23448.
BibTeX
@misc{wang2026constraint,
title = {{Constraint-Bound Agnostic Bayesian Optimization: One Model for All Thresholds}},
author = {Wang, Jin and Lin, Xi and Wang, Handing},
howpublished = {arXiv (Cornell University)},
year = {2026},
doi = {10.48550/arxiv.2607.23448},
url = {https://doi.org/10.48550/arxiv.2607.23448}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms
- constrained Bayesian optimization
- expensive optimization
- industrial design
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Wang, J., Lin, X., & Wang, H. (2026). Constraint-Bound Agnostic Bayesian Optimization: One Model for All Thresholds. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2607.23448
How many times has this paper been cited?
0 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?
Jin Wang, Xi Lin, Handing Wang.
What is the DOI of this paper?
10.48550/arxiv.2607.23448, permanently at https://doi.org/10.48550/arxiv.2607.23448. 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.