arxiv
PublishedApril 30, 2026 at 4:00 AM
▲bullish
Large-scale semi-supervised learning with online spectral graph sparsification
Publisher summary· verbatim
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.
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivADS-C: Antidistillation Sampling for Classification14harxivDo Coding Agents Need Executable World Models, Simplification, and Verification to Solve ARC-AGI-3?14harxivBeyond a Joke: Multi-Angle Reasoning for Detecting and Explaining Harmful Humor in Memes14harxivFrom Black Box to Executable Logic: Explainable Reinforcement Learning through Prolog Expert Systems14hThe Bubble Brief
WEEKLYRead semi-supervised-learning insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗