Fetching the paper…
Reading the bibliography…
We consider the problem of learning a target function corresponding to a single hidden layer neural network, with a quadratic activation function after the first layer, and random weights.
Characteristic vectors of bordered matrices with infinite dimensions
Eugene P Wigner · 1955
Earlier work this paper cites.
Differential operators on a semisimple lie algebra
Harish-Chandra · 1957
Earlier work this paper cites.
Locally asymptotically normal families of distributions. certain approximations to families of distributions and their use in the theory of estimation and testing hypotheses
Lucien Le Cam · 1960
Earlier work this paper cites.
Distribution of eigenvalues for some sets of random matrices
Vladimir Alexandrovich Marchenko and Leonid Andreevich Pastur · 1967
Earlier work this paper cites.
The planar approximation. ii
Claude Itzykson and J-B Zuber · 1980
Earlier work this paper cites.
Spin glass theory and beyond: An Introduction to the Replica Method and Its Applications , volume 9
Marc Mézard, Giorgio Parisi, and Miguel Angel Virasoro · 1987
Earlier work this paper cites.
Approximation by superpositions of a sigmoidal function
George Cybenko · 1989
Earlier work this paper cites.
Three unfinished works on the optimal storage capacity of networks
Elizabeth Gardner and Bernard Derrida · 1989
Earlier work this paper cites.
First-order transition to perfect generalization in a neural network with binary synapses
Géza Györgyi · 1990
Earlier work this paper cites.
Learning from examples in large neural networks
Haim Sompolinsky, Naftali Tishby, and H Sebastian Seung · 1990
Earlier work this paper cites.
Generalization performance of bayes optimal classification algorithm for learning a perceptron
Opper and Haussler · 1991
Earlier work this paper cites.
Statistical mechanics of learning from examples
Hyunjune Sebastian Seung, Haim Sompolinsky, and Naftali Tishby · 1992
Earlier work this paper cites.
Learning a rule in a multilayer neural network
Henry Schwarze · 1993
Earlier work this paper cites.
Free convolution and the random sum of matrices
Roland Speicher · 1993
Earlier work this paper cites.
The statistical mechanics of learning a rule
Timothy LH Watkin, Albrecht Rau, and Michael Biehl · 1993
Earlier work this paper cites.
Analysis of the limiting spectral distribution of large dimensional random matrices
Jack W Silverstein and Sang-Il Choi · 1995
Earlier work this paper cites.
High-dimensional data analysis: The curses and blessings of dimensionality
David L Donoho · 2000
Earlier work this paper cites.
Statistical mechanics of learning
Andreas Engel · 2001
Earlier work this paper cites.
Large deviations asymptotics for spherical integrals
Alice Guionnet and Ofer Zeitouni · 2002
Earlier work this paper cites.
Random matrix theory and wireless communications
Antonia M Tulino and Sergio Verdú · 2004
Earlier work this paper cites.
Mutual information and minimum mean-square error in gaussian channels
Dongning Guo, Shlomo Shamai, and Sergio Verdú · 2005
Earlier work this paper cites.
Message-passing algorithms for compressed sensing
David L Donoho, Arian Maleki, and Andrea Montanari · 2009
Earlier work this paper cites.
Information, physics, and computation
Marc Mezard and Andrea Montanari · 2009
Earlier work this paper cites.
An introduction to random matrices
Greg W Anderson, Alice Guionnet, and Ofer Zeitouni · 2010
Earlier work this paper cites.
The eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices
Florent Benaych-Georges and Raj Rao Nadakuditi · 2011
Earlier work this paper cites.
Generalized approximate message passing for estimation with random linear mixing
Sundeep Rangan · 2011
Earlier work this paper cites.
Optimization and dynamical systems
Uwe Helmke and John B Moore · 2012
Earlier work this paper cites.
Phaselift: Exact and stable signal recovery from magnitude measurements via convex programming
Emmanuel J Candes, Thomas Strohmer, and Vladislav Voroninski · 2013
Earlier work this paper cites.
State evolution for general approximate message passing algorithms, with applications to spatial coupling
Adel Javanmard and Andrea Montanari · 2013
Earlier work this paper cites.
Solving quadratic equations via phaselift when there are about as many equations as unknowns
Emmanuel J Candès and Xiaodong Li · 2014
Cited alongside, same era.
Stable optimizationless recovery from phaseless linear measurements
Laurent Demanet and Paul Hand · 2014
Cited alongside, same era.
Solving random quadratic systems of equations is nearly as easy as solving linear systems
Yuxin Chen and Emmanuel Candes · 2015
Cited alongside, same era.
The mutual information in random linear estimation
Jean Barbier, Mohamad Dia, Nicolas Macris, and Florent Krzakala · 2016
Cited alongside, same era.
Rotational invariant estimator for general noisy matrices
Joël Bun, Romain Allez, Jean-Philippe Bouchaud, and Marc Potters · 2016
Cited alongside, same era.
Tracy-widom distribution for the largest eigenvalue of real sample covariance matrices with general population
Online stochastic gradient descent on non-convex losses from high-dimensional inference
Gérard Ben Arous, Reza Gheissari, and Aukosh Jagannath · 2021
Later among the works it cites.
Stochasticity helps to navigate rough landscapes: comparing gradient-descent-based algorithms in the phase retrieval problem
Francesca Mignacco, Pierfrancesco Urbani, and Lenka Zdeborová · 2021
Later among the works it cites.
On the cryptographic hardness of learning single periodic neurons
Min Jae Song, Ilias Zadik, and Joan Bruna · 2021
Later among the works it cites.
Small random initialization is akin to spectral learning: Optimization and generalization guarantees for overparametrized low-rank matrix reconstruction
Dominik Stöger and Mahdi Soltanolkotabi · 2021
Later among the works it cites.
Solving phase retrieval with random initial guess is nearly as good as by spectral initialization
Jian-Feng Cai, Meng Huang, Dong Li, and Yang Wang · 2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Ji Oon Lee and Kevin Schnelli · 2016
Cited alongside, same era.
Statistical physics of inference: Thresholds and algorithms
Lenka Zdeborová and Florent Krzakala · 2016
Cited alongside, same era.
Implicit regularization in matrix factorization
Suriya Gunasekar, Blake E Woodworth, Srinadh Bhojanapalli, Behnam Neyshabur, and Nati Srebro · 2017
Cited alongside, same era.
Statistical and computational phase transitions in spiked tensor estimation
Thibault Lesieur, Léo Miolane, Marc Lelarge, Florent Krzakala, and Lenka Zdeborová · 2017
Cited alongside, same era.
On the power of over-parametrization in neural networks with quadratic activation
Simon Du and Jason Lee · 2018
Cited alongside, same era.
Phase retrieval under a generative prior
Paul Hand, Oscar Leong, and Vlad Voroninski · 2018
Cited alongside, same era.
Theoretical insights into the optimization landscape of over-parameterized shallow neural networks
Mahdi Soltanolkotabi, Adel Javanmard, and Jason D Lee · 2018
Cited alongside, same era.
Disordered systems insights on computational hardness
David Gamarnik, Cristopher Moore, and Lenka Zdeborová · 2022
Later among the works it cites.
Universality laws for high-dimensional learning with random features
Hong Hu and Yue M Lu · 2022
Later among the works it cites.
Perturbative construction of mean-field equations in extensive-rank matrix factorization and denoising
Antoine Maillard, Florent Krzakala, Marc Mézard, and Lenka Zdeborová · 2022
Later among the works it cites.
Universality of empirical risk minimization
Andrea Montanari and Basil N Saeed · 2022
Later among the works it cites.
Sgd learning on neural networks: leap complexity and saddle-to-saddle dynamics
Emmanuel Abbe, Enric Boix Adsera, and Theodor Misiakiewicz · 2023
Later among the works it cites.
On learning gaussian multi-index models with gradient flow
Alberto Bietti, Joan Bruna, and Loucas Pillaud-Vivien · 2023
Later among the works it cites.
Matrix factorization with neural networks
Francesco Camilli and Marc Mézard · 2023
Later among the works it cites.
Spin Glass Theory and Far Beyond: Replica Symmetry Breaking after 40 Years
Patrick Charbonneau, Enzo Marinari, Giorgio Parisi, Federico Ricci-tersenghi, Gabriele Sicuro, Francesco Zamponi, and Marc Mezard · 2023
Later among the works it cites.
Hitting the high-dimensional notes: An ode for sgd learning dynamics on glms and multi-index models
Elizabeth Collins-Woodfin, Courtney Paquette, Elliot Paquette, and Inbar Seroussi · 2023
Later among the works it cites.
Bayes-optimal learning of deep random networks of extensive-width
Hugo Cui, Florent Krzakala, and Lenka Zdeborova · 2023
Later among the works it cites.
Phase retrieval: From computational imaging to machine learning: A tutorial
Jonathan Dong, Lorenzo Valzania, Antoine Maillard, Thanh-an Pham, Sylvain Gigan, and Michael Unser · 2023
Later among the works it cites.
Graph-based approximate message passing iterations
Cédric Gerbelot and Raphaël Berthier · 2023
Later among the works it cites.
Exact threshold for approximate ellipsoid fitting of random points
Antoine Maillard and Afonso S Bandeira · 2023
Later among the works it cites.
Injectivity of relu networks: perspectives from statistical physics
Antoine Maillard, Afonso S Bandeira, David Belius, Ivan Dokmanić, and Shuta Nakajima · 2023
Later among the works it cites.
The decimation scheme for symmetric matrix factorization
Francesco Camilli and Marc Mézard · 2024
Closest in time.
The computational complexity of learning gaussian single-index models
Alex Damian, Loucas Pillaud-Vivien, Jason D Lee, and Joan Bruna · 2024
Closest in time.
Universality laws for gaussian mixtures in generalized linear models
Yatin Dandi, Ludovic Stephan, Florent Krzakala, Bruno Loureiro, and Lenka Zdeborová · 2024
Closest in time.
Fitting an ellipsoid to random points: predictions using the replica method
Antoine Maillard and Dmitriy Kunisky · 2024
Closest in time.
Numerical code used for experimental results
Antoine Maillard, Emanuele Troiani, Simon Martin, Florent Krzakala, and Zdeborová Lenka · 2024
Closest in time.
On the impact of overparameterization on the training of a shallow neural network in high dimensions
Simon Martin, Francis Bach, and Giulio Biroli · 2024
Closest in time.
A friendly tutorial on mean-field spin glass techniques for non-physicists
Andrea Montanari and Subhabrata Sen · 2024
Closest in time.
Matrix inference in growing rank regimes
Farzad Pourkamali, Jean Barbier, and Nicolas Macris · 2024
Closest in time.
Matrix denoising: Bayes-optimal estimators via low-degree polynomials
Guilhem Semerjian · 2024
Closest in time.