Research map / Probabilistic and scientific modeling / Bayesian optimization
The Kalai-Smorodinsky solution for many-objective Bayesian optimization
Mickael Binois, Victor Picheny, Patrick Taillandier, Abderrahmane Habbal
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 |
|---|---|---|---|
| use SUR acquisition instead of baseline strategies | KS and CKS Bayesian optimization · DTLZ2 and hartman (discrete) | optimality gap | Improved |
| use hypervolume-based SMS-EGO instead of uniform random search | KS search · DTLZ2 | optimality gap | Hurt |
| use the fine SUR configuration (N=1000, M=100) instead of coarse (N=250, M=25) (ablation) | SUR · hartman, CKS | convergence speed: 528s vs 33s per iteration (KS) | Improved |
| use fine instead of coarse SUR configuration (ablation) | SUR · DTLZ2 and hartman KS | optimality gap | No clear effect |
| work on a continuous-space discretization (random subset of 10^5 out of 10^7 points) instead of the exact discrete domain (ablation) | SUR · hartman | rate of convergence | Hurt |
| discretization of the domain (ablation) | SUR · DTLZ2 | optimality gap | No clear effect |
| keep all objectives instead of dropping all but two (ablation) | hartman · hartman (Appendix E) | minimal ratio | Improved |
| use copula-based CKS instead of KS | CNN training · CNN hyperparameter tuning | balance across objectives | Improved |
| run SUR after space-filling initial design | KS, CKS, PKS · li-BIM calibration | minimum ratio | Improved |
| use CKS instead of KS (and KS with preferences) | SUR · li-BIM calibration | progress of minimum ratio | Hurt |
Closest papers by meaning
- BOtied: Multi-objective Bayesian optimization with tied multivariate ranks (ICML 2024 · similarity 0.87)
- Simple Extensions of Single-Objective Acquisition Functions and Hedge Strategies for Multi-Objective Bayesian Optimization (NeurIPS 2026 · similarity 0.87)
- MOBO-OSD: Batch Multi-Objective Bayesian Optimization via Orthogonal Search Directions (NeurIPS 2025 · similarity 0.87)
- Pareto Front-Diverse Batch Multi-Objective Bayesian Optimization (AAAI 2024 · similarity 0.86)
- Trading Off Quality and Uncertainty Through Multi-Objective Optimisation in Batch Bayesian Optimisation (AAAI 2025 · similarity 0.86)
- Preference-Aware Constrained Multi-Objective Bayesian Optimization (Student Abstract) (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.
