Deterministic convergence of an online gradient method for neural networks
From MaRDI portal
Publication:1612376
DOI10.1016/S0377-0427(01)00571-4zbMath1066.68111OpenAlexW1967687609MaRDI QIDQ1612376
Publication date: 22 August 2002
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-0427(01)00571-4
Related Items (8)
Dynamical properties of a perceptron learning process: structural stability under numerics and shadowing ⋮ Shadowing property in analysis of neural networks dynamics. ⋮ Convergence of an online gradient method for feedforward neural networks with stochastic inputs. ⋮ Convergence of online gradient methods for continuous perceptrons with linearly separable training patterns ⋮ Convergence analysis of online gradient method for BP neural networks ⋮ Convergence analyses on sparse feedforward neural networks via group lasso regularization ⋮ An online gradient method with momentum for two-layer feedforward neural networks ⋮ Interpolation by ridge polynomials and its application in neural networks
Cites Work
This page was built for publication: Deterministic convergence of an online gradient method for neural networks
