On the optimality of the Oja's algorithm for online PCA (Q6172918): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W4361029344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Methods for Computing Angles Between Linear Subspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal stochastic approximation for online principal component estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly optimal stochastic approximation for online principal subspace estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified neuron model as a principal component analyzer / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stochastic approximation of the eigenvectors and eigenvalues of the expectation of a random matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak convergence and empirical processes. With applications to statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax sparse principal subspace estimation in high dimensions / rank
 
Normal rank

Latest revision as of 18:48, 1 August 2024

scientific article; zbMATH DE number 7714825
Language Label Description Also known as
English
On the optimality of the Oja's algorithm for online PCA
scientific article; zbMATH DE number 7714825

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references