Metraipolis › archive › dc_7bcbd4668f24

Consensus-based optimization for linearly separable functions — arXiv:2609.01317

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.01317
License (as archived)
CC0-1.0
Archived
2026-10-17T07:03:29.804Z
SHA-256 of the archived text
d6e717f5859b0e7837319ed530f2dd298f744a3777a1590dafd5fe1e4c460984
Stable URL of this page
https://metraipolis.com/documento/dc_7bcbd4668f24

How to cite

Consensus-based optimization for linearly separable functions — arXiv:2609.01317 — arXiv (en), https://arxiv.org/abs/2609.01317 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7bcbd4668f24 (Metraipolis archive dc_7bcbd4668f24, sha256 d6e717f5859b0e7837319ed530f2dd298f744a3777a1590dafd5fe1e4c460984)
BibTeX
@misc{dc7bcbd4668f24,
  title = {Consensus-based optimization for linearly separable functions — arXiv:2609.01317},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.01317},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7bcbd4668f24; sha256 d6e717f5859b0e7837319ed530f2dd298f744a3777a1590dafd5fe1e4c460984},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.01317. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Consensus-based optimization (CBO) is an efficient metaheuristic for global optimisation with attractive mathematical properties, allowing global convergence results even in non-convex settings. In practice it suffers greatly from the curse of dimensionality, as do most particle-based optimisers. Different strategies have been proposed to apply CBO even for high-dimensional optimisation problems, the most prominent being the so-called anisotropic noise model. However, a recent work by Bonandin et al. highlighted that this method performs well primarily on separable objective functions, and even small coordinate rotations severely degrade the performance. Motivated by this observation, in this work we study the case where the objective function is separable only in a linearly transformed coordinate system. To leverage the efficiency of anisotropic CBO we propose a reparametrisation scheme, which provably estimates such a coordinate transformation and then applies CBO in the new variables. Furthermore, we show how our scheme can be interpreted as noise adaptation in CBO. Numerical examples highlight the efficacy of the method, demonstrating significant performance improvements on challenging benchmark objectives.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-02 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.01317 — 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-10-17T06:49:55.534Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).