Distributed and Asynchronous Methods for Semi-supervised Learning
Résumé
We propose two asynchronously distributed approaches for graph-based semi-supervised learning. The first approach is based on stochastic approximation, whereas the second approach is based on randomized Kaczmarz algorithm. In addition to the possibility of distributed implementation, both approaches can be naturally applied online to streaming data. We analyse both approaches theoretically and by experiments. It appears that there is no clear winner and we provide indications about cases of superiority for each approach.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...