• Corpus ID: 7964701

# Fourier-Based Testing for Families of Distributions

@article{Canonne2017FourierBasedTF,
title={Fourier-Based Testing for Families of Distributions},
author={Cl{\'e}ment L. Canonne and Ilias Diakonikolas and Alistair Stewart},
journal={Electron. Colloquium Comput. Complex.},
year={2017},
volume={TR17}
}
• Published 1 June 2017
• Mathematics, Computer Science
• Electron. Colloquium Comput. Complex.
We study the general problem of testing whether an unknown distribution belongs to a specified family of distributions. More specifically, given a distribution family $\mathcal{P}$ and sample access to an unknown discrete distribution $\mathbf{P}$, we want to distinguish (with high probability) between the case that $\mathbf{P} \in \mathcal{P}$ and the case that $\mathbf{P}$ is $\epsilon$-far, in total variation distance, from every distribution in $\mathcal{P}$. This is the prototypical…
8 Citations

### Testing for Families of Distributions via the Fourier Transform

• Mathematics
NeurIPS
• 2018
This work applies its Fourier-based framework to obtain near sample-optimal and computationally efficient testers for the following fundamental distribution families: Sums of Independent Integer Random Variables, Poisson Multinomial Distributions, and Discrete Log-Concave Distributions.

### Sharp Bounds for Generalized Uniformity Testing

• Computer Science, Mathematics
Electron. Colloquium Comput. Complex.
• 2017
This work presents a computationally efficient tester whose sample complexity is optimal, up to constant factors, and a matching information-theoretic lower bound on the sample complexity of generalized uniformity testing.

### Testing Conditional Independence of Discrete Distributions

• Computer Science, Mathematics
2018 Information Theory and Applications Workshop (ITA)
• 2018
This work studies the problem of testing conditional independence for discrete distributions and develops a general theory providing tight variance bounds for specific estimators of this form, up to constant factors, for all such estimators.

### Sample-Optimal Identity Testing with High Probability

• Mathematics, Computer Science
Electron. Colloquium Comput. Complex.
• 2017

### Efficient Robust Proper Learning of Log-concave Distributions

• Computer Science
ArXiv
• 2016
This work gives the first computationally efficient algorithm for the robust proper learning of univariate log-concave distributions, which achieves the information-theoretically optimal sample size, runs in polynomial time, and is robust to model misspecification with nearly-optimal error guarantees.

### Learning Poisson Binomial Distributions

• Computer Science, Mathematics
STOC '12
• 2012
This work considers a basic problem in unsupervised learning: learning an unknown Poisson binomial distribution, and gives a highly efficient algorithm which learns to $$\epsilon$$ϵ-accuracy (with respect to the total variation distance) using $$\tilde{O}(1/ \ep silon ^{3})$$O~( 1/ϵ3) samples independent of$$n$$n.

### Optimal Learning via the Fourier Transform for Sums of Independent Integer Random Variables

• Computer Science, Mathematics
COLT
• 2016
A computationally efficient algorithm is designed that uses $\widetilde{O}(k/\epsilon^2)$ samples, and learns an arbitrary $k$-SIIRV within error $k,$ in total variation distance, and proves a tight lower bound on the size of $\ep silon$-covers for ${\cal S}_{n,k}$, and is the key ingredient in the authors' tight sample complexity lower bound.

### A New Approach for Testing Properties of Discrete Distributions

• Computer Science, Mathematics
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
• 2016
The sample complexity of the algorithm depends on the structure of the unknown distributions - as opposed to merely their domain size - and is significantly better compared to the worst-case optimal L1-tester in many natural instances.

### Testing Poisson Binomial Distributions

• Mathematics, Computer Science
SODA
• 2015
The sample complexity of this algorithm improves quadratically upon that of the naive "learn followed by tolerant-test" approach, while instance optimal identity testing [VV14] is not applicable since it is looking to simultaneously test against a whole family of distributions.

### Optimal Algorithms for Testing Closeness of Discrete Distributions

• Computer Science, Mathematics
SODA
• 2014
This work presents simple testers for both the e1 and e2 settings, with sample complexity that is information-theoretically optimal, to constant factors, and establishes that the sample complexity is Θ(max{n2/3/e4/3, n1/2/&epsilon2}.