Preprint · 2024 · Open access

Preference-Optimized Pareto Set Learning for Blackbox Optimization

Haishan, Zhang, Diptesh Das, Koji Tsuda

arXiv (Cornell University) · Published 19 August 2024 · DOI 10.48550/arxiv.2408.09976

Open PDFView at the publisherCite this paper

In brief

“Preference-Optimized Pareto Set Learning for Blackbox Optimization” is a 2024 preprint by Haishan, Zhang and 2 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
2024 (1)
References
61
Authors
3

Abstract

Multi-Objective Optimization (MOO) is an important problem in real-world applications. However, for a non-trivial problem, no single solution exists that can optimize all the objectives simultaneously. In a typical MOO problem, the goal is to find a set of optimum solutions (Pareto set) that trades off the preferences among objectives. Scalarization in MOO is a well-established method for finding a finite set approximation of the whole Pareto set (PS). However, in real-world experimental design scenarios, it's beneficial to obtain the whole PS for flexible exploration of the design space. Recently Pareto set learning (PSL) has been introduced to approximate the whole PS. PSL involves creating a manifold representing the Pareto front of a multi-objective optimization problem. A naive approach includes finding discrete points on the Pareto front through randomly generated preference vectors and connecting them by regression. However, this approach is computationally expensive and leads to a poor PS approximation. We propose to optimize the preference points to be distributed evenly on the Pareto front. Our formulation leads to a bilevel optimization problem that can be solved by e.g. differentiable cross-entropy methods. We demonstrated the efficacy of our method for complex and difficult black-box MOO problems using both synthetic and real-world benchmark data.

Cite this paper

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

APA 7

Zhang, H., Das, D., & Tsuda, K. (2024). Preference-Optimized Pareto Set Learning for Blackbox Optimization. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2408.09976

MLA 9

Zhang, Haishan,, et al. “Preference-Optimized Pareto Set Learning for Blackbox Optimization.” arXiv (Cornell University), 2024. https://doi.org/10.48550/arxiv.2408.09976.

Chicago

Zhang, Haishan,, Diptesh Das, and Koji Tsuda. 2024. “Preference-Optimized Pareto Set Learning for Blackbox Optimization.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2408.09976.

Harvard

Zhang, H., Das, D. and Tsuda, K. (2024) ‘Preference-Optimized Pareto Set Learning for Blackbox Optimization’, arXiv (Cornell University). doi:10.48550/arxiv.2408.09976.

IEEE

H. Zhang, D. Das, and K. Tsuda, “Preference-Optimized Pareto Set Learning for Blackbox Optimization,” arXiv (Cornell University), 2024, doi: 10.48550/arxiv.2408.09976.

BibTeX

@misc{zhang2024preference,
  title     = {{Preference-Optimized Pareto Set Learning for Blackbox Optimization}},
  author    = {Zhang, Haishan, and Das, Diptesh and Tsuda, Koji},
  howpublished = {arXiv (Cornell University)},
  year      = {2024},
  doi       = {10.48550/arxiv.2408.09976},
  url       = {https://doi.org/10.48550/arxiv.2408.09976}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
202411
202511
202611

Topic and keywords

Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms

  • multi-objective optimization
  • black-box optimization
  • preference vectors
  • Pareto front approximation
  • bi-level optimization
  • scalarization
  • experimental design

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?

Zhang, H., Das, D., & Tsuda, K. (2024). Preference-Optimized Pareto Set Learning for Blackbox Optimization. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2408.09976

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?

Haishan, Zhang, Diptesh Das, Koji Tsuda.

What is the DOI of this paper?

10.48550/arxiv.2408.09976, permanently at https://doi.org/10.48550/arxiv.2408.09976. 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.