First algorithms recover Ising structure and parameters from flip-only dynamics trajectories, in time poly(d)n^2 log n for structure and O~(2^d n) for parameters.
Discrete distributions are learnable from metastable samples
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
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.
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Better Models and Algorithms for Learning Ising Models from Dynamics
First algorithms recover Ising structure and parameters from flip-only dynamics trajectories, in time poly(d)n^2 log n for structure and O~(2^d n) for parameters.