Metraipolis › archive › dc_8486d082e09e
Adaptive Multi Mode: Budget-Aware Routing of Optimizers By Online Landscape Probes — arXiv:2611.06879
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.06879
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-05T18:22:27.446Z
- SHA-256 of the archived text
4dbe2697862fab5b06eebc956f06c3709b741e600d9d7f3962963e8d497bf0d1- Stable URL of this page
https://metraipolis.com/documento/dc_8486d082e09e
How to cite
Adaptive Multi Mode: Budget-Aware Routing of Optimizers By Online Landscape Probes — arXiv:2611.06879 — arXiv (en), https://arxiv.org/abs/2611.06879 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8486d082e09e (Metraipolis archive dc_8486d082e09e, sha256 4dbe2697862fab5b06eebc956f06c3709b741e600d9d7f3962963e8d497bf0d1)
BibTeX
@misc{dc8486d082e09e,
title = {Adaptive Multi Mode: Budget-Aware Routing of Optimizers By Online Landscape Probes — arXiv:2611.06879},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.06879},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8486d082e09e; sha256 4dbe2697862fab5b06eebc956f06c3709b741e600d9d7f3962963e8d497bf0d1},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.06879. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The best classical optimizer for a continuous black-box problem depends on its budget and landscape. Existing routers decide from the dimension and budget, past improvement or features fitted to one benchmark, and few test an optimizer's implicit assumptions online. AMM (Adaptive Multi Mode) routes a known budget among quasi-Newton, trust-region, coordinate, multistart and evolution-strategy optimization engines with online probes of curvature, plateaus, separability, kinks, basins and fractal structure. Each probe has a default, a dimension-by-budget validity range and a cost charged to the budget. In its pre-registered development loop on bbob, 32 of 36 predictions held over the last 16 confirmations. AMM was then tested once on held-out bbob instances 101-110 (D=2-40, 10*D-1000*D) against up to seven competitors. It has the highest target share in 382 of 600 function-dimension-budget cells (236 outright, 146 tied) and, by a descriptive posterior rule, is credibly behind in 35, mostly at 10*D and 30*D. At every budget it also leads the controls built from its own engines (the best engine alone, the best engine per dimension and budget, and a greedy schedule), narrowly at 10*D and 30*D, and nevergrad's NgIohTuned. In pre-registered runs its lead over IPOP-CMA-ES holds under affine and box transformations, on box-constrained bbob and, pooled, on rotated f2-f4, but rotating the separable f3 and f4 removes most of the lead there. On held-out MA-BBOB its final share at 2000*D is level with IPOP-CMA-ES's and its anytime area lower. We published AMM as an open-source Python package (pip install amm-optimizer; this https URL ). Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Machine Learning (cs.LG) ; Neural and Evolutionary Computing (cs.NE); Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2611.06879 — 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-05T18:15:49.026Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).