Fetching the paper…
Reading the bibliography…
We address the structure identification and the uniform approximation of two fully nonlinear layer neural networks of the type $f(x)=1^T h(B^T g(A^T x))$ on $\mathbb R^d$ from a small number of query samples.
P. Grohs, D. Perekrestenko, D. Elbraechter, H. Boelcskei,
1901
Earlier work this paper cites.
S. Mei, T. Misiakiewicz, A. Montanari,
1902
Earlier work this paper cites.
Perturbation theory of eigenvalue problems
F. Rellich and J. Berkowitz · 1969
Earlier work this paper cites.
P.-A. Wedin,
1972
Earlier work this paper cites.
C. Stein,
1981
Earlier work this paper cites.
L. Devroye and L. Györfi, Nonparametric Density Estimation, Wiley Series in Probability and Mathematical Statistics: Tracts on Probability and Statistics, John Wiley
1985
Earlier work this paper cites.
On differentiating eigenvalues and eigenvectors
J. R Magnus · 1985
Earlier work this paper cites.
J. Håstad,
1990
Earlier work this paper cites.
J. S. Judd, Neural network design and the complexity of learning, MIT press, 1990
1990
Earlier work this paper cites.
G. W. Stewart,
1991
Earlier work this paper cites.
A. L. Blum and R. L. Rivest,
1992
Earlier work this paper cites.
H. Ichimura
1993
Earlier work this paper cites.
W. Light,
1993
Earlier work this paper cites.
C. Fefferman,
1994
Earlier work this paper cites.
Weak convergence and empirical processes
A. W. van der Vaart and J. A. Wellner · 1996
Earlier work this paper cites.
Springer Science & Business Media, 1997
R. Bhatia. Matrix analysis, volume 169 · 1997
Earlier work this paper cites.
R. DeVore, K. Oskolkov, and P. Petrushev,
1997
Earlier work this paper cites.
A. Pinkus,
1997
Earlier work this paper cites.
Neural Network Learning: Theoretical Foundations
M. Anthony and P. Bartlett · 1999
Earlier work this paper cites.
P. P. Petrushev,
1999
Earlier work this paper cites.
A. Pinkus,
1999
Earlier work this paper cites.
M. Hristache, A. Juditsky, and V. Spokoiny
2001
Cited alongside, same era.
Greed is good: Algorithmic results for sparse approximation
J. A. Tropp · 2004
Cited alongside, same era.
Y. Bengio, P. Lamblin, D. Popovici, and H. Larochelle,
2006
Cited alongside, same era.
M. Rudelson and R. Vershynin,
2007
Cited alongside, same era.
P. G. Casazza and N. Leonhard,
2008
Cited alongside, same era.
Vi. De Silva and L.-H. Lim,
2008
Cited alongside, same era.
S. Shalev-Shwartz and S. Ben-David. Understanding machine learning: From theory to algorithms. Cambridge University Press, 2014
2014
Later among the works it cites.
P. Constantine, Active Subspaces: Emerging Ideas for Dimension Reduction in Parameter Studies, SIAM Spotlights 2., Society for Industrial and Applied Mathematics (SIAM), Philadelphia, 2015
2015
Later among the works it cites.
Beating the Perils of Non-Convexity: Guaranteed Training of Neural Networks using Tensor Methods
M. Janzamin, H. Sedghi, and A. Anandkumar, · 2015
Later among the works it cites.
2015
Later among the works it cites.
S. Mayer, T. Ullrich, and J. Vybíral,
2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Gittens and J. A. Tropp · 2011
Cited alongside, same era.
D.C. Ciresan, U. Meier, J. Masci, and J. Schmidhuber,
2012
Cited alongside, same era.
Capturing ridge functions in high dimensions from point queries
A. Cohen, I. Daubechies, R. DeVore, g. Kerkyacharian, and D. Picard · 2012
Cited alongside, same era.
Learning functions of few arbitrary linear parameters in high dimensions
M. Fornasier, K. Schnass, and J. Vybíral · 2012
Cited alongside, same era.
A. Krizhevsky, I. Sutskever, and G. E. Hinton,
2012
Cited alongside, same era.
J. Stallkamp, M. Schlipsing, J. Salmen, and C. Igel,
2012
Cited alongside, same era.
U. Shaham, A. Cloninger, and R. R. Coifman
2015
Later among the works it cites.
K. Kawaguchi,
2016
Later among the works it cites.
Q. Qu, J. Sun, and J.Wright,
2016
Later among the works it cites.
D. Silver, A. Huang, C. J. Maddison, A. Guez, L. Sifre, G. Van Den Driessche, J. Schrittwieser et al.,
2016
Later among the works it cites.
I. Sturm, S. Lapuschkin, W. Samek, and K.-R. Müller,
2016
Later among the works it cites.
J. J. Benedetto and M. Fickus,
2017
Later among the works it cites.
N. Carlini and D. Wagner,
2017
Later among the works it cites.
M. Moravčík, M. Schmid, N. Burch, V. Lisý, D. Morrill, N. Bard, T. Davis, K. Waugh, M. Johanson, and M. Bowling,
2017
Later among the works it cites.
Finding a low-rank basis in a matrix subspace
Y. Nakatsukasa, T. Soma, and A. Uschmajew, · 2017
Later among the works it cites.
N. Golowich, A. Rakhlin, O. Shamir,
2018
Later among the works it cites.
On the connection between learning two-layers neural networks and tensor decomposition
M. Mondelli and A. Montanari, · 2018
Later among the works it cites.
G. M. Rotskoff, E. Vanden-Eijnden,
2018
Later among the works it cites.
High-dimensional probability, volume 47 of
R. Vershynin · 2018
Later among the works it cites.
T. Wiatowski, P. Grohs, and H. Boelcskei
2018
Later among the works it cites.
Robust and resource efficient identification of shallow neural networks by fewest samples
M. Fornasier, J. Vybíral, and I. Daubechies · 2019
Closest in time.