Online Coregularization for Multiview Semisupervised Learning

الملخص EN

We propose a novel online coregularization framework for multiview semisupervised learning based on the notion of duality in constrained optimization.

Using the weak duality theorem, we reduce the online coregularization to the task of increasing the dual function.

We demonstrate that the existing online coregularization algorithms in previous work can be viewed as an approximation of our dual ascending process using gradient ascent.

New algorithms are derived based on the idea of ascending the dual function more aggressively.

For practical purpose, we also propose two sparse approximation approaches for kernel representation to reduce the computational complexity.

Experiments show that our derived online coregularization algorithms achieve risk and accuracy comparable to offline algorithms while consuming less time and memory.

Specially, our online coregularization algorithms are able to deal with concept drift and maintain a much smaller error rate.

This paper paves a way to the design and analysis of online coregularization algorithms.