AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Nearly Space-Optimal Graph and Hypergraph Sparsification in Insertion-Only Data Streams

Vincent Cohen-Addad, David Woodruff, Shenghao Xie, Samson Zhou

ICLR 2026 · Learning theory and algorithms › Sample complexity · approach: Private and query-efficient algorithms · 3 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Apply merge-and-reduce to an online prefix substream instead of the whole streamstreaming sparsifier · Synthetic graph (n=100, m=50000) and Facebook graphmultiplicative errorImproved
Increase space budget (ablation)streaming sparsifier vs merge-and-reduce · Synthetic and Facebook graphsmultiplicative error advantageHurt
Use extremely low budget (l=500) (ablation)streaming sparsifier · Synthetic graph (n=100, m=50000)multiplicative errorNo clear effect
Increase number of edges m with budget fixed at 1500 (ablation)streaming sparsifier · Synthetic graph (n=100, l=1500)multiplicative errorImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy