Name
Abstract | ||
|---|---|---|
Recently, there has been considerable work on analyzing learning algorithms with pairwise loss functions in the batch setting. There is relatively little theoretical work on analyzing their online algorithms, despite of their popularity in practice due to the scalability to big data. In this paper, we consider online learning algorithms with pairwise loss functions based on regularization schemes in reproducing kernel Hilbert spaces. In particular, we establish the convergence of the last iterate of the online algorithm under a very weak assumption on the step sizes and derive satisfactory convergence rates for polynomially decaying step sizes. Our technique uses Rademacher complexities which handle function classes associated with pairwise loss functions. Since pairwise learning involves pairs of examples, which are no longer i.i.d., standard techniques do not directly apply to such pairwise learning algorithms. Hence, our results are a non-trivial extension of those in the setting of univariate loss functions to the pairwise setting. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/s10444-016-9479-7 | Adv. Comput. Math. |
Keywords | Field | DocType |
Pairwise learning,Online learning,Regularization,RKHS,68Q32,68T05,62J02,62L20 | Kernel (linear algebra),Hilbert space,Convergence (routing),Pairwise comparison,Online algorithm,Mathematical optimization,Regularization (mathematics),Mathematics,Reproducing kernel Hilbert space,Scalability | Journal |
Volume | Issue | ISSN |
43 | 1 | 1019-7168 |
Citations | PageRank | References |
4 | 0.40 | 21 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zheng-Chu Guo | 1 | 26 | 2.66 |
| Yiming Ying | 2 | 1008 | 56.43 |
| Ding-xuan Zhou | 3 | 954 | 81.62 |