Preprint · 2025 · Open access
Pareto-frontier Entropy Search with Variational Lower Bound Maximization
arXiv (Cornell University) · Published 31 January 2025 · DOI 10.48550/arxiv.2501.19073
In brief
“Pareto-frontier Entropy Search with Variational Lower Bound Maximization” is a 2025 preprint by Mitsuru Ishikura and Masayuki Karasuyama, published in arXiv (Cornell University). OpenAlex counts 1 citations as of 19 November 2026. It is open access under a CC BY licence: the full text is free to read at arXiv (Cornell University).
- Citations
- 1
- Most cited in
- 2026 (1)
- References
- 24
- Authors
- 2
Abstract
This study considers multi-objective Bayesian optimization (MOBO) through the information gain of the Pareto-frontier. To calculate the information gain, a predictive distribution conditioned on the Pareto-frontier plays a key role, which is defined as a distribution truncated by the Pareto-frontier. However, it is usually impossible to obtain the entire Pareto-frontier in a continuous domain, and therefore, the complete truncation cannot be known. We consider an approximation of the truncate distribution by using a mixture distribution consisting of two possible approximate truncation obtainable from a subset of the Pareto-frontier, which we call over- and under-truncation. Since the optimal balance of the mixture is unknown beforehand, we propose optimizing the balancing coefficient through the variational lower bound maximization framework, by which the approximation error of the information gain can be minimized. Our empirical evaluation demonstrates the effectiveness of the proposed method particularly when the number of objective functions is large.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Ishikura, M., & Karasuyama, M. (2025). Pareto-frontier Entropy Search with Variational Lower Bound Maximization. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2501.19073
MLA 9
Ishikura, Mitsuru, and Masayuki Karasuyama. “Pareto-frontier Entropy Search with Variational Lower Bound Maximization.” arXiv (Cornell University), 2025. https://doi.org/10.48550/arxiv.2501.19073.
Chicago
Ishikura, Mitsuru and Masayuki Karasuyama. 2025. “Pareto-frontier Entropy Search with Variational Lower Bound Maximization.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2501.19073.
Harvard
Ishikura, M. and Karasuyama, M. (2025) ‘Pareto-frontier Entropy Search with Variational Lower Bound Maximization’, arXiv (Cornell University). doi:10.48550/arxiv.2501.19073.
IEEE
M. Ishikura and M. Karasuyama, “Pareto-frontier Entropy Search with Variational Lower Bound Maximization,” arXiv (Cornell University), 2025, doi: 10.48550/arxiv.2501.19073.
BibTeX
@misc{ishikura2025pareto,
title = {{Pareto-frontier Entropy Search with Variational Lower Bound Maximization}},
author = {Ishikura, Mitsuru and Karasuyama, Masayuki},
howpublished = {arXiv (Cornell University)},
year = {2025},
doi = {10.48550/arxiv.2501.19073},
url = {https://doi.org/10.48550/arxiv.2501.19073}
}
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
- multi-objective Bayesian optimization
- Pareto front
- information gain
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?
Ishikura, M., & Karasuyama, M. (2025). Pareto-frontier Entropy Search with Variational Lower Bound Maximization. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2501.19073
How many times has this paper been cited?
1 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?
Mitsuru Ishikura, Masayuki Karasuyama.
What is the DOI of this paper?
10.48550/arxiv.2501.19073, permanently at https://doi.org/10.48550/arxiv.2501.19073. 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.