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

arXiv:2604.26550v1 Announce Type: new 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.

Leave a Comment

Your email address will not be published. Required fields are marked *

Scroll to Top