A new random-walk framework yields near-optimal sample complexity bounds for replicable uniformity testing (settling an open question) and for replicable closeness testing.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Replicable Distribution Testing
A new random-walk framework yields near-optimal sample complexity bounds for replicable uniformity testing (settling an open question) and for replicable closeness testing.