Papers
arxiv:2604.26550

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

Published on Apr 29
Authors:
,
,

Abstract

Sparse-HFS is a scalable algorithm for solving SSL problems with improved space and time complexity.

AI-generated summary

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.

Community

Sign up or log in to comment

Get this paper in your agent:

hf papers read 2604.26550
Don't have the latest CLI?
curl -LsSf https://hf.co/cli/install.sh | bash

Models citing this paper 0

No model linking this paper

Cite arxiv.org/abs/2604.26550 in a model README.md to link it from this page.

Datasets citing this paper 1

Spaces citing this paper 0

No Space linking this paper

Cite arxiv.org/abs/2604.26550 in a Space README.md to link it from this page.

Collections including this paper 0

No Collection including this paper

Add this paper to a collection to link it from this page.