English

Testing Ising Models

Data Structures and Algorithms 2019-07-12 v6 Information Theory Machine Learning math.IT Probability Statistics Theory Statistics Theory

Abstract

Given samples from an unknown multivariate distribution pp, is it possible to distinguish whether pp is the product of its marginals versus pp being far from every product distribution? Similarly, is it possible to distinguish whether pp equals a given distribution qq versus pp and qq being far from each other? These problems of testing independence and goodness-of-fit have received enormous attention in statistics, information theory, and theoretical computer science, with sample-optimal algorithms known in several interesting regimes of parameters. Unfortunately, it has also been understood that these problems become intractable in large dimensions, necessitating exponential sample complexity. Motivated by the exponential lower bounds for general distributions as well as the ubiquity of Markov Random Fields (MRFs) in the modeling of high-dimensional distributions, we initiate the study of distribution testing on structured multivariate distributions, and in particular the prototypical example of MRFs: the Ising Model. We demonstrate that, in this structured setting, we can avoid the curse of dimensionality, obtaining sample and time efficient testers for independence and goodness-of-fit. One of the key technical challenges we face along the way is bounding the variance of functions of the Ising model.

Keywords

Cite

@article{arxiv.1612.03147,
  title  = {Testing Ising Models},
  author = {Constantinos Daskalakis and Nishanth Dikkala and Gautam Kamath},
  journal= {arXiv preprint arXiv:1612.03147},
  year   = {2019}
}

Comments

Appeared SODA 2018. Final version to appear in IEEE Transactions on Information Theory

R2 v1 2026-06-22T17:19:02.117Z