On stochastic approximation of the eigenvectors and eigenvalues of the expectation of a random matrix
From MaRDI portal
(Redirected from Publication:1069252)
Recommendations
Cites work
- scientific article; zbMATH DE number 3136275 (Why is no real title available?)
- scientific article; zbMATH DE number 3459735 (Why is no real title available?)
- scientific article; zbMATH DE number 3560401 (Why is no real title available?)
- scientific article; zbMATH DE number 3451330 (Why is no real title available?)
- scientific article; zbMATH DE number 3297399 (Why is no real title available?)
- scientific article; zbMATH DE number 3340880 (Why is no real title available?)
- scientific article; zbMATH DE number 3085434 (Why is no real title available?)
- An analysis of convergence for a learning version of the subspace method
- Computational aspects of F. L. Bauer's simultaneous iteration method
- Method of stochastic approximation in the determination of the largest eigenvalue of the mathematical expectation of random matrices
- On the generalized Karhunen-Loeve expansion (Corresp.)
- Stochastic approximation methods for constrained and unconstrained systems
Cited in
(72)- Approximation of some moments in eigenvalue problem including some random variables and its application
- On principal subspace analysis
- Incremental modelling for compositional data streams
- Streaming principal component analysis from incomplete data
- Neural networks for computing eigenvalues and eigenvectors
- Past, current and future trends and challenges in non-deterministic fracture mechanics: a review
- Convergence analysis of Oja's iteration for solving online PCA with nonzero-mean samples
- Differential equations in Schatten classes of operators
- scientific article; zbMATH DE number 4101379 (Why is no real title available?)
- DESIGNING RELEVANT FEATURES FOR CONTINUOUS DATA SETS USING ICA
- Analyzing iterations in identification with application to nonparametric \(\mathcal H_{\infty}\)-norm estimation
- Online Principal Component Analysis in High Dimension: Which Algorithm to Choose?
- Computational intelligence: From mathematical point of view
- Widening the scope of an eigenvector stochastic approximation process and application to streaming PCA and related methods
- An adaptive constraint method for paraunitary filter banks with applications to spatiotemporal subspace tracking
- scientific article; zbMATH DE number 4155705 (Why is no real title available?)
- Global analysis of planar neural networks
- Nonlinear differential equations in \({\mathcal{B}(\mathcal{H})}\) motivated by learning models
- Recursive estimation for ordered eigenvectors of symmetric matrix with observation noise
- Adaptive algorithms for first principal eigenvector computation
- Eigenmeasures and stochastic diagonalization of bilinear maps
- scientific article; zbMATH DE number 17451 (Why is no real title available?)
- Hebbian errors in learning: an analysis using the Oja model
- Majorization, doubly stochastic matrices, and comparison of eigenvalues
- Incremental slow feature analysis: adaptive low-complexity slow feature updating from high-dimensional input streams
- Influence of stochastic geometric imperfections on the load-carrying behaviour of thin-walled structures using constrained random fields
- Differential equations in spaces of compact operators
- Neural networks based approach for computing eigenvectors and eigenvalues of symmetric matrix
- scientific article; zbMATH DE number 1036075 (Why is no real title available?)
- On the organization of grid and place cells: neural denoising via subspace learning
- Online sufficient dimension reduction through sliced inverse regression
- Convergence analysis of Chauvin's PCA learning algorithm with a constant learning rate
- Stability and chaos of LMSER PCA learning algorithm
- Global convergence of a PCA learning algorithm with a constant learning rate
- Unsupervised streaming anomaly detection for instrumented infrastructure
- Hybrid uncertain natural frequency analysis for structures with random and interval fields
- Online sparse sliced inverse regression for high-dimensional streaming data
- A brief introduction to manifold optimization
- scientific article; zbMATH DE number 7370623 (Why is no real title available?)
- Object recognition using a neural network with optimal feature extraction.
- Neurodynamics and nonlinear integrable systems of Lax type
- Analysis of a stochastic approximation algorithm for computing quasi-stationary distributions
- Adaptive multiple minor directions extraction in parallel using a PCA neural network
- Robust frequent directions with application in online learning
- Another neural network based approach for computing eigenvalues and eigenvectors of real skew-symmetric matrices
- Stochastic models in artificial intelligence development
- Distributed user profiling via spectral methods
- On stochastic majorization of the eigenvalues of a Wishart matrix
- A dual purpose principal and minor component flow
- A note on linear function approximation using random projections
- A learning rule with generalized Hebbian synapses
- A simplified neuron model as a principal component analyzer
- Convergence rate of Krasulina estimator
- The scaling limit of high-dimensional online independent component analysis
- Convergence proof of matrix dynamics for online linear discriminant analysis
- On the optimality of the Oja's algorithm for online PCA
- Stability behavior for unsupervised learning
- The method of averaged models for discrete-time adaptive systems
- Nearly optimal stochastic approximation for online principal subspace estimation
- A Hebbian/Anti-Hebbian Neural Network for Linear Subspace Learning: A Derivation from Multidimensional Scaling of Streaming Data
- Oja's algorithm for graph clustering, Markov spectral decomposition, and risk sensitive control
- Global convergence of Oja's PCA learning algorithm with a non-zero-approaching adaptive learning rate
- AgFlow: fast model selection of penalized PCA via implicit regularization effects of gradient flow
- Robust learning in a partial least-squares neural network
- Some Approximation Formula for Stochastic Eigenvalues
- Dual randomized coordinate descent method for solving a class of nonconvex problems
- Discriminative Bayesian filtering lends momentum to the stochastic Newton method for minimizing log-convex functions
- Input Statistics and Hebbian Cross-Talk Effects
- Convergence of solutions to equations arising in neural networks
- A simple numerical method based simultaneous stochastic perturbation for estimation of high dimensional matrices
- Near-optimal stochastic approximation for online principal component estimation
- Learning Visual Spatial Pooling by Strong PCA Dimension Reduction
This page was built for publication: On stochastic approximation of the eigenvectors and eigenvalues of the expectation of a random matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1069252)
