Recognition: unknown
Nonconvex optimization methods for ground states in disordered continuous-spin models
Pith reviewed 2026-05-08 17:10 UTC · model grok-4.3
The pith
Monotonic Basin Hopping finds lower-energy ground states than MultiStart in the random field XY model after reformulating it on spheres.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
By expressing the angular Hamiltonian as a constrained problem on the Cartesian product of spheres, Riemannian optimization becomes applicable, and Monotonic Basin Hopping consistently returns lower-energy configurations than MultiStart while using less computation and showing greater numerical stability.
What carries the argument
Reformulation of the random-field XY Hamiltonian as minimization on the product of unit spheres, combined with the Monotonic Basin Hopping global search procedure.
Load-bearing premise
Converting the original angle variables into Cartesian vectors on spheres leaves the energy values and the locations of all minima unchanged.
What would settle it
On a set of random instances, compute the energies reached by both methods; if MultiStart ever returns a strictly lower energy than Monotonic Basin Hopping on the same instance, the performance claim is false.
read the original abstract
This work explores the global optimization problem of finding lowest-energy configurations (ground states) in disordered continuous spins models from statistical physics, with a particular focus on the random field XY model. Due to an extremely non-convex nature of the associated energy landscape, this problem remains highly challenging. From an optimization perspective, we reformulate the traditional angular Hamiltonian as a constrained problem on the Cartesian product of spheres, allowing the application of Riemannian optimization techniques, which show better computational performances. We compare a MultiStart (MS) strategy against a Monotonic Basin Hopping (MBH) framework, with the aim of highlighting the limitations of standard approaches and the resulting need to resort to more advanced global optimization techniques. Our results demonstrate that MBH consistently outperforms MS in identifying lower-energy configurations, offering superior computational efficiency and numerical stability. This approach establishes a robust link between continuous-spin systems and continuous global optimization, providing a high-performance benchmark for exploring complex energy landscapes.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript reformulates the ground-state problem for the random field XY model as a constrained Riemannian optimization task on the Cartesian product of spheres. It then compares a MultiStart (MS) strategy of random initializations followed by local Riemannian optimization against a Monotonic Basin Hopping (MBH) framework that augments the same local solver with monotonic perturbations, asserting that MBH consistently locates lower-energy configurations with better efficiency and numerical stability.
Significance. The sphere-product reformulation is exactly equivalent to the original angular Hamiltonian and introduces no landscape artifacts. If the MBH–MS comparison were performed under matched computational budgets, the work would supply a concrete, reproducible benchmark linking disordered spin systems to continuous global optimization methods. The current presentation, however, leaves the efficiency and consistency claims unverifiable.
major comments (1)
- [Abstract] Abstract (and presumably the Results section): the headline claim that MBH offers superior computational efficiency and numerical stability is not supported by any accounting of total energy/gradient evaluations, local-solver iterations, or wall-clock time. Because MBH performs additional hops beyond the MS baseline, observed advantages could be an artifact of unequal resource allocation rather than intrinsic superiority of the framework. This directly undermines the central empirical conclusion.
minor comments (2)
- [Abstract] The abstract states that MBH 'consistently outperforms' MS yet supplies no quantitative metrics, system sizes, disorder realizations, or error bars; these must appear in the main text with tables or figures.
- Implementation details (Riemannian solver tolerances, hop acceptance criteria, stopping rules) are referenced but not specified; these should be stated explicitly to allow reproduction.
Simulated Author's Rebuttal
We thank the referee for their careful reading of the manuscript and for highlighting the need for verifiable computational accounting in the MBH–MS comparison. We address the major comment below and commit to revisions that will make the efficiency claims fully transparent and reproducible.
read point-by-point responses
-
Referee: [Abstract] Abstract (and presumably the Results section): the headline claim that MBH offers superior computational efficiency and numerical stability is not supported by any accounting of total energy/gradient evaluations, local-solver iterations, or wall-clock time. Because MBH performs additional hops beyond the MS baseline, observed advantages could be an artifact of unequal resource allocation rather than intrinsic superiority of the framework. This directly undermines the central empirical conclusion.
Authors: We agree that the current presentation does not supply the quantitative resource accounting required to substantiate the efficiency and stability claims. While the manuscript reports lower final energies and greater consistency across independent runs for MBH, it does not tabulate the total number of energy or gradient evaluations, local Riemannian solver iterations, or wall-clock times, nor does it normalize performance by computational budget. This omission leaves open the possibility that the observed advantages arise from the additional monotonic perturbations performed by MBH rather than from intrinsic superiority. In the revised manuscript we will add a dedicated subsection (and accompanying table) in the Results section that reports, for each system size and disorder realization, the average number of function evaluations, gradient calls, local-solver iterations, and CPU seconds required by both MS and MBH to reach the reported configurations. We will also present performance curves normalized by total computational effort, thereby demonstrating whether MBH attains lower energies within matched or lower budgets. These additions will directly resolve the referee’s concern and strengthen the link between the Riemannian reformulation and global optimization practice. revision: yes
Circularity Check
No circularity: standard reformulation and empirical comparison
full rationale
The paper's claimed chain consists of a mathematically equivalent change-of-variables reformulation (angular Hamiltonian to sphere-product constraints) followed by an empirical head-to-head of MS versus MBH on the resulting non-convex problem. Neither step reduces to a self-definition, a fitted parameter renamed as prediction, or a load-bearing self-citation; the equivalence is isometric and the performance claims rest on direct numerical trials rather than any derived identity. The derivation is therefore self-contained against external benchmarks.
Axiom & Free-Parameter Ledger
axioms (2)
- domain assumption The energy landscape of the random-field XY model is extremely non-convex.
- domain assumption The angular Hamiltonian can be equivalently represented as a constrained problem on the Cartesian product of spheres.
Reference graph
Works this paper leans on
-
[1]
Wales, D.: Energy Landscapes: Applications to Clusters, Biomolec ules and Glasses. Cambridge Molecular Science. Cambridge University Press, UK (2004). https://doi.org/10.1017/CBO9780511721724
-
[2]
Mezard, M., Montanari, A.: Information, Physics, and Computat ion. Oxford University Press, Inc., USA (2009). https://doi.org/10.1093/acprof:oso/9780198570837.001.0001
work page doi:10.1093/acprof:oso/9780198570837.001.0001 2009
-
[3]
John Wiley & Sons, Wein heim, Germany (2006)
Hartmann, A.K., Weigt, M.: Phase Transitions in Combinatorial Optim ization Problems: Basics, Algorithms and Statistical Mechanics. John Wiley & Sons, Wein heim, Germany (2006). https://doi.org/10.1002/3527606734.index
-
[4]
Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimiz ation via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence 23(11), 1222–1239 (2001) https://doi.org/10.1109/34.969114
-
[5]
Kolmogorov, V.: Convergent tree-reweighted message passing for energy minimization. IEEE Transactions on Pattern Analysis and Machine Intelligence 28(10), 1568–1583 (2006) https://doi.org/10.1109/TPAMI.2006.200
-
[6]
Krislock, N., Malick, J., Roupin, F.: Biqcrunch: A semidefinite branch -and-bound method for solving binary quadratic problems. ACM Trans. Math. So ftw. 43(4) (2017) 10 Run 0 20 40 60 80 100 120 140 160 180 200 -9.84 -9.82 -9.8 -9.78 -9.76 -9.74 -9.72 -9.7 Final Cost × 104 RCG RTR Run 0 20 40 60 80 100 120 140 160 180 200 -9.84 -9.82 -9.8 -9.78 -9.76 -9.74...
-
[7]
Agrawal, R., Kumar, M., Puri, S.: Domain growth and aging in the ran- dom field xy model: A monte carlo study. Phys. Rev. E 104, 044123 (2021) https://doi.org/10.1103/PhysRevE.104.044123
-
[8]
Boumal, N.: An Introduction to Optimization on Smooth Manifolds. C am- bridge University Press, UK (2023). https://doi.org/10.1017/9781009166164 . https://www.nicolasboumal.net/book
-
[9]
IMA Journal of Numerical Analysis 39(1), 1–33 (2018) https://doi.org/10.1093/imanum/drx080 11
Boumal, N., Absil, P.-A., Cartis, C.: Global rates of convergence fo r nonconvex optimization on manifolds. IMA Journal of Numerical Analysis 39(1), 1–33 (2018) https://doi.org/10.1093/imanum/drx080 11
-
[10]
Absil, P.-A., Mahony, R., Sepulchre, R.: Optimization Algorithms on M atrix Manifolds, p. 224. Princeton University Press, Princeton, NJ (2008). https://doi.org/10.1515/9781400830244
-
[11]
Society for Industrial and Applied Mathematics, USA (2013)
Locatelli, M., Schoen, F.: Global Optimization: Theory, Algorithms , and Applications. Society for Industrial and Applied Mathematics, USA (2013). https://doi.org/10.1137/1.9781611972672
-
[12]
Wales, D., Doye, J.: Global optimization by basin-hopping and the lo west energy structures of lennard-jones clusters containing up to 110 atoms. The Journal o f Physical Chemistry A 101 (1998) https://doi.org/10.1021/jp970984n
-
[13]
Di Lorenzo, D., Liuzzi, G., Rinaldi, F., Schoen, F., Sciandrone, M.: A concave optimization-based approach for sparse portfolio selection. Optimization Methods and Software 27(6), 983–1000 (2012) https://doi.org/10.1080/10556788.2011.577773
-
[14]
Townsend, J., Koep, N., Weichwald, S.: Pymanopt: A python toolb ox for optimization on mani- folds using automatic differentiation. Journal of Machine Learning R esearch 17(137), 1–5 (2016) https://doi.org/10.48550/arXiv.1603.03236
-
[15]
Baity-Jesi, M., Parisi, G.: Inherent structures in m-component spin glasses. Phys. Rev. B 91, 134203 (2015) https://doi.org/10.1103/PhysRevB.91.134203
-
[16]
Absil, P.-A., Baker, C.G., Gallivan, K.A.: Trust-region methods on Rie man- nian manifolds. Foundations of Computational Mathematics 7(3), 303–330 (2007) https://doi.org/10.1007/s10208-005-0179-9 12
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.