Papers
Topics
Authors
Recent
Search
2000 character limit reached

High-Magnetization Sampling at Low Temperatures: Ising Models and Bayesian Sparse Linear Regression

Published 8 Sep 2026 in cs.DS, cs.LG, math.PR, math.ST, and stat.ML | (2609.08873v1)

Abstract: Sparsity is a powerful structural resource in optimization and statistics. We develop frameworks for leveraging sparsity in sampling problems over the Hamming slice X<em>k<sup>d:=x∈±</sup>1<sup>d:∣i:xi=1∣=k\mathcal{X}<em>k<sup>d:={\mathbf{x}\in{\pm</sup> 1}<sup>d:|{i:\mathbf{x}_i=1}|=k}, in high-dimensional regimes where k≪dk\ll d (i.e., where Xk<sup>d\mathcal{X}_k<sup>d is \emph{highly magnetized}). We use our frameworks to design improved samplers for canonical problems in the study of \emph{Ising models} and \emph{Bayesian sparse linear regression}. Our first main result considers the \emph{Sherrington--Kirkpatrick} (SK) model restricted to fixed-magnetization slices Xk<sup>d\mathcal{X}_k<sup>d. We give a polynomial-time sampler for fixed-magnetization SK models at any inverse temperature $β&gt;0$, under arbitrary external fields, provided that k≤c</em>βdk\le c</em>βd for an appropriate constant cβc_β. By combining this result with an annealing strategy for estimating normalizing constants, we obtain polynomial-time samplers for the SK model at arbitrarily low temperatures under a sufficiently strong external field of strength hh. In the large-ββ limit, our framework permits sampling at field strengths within constant factors of the \emph{Almeida--Thouless line} delineating the replica-symmetric and replica-symmetry-breaking regions ([dAT78]), improving polynomially over the field strength h(β)h(β) required by the recent work of [BAR26]. Our second main result concerns the measurement complexity of polynomial-time Bayesian sparse linear regression. Recent work by [KSTZ25] shows how to sample from the canonical \emph{Gaussian spike-and-slab posterior} with expected sparsity kk, at any signal-to-noise ratio, given n≳k<sup>3log⁡<sup>3</sup></sup>dn\gtrsim k<sup>3\log<sup>3</sup></sup> d Gaussian measurements. We improve this requirement to n≳k<sup>3/2log⁡<sup>2</sup></sup>d+klog⁡<sup>3</sup>dn\gtrsim k<sup>{3/2}\log<sup>2</sup></sup> d+k\log<sup>3</sup> d, using a common sparsity-aware framework underlying both our results.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.