On Learning Graph Binomial Distributions and Powers of Poisson Binomial Distributions
summary
Presents concrete results: learn a Poisson binomial distribution up to total variation ε with sample complexity ~O((log(1/δ))/ε^2) by estimate mean and variance in the high-variance (Gaussian) case and by finding an effective support interval and histogram in the low-variance case; proves that exact parameter recovery needs exp(1/ε) samples so approximating the distribution is strictly easier. Extends to learning all powered distributions by choosing a power L where P^L flattens, shows Newton identities plus noise cause exponential error amplification, and shows the graph-induced-edge-count distribution can be multimodal and is often hard to characterize.
AI-written summary · about
chapters (11)
- 0:00Intro
- 3:42Distribution Learning (Small) Sample of Previous Work
- 7:10Warm-up: Learning a Binomial Distribution Binn,p
- 8:27Poisson Binomial Distributions (PBDs)
- 13:16Learning Poisson Binomial Distributions
- 20:27Powers of Poisson Binomial Distribution
- 24:39Learning the powers of Binp
- 26:48Sampling from the Right Power
- 29:05Lower Bound on PBD Power Learning
- 30:12Parameter Learning through Newton Identities
- 34:04Graph Binomial Distributions
related talks
21mTesting Distribution Families
53mDesigning Robust Learners
45mThe lower tail: Poisson approximation revisited
01h 04mNonparametric Bayesian Methods: Models, Algorithms, and Applications II
01h 02mNonparametric Bayesian Methods: Models, Algorithms, and Applications III
29mOn Learning Distributions from their Samples
01h 12mLearning probability distributions; what can, what can't be done
36mPrivately Learning High-Dimensional Distributions
