A Probability Density Theory for Spin-Glass Systems

01/03/2020
by   Gavin S. Hartnett, et al.
0

Spin-glass systems are universal models for representing many-body phenomena in statistical physics and computer science. High quality solutions of NP-hard combinatorial optimization problems can be encoded into low energy states of spin-glass systems. In general, evaluating the relevant physical and computational properties of such models is difficult due to critical slowing down near a phase transition. Ideally, one could use recent advances in deep learning for characterizing the low-energy properties of these complex systems. Unfortunately, many of the most promising machine learning approaches are only valid for distributions over continuous variables and thus cannot be directly applied to discrete spin-glass models. To this end, we develop a continuous probability density theory for spin-glass systems with arbitrary dimensions, interactions, and local fields. We show how our formulation geometrically encodes key physical and computational properties of the spin-glass in an instance-wise fashion without the need for quenched disorder averaging. We show that our approach is beyond the mean-field theory and identify a transition from a convex to non-convex energy landscape as the temperature is lowered past a critical temperature. We apply our formalism to a number of spin-glass models including the Sherrington-Kirkpatrick (SK) model, spins on random Erdős-Rényi graphs, and random restricted Boltzmann machines.

READ FULL TEXT

page 8

page 10

research
09/09/2019

Logical Quantum Field Theory

We consider the statistical mechanical ensemble of bit string histories ...
research
01/02/2020

Self-Supervised Learning of Generative Spin-Glasses with Normalizing Flows

Spin-glasses are universal models that can capture complex behavior of m...
research
11/23/2020

Restricted Boltzmann Machine, recent advances and mean-field theory

This review deals with Restricted Boltzmann Machine (RBM) under the ligh...
research
10/11/2018

The algorithmic hardness threshold for continuous random energy models

We prove an algorithmic hardness result for finding low-energy states in...
research
12/06/2016

Statistical mechanics of unsupervised feature learning in a restricted Boltzmann machine with binary synapses

Revealing hidden features in unlabeled data is called unsupervised featu...
research
07/11/2019

Highly parallel algorithm for the Ising ground state searching problem

Finding an energy minimum in the Ising model is an exemplar objective, a...
research
11/05/2019

Computational Separations between Sampling and Optimization

Two commonly arising computational tasks in Bayesian learning are Optimi...

Please sign up or login with your details

Forgot password? Click here to reset