Abstract | ||
---|---|---|
<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">We investigate an approach based on DC (Difference of Convex functions) programming and DCA (DC Algorithm) for online learning techniques. The prediction problem of an online learner can be formulated as a DC program for which online DCA is applied. We propose the two so-called complete/approximate versions of online DCA scheme and prove their logarithmic/sublinear regrets. Six online DCA-based algorithms are developed for online binary linear classification. Numerical experiments on a variety of benchmark classification data sets show the efficiency of our proposed algorithms in comparison with the state-of-the-art online classification algorithms.</para> |
Year | DOI | Venue |
---|---|---|
2020 | 10.1162/neco_a_01266 | Neural computation |
DocType | Volume | Issue |
Journal | 32 | 4 |
ISSN | Citations | PageRank |
0899-7667 | 2 | 0.37 |
References | Authors | |
0 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Le Thi Hoai An | 1 | 1038 | 80.20 |
Vinh Thanh Ho | 2 | 6 | 2.44 |