Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 43 min ago
PreprintarXiv licencearXiv

Revealing more on complex energy landscapes by passing less local information: Cavity approach with trust region in non-convex optimization problems

Abstract

Energy landscapes of non-convex optimization problems are high-dimensional surfaces that are difficult to reveal, visualize, or analyze. Message-passing algorithms, or equivalently cavity approaches in statistical physics, may fail to identify local minima as messages do not converge owing to the ruggedness of the energy landscapes. Here we aim to reveal the characteristics of these complex energy landscapes by limiting the amount of information passed in local messages, improving the convergence of messages for local minima. By studying a routing optimization problem with its convexity governed by a single parameter, we introduce a cavity message-passing algorithm with a trust region, and sample ensembles of converged local minima of rugged energy landscapes across many independent realizations of the same problem instances. We observe three regimes with different characteristics of the energy landscapes: (1) a maximally rugged regime with a peak in the diversity of low-energy minima; (2) an intermediate regime with a hierarchical multi-cluster organization of low-energy solutions; and (3) a smooth regime dominated by a single minimum. Additional tests show that the converged energies are largely insensitive to the size of the trust region if the size is small or moderate, demonstrating the robustness of the proposed approach in identifying characteristics of rugged energy landscapes.

Related

  1. Revealing antenna-molecule coupling using virtual gain from synthetic complex frequency analysis
    Toby Severs Millard, Xiaofei Xiao, Mayela Romero-Gómez +6
    arXivPreprintarXiv licenceFull textApplied physics & instrumentationOptics & photonicsarXiv
  2. Adaptive workforce exploration in complex productivity landscapes
    Mateus F. B. Granha, Igor V. G. de Oliveira, André L. M. Vilela +2
    arXivPreprintarXiv licenceFull textStatistical & nonlinear physicsarXiv
  3. Quantum Vehicle Routing Problem: a smart initialization strategy for ill-conditioned optimization landscapes
    Emanuele Casciaro, Mario De Simone, Stefano Martina +3
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsOptimisation & controlarXiv
  4. Thermodynamic optimization of thermal landscapes and energy barriers in a Brownian heat engine
    Mesfin Taye
    arXivPreprintCC BY 4.0Full textStatistical & nonlinear physicsarXiv
  5. Decision-aware validation of zero-noise extrapolation in QAOA optimization landscapes
    Vicenzo Scavino Alfaro
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
BibTeX
@misc{xu2026revealing,
  title = {{Revealing more on complex energy landscapes by passing less local information: Cavity approach with trust region in non-convex optimization problems}},
  author = {Zhiqi Xu and Chi Ho Yeung},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.10096},
  eprint = {2610.10096},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.10096},
}
RIS
TY  - UNPB
TI  - Revealing more on complex energy landscapes by passing less local information: Cavity approach with trust region in non-convex optimization problems
AU  - Zhiqi Xu
AU  - Chi Ho Yeung
PY  - 2026
DA  - 2026/10/07
PB  - arXiv
DO  - 10.48550/arxiv.2610.10096
UR  - https://arxiv.org/abs/2610.10096
AB  - Energy landscapes of non-convex optimization problems are high-dimensional surfaces that are difficult to reveal, visualize, or analyze. Message-passing algorithms, or equivalently cavity approaches in statistical physics, may fail to identify local minima as messages do not converge owing to the ruggedness of the energy landscapes. Here we aim to reveal the characteristics of these complex energy landscapes by limiting the amount of information passed in local messages, improving the convergence of messages for local minima. By studying a routing optimization problem with its convexity governed by a single parameter, we introduce a cavity message-passing algorithm with a trust region, and sample ensembles of converged local minima of rugged energy landscapes across many independent realizations of the same problem instances. We observe three regimes with different characteristics of the energy landscapes: (1) a maximally rugged regime with a peak in the diversity of low-energy minima; (2) an intermediate regime with a hierarchical multi-cluster organization of low-energy solutions; and (3) a smooth regime dominated by a single minimum. Additional tests show that the converged energies are largely insensitive to the size of the trust region if the size is small or moderate, demonstrating the robustness of the proposed approach in identifying characteristics of rugged energy landscapes.
ER  -