Learning with Incremental Iterative Regularization
| 
61 | 
39 | 
0
Abstract
Within a statistical learning setting, we propose and study an iterative regularization algorithm for least squares defined by an incremental gradient method. In particular, we show that, if all other parameters are fixed a priori, the number of passes over the data (epochs) acts as a regularization parameter, and prove strong universal consistency, i.e. almost sure convergence of the risk, as well as sharp finite sample bounds for the iterates. Our results are a step towards understanding the effect of multiple epochs in stochastic gradient techniques in machine learning and rely on integrating statistical and optimization results.
还没有评论，说两句吧！
热门资源
Learning to learn...
The move from hand-designed features to learned...
A Mathematical Mo...
Direct democracy, where each voter casts one vo...
Stratified Strate...
In this paper we introduce Stratified Strategy ...
Rating-Boosted La...
The performance of a recommendation system reli...
Hierarchical Task...
We extend hierarchical task network planning wi...
智能在线
400-630-6780
聆听.建议反馈
E-mail: support@tusaishared.com
资源分类
