The convergence of online learning algorithms is analyzed using the tools of the stochastic approximation theory, and proved under very weak conditions. A general framework for online learning algorithms is first presented. This framework encompasses the most common online learning algorithms in use today, as illustrated by several examples. The stochastic approximation theory then provides general results describing the convergence of all these learning algorithms at once.
CITATION STYLE
Benveniste, A., Métivier, M., & Priouret, P. (1990). Adaptive Algorithms and Stochastic Approximations. Adaptive Algorithms and Stochastic Approximations. Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-75894-2
Mendeley helps you to discover research relevant for your work.