Research map / Learning theory and algorithms / Combinatorial and search optimization
Picking a Representative Set of Solutions in Multiobjective Optimization: Axioms, Algorithms, and Experiments
Niclas Boehmer, Maximilian T. Wittmann
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 changed | Where | Measured | Effect |
|---|---|---|---|
| optimize directed coverage instead of coverage | Pareto pruning slate selection · ZDT (k=5%) | Hypervolume: 97.3% -> 99.3% | Improved |
| optimize directed coverage instead of coverage | Pareto pruning slate selection · PGMORL (k=5%) | Avg. sum objective: 96.9% -> 100.0% | Improved |
| optimize directed coverage instead of uniformity | Pareto pruning slate selection · PGMORL (k=5%) | Hypervolume: 94.8% -> 100.0% | Improved |
| optimize directed coverage instead of coverage | Pareto pruning slate selection · DTLZ (k=25%) | Hypervolume: 95.9% -> 99.1% | Improved |
| optimize directed coverage instead of coverage | Pareto pruning slate selection · DTLZ (k=10%) | Hypervolume: 99.6% -> 97.9% | Hurt |
| optimize uniformity instead of directed coverage | Pareto pruning slate selection · ZDT (k=5%) | Directed coverage (lower better): 100.0% -> 195.3% | Hurt |
| optimize coverage instead of directed coverage | Pareto pruning slate selection · PGMORL (k=25%) | Directed coverage (lower better): 100.0% -> 227.1% | Hurt |
| optimize directed coverage instead of coverage | Pareto pruning slate selection · PGMORL (k=25%) | Uniformity: 56.4% -> 45.9% | Hurt |
| optimize directed coverage instead of uniformity | Pareto pruning slate selection · ZDT (k=25%) | Coverage (lower better): 117.4% -> 364.6% | Hurt |
| optimize coverage instead of uniformity | Pareto pruning slate selection · DTLZ (k=5%) | Coverage (lower better): 131.2% -> 100.0% | Improved |
| increase k from 5% to 25% | Pareto pruning slate selection · ZDT, Directed Coverage method | Hypervolume: 99.3% -> 99.9% | No clear effect |
Closest papers by meaning
- Preference Optimization on Pareto Sets: On a Theory of Multi-Objective Optimization (NeurIPS 2025 · similarity 0.88)
- Preference-Guided Diffusion for Multi-Objective Offline Optimization (NeurIPS 2025 · similarity 0.87)
- User Preference Meets Pareto-Optimality in Multi-Objective Bayesian Optimization (AAAI 2025 · similarity 0.86)
- BOtied: Multi-objective Bayesian optimization with tied multivariate ranks (ICML 2024 · similarity 0.86)
- Pareto Merging: Multi-Objective Optimization for Preference-Aware Model Merging (ICML 2025 · similarity 0.86)
- Pareto Front-Diverse Batch Multi-Objective Bayesian Optimization (AAAI 2024 · similarity 0.86)
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.
