Fetching the paper…
Reading the bibliography…
Stochastic gradient descent (SGD) is a popular algorithm for optimization problems arising in high-dimensional inference tasks.
A stochastic approximation method
H. Robbins and S. Monro · 1951
Earlier work this paper cites.
The method of stochastic approximation for the determination of the least eigenvalue of a symmetrical matrix
T. Krasulina · 1969
Earlier work this paper cites.
On tail probabilities for martingales
D. A. Freedman · 1975
Earlier work this paper cites.
Functional and random central limit theorems for the robbins-munro process
D. L. McLeish · 1976
Earlier work this paper cites.
Analysis of recursive stochastic algorithms
L. Ljung · 1977
Earlier work this paper cites.
On stochastic approximation of the eigenvectors and eigenvalues of the expectation of a random matrix
E. Oja and J. Karhunen · 1985
Earlier work this paper cites.
Generalized Linear Models, Second Edition
P. McCullagh and J. Nelder · 1989
Earlier work this paper cites.
Adaptive algorithms and stochastic approximations
A. Benveniste, M. Métivier, and P. Priouret · 1990
Earlier work this paper cites.
Probability in Banach spaces
M. Ledoux and M. Talagrand · 1991
Earlier work this paper cites.
Online learning versus offline learning
S. Ben-David, E. Kushilevitz, and Y. Mansour · 1995
Earlier work this paper cites.
Algorithmes stochastiques
M. Duflo · 1996
Earlier work this paper cites.
Gradient-based learning applied to document recognition
Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner · 1998
Earlier work this paper cites.
Dynamics of stochastic approximation algorithms
M. Benaïm · 1999
Earlier work this paper cites.
On-Line Learning and Stochastic Approximations
L. Bottou · 1999
Earlier work this paper cites.
On the distribution of the largest eigenvalue in principal components analysis
I. M. Johnstone · 2001
Earlier work this paper cites.
Stochastic learning
L. Bottou · 2003
Earlier work this paper cites.
Large scale online learning
L. Bottou and Y. Le Cun · 2004
Earlier work this paper cites.
Pattern recognition and machine learning
C. M. Bishop · 2006
Earlier work this paper cites.
The largest eigenvalue of small rank perturbations of hermitian random matrices
S. Péché · 2006
Earlier work this paper cites.
The elements of statistical learning: data mining, inference, and prediction
T. Hastie, R. Tibshirani, and J. Friedman · 2009
Earlier work this paper cites.
Sharp thresholds for high-dimensional and noisy sparsity recovery using ℓ 1 \ell_{1} -constrained quadratic programming (Lasso)
M. J. Wainwright · 2009
Earlier work this paper cites.
An introduction to random matrices
G. W. Anderson, A. Guionnet, and O. Zeitouni · 2010
Earlier work this paper cites.
Efficiently learning mixtures of two gaussians
A. T. Kalai, A. Moitra, and G. Valiant · 2010
Earlier work this paper cites.
Stochastic gradient descent, weighted sampling, and the randomized kaczmarz algorithm
D. Needell, N. Srebro, and R. Ward · 2014
Earlier work this paper cites.
A statistical model for tensor pca
E. Richard and A. Montanari · 2014
Cited alongside, same era.
Near-optimal-sample estimators for spherical gaussian mixtures
A. T. Suresh, A. Orlitsky, J. Acharya, and A. Jafarpour · 2014
Cited alongside, same era.
Phase retrieval via Wirtinger flow: theory and algorithms
E. J. Candès, X. Li, and M. Soltanolkotabi · 2015
Cited alongside, same era.
Escaping from saddle points — online stochastic gradient for tensor decomposition
R. Ge, F. Huang, C. Jin, and Y. Yuan · 2015
Cited alongside, same era.
Tensor principal component analysis via sum-of-square proofs
S. B. Hopkins, J. Shi, and D. Steurer · 2015
Cited alongside, same era.
On the limitation of spectral methods: From the gaussian hidden clique problem to rank-one perturbations of gaussian tensors
A. Montanari, D. Reichman, and O. Zeitouni · 2015
A geometric analysis of phase retrieval
J. Sun, Q. Qu, and J. Wright · 2018
Later among the works it cites.
Phase retrieval via randomized Kaczmarz: theoretical guarantees
Y. S. Tan and R. Vershynin · 2018
Later among the works it cites.
Optimal errors and phase transitions in high-dimensional generalized linear models
J. Barbier, F. Krzakala, N. Macris, L. Miolane, and L. Zdeborová · 2019
Later among the works it cites.
The landscape of the spiked tensor model
G. Ben Arous, S. Mei, A. Montanari, and M. Nica · 2019
Later among the works it cites.
Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval
Y. Chen, Y. Chi, J. Fan, and C. Ma · 2019
Later among the works it cites.
Tight analyses for non-smooth stochastic gradient descent
N. J. A. Harvey, C. Liaw, Y. Plan, and S. Randhawa · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Deep learning
I. Goodfellow, Y. Bengio, and A. Courville · 2016
Cited alongside, same era.
Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors
S. B. Hopkins, T. Schramm, J. Shi, and D. Steurer · 2016
Cited alongside, same era.
Online ica: Understanding global dynamics of nonconvex optimization via diffusion processes
C. J. Li, Z. Wang, and H. Liu · 2016
Cited alongside, same era.
Online learning for sparse pca in high dimensions: Exact dynamics and phase transitions
C. Wang and Y. M. Lu · 2016
Cited alongside, same era.
Reshaped wirtinger flow for solving quadratic system of equations
H. Zhang and Y. Liang · 2016
Cited alongside, same era.
Convergence of the randomized kaczmarz method for phase retrieval
H. Jeong and C. S. Güntürk · 2017
Cited alongside, same era.
Later among the works it cites.
Optimal Spectral Initialization for Signal Recovery With Applications to Phase Retrieval
W. Luo, W. Alghamdi, and Y. M. Lu · 2019
Later among the works it cites.
Sampling can be faster than optimization
Y.-A. Ma, Y. Chen, C. Jin, N. Flammarion, and M. I. Jordan · 2019
Later among the works it cites.
Who is afraid of big bad minima? analysis of gradient-flow in spiked matrix-tensor models
S. S. Mannelli, G. Biroli, C. Cammarota, F. Krzakala, and L. Zdeborová · 2019
Later among the works it cites.
Passed & spurious: Descent algorithms and local minima in spiked matrix-tensor models
S. S. Mannelli, F. Krzakala, P. Urbani, and L. Zdeborova · 2019
Later among the works it cites.
Complex energy landscapes in spiked-tensor and simple glassy models: Ruggedness, arrangements of local minima, and phase transitions
V. Ros, G. Ben Arous, G. Biroli, and C. Cammarota · 2019
Later among the works it cites.
A modern maximum-likelihood theory for high-dimensional logistic regression
P. Sur and E. J. Candès · 2019
Later among the works it cites.
Y. S. Tan and R. Vershynin · 2019
Later among the works it cites.
High–Dimensional Probability
R. Vershynin · 2019
Later among the works it cites.
The kikuchi hierarchy and tensor pca
A. S. Wein, A. E. Alaoui, and C. Moore · 2019
Later among the works it cites.
Exact asymptotics for phase retrieval and compressed sensing with random generative priors
B. Aubin, B. Loureiro, A. Baker, F. Krzakala, and L. Zdeborová · 2020
Closest in time.
Algorithmic thresholds for tensor PCA
G. Ben Arous, R. Gheissari, and A. Jagannath · 2020
Closest in time.
Bounding flows for spherical spin glass dynamics
G. Ben Arous, R. Gheissari, and A. Jagannath · 2020
Closest in time.
How to iron out rough landscapes and get optimal performances: Averaged gradient descent and its application to tensor pca
G. Biroli, C. Cammarota, and F. Ricci-Tersenghi · 2020
Closest in time.
Stochastic gradient and Langevin processes
X. Cheng, D. Yin, P. Bartlett, and M. Jordan · 2020
Closest in time.
Bridging the gap between constant step size stochastic gradient descent and markov chains
A. Dieuleveut, A. Durmus, and F. Bach · 2020
Closest in time.
Statistical thresholds for tensor PCA
A. Jagannath, P. Lopatto, and L. Miolane · 2020
Closest in time.
Landscape complexity for the empirical risk of generalized linear models
A. Maillard, G. Ben Arous, and G. Biroli · 2020
Closest in time.
Marvels and pitfalls of the langevin algorithm in noisy high-dimensional inference
S. S. Mannelli, G. Biroli, C. Cammarota, F. Krzakala, P. Urbani, and L. Zdeborová · 2020
Closest in time.