[2604.26550]
Daniele Calandriello, Alessandro Lazaric, Michal Valko
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.
PDF on arXiv
Abstract on arXiv