Low-Degree Hardness of Random Optimization Problems
暂无分享,去创建一个
[1] Andrea Montanari,et al. Optimization of mean-field spin glasses , 2020, The Annals of Probability.
[2] Y. Gliklikh. Stochastic Analysis on Manifolds , 2011 .
[3] Prasad Raghavendra,et al. The Power of Sum-of-Squares for Detecting Hidden Structures , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[4] M. B. Hastings,et al. Classical and Quantum Algorithms for Tensor Principal Component Analysis , 2019, Quantum.
[5] Thierry Mora,et al. Clustering of solutions in the random satisfiability problem , 2005, Physical review letters.
[6] Tselil Schramm,et al. Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors , 2015, STOC.
[7] A. Dembo,et al. Cugliandolo-Kurchan equations for dynamics of Spin-Glasses , 2004, math/0409273.
[8] O. Zeitouni,et al. The extremal process of critical points of the pure p-spin spherical spin glass model , 2015, 1509.03098.
[9] S. Sen,et al. On the unbalanced cut problem and the generalized Sherrington–Kirkpatrick model , 2017, 1707.09042.
[10] Cristopher Moore,et al. The Kikuchi Hierarchy and Tensor PCA , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).
[11] Nicholas C. Wormald,et al. Large independent sets in regular graphs of large girth , 2007, J. Comb. Theory, Ser. B.
[12] David Steurer,et al. Efficient Bayesian Estimation from Few Samples: Community Detection and Related Problems , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[13] J. Bell. Gaussian Hilbert spaces , 2015 .
[14] Madhu Sudan,et al. Limits of local algorithms over sparse random graphs , 2013, ITCS.
[15] Amin Coja-Oghlan,et al. Algorithmic Barriers from Phase Transitions , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[16] Antonio Auffinger,et al. Random Matrices and Complexity of Spin Glasses , 2010, 1003.1129.
[17] Afonso S. Bandeira,et al. Subexponential-Time Algorithms for Sparse PCA , 2019, ArXiv.
[18] G'erard Ben-Arous,et al. Aging and spin-glass dynamics , 2003, math/0304364.
[19] S. Varadhan,et al. Large deviations , 2019, Graduate Studies in Mathematics.
[20] A. COJA-OGHLAN,et al. Walksat Stalls Well Below Satisfiability , 2016, SIAM J. Discret. Math..
[21] Pravesh Kothari,et al. A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[22] Andrea Montanari,et al. Message-passing algorithms for compressed sensing , 2009, Proceedings of the National Academy of Sciences.
[23] Afonso S. Bandeira,et al. Computational Hardness of Certifying Bounds on Constrained PCA Problems , 2019, ITCS.
[24] David Gamarnik,et al. Combinatorial approach to the interpolation method and scaling limits in sparse random graphs , 2010, STOC '10.
[25] Dmitry Panchenko,et al. Suboptimality of local algorithms for a class of max-cut problems , 2017, The Annals of Probability.
[26] Cugliandolo,et al. Analytical solution of the off-equilibrium dynamics of a long-range spin-glass model. , 1993, Physical review letters.
[27] M. Mézard,et al. Out of equilibrium dynamics in spin-glasses and other glassy systems , 1997, cond-mat/9702070.
[28] Ryan O'Donnell,et al. Analysis of Boolean Functions , 2014, ArXiv.
[29] Aukosh Jagannath,et al. Low Temperature Asymptotics of Spherical Mean Field Spin Glasses , 2016, 1602.00657.
[30] F. Guerra,et al. The Thermodynamic Limit in Mean Field Spin Glass Models , 2002, cond-mat/0204280.
[31] David Gamarnik,et al. The overlap gap property and approximate message passing algorithms for $p$-spin models , 2019, The Annals of Probability.
[32] Federico Ricci-Tersenghi,et al. How to iron out rough landscapes and get optimal performances: averaged gradient descent and its application to tensor PCA , 2019, Journal of Physics A: Mathematical and Theoretical.
[33] Andrea Montanari,et al. Optimization of the Sherrington-Kirkpatrick Hamiltonian , 2018, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).
[34] Alice Guionnet,et al. Dynamics for Spherical Models of Spin-Glass and Aging , 2007 .
[35] Jonathan Shi,et al. Tensor principal component analysis via sum-of-square proofs , 2015, COLT.
[36] G. B. Arous,et al. Algorithmic thresholds for tensor PCA , 2018, The Annals of Probability.
[37] G. Ben Arous,et al. Spectral Gap Estimates in Mean Field Spin Glasses , 2017, 1705.04243.
[38] Reza Gheissari,et al. On the spectral gap of spherical spin glass dynamics , 2016, Annales de l'Institut Henri Poincaré, Probabilités et Statistiques.
[39] Wei-Kuo Chen,et al. Parisi Formula, Disorder Chaos and Fluctuation for the Ground State Energy in the Spherical Mixed p-Spin Models , 2015, 1512.08492.
[40] Reza Gheissari,et al. Bounding Flows for Spherical Spin Glass Dynamics , 2018, Communications in Mathematical Physics.
[41] Prasad Raghavendra,et al. High-dimensional estimation via sum-of-squares proofs , 2018, Proceedings of the International Congress of Mathematicians (ICM 2018).
[42] M. Talagrand,et al. Probability in Banach spaces , 1991 .
[43] Bálint Virág,et al. Local algorithms for independent sets are half-optimal , 2014, ArXiv.
[44] A. Dembo,et al. Aging of spherical spin glasses , 2001 .
[45] Aukosh Jagannath,et al. Dynamics of mean field spin glasses on short and long timescales , 2019, Journal of Mathematical Physics.
[46] Andrea Montanari,et al. A statistical model for tensor PCA , 2014, NIPS.
[47] T. Sideris. Ordinary Differential Equations and Dynamical Systems , 2013 .
[48] Alan M. Frieze,et al. On the independence number of random graphs , 1990, Discret. Math..
[49] Afonso S. Bandeira,et al. Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio , 2019, ArXiv.
[50] Eliran Subag. Following the Ground States of Full‐RSB Spherical Spin Glasses , 2018 .
[51] A. Crisanti,et al. The sphericalp-spin interaction spin-glass model , 1993 .
[52] Wei-Kuo Chen,et al. On the energy landscape of spherical spin glasses , 2017, 1702.08906.