title: Online Pairwise Learning Algorithms.
abstract: Pairwise learning usually refers to a learning task that involves a loss function depending on pairs of examples, among which the most notable ones are bipartite ranking, metric learning, and AUC maximization. In this letter we study an online algorithm for pairwise learning with a least-square loss function in an unconstrained setting of a reproducing kernel Hilbert space (RKHS) that we refer to as the Online Pairwise lEaRning Algorithm (OPERA). In contrast to existing works (Kar, Sriperumbudur, Jain, & Karnick, 2013 ; Wang, Khardon, Pechyony, & Jones, 2012 ), which require that the iterates are restricted to a bounded domain or the loss function is strongly convex, OPERA is associated with a non-strongly convex objective function and learns the target function in an unconstrained RKHS. Specifically, we establish a general theorem that guarantees the almost sure convergence for the last iterate of OPERA without any assumptions on the underlying distribution. Explicit convergence rates are derived under the condition of polynomially decaying step sizes. We also establish an interesting property for a family of widely used kernels in the setting of pairwise learning and illustrate the convergence results using such kernels. Our methodology mainly depends on the characterization of RKHSs using its associated integral operators and probability inequalities for random variables with values in a Hilbert space.
authors.affiliation: Department of Mathematics and Statistics, State University of New York at Albany, Albany, NY 12222, U.S.A. yying@albany.edu.
authors.forename: Yiming
authors.initials: Y
authors.lastname: Ying
authors.affiliation: Department of Mathematics, City University of Hong Kong, Kowloon, Hong Kong, China mazhou@cityu.edu.hk.
authors.forename: Ding-Xuan
authors.initials: DX
authors.lastname: Zhou