Sharper Bounds for Regularized Data Fitting

We study matrix sketching methods for regularized variants of linear regression, low rank approximation, and canonical correlation analysis. Our main focus is on sketching techniques which preserve the objective function value for regularized problems, which is an area that has remained largely unexplored. We study regularization both in a fairly broad setting, and in the specific context of the popular and widely used technique of ridge regularization; for the latter, as applied to each of these problems, we show algorithmic resource bounds in which the em statistical dimension appears in places where in previous bounds the rank would appear. The statistical dimension is always smaller than the rank, and decreases as the amount of regularization increases. In particular, for the ridge low-rank approximation problem minY,X lVert YX - A rVertF2 + λ lVert YrVertF2 + λlVert X rVertF2, where Y∈ℝn× k and X∈ℝk× d, we give an approximation algorithm needing [ O(mathttnnz(A)) + tildeO((n+d)varepsilon-1k mink, varepsilon-1mathttsdλ(Y^*))+ mathttpoly(mathttsdλ(Y^*) varepsilon-1) ] time, where sλ(Y^*)≤ k is the statistical dimension of Y^*, Y^* is an optimal Y, varepsilon is an error parameter, and mathttnnz(A) is the number of nonzero entries of A.This is faster than prior work, even when λ=0. We also study regularization in a much more general setting. For example, we obtain sketching-based algorithms for the low-rank approximation problem minX,Y lVert YX - A rVertF2 + f(Y,X) where f(·,·) is a regularizing function satisfying some very general conditions (chiefly, invariance under orthogonal transformations).