On the optimality of the Oja’s algorithm for online PCA
Author:
- 30 March 2023
- journal article
- research article
- Published by Springer Nature in Statistics and Computing
- Vol. 33 (3) , 1-11
Abstract
No abstract availableKeywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Near-optimal stochastic approximation for online principal component estimationMathematical Programming, 2017
- Minimax sparse principal subspace estimation in high dimensionsThe Annals of Statistics, 2013
- Introduction to the non-asymptotic analysis of random matrices2012
- Orthogonal Oja algorithmIEEE Signal Processing Letters, 2000
- Matrix Analysis1985
- On stochastic approximation of the eigenvectors and eigenvalues of the expectation of a random matrixJournal of Mathematical Analysis and Applications, 1985
- Simplified neuron model as a principal component analyzerJournal of Mathematical Biology, 1982
- Numerical methods for computing angles between linear subspacesMathematics of Computation, 1973
- Analysis of a complex of statistical variables into principal components.Journal of Educational Psychology, 1933
- LIII. On lines and planes of closest fit to systems of points in spaceJournal of Computers in Education, 1901