Convergence analysis of online algorithms for vector-valued kernel regression

We consider the problem of approximating the regression function fμ:, Omega → Y from noisy μ-distributed vector-valued data (ωm,ym)∈Omega× Y by an online learning algorithm using a reproducing kernel Hilbert space H (RKHS) as prior. In an online algorithm, i.i.d. samples become available one by one via a random process and are successively processed to build approximations to the regression function. Assuming that the regression function essentially belongs to H (soft learning scenario), we provide estimates for the expected squared error in the RKHS norm of the approximations f(m)∈ H obtained by a standard regularized online approximation algorithm. In particular, we show an order-optimal estimate mathbbE(|ε(m)|H2)≤ C (m+1)-s/(2+s),qquad m=1,2,ldots, where ε(m) denotes the error term after m processed data, the parameter 0<s≤ 1 expresses an additional smoothness assumption on the regression function, and the constant C depends on the variance of the input noise, the smoothness of the regression function, and other parameters of the algorithm. The proof, which is inspired by results on Schwarz iterative methods in the noiseless case, uses only elementary Hilbert space techniques and minimal assumptions on the noise, the feature map that defines H and the associated covariance operator.