Conference paper · 2026 · Open access
Parametric Pareto Set Learning for Expensive Multi-Objective Optimization
Proceedings of the AAAI Conference on Artificial Intelligence, 40(43), 36829–36837 · Published 14 March 2026 · DOI 10.1609/aaai.v40i43.41009
In brief
“Parametric Pareto Set Learning for Expensive Multi-Objective Optimization” is a 2026 conference paper by Ji Cheng and 2 co-authors, published in Proceedings of the AAAI Conference on Artificial Intelligence. OpenAlex counts 3 citations as of 19 November 2026, which puts it in the top 4% of works published in 2026 by citations. It is open access: the full text is free to read at Proceedings of the AAAI Conference on Artificial Intelligence.
- Citations
- 3
- Most cited in
- 2026 (3)
- Field-weighted impact
- 4.85
- References
- 31
- Authors
- 3
Abstract
Parametric multi-objective optimization (PMO) addresses the challenge of solving an infinite family of multi-objective optimization problems, where optimal solutions must adapt to varying parameters. Traditional methods require re-execution for each parameter configuration, leading to prohibitive costs when objective evaluations are computationally expensive. To address this issue, we propose Parametric Pareto Set Learning with multi-objective Bayesian Optimization (PPSL-MOBO), a novel framework that learns a unified mapping from both preferences and parameters to Pareto-optimal solutions. PPSL-MOBO leverages a hypernetwork with Low-Rank Adaptation (LoRA) to efficiently capture parametric variations, while integrating Gaussian process surrogates and hypervolume-based acquisition to minimize expensive function evaluations. We demonstrate PPSL-MOBO's effectiveness on two challenging applications: multi-objective optimization with shared components, where certain design variables must be identical across solution families due to modular constraints, and dynamic multi-objective optimization, where objectives evolve over time. Unlike existing methods that cannot directly solve PMO problems in a unified manner, PPSL-MOBO learns a single model that generalizes across the entire parameter space. By enabling instant inference of Pareto sets for new parameter values without retraining, PPSL-BO provides an efficient solution for expensive PMO problems.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Cheng, J., Xue, B., & Zhang, Q. (2026). Parametric Pareto Set Learning for Expensive Multi-Objective Optimization. Proceedings of the AAAI Conference on Artificial Intelligence, 40(43), 36829–36837. https://doi.org/10.1609/aaai.v40i43.41009
MLA 9
Cheng, Ji, et al. “Parametric Pareto Set Learning for Expensive Multi-Objective Optimization.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 40, no. 43, 2026, pp. 36829–36837. https://doi.org/10.1609/aaai.v40i43.41009.
Chicago
Cheng, Ji, Bo Xue, and Qingfu Zhang. 2026. “Parametric Pareto Set Learning for Expensive Multi-Objective Optimization.” Proceedings of the AAAI Conference on Artificial Intelligence 40 (43): 36829–36837. https://doi.org/10.1609/aaai.v40i43.41009.
Harvard
Cheng, J., Xue, B. and Zhang, Q. (2026) ‘Parametric Pareto Set Learning for Expensive Multi-Objective Optimization’, Proceedings of the AAAI Conference on Artificial Intelligence, 40(43), pp. 36829–36837. doi:10.1609/aaai.v40i43.41009.
IEEE
J. Cheng, B. Xue, and Q. Zhang, “Parametric Pareto Set Learning for Expensive Multi-Objective Optimization,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 40, no. 43, pp. 36829–36837, 2026, doi: 10.1609/aaai.v40i43.41009.
BibTeX
@inproceedings{cheng2026parametric,
title = {{Parametric Pareto Set Learning for Expensive Multi-Objective Optimization}},
author = {Cheng, Ji and Xue, Bo and Zhang, Qingfu},
booktitle = {Proceedings of the AAAI Conference on Artificial Intelligence},
year = {2026},
volume = {40},
number = {43},
pages = {36829--36837},
doi = {10.1609/aaai.v40i43.41009},
url = {https://doi.org/10.1609/aaai.v40i43.41009}
}
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
- hypernetworks
- low-rank adaptation
- Kriging surrogate model
- expensive function evaluations
- dynamic multi-objective optimization
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?
Cheng, J., Xue, B., & Zhang, Q. (2026). Parametric Pareto Set Learning for Expensive Multi-Objective Optimization. Proceedings of the AAAI Conference on Artificial Intelligence, 40(43), 36829–36837. https://doi.org/10.1609/aaai.v40i43.41009
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 Proceedings of the AAAI Conference on Artificial Intelligence: sign in and open the PDF from this page.
Who wrote this paper?
Ji Cheng, Bo Xue, Qingfu Zhang.
What is the DOI of this paper?
10.1609/aaai.v40i43.41009, permanently at https://doi.org/10.1609/aaai.v40i43.41009. 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.