Self-Averaging and On-line Learning
classification
❄️ cond-mat.dis-nn
cond-mat.stat-mech
keywords
constraintlearningon-lineself-averagingstochasticabsenceaverageconditions
read the original abstract
Conditions are given under which one may prove that the stochastic dynamics of on-line learning can be described by the deterministic evolution of a finite set of order parameters in the thermodynamic limit. A global constraint on the average magnitude of the increments in the stochastic process is necessary to ensure self-averaging. In the absence of such a constraint, convergence may only be in probability.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.