Large-scale semi-supervised learning with online spectral graph sparsification

Read full text
Authors: Daniele Calandriello, Alessandro Lazaric, Michal Valko
Cited by: 0

Abstract

We introduce Sparse-HFS, a scalable algorithm that can compute solutions to SSL problems using only O(n polylog(n)) space and O(m polylog(n)) time.

Fields of Study & Subjects

Text and Document Classification Technologies Internet Traffic Analysis and Secure E-voting Face and Expression Recognition

Publication details

Journal / source
arXiv (Cornell University)
Publication date
29 April 2026
Language
EN
Document type
Preprint