Fetching the paper…
Reading the bibliography…
The autoencoder is an effective unsupervised learning model which is widely used in deep learning.
C. Eckardt and G. Young, “The approximation of one matrix by another of lower rank,” Psychometrika , vol. 1, pp. 211–218, 1936
1936
Earlier work this paper cites.
H. Bourlard and Y. Kamp, “Auto-association by multilayer perceptrons and singular value decomposition,” Biological Cybernetics , vol. 59(4-5), pp. 291–294, 1988
1988
Earlier work this paper cites.
P. Baldi and K. Hornik, “Neural networks and principal component analysis: Learning from examples without local minima,” Neural Networks , vol. 2(1), pp. 53–58, 1989
1989
Earlier work this paper cites.
E. Oja, “Neural networks, principal components, and subspaces,” International Journal of Neural Systems , vol. 1(01), pp. 61–68, 1989
1989
Earlier work this paper cites.
J. Rubner and P. Tavan, “A self-organizing network for principal-component analysis,” EPL (Europhysics Letters) , vol. 10(7), p. 693, 1989
1989
Earlier work this paper cites.
S. Kung and K. Diamantaras, “A neural network learning algorithm for adaptive principal component extraction (APEX),” ICASSP , pp. 861–864, 1990
1990
Earlier work this paper cites.
E. Oja, “Principal components, minor components, and linear neural networks,” Neural Networks , vol. 5(6), pp. 927–935, 1992
1992
Cited alongside, same era.
L. Xu, “Least mean square error reconstruction principle for self-organizing neural-nets,” Neural Networks , vol. 6(5), pp. 627–648, 1993
1993
Cited alongside, same era.
N. Kambhatla and T. Leen, “Dimension reduction by local principal component analysis,” Neural Computation , vol. 9(7), pp. 1493–1516, 1997
1997
Cited alongside, same era.
A. Antoulas, “Approximation of large-scale dynamical systems,” SIAM , vol. 6, pp. 37–38, 2005
2005
Cited alongside, same era.
G. Hinton and R. Salakhutdinov, “Reducing the dimensionality of data with neural networks,” Science , vol. 313(5786), pp. 504–507, 2006
2006
Cited alongside, same era.
D. A. Freedman, “Statistical models: Theory and practice.” Cambridge University Press , 2009
2009
Later among the works it cites.
Y. LeCun, C. Cortes, and C. Burges, “MNIST handwritten digit database,” 2010
2010
Later among the works it cites.
C. Wah, S. Branson, P. Welinder, P. Perona, and S. Belongie, “The Caltech-UCSD birds-200-2011 dataset,” no. CNS-TR-2011-001, 2011
2011
Later among the works it cites.
J. Fend, H. Xu, S. Mannor, and S. Yan, “Online PCA for contaminated data,” Advances in Neural Information Processing Systems , pp. 764–772, 2013
2013
Later among the works it cites.
J. Fend, H. Xu, and S. Yan, “Online robust PCA via stochastic optimization,” Advances in Neural Information Processing Systems , pp. 404–412, 2013
2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Warmuth and D. Kuzmin, “Randomized online PCA algorithms with regret bounds that are logarithmic in the dimension,” Journal of Machine Learning Research , vol. 9, pp. 2287–2320, 2008
2008
Cited alongside, same era.