Algorithmic pure states for the negative spherical perceptron
arXiv:2010.15811
Abstract
We consider the spherical perceptron with Gaussian disorder. This is the set of points on the sphere of radius satisfying for all , where are independent standard gaussian vectors and is fixed. Various characteristics of such as its surface measure and the largest for which it is non-empty, were computed heuristically in statistical physics in the asymptotic regime , . The case is of special interest as is conjectured to exhibit a hierarchical tree-like geometry known as "full replica-symmetry breaking" (FRSB) close to the satisfiability threshold , and whose characteristics are captured by a Parisi variational principle akin to the one appearing in the Sherrington-Kirkpatrick model. In this paper we design an efficient algorithm which, given oracle access to the solution of the Parisi variational principle, exploits this conjectured FRSB structure for and outputs a vector satisfying for all and lying on a sphere of non-trivial radius , where is the right-end of the support of the associated Parisi measure. We expect to be approximately the barycenter of a pure state of the spherical perceptron. Moreover we expect that as , so that near criticality.
34 pages