Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Alexander Cloninger
Recent (6 mo)
1
With code
0
Influential cites
0
Benchmarked
0

Publications per year

1
26

Top categories

Numerical Analysis×1Stats ML×1

Frequent co-authors

Zhaiming Shen1×

Research Timeline

2026
Scalable Graph Coreset Selection via Greedy Sampling

A new graph sampling algorithm based on minimum inner product greedy selection rule is proposed, which requires only access to a small random subset of Laplacian columns and achieves sampling proportional to cluster size under the stochastic block model.

Highlighted terms show continued research focus across papers

Papers

Alexander Cloninger

1 indexed paper

math.NA
stat.ML
Theoretical
Recent
Jul 30, 2026

Scalable Graph Coreset Selection via Greedy Sampling

Zhaiming Shen, Alexander Cloninger

A new graph sampling algorithm based on minimum inner product greedy selection rule is proposed, which requires only access to a small random subset of Laplacian columns and achieves sampling proporti…

View →