Online Learning Algorithms
Online Learning Algorithms
复制标题
DOI：
10.1007/s10208-004-0160-z
复制
发表时间：
2006-04
影响因子：
3
通讯作者：
S. Smale;Y. Yao
中科院分区：
文献类型：
--
作者：
S. Smale;Y. Yao
In this paper, we study an online learning algorithm in Reproducing Kernel Hilbert Spaces (RKHSs) and general Hilbert spaces. We present a general form of the stochastic gradient method to minimize a quadratic potential function by an independent identically distributed (i.i.d.) sample sequence, and show a probabilistic upper bound for its convergence.
