Efficiently Learning Markov Random Fields from Dynamics
<|reference_start|>Efficiently Learning Markov Random Fields from Dynamics: An important task in high-dimensional statistics is learning the parameters or dependency structure of an undirected graphical model, or Markov random field (MRF). Much of the prior work on this problem assumes access to i.i.d. samples from the MRF distribution and state-of-the-art algorithms succeed using $n^{\Theta(k)}$ runtime, where $n$ is the dimension and $k$ is the order of the interactions. However, well-known reductions from the sparse parity with noise problem imply that given i.i.d. samples from a sparse, order-$k$ MRF, any learning algorithm likely requires $n^{\Omega(k)}$ time, impeding the potential for significant computational improvements. In this work, we demonstrate that these fundamental barriers for learning MRFs can surprisingly be completely circumvented when learning from natural, dynamical samples. We show that in bounded-degree MRFs, the dependency structure and parameters can be recovered using a trajectory of Glauber dynamics of length $O(n \log n)$ with runtime $O(n^2 \log n)$. The implicit constants depend only on the degree and non-degeneracy parameters of the model, but not the dimension $n$. In particular, learning MRFs from dynamics is $\textit{provably computationally easier}$ than learning from i.i.d. samples under standard hardness assumptions.<|reference_end|>
@article{gaitonde2024bypassing,
    title={Bypassing the Noisy Parity Barrier: Learning Higher-Order Markov Random
  Fields from Dynamics},
    author={Jason Gaitonde, Ankur Moitra, Elchanan Mossel},
    journal={arXiv preprint arXiv:2409.05284},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.05284},
    primaryClass={cs.LG cs.DS stat.ML}
}