Property Testing in High Dimensional Ising models
Matey Neykov, Han Liu

TL;DR
This paper investigates the fundamental limits of testing basic properties in high-dimensional Ising models, proposing new correlation-based methods that are both statistically optimal and computationally efficient for different types of interactions.
Contribution
It introduces new bounds for property testing in Ising models and develops correlation-based tests tailored for ferromagnetic and general models, improving efficiency and understanding.
Findings
Correlation screening tests match theoretical bounds in ferromagnets.
Property testing is more challenging in general Ising models.
New methods outperform existing algorithms in specific settings.
Abstract
This paper explores the information-theoretic limitations of graph property testing in zero-field Ising models. Instead of learning the entire graph structure, sometimes testing a basic graph property such as connectivity, cycle presence or maximum clique size is a more relevant and attainable objective. Since property testing is more fundamental than graph recovery, any necessary conditions for property testing imply corresponding conditions for graph recovery, while custom property tests can be statistically and/or computationally more efficient than graph recovery based algorithms. Understanding the statistical complexity of property testing requires the distinction of ferromagnetic (i.e., positive interactions only) and general Ising models. Using combinatorial constructs such as graph packing and strong monotonicity, we characterize how target properties affect the corresponding…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
