For a linear output , the second term limits the growth produced by the Hebbian term. On the averaged dynamics with , . For , positive-eigenvalue equilibria have norm and align with eigenvectors of . If inputs are centered, is their covariance matrix.
At the equilibrium , linearization along orthonormal eigenvectors of gives the displayed rates, with the first equation applying to . A simple positive largest eigenvalue makes its two normalized eigenvectors locally asymptotically stable; smaller eigenvalues have an unstable direction. Repeated largest eigenvalues give a manifold of equilibria with neutral directions. Generic convergence also needs a nonzero initial component in the largest eigenspace. The squared norm satisfies .
Articles by others on the same topic
Oja's rule is an unsupervised learning algorithm used in the field of neural networks and machine learning, particularly in the context of learning vector representations. It is a type of Hebbian learning rule, which is based on the principle that neurons that fire together, wire together. Oja's rule is specifically designed to allow a neural network to learn the principal components of the input data, effectively performing a form of principal component analysis (PCA).