A Stochastic Gradient Descent Theorem and the Back-Propagation Algorithm
Hao Wu

TL;DR
This paper proves a convergence theorem for a specific stochastic gradient descent method, providing theoretical foundations for a convergent version of the back-propagation algorithm used in training neural networks.
Contribution
It introduces a new convergence theorem for stochastic gradient descent, enhancing the theoretical understanding of back-propagation algorithms.
Findings
Proves convergence of a stochastic gradient descent variant.
Provides theoretical validation for back-propagation.
Lays groundwork for more reliable neural network training methods.
Abstract
We establish a convergence theorem for a certain type of stochastic gradient descent, which leads to a convergent variant of the back-propagation algorithm
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic Gradient Optimization Techniques · Sparse and Compressive Sensing Techniques · Markov Chains and Monte Carlo Methods
