Bypassing the Noisy Parity Barrier: Learning Higher-Order Markov Random Fields from Dynamics
Open Access
- 15 June 2025
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 348-359
Abstract
No abstract availableAll Related Versions
Funding Information
- Office of Naval Research (N00014-20-1-2826)
- NSF (National Science Foundation) (CCF-2430381, CCF-1918421, DMS-2031883)
- Microsoft (Trustworthy AI Grant)
- David and Lucile Packard Foundation (Fellowship)
- Simons Foundation (622132)
This publication has 31 references indexed in Scilit:
- Structure Learning of Hamiltonians from Real-Time Evolution2024
- Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures2022
- Chow-Liu++: Optimal Prediction-Centric Learning of Tree Ising Models2022
- Learning Graphical Models Using Multiplicative Weights2017
- The Computational Hardness of Counting in Two-Spin Models on d-Regular Graphs2012
- The dynamics of social innovationProceedings of the National Academy of Sciences, 2011
- Computational Transition at the Uniqueness Threshold2010
- Learning DNF from random walksJournal of Computer and System Sciences, 2005
- Exploiting Random Walks for LearningInformation and Computation, 2002
- The Statistical Mechanics of Strategic InteractionGames and Economic Behavior, 1993