Conference paper · 2022 · Open access
Pareto Set Learning for Expensive Multi-Objective Optimization
neural information processing systems, 19231–19247 · Published 1 January 2022 · DOI 10.52202/068431-1398
In brief
“Pareto Set Learning for Expensive Multi-Objective Optimization” is a 2022 conference paper by Xi Lin and 3 co-authors, published in neural information processing systems. OpenAlex counts 165 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 165
- Most cited in
- 2025 (60)
- Field-weighted impact
- 19.54
- References
- 82
- Authors
- 4
Abstract
Expensive multi-objective optimization problems can be found in many real-world applications, where their objective function evaluations involve expensive computations or physical experiments. It is desirable to obtain an approximate Pareto front with a limited evaluation budget. Multi-objective Bayesian optimization (MOBO) has been widely used for finding a finite set of Pareto optimal solutions. However, it is well-known that the whole Pareto set is on a continuous manifold and can contain infinite solutions. The structural properties of the Pareto set are not well exploited in existing MOBO methods, and the finite-set approximation may not contain the most preferred solution(s) for decision-makers. This paper develops a novel learning-based method to approximate the whole Pareto set for MOBO, which generalizes the decomposition-based multi-objective optimization algorithm (MOEA/D) from finite populations to models. We design a simple and powerful acquisition search method based on the learned Pareto set, which naturally supports batch evaluation. In addition, with our proposed model, decision-makers can readily explore any trade-off area in the approximate Pareto set for flexible decision-making. This work represents the first attempt to model the Pareto set for expensive multi-objective optimization. Experimental results on different synthetic and real-world problems demonstrate the effectiveness of our proposed method.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Lin, X., Yang, Z., Zhang, X., & Zhang, Q. (2022). Pareto Set Learning for Expensive Multi-Objective Optimization. neural information processing systems, 19231–19247. https://doi.org/10.52202/068431-1398
MLA 9
Lin, Xi, et al. “Pareto Set Learning for Expensive Multi-Objective Optimization.” neural information processing systems, 2022, pp. 19231–19247. https://doi.org/10.52202/068431-1398.
Chicago
Lin, Xi, Zhiyuan Yang, Xiaoyuan Zhang, and Qingfu Zhang. 2022. “Pareto Set Learning for Expensive Multi-Objective Optimization.” neural information processing systems: 19231–19247. https://doi.org/10.52202/068431-1398.
Harvard
Lin, X. et al. (2022) ‘Pareto Set Learning for Expensive Multi-Objective Optimization’, neural information processing systems, pp. 19231–19247. doi:10.52202/068431-1398.
IEEE
X. Lin, Z. Yang, X. Zhang, and Q. Zhang, “Pareto Set Learning for Expensive Multi-Objective Optimization,” neural information processing systems, pp. 19231–19247, 2022, doi: 10.52202/068431-1398.
BibTeX
@inproceedings{lin2022pareto,
title = {{Pareto Set Learning for Expensive Multi-Objective Optimization}},
author = {Lin, Xi and Yang, Zhiyuan and Zhang, Xiaoyuan and Zhang, Qingfu},
booktitle = {neural information processing systems},
year = {2022},
pages = {19231--19247},
doi = {10.52202/068431-1398},
url = {https://doi.org/10.52202/068431-1398}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2020 | 1 | |
| 2023 | 11 | |
| 2024 | 43 | |
| 2025 | 60 | |
| 2026 | 50 |
Its field-weighted citation impact is 19.54: it has been cited 19.54 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms
- Pareto set approximation
- expensive multi-objective optimization
- multi-objective Bayesian optimization
- MOEA/D
- decomposition-based multi-objective optimization
- Pareto front
- decision-making
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?
Lin, X., Yang, Z., Zhang, X., & Zhang, Q. (2022). Pareto Set Learning for Expensive Multi-Objective Optimization. neural information processing systems, 19231–19247. https://doi.org/10.52202/068431-1398
How many times has this paper been cited?
165 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?
Xi Lin, Zhiyuan Yang, Xiaoyuan Zhang, Qingfu Zhang.
What is the DOI of this paper?
10.52202/068431-1398, permanently at https://doi.org/10.52202/068431-1398. 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.