A new concentration result for regularized risk minimizers

Abstract

We establish a new concentration result for regularized risk minimizers which is similar to an oracle inequality. Applying this inequality to regularized least squares minimizers like least squares support vector machines, we show that these algorithms learn with (almost) the optimal rate in some specific situations. In addition, for regression our results suggest that using the loss function $L_{\a}(y,t)=|y -t|^{\a}$ with $\a$ near $1$ may often be preferable to the usual choice of $\a=2$.