Metraipolis › archive › dc_ce53aa3432ee
RaMMOBO: Random Max-Margin Multi-Objective Bayesian Optimization — arXiv:2611.00312
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.00312
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T11:19:18.131Z
- SHA-256 of the archived text
f9d3cef3f7760a74e09498a6b169db85cb90a0b9c21a99b88e99d82277d14e5a- Stable URL of this page
https://metraipolis.com/documento/dc_ce53aa3432ee
How to cite
RaMMOBO: Random Max-Margin Multi-Objective Bayesian Optimization — arXiv:2611.00312 — arXiv (en), https://arxiv.org/abs/2611.00312 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ce53aa3432ee (Metraipolis archive dc_ce53aa3432ee, sha256 f9d3cef3f7760a74e09498a6b169db85cb90a0b9c21a99b88e99d82277d14e5a)
BibTeX
@misc{dcce53aa3432ee,
title = {RaMMOBO: Random Max-Margin Multi-Objective Bayesian Optimization — arXiv:2611.00312},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.00312},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ce53aa3432ee; sha256 f9d3cef3f7760a74e09498a6b169db85cb90a0b9c21a99b88e99d82277d14e5a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.00312. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Multi-objective Bayesian optimization (MOBO) maximizes $M$ expensive black-box objectives with the goal of approximating the Pareto set, whose objective vectors cannot be improved in one component without sacrificing another. A common quality measure is hypervolume, the volume in objective space dominated by these vectors relative to a reference point. Expected hypervolume improvement (EHVI) directly targets this metric and is one-step Bayes-optimal, but its standard computation scales exponentially with $M$, making it prohibitively expensive for many-objective problems. We introduce random max-margin multi-objective Bayesian optimization (RaMMOBO), whose acquisition function lower-bounds EHVI while requiring only linear cost in $M$ to evaluate. RaMMOBO measures the volume of a max-margin box contained in a candidate's hypervolume-improvement region and averages over random reweightings of the objective space, yielding a utility that is strictly Pareto-monotone on hypervolume-improving outcomes. It naturally handles noisy observations and different probabilistic surrogates and supports efficient gradient-based optimization. Across synthetic and real-world benchmarks, RaMMOBO matches or outperforms state-of-the-art methods, with largest gains at higher $M$, with acquisition optimization up to two orders of magnitude faster than qLogNEHVI. Our implementation is available at this https URL . Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2611.00312 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-03T11:02:37.424Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).