Preprint · 2019 · Open access
The Kalai-Smorodinski solution for many-objective Bayesian optimization
arXiv (Cornell University), 21(150), 1–42 · Published 18 February 2019 · DOI 10.48550/arxiv.1902.06565
In brief
“The Kalai-Smorodinski solution for many-objective Bayesian optimization” is a 2019 preprint by Mickaël Binois and 3 co-authors, published in arXiv (Cornell University). OpenAlex counts 3 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 3
- Most cited in
- 2018 (1)
- References
- 78
- Authors
- 4
Abstract
An ongoing aim of research in multiobjective Bayesian optimization is to extend its applicability to a large number of objectives. While coping with a limited budget of evaluations, recovering the set of optimal compromise solutions generally requires numerous observations and is less interpretable since this set tends to grow larger with the number of objectives. We thus propose to focus on a specific solution originating from game theory, the Kalai-Smorodinsky solution, which possesses attractive properties. In particular, it ensures equal marginal gains over all objectives. We further make it insensitive to a monotonic transformation of the objectives by considering the objectives in the copula space. A novel tailored algorithm is proposed to search for the solution, in the form of a Bayesian optimization algorithm: sequential sampling decisions are made based on acquisition functions that derive from an instrumental Gaussian process prior. Our approach is tested on four problems with respectively four, six, eight, and nine objectives. The method is available in the Rpackage GPGame available on CRAN at https://cran.r-project.org/package=GPGame.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Binois, M., Picheny, V., Taillandier, P., & Habbal, A. (2019). The Kalai-Smorodinski solution for many-objective Bayesian optimization. arXiv (Cornell University), 21(150), 1–42. https://doi.org/10.48550/arxiv.1902.06565
MLA 9
Binois, Mickaël, et al. “The Kalai-Smorodinski solution for many-objective Bayesian optimization.” arXiv (Cornell University), vol. 21, no. 150, 2019, pp. 1–42. https://doi.org/10.48550/arxiv.1902.06565.
Chicago
Binois, Mickaël, Victor Picheny, Patrick Taillandier, and Abderrahmane Habbal. 2019. “The Kalai-Smorodinski solution for many-objective Bayesian optimization.” arXiv (Cornell University) 21 (150): 1–42. https://doi.org/10.48550/arxiv.1902.06565.
Harvard
Binois, M. et al. (2019) ‘The Kalai-Smorodinski solution for many-objective Bayesian optimization’, arXiv (Cornell University), 21(150), pp. 1–42. doi:10.48550/arxiv.1902.06565.
IEEE
M. Binois, V. Picheny, P. Taillandier, and A. Habbal, “The Kalai-Smorodinski solution for many-objective Bayesian optimization,” arXiv (Cornell University), vol. 21, no. 150, pp. 1–42, 2019, doi: 10.48550/arxiv.1902.06565.
BibTeX
@misc{binois2019kalai,
title = {{The Kalai-Smorodinski solution for many-objective Bayesian optimization}},
author = {Binois, Mickaël and Picheny, Victor and Taillandier, Patrick and Habbal, Abderrahmane},
howpublished = {arXiv (Cornell University)},
year = {2019},
volume = {21},
number = {150},
pages = {1--42},
doi = {10.48550/arxiv.1902.06565},
url = {https://doi.org/10.48550/arxiv.1902.06565}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2018 | 1 | |
| 2019 | 1 | |
| 2020 | 1 |
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms
- Kalai-Smorodinsky solution
- many-objective optimization
- compromise solution
- acquisition functions
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?
Binois, M., Picheny, V., Taillandier, P., & Habbal, A. (2019). The Kalai-Smorodinski solution for many-objective Bayesian optimization. arXiv (Cornell University), 21(150), 1–42. https://doi.org/10.48550/arxiv.1902.06565
How many times has this paper been cited?
3 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?
Mickaël Binois, Victor Picheny, Patrick Taillandier, Abderrahmane Habbal.
What is the DOI of this paper?
10.48550/arxiv.1902.06565, permanently at https://doi.org/10.48550/arxiv.1902.06565. 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.