mlsanityData to 7 Oct 2026

Simpler Distribution Testing with Little Memory

arXiv 2311.01145 ↗First posted 2 Nov 2023cs.DS cs.DMcited by 1

Not on the map. Why?

Abstract (arXiv)

We consider the question of distribution testing (specifically, uniformity and closeness testing) in the streaming setting, ie under stringent memory constraints. We improve on the results of Diakonikolas, Gouleakis, Kane, and Rao (2019) by providing considerably simpler algorithms, which remove some restrictions on the range of parameters and match their lower bounds.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). First posted on arXiv 2 Nov 2023.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.