Discrete distributions are learnable from metastable samples
Not on the map. Why?
Abstract (arXiv)
Physically motivated stochastic dynamics are widely used to sample from high-dimensional distributions. However, such samplers often get trapped in metastable states, approximately sampling from a distribution that differs significantly from the desired stationary state. We rigorously show that for multivariable discrete distributions, the true stationary model can nevertheless be recovered from these metastable samples. This relies on a fundamental observation: for distributions satisfying a strong metastability condition, their single-variable conditional probabilities are on average extremely close to those of the true stationary distribution. This remains true even when the two distributions are far apart under global metrics such as Kullback-Leibler divergence. Consequently, we can effectively learn the true model using a conditional-likelihood estimator even when the samples are drawn from a restricted state space. Extending these general results to Ising models, we prove rigorous parameter and structure learning guarantees. Finally, we demonstrate this phenomenon numerically on higher-alphabet spin glass models.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 22 of its 78 references that are in the map. First posted on arXiv 17 Oct 2024.
Builds on
22 of 78 references.
References · 22
- 2021How to Train Your Energy-Based Modelscited by 271
- 2016Structure Learning in Graphical Modelingcited by 66
- 2022Statistical Efficiency of Score Matching: The View from Isoperimetrycited by 63
- 2014Efficiently learning Ising models on arbitrary graphscited by 50
- 2016Interaction Screening: Efficient and Sample-Optimal Learning of Ising Modelscited by 43
- 2017Learning Graphical Models Using Multiplicative Weightscited by 43
- 2018On the Fenchel Duality between Strong Convexity and Lipschitz Continuous Gradientcited by 42
- 2017Inverse statistical problems: from the inverse Ising problem to data sciencecited by 36
- 2022JuMP 1.0: Recent improvements to a modeling language for mathematical optimizationcited by 34
- 2016Optimal structure and parameter learning of Ising modelscited by 26
- 2017Information Theoretic Properties of Markov Random Fields, and their Algorithmic Applicationscited by 21
- 2019Efficient Learning of Discrete Graphical Modelscited by 21
10 more
- 2019Nonparametric Density Estimation for High-Dimensional Data - Algorithms and Applicationscited by 18
- 2023Provable benefits of score matchingcited by 18
- 2018Sparse Logistic Regression Learns All Discrete Pairwise Graphical Modelscited by 16
- 2014Learning graphical models from the Glauber dynamicscited by 14
- 2023A Unified Approach to Learning Ising Models: Beyond Independence and Bounded Widthcited by 13
- 2023Fit Like You Sample: Sample-Efficient Generalized Score Matching from Fast Mixing Diffusionscited by 6
- 2020Learning of Discrete Graphical Models with Neural Networkscited by 5
- 2021Exponential Reduction in Sample Complexity with Learning of Ising Model Dynamicscited by 5
- 2016Learning Multivariate Log-concave Distributionscited by 4
- 2024Locally Stationary Distributions: A Framework for Analyzing Slow-Mixing Markov Chainscited by 1
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.
- 2025Estimating Ising Models in Total Variation Distancecited by 2
- 2026Computationally sufficient statistics for Ising modelscited by 0
- 2026Computationally sufficient statistics for Ising models12 Feb 2026
- 2025Estimating Ising Models in Total Variation Distance26 Nov 2025