Adaptive Learning in a World of Projections

被引:168
作者
Theodoridis, Sergios
Slavakis, Konstantinos [1 ,2 ,3 ]
Yamada, Isao
机构
[1] TokyoTech, Tokyo, Japan
[2] Univ Athens, Dept Informat & Telecommun, GR-10679 Athens, Greece
[3] Univ Peloponnese, Dept Telecommun Sci & Technol, Tripolis, Greece
关键词
Training data; Training; Optimization; Signal processing algorithms; Array signal processing; Estimation; Least squares approximation; SUPPORT VECTOR MACHINES; STEEPEST DESCENT METHOD; FIXED-POINT SET; SUBGRADIENT METHOD; NONEXPANSIVE-MAPPINGS; HILBERT-SPACES; ALGORITHM; MINIMIZATION; SYSTEMS; SIGNAL;
D O I
10.1109/MSP.2010.938752
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This article presents a general tool for convexly constrained parameter/function estimation both for classification and regression tasks, in a time-adaptive setting and in (infinite dimensional) Reproducing Kernel Hilbert Spaces (RKHS). The mathematical framework is that of the set theoretic estimation formulation and the classical projections onto convex sets (POCS) theory. However, in contrast to the classical POCS methodology, which assumes a finite number of convex sets, our method builds upon our recent extension of the theory, which considers an infinite number of convex sets. Such a context is necessary to cope with the adaptive setting rationale, where data arrive sequentially. © 2010 IEEE.
引用
收藏
页码:97 / 123
页数:27
相关论文
共 80 条
[1]  
ALBERT A.E., 1967, STOCHASTIC APPROXIMA
[2]  
[Anonymous], 2003, Generalized Inverses. Theory and Applications, DOI [DOI 10.1007/B97366, 10.1007/b97366]
[3]  
[Anonymous], J IEICE
[4]  
[Anonymous], 1997, Parallel Optimization: Theory, Algorithms, and Applications
[5]   THEORY OF REPRODUCING KERNELS [J].
ARONSZAJN, N .
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1950, 68 (MAY) :337-404
[6]  
BAUSCHKE H, 1996, THESIS S FRASER U CA
[7]   A weak-to-strong convergence principle for Fejer-monotone methods in Hilbert spaces [J].
Bauschke, HH ;
Combettes, PL .
MATHEMATICS OF OPERATIONS RESEARCH, 2001, 26 (02) :248-264
[8]   Projection algorithms for solving convex feasibility problems [J].
Bauschke, HH ;
Borwein, JM .
SIAM REVIEW, 1996, 38 (03) :367-426
[9]  
Boyd S.P, 2004, Convex optimization, DOI [DOI 10.1017/CBO9780511804441, 10.1017/CBO9780511804441]
[10]  
Bregman L.M., 1965, Dokl. Akad. Nauk, V162, P688