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.
| Comments: | Workshop on Resource-Efficient Machine Learning (REML), ICML 2015 |
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2604.26550 [cs.LG] |
| (or arXiv:2604.26550v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2604.26550 arXiv-issued DOI via DataCite (pending registration) |
Submission history
From: Michal Valko [view email]
[v1]
Wed, 29 Apr 2026 11:32:57 UTC (333 KB)