dc.contributor.author | Daskalakis, C | |
dc.contributor.author | Dikkala, N | |
dc.contributor.author | Kamath, G | |
dc.date.accessioned | 2022-06-17T15:58:25Z | |
dc.date.available | 2022-06-17T15:58:25Z | |
dc.date.issued | 2018-01-01 | |
dc.identifier.uri | https://hdl.handle.net/1721.1/143463 | |
dc.description.abstract | © Copyright 2018 by SIAM. Given samples from an unknown multivariate distribution p, is it possible to distinguish whether p is the product of its marginals versus p being far from every product distribution? Similarly, is it possible to distinguish whether p equals a given distribution q versus p and q 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 [BFF+01, Pan08, VV17, ADK15, DK16]. 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. | en_US |
dc.language.iso | en | |
dc.publisher | Society for Industrial and Applied Mathematics | en_US |
dc.relation.isversionof | 10.1137/1.9781611975031.130 | en_US |
dc.rights | Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. | en_US |
dc.source | SIAM | en_US |
dc.title | Testing ising models | en_US |
dc.type | Article | en_US |
dc.identifier.citation | Daskalakis, C, Dikkala, N and Kamath, G. 2018. "Testing ising models." Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. | |
dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | |
dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | |
dc.relation.journal | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms | en_US |
dc.eprint.version | Final published version | en_US |
dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
dc.date.updated | 2022-06-17T14:41:37Z | |
dspace.orderedauthors | Daskalakis, C; Dikkala, N; Kamath, G | en_US |
dspace.date.submission | 2022-06-17T14:41:38Z | |
mit.license | PUBLISHER_POLICY | |
mit.metadata.status | Authority Work and Publication Information Needed | en_US |