Related papers: AMP algorithms and Stein's method: Understanding T…
We present a new dynamical proof of the Thouless-Anderson-Palmer (TAP) equations for the classical Sherrington-Kirkpatrick spin glass at sufficiently high temperature. In our derivation, the TAP equations are a simple consequence of the…
Network structures are reconstructed from dynamical data by respectively naive mean field (nMF) and Thouless-Anderson-Palmer (TAP) approximations. For TAP approximation, we use two methods to reconstruct the network: a) iteration method; b)…
We propose an iterative construction of solutions of the Thouless-Anderson-Palmer-equations for the Sherrington-Kirpatrick model. The iterative scheme is proved to converge exactly up to the de Almayda-Thouless-line. No results on the…
One of the remarkable applications of the cavity method is to prove the Thouless-Anderson-Palmer (TAP) system of equations in the high temperature regime of the Sherrington-Kirkpatrick (SK) model. This naturally leads us to the important…
We study the high-temperature regime of a mean-field spin glass model whose couplings matrix is orthogonally invariant in law. The magnetization of this model is conjectured to satisfy a system of TAP equations, originally derived by Parisi…
There has been recent progress on the problem of inferring the structure of interactions in complex networks when they are in stationary states satisfying detailed balance, but little has been done for non-equilibrium systems. Here we…
We revisit two classic Thouless-Anderson-Palmer (TAP) studies of the Sherrington-Kirkpatrick model [Bray A J and Moore M A 1980 J. Phys. C 13, L469; De Dominicis C and Young A P, 1983 J. Phys. A 16, 2063]. By using the…
We show that the only solutions of the TAP equations for the Sherrington-Kirkpatrick model of Ising spin glasses which can be found by iteration are those whose free energy lies on the border between replica symmetric and broken replica…
A generalization of the Sherrington-Kirkpatrick (SK) model for spin glasses is considered, in which the interaction matrix is endowed with a variance profile that has no particular structure an may be sparse. In the first part of this…
We study how the degree of symmetry in the couplings influences the performance of three mean field methods used for solving the direct and inverse problems for generalized Sherrington-Kirkpatrick models. In this context, the direct problem…
We consider the problem of solving TAP mean field equations by iteration for Ising model with coupling matrices that are drawn at random from general invariant ensembles. We develop an analysis of iterative algorithms using a dynamical…
The canonical tensor rank approximation problem (TAP) consists of approximating a real-valued tensor by one of low canonical rank, which is a challenging non-linear, non-convex, constrained optimization problem, where the constraint set…
The cavity and TAP equations are high-dimensional systems of nonlinear equations of the local magnetization in the Sherrington-Kirkpatrick model. In the seminal work [Comm. Math. Phys., 325(1):333-366, 2014], Bolthausen introduced an…
This work proves an upper bound for the free energy of the Sherrington-Kirkpatrick model and its generalizations in terms of the Thouless-Anderson-Palmer (TAP) energy. The result applies to models with spherical or Ising spins and any mixed…
We develop an advanced mean field method for approximating averages in probabilistic data models that is based on the TAP approach of disorder physics. In contrast to conventional TAP, where the knowledge of the distribution of couplings…
The adaptive Thouless--Anderson--Palmer (TAP) mean-field approximation is one of the advanced mean-field approaches, and it is known as a powerful accurate method for Markov random fields (MRFs) with quadratic interactions (pairwise MRFs).…
Optimizing a high-dimensional non-convex function is, in general, computationally hard and many problems of this type are hard to solve even approximately. Complexity theory characterizes the optimal approximation ratios achievable in…
Applications such as megaregional planning require efficient methods for solving traffic assignment problems (TAPs) on large-scale networks. We propose a decomposition heuristic that generates approximate TAP solutions by partitioning the…
Approximate Message Passing (AMP) is an efficient iterative parameter-estimation technique for certain high-dimensional linear systems with non-Gaussian distributions, such as sparse systems. In AMP, a so-called Onsager term is added to…
In 1977, Thouless, Anderson, and Palmer (TAP) derived a system of consistent equations in terms of the effective magnetization in order to study the free energy in the Sherrington-Kirkpatrick (SK) spin glass model. The solutions to their…