 Learning quantum Hamiltonians at any temperature in polynomial timeSymposium on the Theory of Computing (STOC), 2023 |
 Provable benefits of score matchingNeural Information Processing Systems (NeurIPS), 2023 |
 |
 Statistical Query Algorithms and Low-Degree Tests Are Almost EquivalentAnnual Conference Computational Learning Theory (COLT), 2020 |
 Sample-efficient learning of quantum many-body systemsNature Physics (Nat. Phys.), 2020 |
 Breaking the Barrier: Faster Rates for Permutation-based
Models in Polynomial TimeAnnual Conference Computational Learning Theory (COLT), 2018 |
 Optimal structure and parameter learning of Ising modelsScience Advances (Sci Adv), 2016 |
 |
 |
 Efficiently learning Ising models on arbitrary graphsSymposium on the Theory of Computing (STOC), 2014 |
 Hardness of parameter estimation in graphical modelsNeural Information Processing Systems (NeurIPS), 2014 |
