AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Pareto Set Learning for Expensive Multi-Objective Optimization

Xi Lin, Zhiyuan Yang, Xiaoyuan Zhang, Qingfu Zhang

NeurIPS 2022 · Learning theory and algorithms › Combinatorial and search optimization · approach: Multi-objective optimization · 23 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use PSL instead of qEHVI for MOBO on F1qEHVI · F1 (2 objectives)runtime per iteration (s): 36.71 -> 6.59Improved
use PSL instead of DGEMO on DTLZ2DGEMO · DTLZ2 (3 objectives)runtime per iteration (s): 83.57 -> 8.61Improved
use PSL instead of TSEMOTSEMO · F1 and DTLZ2runtime per iteration (s): 4.82 -> 6.59; 7.28 -> 8.61No clear effect
use PSL (learned Pareto set, batch selection by HVI) instead of model-free scalarization MOBO (qParEGO, MOEA/D-EGO, TS-TCH)scalarization-based MOBO · 15 synthetic and real-world problemslog hypervolume differenceImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy