Online Learning as Stochastic Approximation of Regularization Paths: Optimality and Almost-Sure Convergence
Online Learning as Stochastic Approximation of Regularization Paths: Optimality and Almost-Sure Convergence
复制标题
DOI：
10.1109/tit.2014.2332531
复制
发表时间：
2011-03
影响因子：
2.5
通讯作者：
P. Tarres;Y. Yao
中科院分区：
文献类型：
--
作者：
P. Tarres;Y. Yao
In this paper, an online learning algorithm is proposed as sequential stochastic approximation of a regularization path converging to the regression function in reproducing kernel Hilbert spaces (RKHSs). We show that it is possible to produce the best known strong (RKHS norm) convergence rate of batch learning, through a careful choice of the gain or step size sequences, depending on regularity assumptions on the regression function. The corresponding weak (mean square distance) convergence rate is optimal in the sense that it reaches the minimax and individual lower rates in this paper. In both cases, we deduce almost sure convergence, using Bernstein-type inequalities for martingales in Hilbert spaces. To achieve this, we develop a bias-variance decomposition similar to the batch learning setting; the bias consists in the approximation and drift errors along the regularization path, which display the same rates of convergence, and the variance arises from the sample error analyzed as a (reverse) martingale difference sequence. The rates above are obtained by an optimal tradeoff between the bias and the variance.
