Pseudorandomness, symmetry, smoothing: II
Harm Derksen, Peter Ivanov, Chin Ho Lee, Emanuele Viola

TL;DR
This paper advances the understanding of the Hamming weight distribution in bounded uniform and small-bias distributions, providing new anti-concentration results, transformations, and constructions that match classical tail bounds and support weight restrictions.
Contribution
It introduces novel anti-concentration bounds, a generic transformation from bounded uniform to small-bias distributions, and constructions supporting limited Hamming weights, extending previous work.
Findings
Bounded-uniform distributions can be anti-concentrated, matching classical tail bounds.
A transformation converts bounded uniform to small-bias distributions with preserved weight properties.
Small-bias distributions with restricted weights are constructed, supporting derandomization applications.
Abstract
We prove several new results on the Hamming weight of bounded uniform and small-bias distributions. We exhibit bounded-uniform distributions whose weight is anti-concentrated, matching existing concentration inequalities. This construction relies on a recent result in approximation theory due to Erd\'eyi (Acta Arithmetica 2016). In particular, we match the classical tail bounds, generalizing a result by Bun and Steinke (RANDOM 2015). Also, we improve on a construction by Benjamini, Gurel-Gurevich, and Peled (2012). We give a generic transformation that converts any bounded uniform distribution to a small-bias distribution that almost preserves its weight distribution. Applying this transformation in conjunction with the above results and others, we construct small-bias distributions with various weight restrictions. In particular, we match the concentration that follows from that of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRandom Matrices and Applications · Markov Chains and Monte Carlo Methods · Sparse and Compressive Sensing Techniques
