Fetching the paper…
Reading the bibliography…
We study a class of deterministic flows in ${\mathbb R}^{d\times k}$, parametrized by a random matrix ${\boldsymbol X}\in {\mathbb R}^{n\times d}$ with i.i.d.
Haim Sompolinsky and Annette Zippelius, Dynamic theory of the spin-glass phase , Physical Review Letters 47
1981
Earlier work this paper cites.
James R Fienup, Phase retrieval algorithms: a comparison , Applied optics 21
1982
Earlier work this paper cites.
H Rieger, Michael Schreckenberg, and J Zittartz, Glauber dynamics of the Little-Hopfield model , Zeitschrift für Physik B Condensed Matter 72
1988
Earlier work this paper cites.
Andrea Crisanti, Heinz Horner, and H-J Sommers, The spherical p-spin interaction spin-glass model , Zeitschrift für Physik B Condensed Matter 92
1993
Earlier work this paper cites.
Leticia F Cugliandolo and Jorge Kurchan, Analytical solution of the off-equilibrium dynamics of a long-range spin-glass model , Physical Review Letters 71
1993
Earlier work this paper cites.
K Skouras, C Goutis, and MJ Bramson, Estimation in linear models using gradient descent with early stopping , Statistics and Computing 4
1994
Earlier work this paper cites.
Gerard Ben Arous and Alice Guionnet, Large deviations for langevin spin glass dynamics , Probability Theory and Related Fields 102
1995
Earlier work this paper cites.
Malte Grunwald, Sanov results for glauber spin-glass dynamics , Probability Theory and Related Fields 106
1996
Earlier work this paper cites.
Alice Guionnet, Averaged and quenched propagation of chaos for spin glass dynamics , Probability Theory and Related Fields 109
1997
Earlier work this paper cites.
Daniel W Stroock and SR Srinivasa Varadhan, Multidimensional diffusion processes , vol. 233, Springer Science & Business Media, 1997
1997
Earlier work this paper cites.
Gerard Ben Arous, Amir Dembo, and Alice Guionnet, Aging of spherical spin glasses , Probability Theory and Related Fields 120
2001
Earlier work this paper cites.
Zhidong Bai and Jack Silverstein, Spectral Analysis of Large Dimensional Random Matrices ( 2 n d 2^{nd} edition) , Springer, 2010
2010
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
Cited alongside, same era.
Patrick Billingsley, Convergence of probability measures , John Wiley & Sons, 2013
2013
Cited alongside, same era.
Adel Javanmard and Andrea Montanari, State evolution for general approximate message passing algorithms, with applications to spatial coupling , Information and Inference: A Journal of the IMA 2
2013
Cited alongside, same era.
Mihailo Stojnic, A framework to characterize performance of lasso algorithms , arXiv:1303.7291
2013
Cited alongside, same era.
Erwin Bolthausen, An iterative construction of solutions of the TAP equations for the Sherrington–Kirkpatrick model , Communications in Mathematical Physics 325
2019
Later among the works it cites.
2019
Later among the works it cites.
Pragya Sur and Emmanuel J. Candès, A modern maximum-likelihood theory for high-dimensional logistic regression , Proceedings of the National Academy of Sciences 116
2019
Later among the works it cites.
Ada Altieri, Giulio Biroli, and Chiara Cammarota, Dynamical mean-field theory and aging dynamics , Journal of Physics A: Mathematical and Theoretical 53
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2014
Cited alongside, same era.
Mohsen Bayati, Marc Lelarge, and Andrea Montanari, Universality in polytope phase transitions and message passing algorithms , The Annals of Applied Probability 25
2015
Cited alongside, same era.
2015
Cited alongside, same era.
David Donoho and Andrea Montanari, High dimensional robust M-estimation: asymptotic variance via approximate message passing , Probability Theory and Related Fields 166
2016
Cited alongside, same era.
Yuxin Chen and Emmanuel J Candès, Solving random quadratic systems of equations is nearly as easy as solving linear systems , Communications on pure and applied mathematics 70
2017
Cited alongside, same era.
Elisabeth Agoritsas, Giulio Biroli, Pierfrancesco Urbani, and Francesco Zamponi, Out-of-equilibrium dynamical mean-field equations for the perceptron model , Journal of Physics A: Mathematical and Theoretical 51
2018
Cited alongside, same era.
Daniel Soudry, Elad Hoffer, Mor Shpigel Nacson, Suriya Gunasekar, and Nathan Srebro, The implicit bias of gradient descent on separable data , The Journal of Machine Learning Research 19
2018
Cited alongside, same era.
Christos Thrampoulidis, Ehsan Abbasi, and Babak Hassibi, Precise error analysis of regularized M {M} -estimators in high dimensions , IEEE Transactions on Information Theory 64
2018
Cited alongside, same era.
Raphael Berthier, Andrea Montanari, and Phan-Minh Nguyen, State evolution for approximate message passing with non-separable functions , Information and Inference: A Journal of the IMA 9
2020
Later among the works it cites.
2020
Later among the works it cites.
Michael Celentano, Andrea Montanari, and Yuchen Wu, The estimation error of general first order methods , Conference on Learning Theory, PMLR, 2020, pp. 1078–1141
2020
Later among the works it cites.
Stefano Sarao Mannelli, Giulio Biroli, Chiara Cammarota, Florent Krzakala, Pierfrancesco Urbani, and Lenka Zdeborová, Marvels and pitfalls of the Langevin algorithm in noisy high-dimensional inference , Physical Review X 10
2020
Later among the works it cites.
2020
Later among the works it cites.
Wei-Kuo Chen and Wai-Kit Lam, Universality of approximate message passing algorithms , Electronic Journal of Probability 26
2021
Closest in time.
Amir Dembo and Reza Gheissari, Diffusions interacting through a random matrix: universality via stochastic Taylor expansion , Probability Theory and Related Fields (2021), 1–41
2021
Closest in time.
Andrea Montanari, Optimization of the Sherrington–Kirkpatrick hamiltonian , SIAM Journal on Computing (2021), no. 0, FOCS19–1
2021
Closest in time.