Online Manifold Regularization by Dual Ascending Procedure
Open Access
- 2 July 2013
- journal article
- research article
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2013, 1-16
Abstract
We propose a novel online manifold regularization framework based on the notion of duality in constrained optimization. The Fenchel conjugate of hinge functions is a key to transfer manifold regularization from offline to online in this paper. Our algorithms are derived by gradient ascent in the dual function. For practical purpose, we propose two buffering strategies and two sparse approximations to reduce the computational complexity. Detailed experiments verify the utility of our approaches. An important conclusion is that our online MR algorithms can handle the settings where the target hypothesis is not fixed but drifts with the sequence of examples. We also recap and draw connections to earlier works. This paper paves a way to the design and analysis of online manifold regularization algorithms.Keywords
This publication has 4 references indexed in Scilit:
- A primal-dual perspective of online learning algorithmsMachine Learning, 2007
- Semi-Supervised Learning Using Semi-Definite Programming2006
- On-Line Algorithms in Machine Learning1998
- The Nature of Statistical Learning TheoryTechnometrics, 1996