Fetching the paper…
Reading the bibliography…
We revisit the problem of solving $n$ random equations in $d$ real variables, when the equations are independent realizations of a Gaussian process in $d$ dimensions.
John Edensor Littlewood and Albert C Offord, On the number of real roots of a random algebraic equation. ii , Mathematical proceedings of the Cambridge philosophical society, vol. 35, Cambridge University Press, 1939, pp. 133–148
1939
Earlier work this paper cites.
Isaac J. Schoenberg, Positive definite functions on spheres , Duke Math. J. 9
1942
Earlier work this paper cites.
Mark Kac, On the average number of real roots of a random algebraic equation , Bull. Amer. Math. Soc. 49
1943
Earlier work this paper cites.
Stephen O. Rice, Mathematical analysis of random noise , Bell System Tech. J. 24
1945
Earlier work this paper cites.
Yehoram Gordon, Some inequalities for gaussian processes and applications , Israel Journal of Mathematics 50
1985
Earlier work this paper cites.
Marc Mézard, Giorgio Parisi, and Miguel Angel Virasoro, Spin glass theory and beyond , World Scientific Lecture Notes in Physics, vol. 9, World Scientific Publishing Co., Inc., Teaneck, NJ, 1987. MR 1026102
1987
Earlier work this paper cites.
Andrea Crisanti and H-J Sommers, The sphericalp-spin interaction spin glass model: the statics , Zeitschrift für Physik B Condensed Matter 87
1992
Earlier work this paper cites.
Michael Shub and Steve Smale, Complexity of Bézout’s theorem. I. Geometric aspects , J. Amer. Math. Soc. 6
1993
Earlier work this paper cites.
Andrea Crisanti and Hans-J. Sommers, Thouless-Anderson-Palmer Approach to the Spherical p-Spin Spin Glass Model , J. Phys. I France 5
1995
Earlier work this paper cites.
Steve Smale, Mathematical problems for the next century , Mathematical Intelligencer 20
1998
Earlier work this paper cites.
Yurii Nesterov, Introductory lectures on convex optimization: A basic course , vol. 87, Springer, 2003
2003
Earlier work this paper cites.
M. Wschebor, On the Kostlan-Shub-Smale model for random polynomial systems. Variance of the number of roots , J. Complexity 21
2005
Earlier work this paper cites.
Carlos Beltrán and Luis Miguel Pardo, On Smale’s 17th problem: a probabilistic positive solution , Found. Comput. Math. 8
2008
Earlier work this paper cites.
Greg W. Anderson, Alice Guionnet, and Ofer Zeitouni, An introduction to random matrices , Cambridge University Press, 2009
2009
Earlier work this paper cites.
Jean-Marc Azaïs and Mario Wschebor, Level sets and extrema of random processes and fields , John Wiley & Sons, 2009. MR 2478201
2009
Earlier work this paper cites.
David L. Donoho, Arian Maleki, and Andrea Montanari, Message Passing Algorithms for Compressed Sensing , Proceedings of the National Academy of Sciences 106
2009
Earlier work this paper cites.
Marc Mézard and Andrea Montanari, Information, Physics and Computation , Oxford, 2009
2009
Earlier work this paper cites.
Michel Talagrand, Mean field models for spin glasses: Volume i: Basic examples , vol. 54, Springer Science & Business Media, 2010
2010
Earlier work this paper cites.
Peter Bürgisser and Felipe Cucker, On a problem posed by Steve Smale , Ann. of Math. (2) 174
2011
Earlier work this paper cites.
Mohsen Bayati and Andrea Montanari, The dynamics of message passing on dense graphs, with applications to compressed sensing , IEEE Transactions on Information Theory 57
2011
Earlier work this paper cites.
Mireille Capitaine, Catherine Donati-Martin, Delphine Féral, and Maxime Février, Free convolution with a semicircular distribution and eigenvalues of spiked deformations of wigner matrices , Electron. J. Probab 16
2011
Earlier work this paper cites.
Yousef Saad, Numerical methods for large eigenvalue problems: revised edition , SIAM, 2011
2011
Earlier work this paper cites.
Antonio Auffinger and Gérard. Ben Arous, Complexity of random smooth functions on the high-dimensional sphere , Ann. Probab. 41
2013
Earlier work this paper cites.
Auffinger, Antonio and Ben Arous, Gérard and Cernỳ, Jirí, Random matrices and complexity of spin glasses , Communications on Pure and Applied Mathematics 66
2013
Earlier work this paper cites.
Dimitry Panchenko, The Sherrington-Kirkpatrick model , Springer Monographs in Mathematics, Springer, New York, 2013. MR 3052333
2013
Earlier work this paper cites.
Yann N Dauphin, Razvan Pascanu, Caglar Gulcehre, Kyunghyun Cho, Surya Ganguli, and Yoshua Bengio, Identifying and attacking the saddle point problem in high-dimensional non-convex optimization , Advances in neural information processing systems 27
2014
Cited alongside, same era.
Shai Shalev-Shwartz and Shai Ben-David, Understanding machine learning: From theory to algorithms , Cambridge University Press, 2014
2014
Cited alongside, same era.
Anna Choromanska, Mikael Henaff, Michael Mathieu, Gérard Ben Arous, and Yann LeCun, The loss surfaces of multilayer networks , Artificial intelligence and statistics, PMLR, 2015, pp. 192–204
2015
Cited alongside, same era.
Rong Ge, Furong Huang, Chi Jin, and Yang Yuan, Escaping from saddle points—online stochastic gradient for tensor decomposition , Conference on learning theory, PMLR, 2015, pp. 797–842
2015
Cited alongside, same era.
Lenaic Chizat, Edouard Oyallon, and Francis Bach, On lazy training in differentiable programming , Advances in Neural Information Processing Systems, 2019, pp. 2937–2947
2019
Later among the works it cites.
Yan V Fyodorov, A spin glass model for reconstructing nonlinearly encrypted signals corrupted by noise , Journal of Statistical Physics 175
2019
Later among the works it cites.
Behrooz Ghorbani, Shankar Krishnan, and Ying Xiao, An investigation into neural net optimization via hessian eigenvalue density , International Conference on Machine Learning, PMLR, 2019, pp. 2232–2241
2019
Later among the works it cites.
W.-K. Chen, D. Panchenko, and E. Subag, The generalized TAP free energy II , Commun. Math. Phys. (2020)
2020
Later among the works it cites.
Samet Oymak and Mahdi Soltanolkotabi, Towards moderate overparameterization: global convergence guarantees for training shallow neural networks , IEEE Journal on Selected Areas in Information Theory (2020)
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Antonio Auffinger and Wei-Kuo Chen, Parisi formula for the ground state energy in the mixed p p -spin model , The Annals of Probability 45
2017
Cited alongside, same era.
Chi Jin, Rong Ge, Praneeth Netrapalli, Sham M Kakade, and Michael I Jordan, How to escape saddle points efficiently , International conference on machine learning, PMLR, 2017, pp. 1724–1732
2017
Cited alongside, same era.
Aukosh Jagannath and Ian Tobasco, Low temperature asymptotics of spherical mean field spin glasses , Communications in Mathematical Physics 352
2017
Cited alongside, same era.
Pierre Lairez, A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time , Found. Comput. Math. 17
2017
Cited alongside, same era.
James A Mingo and Roland Speicher, Free probability and random matrices , vol. 35, Springer, 2017
2017
Cited alongside, same era.
Jeffrey Pennington and Yasaman Bahri, Geometry of neural network loss surfaces via random matrix theory , International conference on machine learning, PMLR, 2017, pp. 2798–2806
2017
Cited alongside, same era.
2017
Cited alongside, same era.
Eliran Subag, The complexity of spherical p p -spin models—a second moment approach , Ann. Probab. 45
2017
Cited alongside, same era.
2020
Later among the works it cites.
Peter L. Bartlett, Andrea Montanari, and Alexander Rakhlin, Deep learning: a statistical viewpoint , Acta Numerica 30
2021
Later among the works it cites.
2021
Later among the works it cites.
Ahmed El Alaoui, Andrea Montanari, and Mark Sellke, Optimization of mean-field spin glasses , The Annals of Probability 49
2021
Later among the works it cites.
Ronen Eldan, Dan Mikulincer, and Tselil Schramm, Non-asymptotic approximations of neural networks by gaussian processes , Conference on Learning Theory, PMLR, 2021, pp. 1754–1775
2021
Later among the works it cites.
David Gamarnik, The overlap gap property: A topological barrier to optimizing over random structures , Proceedings of the National Academy of Sciences 118
2021
Later among the works it cites.
Andrea Montanari, Optimization of the sherrington–kirkpatrick hamiltonian , SIAM Journal on Computing (2021), no. 0, FOCS19–1
2021
Later among the works it cites.
Eliran Subag, Following the ground states of full-rsb spherical spin glasses , Communications on Pure and Applied Mathematics 74
2021
Later among the works it cites.
Eliran Subag and Ofer Zeitouni, Concentration of the complexity of spherical pure p p -spin models at arbitrary energies , J. Math. Phys. 62
2021
Later among the works it cites.
2021
Later among the works it cites.
Gerard Ben Arous, Reza Gheissari, and Aukosh Jagannath, High-dimensional limit theorems for sgd: Effective dynamics and critical scaling , Advances in Neural Information Processing Systems 35
2022
Later among the works it cites.
Yan V Fyodorov and Rashel Tublin, Optimization landscape in the simplest constrained random least-square problem , Journal of Physics A: Mathematical and Theoretical 55
2022
Later among the works it cites.
Brice Huang and Mark Sellke, Tight lipschitz hardness for optimizing mean field spin glasses , 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), IEEE, 2022, pp. 312–322
2022
Later among the works it cites.
2023
Closest in time.
2023
Closest in time.
Sung Min Park, Kristian Georgiev, Andrew Ilyas, Guillaume Leclerc, and Aleksander Madry, Trak: Attributing model behavior at scale , International Conference on Machine Learning, PMLR, 2023, pp. 27074–27113
2023
Closest in time.
Pierfrancesco Urbani, A continuous constraint satisfaction problem for the rigidity transition in confluent tissues , Journal of Physics A: Mathematical and Theoretical 56
2023
Closest in time.
Germain Kolossov, Andrea Montanari, and Pulkit Tandon, Towards a statistical theory of data selection under weak supervision , The Twelfth International Conference on Learning Representations, 2024
2024
Closest in time.
Andrea Montanari, Learning functions that are invariant under permutations , Unpublished
2024
Closest in time.
Mengzhou Xia, Sadhika Malladi, Suchin Gururangan, Sanjeev Arora, and Danqi Chen, Less: Selecting influential data for targeted instruction tuning , Forty-first International Conference on Machine Learning, 2024
2024
Closest in time.