Conference paper · 2025 · Open access

Improving Pareto Set Learning for Expensive Multi-objective Optimization via Stein Variational Hypernetworks

Minh-Duc Nguyen, Phuong Mai Dinh, Quang-Huy Nguyen, Long P. Hoang, Dung D. Le

Proceedings of the AAAI Conference on Artificial Intelligence, 39(18), 19677–19685 · Published 11 April 2025 · DOI 10.1609/aaai.v39i18.34167

Open PDFView at the publisherCite this paper

In brief

“Improving Pareto Set Learning for Expensive Multi-objective Optimization via Stein Variational Hypernetworks” is a 2025 conference paper by Minh-Duc Nguyen and 4 co-authors, published in Proceedings of the AAAI Conference on Artificial Intelligence. OpenAlex counts 8 citations as of 19 November 2026, which puts it in the top 6% of works published in 2025 by citations. It is open access: the full text is free to read at Proceedings of the AAAI Conference on Artificial Intelligence.

Citations
8
Most cited in
2025 (6)
Field-weighted impact
3.59
References
31
Authors
5

Abstract

Expensive multi-objective optimization problems (EMOPs) are common in real-world scenarios where evaluating objective functions is costly and involves extensive computations or physical experiments. Current Pareto set learning methods for such problems often rely on surrogate models like Gaussian processes to approximate the objective functions. These surrogate models can become fragmented, resulting in numerous small uncertain regions between explored solutions. When using acquisition functions such as the Lower Confidence Bound (LCB), these uncertain regions can turn into pseudo-local optima, complicating the search for globally optimal solutions. To address these challenges, we propose a novel approach called SVH-PSL, which integrates Stein Variational Gradient Descent (SVGD) with Hypernetworks for efficient Pareto set learning. Our method addresses the issues of fragmented surrogate models and pseudo-local optima by collectively moving particles in a manner that smooths out the solution space. The particles interact with each other through a kernel function, which helps maintain diversity and encourages the exploration of underexplored regions. This kernel-based interaction prevents particles from clustering around pseudo-local optima and promotes convergence towards globally optimal solutions. Our approach aims to establish robust relationships between trade-off reference vectors and their corresponding true Pareto solutions, overcoming the limitations of existing methods. Through extensive experiments across both synthetic and real-world MOO benchmarks, we demonstrate that SVH-PSL significantly improves the quality of the learned Pareto set, offering a promising solution for expensive multi-objective optimization problems.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Nguyen, M.-D., Dinh, P. M., Nguyen, Q.-H., Hoang, L. P., & Le, D. D. (2025). Improving Pareto Set Learning for Expensive Multi-objective Optimization via Stein Variational Hypernetworks. Proceedings of the AAAI Conference on Artificial Intelligence, 39(18), 19677–19685. https://doi.org/10.1609/aaai.v39i18.34167

MLA 9

Nguyen, Minh-Duc, et al. “Improving Pareto Set Learning for Expensive Multi-objective Optimization via Stein Variational Hypernetworks.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 39, no. 18, 2025, pp. 19677–19685. https://doi.org/10.1609/aaai.v39i18.34167.

Chicago

Nguyen, Minh-Duc, Phuong Mai Dinh, Quang-Huy Nguyen, Long P. Hoang, and Dung D. Le. 2025. “Improving Pareto Set Learning for Expensive Multi-objective Optimization via Stein Variational Hypernetworks.” Proceedings of the AAAI Conference on Artificial Intelligence 39 (18): 19677–19685. https://doi.org/10.1609/aaai.v39i18.34167.

Harvard

Nguyen, M.-D. et al. (2025) ‘Improving Pareto Set Learning for Expensive Multi-objective Optimization via Stein Variational Hypernetworks’, Proceedings of the AAAI Conference on Artificial Intelligence, 39(18), pp. 19677–19685. doi:10.1609/aaai.v39i18.34167.

IEEE

M.-D. Nguyen, P. M. Dinh, Q.-H. Nguyen, L. P. Hoang, and D. D. Le, “Improving Pareto Set Learning for Expensive Multi-objective Optimization via Stein Variational Hypernetworks,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 39, no. 18, pp. 19677–19685, 2025, doi: 10.1609/aaai.v39i18.34167.

BibTeX

@inproceedings{nguyen2025improving,
  title     = {{Improving Pareto Set Learning for Expensive Multi-objective Optimization via Stein Variational Hypernetworks}},
  author    = {Nguyen, Minh-Duc and Dinh, Phuong Mai and Nguyen, Quang-Huy and Hoang, Long P. and Le, Dung D.},
  booktitle = {Proceedings of the AAAI Conference on Artificial Intelligence},
  year      = {2025},
  volume    = {39},
  number    = {18},
  pages     = {19677--19685},
  doi       = {10.1609/aaai.v39i18.34167},
  url       = {https://doi.org/10.1609/aaai.v39i18.34167}
}

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

  • expensive multi-objective optimization
  • Stein variational gradient descent
  • hypernetworks
  • surrogate models
  • global optimization

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Nguyen, M.-D., Dinh, P. M., Nguyen, Q.-H., Hoang, L. P., & Le, D. D. (2025). Improving Pareto Set Learning for Expensive Multi-objective Optimization via Stein Variational Hypernetworks. Proceedings of the AAAI Conference on Artificial Intelligence, 39(18), 19677–19685. https://doi.org/10.1609/aaai.v39i18.34167

How many times has this paper been cited?

8 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?

Minh-Duc Nguyen, Phuong Mai Dinh, Quang-Huy Nguyen, Long P. Hoang, Dung D. Le.

What is the DOI of this paper?

10.1609/aaai.v39i18.34167, permanently at https://doi.org/10.1609/aaai.v39i18.34167. 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.