In this paper, we consider unregularized online learning algorithms in a Reproducing Kernel Hilbert Spaces (RKHS). Firstly, we derive explicit convergence rates of the unregularized online learning algorithms for classification associated with a general α-activating loss (see Definition 1 below). Our results extend and refine the results in [30] for the least-square loss and the recent result [3] for the loss function with a Lipschitzcontinuous gradient. Moreover, we establish a very general condition on the step sizes which guarantees the convergence of the last iterate of such algorithms. Secondly, we establish, for the first time, the convergence of the unregularized pairwise learning algorithm with a general loss function and derive explicit rates under the assumption of polynomially decaying step sizes. Concrete examples are used to illustrate our main results. The main techniques are tools from convex analysis, refined inequalities of Gaussian averages [5] , and an induction approach.
Recently, a general condition on the step sizes as (2.3) was established for the convergence of the algorithm (1.1), in the sense lim t→∞ A t = 0, with loss functions satisfying Assumption 1 REF .
Unregularized Online Learning Algorithms with General Loss Functions
ArXiv
ArXiv
Mathematics Computer Science