The SK model with a sparse variance profile: free energy and AMP-based magnetization estimation at high temperature
summary
The gist
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 and…
In short
This work generalizes the Sherrington-Kirkpatrick model to systems with sparse, non-structured interaction variance profiles. It derives high-temperature free energy asymptotics independent of the profile's signature and estimates magnetization using an Approximate Message Passing (AMP) algorithm based on Thouless–Anderson–Palmer equations.
Key concepts
- Variance Profile Matrix (Spnq)
- This is a deterministic symmetric matrix that defines how the interaction variance changes across different pairs of spins in the system. It has zero diagonal elements and non-negative entries, and its sparsity (few non-zero entries per row/column) is a key feature studied in this model.
- Approximate Message Passing (AMP)
- AMP is an algorithm used to estimate the mean magnetization vector of the spin system. It works by iteratively updating local estimates based on messages passed between neighboring spins, mimicking how information propagates through the complex interactions defined by the variance profile matrix.
- Thouless–Anderson–Palmer (TAP) Equations
- These are equations that describe the stationary states or equilibrium configurations of spin glasses. The AMP algorithm in this paper uses these equations as a basis for its iterative updates to approximate the true mean magnetization vector under high-temperature conditions.
Terminology used across episodes
This episode discusses
- The SK model with a sparse variance profile: free energy and AMP-based magnetization estimation at high temperature · Paper Radio
- The multi-species mean-field spin-glass on the Nishimori line
- Ferromagnetic Ising Model on multiregular random graphs
- Balanced multi-species spin glasses
- On free energy of non-convex multi-species spin glasses
- The convex structure of the Parisi formula for multi-species spin glasses
- On the de Almeida--Thouless Transition Surface in the Multi-Species SK Model with Centered Gaussian External Field
The paper
The SK model with a sparse variance profile: free energy and AMP-based magnetization estimation at high temperature · Read on arXiv
CNRS · Laboratoire d’informatique Gaspard Monge (LIGM / UMR 8049) · Universit´e Gustave Eiffel · ESIEE Paris · France
A generalization of the Sherrington-Kirkpatrick model for spin glasses is considered, in which the interaction matrix is endowed with a variance profile that has no particular structure and may be sparse. In the first part of the paper, an asymptotic equivalent of the free energy is derived at sufficiently high temperatures, regardless of the signature of the variance profile matrix. In the second part, the mean of the spin vector under the Gibbs measure is estimated using an Approximate Message Passing algorithm that generalizes the one used for the SK case. The dynamical approach of Adhikari et al (J Stat Phys 2021), originally developed for the classical SK model, is adapted to the present setting to obtain these results.
Transcript
Introduction to the show: ident: Mathematical Physics. The day in mathematical physics: rigorous models of physical systems.
Kai: We're looking at the paper: "The SK model with a sparse variance profile".
Mira: Here's the gist of the paper. 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 and may be sparse<ref:2604.25535#pg2> In the first part of the paper, an asymptotic equivalent of the free energy is derived at sufficiently high temperatures, regardless of the signature of the variance profile matrix<ref:2604.25535#pg2> In the second part, the mean of the spin vector under the Gibbs measure is estimated using an Approximate Message Passing algorithm based on the Thouless–Anderson–Palmer equations<ref:2604.25535#pg2> Model Definition and Assumptions The model introduces a deterministic symmetric matrix Spnq with zero diagonal and non-negative elements, which defines the variance profile of the interactions<ref:2604.25535#pg2> The random matrix Wpnq is defined such that its entries are independent, and it satisfies Wpnqij = Np0, tspnqij q for all i, j P rns and for some t ą 0<ref:2604.25535#pg2> Assumption 1 imposes conditions on this matrix Spnq, such as the bound spnqij ď CsK´1n for all n and all i, j P rns, and a finiteness condition on the number Crow “ supn Spnq where ¨ is the max row sum norm<ref:2604.25535#pg2> A case of interest is when Kn!
Kai: n, and there are at most CcardKn non-zero spnqij ’s in each row and column of Spnq for some constant Ccard ą 0, referred to as the “sparse” ones<ref:2604.25535#pg2> Assumption 2 specifies the high temperature regime by requiring t ă log 2 Crow<ref:2604.25535#pg2> Free Energy Asymptotics The first aim of this paper is to study the large n asymptotics of the free energy Fn “ 1/n E log Zpnq in a “high temperature” regime represented by Assumption 2<ref:2604.25535#pg2> Theorem 2 states that under Assumptions 1 and 2, the function F n is bounded, and moreover, that Fn ´ F n ÝÝÝÑ nÑ8 0<ref:2604.25535#pg2> The signature of Spnq has no impact on the form of the large-n approximation of the free energy<ref:2604.25535#pg2> Corollary 3 shows that if Spnq is a doubly stochastic matrix, then under Assumptions 1 and 2, it holds that Fn ÝÝÝÑ nÑ8 log 2 E log cosh p qξ h q t/4 p1 ´ q(tq 2)<ref:2604.25535#pg2> Magnetization Estimation via AMP The second aim is to provide a large–n approximation of the mean vector mpnq “ xσy<ref:2604.25535#pg2> Returning to the classical SK model, this vector can be approximated in the high temperature regime by an Approximate Message Passing (AMP) algorithm based on the Thouless-Anderson-Palmer (TAP) equations<ref:2604.25535#pg2> Theorem 5 proves that under Assumptions 3 and 2, for each even integer b ě 2, it holds that sup n max iPrns Eˇˇz l 1 pA pnq l q iˇˇb ă 8<ref:2604.25535#pg2> This implies that lim supn E››m ´ Tanhpxk q›› 2n1E ď 2ε, which implies that lim supklim supn E››m ´ Tanhpxk q›› 2n1E ď 2ε<ref:2604.25535#pg2> Convergence of AMP Iterates The paper develops a sequence of families of vectors ty1pA1q uA1Ărns,A1“k´-l, ty2pA2q uA2Ărns,A2“k´-l, and so on<ref:2604.25535#pg2> The construction of the iterates involves replacing the function Tanh with a polynomial activation function f<ref:2604.25535#pg2> Lemma 14 shows that for each ε ą 0, there is a polynomial pe such that the iterates (15) with f “ pe satisfy lim sup n max iPrns Epxˇk i ´ x˜k i q squared ď ε<ref:2604.25535#pg2> The proof for Theorem 5 involves showing that the conditional variance of the iterates is bounded by a constant, leading to the convergence of the AMP algorithm<ref:2604.25535#pg2> Bounding Errors and Final Result The final result shows that lim supklim supn E››m ´ Tanhpxk q›› 2n1E ď 2ε<ref:2604.25535#pg2> This implies that lim supn E››m ´ Tanhpxk q›› 2n1E ď 2ε, which implies that lim supklim supn E‹Tanhpxk q›› 2n1E ď 2ε<ref:2604.25535#pg2> Using Lemmas 12 and 11, it is shown that lim supn E››m ´ Tanhpxk q›› 2n1E ď 4plog 2q k<ref:2604.25535#pg2> Denoting as M8 the max norm of the matrix M, it holds that lim supklim supn E››m ´ Tanhpxk q›› 2n1E ď 2ε<ref:2604.25535#pg2> The paper establishes that for any arbitrary moment b ą 0, the supremum over all indices and sets is bounded by a constant independent of n<ref:2604.25535#pg2> This implies that lim supklim supn Eˇˇz l iˇˇb ă 8<ref:2604.25535#pg2> The final result is that lim supklim supn E››m ´ Tanhpxk q›› 2n1E ď 2ε, which implies that lim supn E‹Tanhpxk q›› 2n1E ď 2ε<ref:2604.25535#pg2> The paper closes with remarks on the necessity of the Kn ≥ log n condition and future research directions<ref:2604.25535#pg2> References
1: A.
Mira: Adhikari, C.
Kai: Brennecke, P.
Title and authors: Kai: Let's talk about what the paper actually says in its title and who wrote it. It's "The SK model with a sparse variance profile: free energy and AMP-based magnetization estimation at high temperature." It sounds pretty technical, but it points to two main things: handling sparse interaction matrices in spin glasses, and using Approximate Message Passing for the mean magnetization under high-temperature conditions.
Mira: The authors are working on extending the dynamical approach originally used for the classical SK model to this new setting where we have a variance profile that can be arbitrary or sparse. It's about adapting old tools to a more general problem structure.
Lev: I'm interested in how they handle the assumptions because that's where the physics gets constrained. They introduce these conditions, Assumption one which gives bounds on the matrix elements and also puts a condition on how many non-zero interactions there are in each row and column—they call these "sparse" ones <ref:2604.25535#pg1>.
Kai: So, if we think about what this means for us on hardware, it suggests that if we can define our system such that the number of relevant connections is small per spin, we might be able to use simpler methods for estimation.
Mira: That's right. And they also have Assumption two which sets a high-temperature regime where the temperature is greater than log two times the number of non-zero interactions in each row and column, which helps simplify things significantly <ref:2604.25535#pg2,in each row and column>.
Lev: From an error correction viewpoint, if you can bound the complexity of the interaction structure, you can control the overhead of your approximation algorithm much better.
The paper's summary: Kai: Now let's look at what they actually achieved in their summary. They show that in this high-temperature regime defined by Assumption two there exists an asymptotic equivalent for the free energy, F n, that is bounded and goes to zero as n goes to infinity <ref:2604.25535#pg2>.
Mira: That's a big result because it means the signature of that variance profile matrix doesn't actually matter for the overall form of this large-n approximation of the free energy, which was a key goal they set out.
Lev: So, even if we don't know much about the exact structure of these interactions beyond those general bounds, we still get a stable prediction for the free energy scaling as n gets huge. That's useful because it gives us a baseline behavior to check against.
Kai: And they also show that they can estimate the mean spin vector under this Gibbs measure using an Approximate Message Passing algorithm based on those TAP equations, which is returning to methods from the classical SK model but adapted for these sparse settings.
Mira: The summary highlights that this AMP approach, when applied under Assumption three and Assumption two gives a bound on the expectation of certain terms related to the spins, which ultimately leads to a convergence result for their iterative process <ref:2604.25535#pg3>.
Lev: That's where the complexity comes back in—how fast that AMP algorithm converges on real hardware. They are showing that even with these sparse structures, we can get an approximation for the mean spin vector in this high-temperature setting.
The paper's improvements: Kai: The paper points out a couple of ways they improved the situation. They show that if the variance profile matrix is doubly stochastic—meaning all its row and column sums are exactly one—then they recover the asymptotic free energy expression for the classical SK model at high temperature, as described in Corollary three <ref:2604.25535#pg3,the classical SK model at high temperature>.
Mira: That's a neat result because it shows that when we have that specific structure, the general framework simplifies nicely and connects back to something we already know about the standard SK model behavior.
Lev: For me, this connection is important because it means we have a known benchmark to test against when dealing with structured matrices like doubly stochastic ones. It gives us a concrete target for what our sparse model should behave like under those conditions.
Kai: And they also discuss the construction of the iterative sequence of vectors, t y one p A one q u A one in k'-l, which they use to approximate the mean vector <ref:2604.25535#pg1>. They replace the function Tanh with a polynomial activation function, and Lemma fourteen shows that this polynomial activation ensures convergence for any epsilon greater than zero.
Mira: So the improvement here is moving from just saying an approximation exists to showing *how* that approximation is constructed—using these specific non-backtracking iterations and carefully chosen polynomial functions.
Lev: That iteration sequence, using those polynomials, that's where you start thinking about computational complexity. If the polynomial degree is too high, the number of steps needed for convergence could become prohibitive on a real system.
Conclusion: Kai: So to wrap up this paper on "The SK model with a sparse variance profile: free energy and AMP-based magnetization estimation at high temperature," they've established that for any arbitrary moment b less than zero, the supremum over all indices and sets is bounded by a constant independent of n.
Mira: That means they've confirmed that the final error bound on those moments stays within a fixed constant as we increase the system size, which is a strong statement about their stability in this regime.
Lev: For us in hardware, that means if you run this approximation on a large system, you don't have to worry about some crazy error term growing unboundedly with the size of your setup. It stays controlled by that constant.
Kai: The final result they push is that the supremum over all indices and sets is bounded by two epsilon, which implies that for large n, the estimation of the mean spin vector under this Gibbs measure is bounded by two epsilon times something related to n to the power of one.
Mira: That's what allows them to say that they can get a good approximation for the mean vector, x, even when dealing with sparse variance profiles, provided we are in that high-temperature regime.
Lev: I'm just going to add that their final bound on the supremum is four times log two times q to the power of k, which suggests a slightly more complex dependence than just a simple constant, but still controlled by something related to the sparsity parameter.
Kai: So we've seen how they use AMP, how they handle sparse structures, and how they get bounds on the free energy and magnetization in this model. It’s a solid piece of work showing that even when things are not perfectly structured, you can still find reliable approximations under certain conditions.
More episodes
- 2610.33984-The Genus-One B-Model Calabi-Yau/Landau-Ginzburg Correspondence
- Daily Summary for 2026-11-19
- 2510.25312-Critical temperatures and collapsing of two-dimensional Log gases
- 2602.17549-Prefactorization algebras for the conformal Laplacian: Central charge and Hilbert Fock space
- 2604.22381-Affine Supertrusses and Superbraces
- 2605.20175-Complex deformations of the circle: Group cohomology and Virasoro uniformization
- 2504.14756-Nonlinear wave superpositions and quasi-rectifiable Lie modules
- The day in conversation for 2026-11-19
- Daily Summary for 2026-11-19
- 2508.15666-Cluster Expansion and Decay of Correlations for Multidimensional Long-Range Ising Models