arXiv Analytics

Sign in

arXiv:2407.02082 [cond-mat.dis-nn]AbstractReferencesReviewsResources

Conditioning the complexity of random landscapes on marginal optima

Jaron Kent-Dobias

Published 2024-07-02Version 1

Marginal optima are minima or maxima of a function with many nearly flat directions. In settings with many competing optima, marginal ones tend to attract algorithms and physical dynamics. Often, the important family of marginal attractors are a vanishing minority compared with nonmarginal optima and other unstable stationary points. We introduce a generic technique for conditioning the statistics of stationary points in random landscapes on their marginality, and apply it in three isotropic settings with qualitatively different structure: in the spherical spin-glasses, where the energy is Gaussian and its Hessian is GOE; in multispherical spin glasses, which are Gaussian but non-GOE; and in sums of squared spherical random functions, which are non-Gaussian. In these problems we are able to fully characterize the distribution of marginal optima in the landscape, including when they are in the minority.

Related articles: Most relevant | Search more
arXiv:1711.06290 [cond-mat.dis-nn] (Published 2017-11-16)
Network Geometry and Complexity
arXiv:cond-mat/0404170 (Published 2004-04-07)
The Complexity of Vector Spin Glasses
arXiv:0903.3572 [cond-mat.dis-nn] (Published 2009-03-20)
Physics and Complexity