Arora, S. and Barak, B. (2009). Computational complexity: a modern approach. Cambridge University Press.
Barp, A., Briol, F.-X., Duncan, A., Girolami, M., and Mackey, L. (2019). Minimum stein discrepancy estimators. Advances in Neural Information Processing Systems, 32.
Besag, J. (1977). Efficiency of pseudolikelihood estimation for simple gaussian fields. Biometrika, pages 616-618.
Bresler, G. (2015). Efficiently learning ising models on arbitrary graphs. In Proceedings of the forty-seventh annual ACM symposium on Theory of computing, pages 771-782.
Bresler, G., Gamarnik, D., and Shah, D. (2014). Structure learning of antiferromagnetic ising models. Advances in Neural Information Processing Systems, 27.
Brown, L. D. (1986). Fundamentals of statistical exponential families: with applications in statistical decision theory. Ims.
Cook, S. A. (1971). The complexity of theorem-proving procedures. In Proceedings of the third annual ACM symposium on Theory of computing, pages 151-158.
Dagan, Y., Daskalakis, C., Dikkala, N., and Kandiros, A. V. (2021). Learning ising models from one or multiple samples. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pages 161-168.
Darmois, G. (1935). Sur les lois de probabilité estimation exhaustive. CR Acad. Sci. Paris, 260(1265):85.
Forbes, P. G. and Lauritzen, S. (2015). Linear estimating equations for exponential families with application to gaussian linear concentration models. Linear Algebra and its Applications, 473:261-283.
Hyvarinen, A. (2005). Estimation of non-normalized statistical models by score matching. Journal of Machine Learning Research, 6(4).
Hyvarinen, A. (2007). Some extensions of score matching. Computational statistics & data analysis, 51(5):2499-2512.
Koehler, F., Heckett, A., and Risteski, A. (2022). Statistical efficiency of score matching: The view from isoperimetry. arXiv preprint arXiv:2210.00726.
Koepf, W. (1998). Hypergeometric summation. Vieweg, Braunschweig/Wiesbaden, 5(6).
Koopman, B. O. (1936). On distributions admitting a sufficient statistic. Transactions of the American Mathematical society, 39(3):399-409.
Montanari, A. (2015). Computational implications of reducing data to sufficient statistics.
Pitman, E. J. G. (1936). Sufficient statistics and intrinsic accuracy. In *Mathematical Proceedings of the Cambridge Philosophical society*, volume 32, pages 567-579. Cambridge University Press.
Ren, C. X., Misra, S., Vuffray, M., and Lokhov, A. Y. (2021). Learning continuous exponential families beyond gaussian. arXiv preprint arXiv:2102.09198.
Shah, A., Shah, D., and Wornell, G. (2021). A computationally efficient method for learning exponential family distributions. Advances in neural information processing systems, 34:15841-15854.
Valiant, L. G. and Vazirani, V. V. (1985). Np is as easy as detecting unique solutions. In Proceedings of the seventeenth annual ACM symposium on Theory of computing, pages 458-463.
Van der Vaart, A. W. (2000). Asymptotic statistics, volume 3. Cambridge university press.
Vuffray, M., Misra, S., Lokhov, A., and Chertkov, M. (2016). Interaction screening: Efficient and sample-optimal learning of ising models. Advances in neural information processing systems, 29.