Learning Poisson binomial distributions

DOI10.1007/s00453-015-9971-3zbMath1333.68229arXiv1107.2702OpenAlexW1990190538MaRDI QIDQ2345953

Ilias Diakonikolas, Constantinos Daskalakis, Rocco A. Servedio

Publication date: 21 May 2015

Published in: Algorithmica, Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1107.2702

zbMATH Keywords

computational learning theoryunsupervised learningdensity estimationPoisson binomial distributionapplied probabilitylearning distributions

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (17)

Sampling Correctors ⋮ Auction Design with a Revenue Target ⋮ Relative entropy and envy-free allocation ⋮ The Poisson binomial distribution -- old \& new ⋮ Stein's method and Narayana numbers ⋮ Testing shape restrictions of discrete distributions ⋮ A new and intuitive test for zero modification ⋮ Robust Estimators in High-Dimensions Without the Computational Intractability ⋮ Sparse covers for sums of indicators ⋮ Unnamed Item ⋮ A delay-resilient and quality-aware mechanism over incomplete contextual data streams ⋮ Streaming changepoint detection for transition matrices ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Learning Poisson binomial distributions ⋮ Topics and Techniques in Distribution Testing: A Biased but Representative Sample

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparse covers for sums of indicators
• Convolution of unimodal distributions can produce any number of modes
• Binomial approximation to the Poisson binomial distribution
• Translated Poisson approximation for Markov chains
• Rates of convergence of minimum distance estimators and Kolmogorov's entropy
• A semigroup approach to Poisson approximation
• Estimating a density under order restrictions: Nonasymptotic minimax risk
• On the risk of histograms for estimating decreasing densities
• A universally acceptable smoothing factor for kernel density estimates
• Estimation of unimodal densities without smoothness assumptions
• Nonasymptotic universal smoothing factors, kernel complexity and Yatracos classes
• On the convergence of Poisson binomial to Poisson distributions
• Learning Poisson binomial distributions
• Translated Poisson approximation using exchangeable pair couplings
• Fast multiplication of large numbers
• An approximation theorem for the Poisson binomial distribution
• Binomial Approximation to the Poisson Binomial Distribution: The Krawtchouk Expansion
• On the learnability of discrete distributions
• Efficiently learning mixtures of two Gaussians
• The Poisson Approximation to the Poisson Binomial Distribution
• Faster computation of Bernoulli numbers
• Fast Multiple-Precision Evaluation of Elementary Functions
• Computation of π Using Arithmetic-Geometric Mean
• Le Cam's Inequality and Poisson Approximations
• On oblivious PTAS's for nash equilibrium
• Probability Inequalities for Sums of Bounded Random Variables
• Estimating the unseen
• Learning $k$-Modal Distributions via Testing
• Polynomial Learning of Distribution Families
• An Efficient PTAS for Two-Strategy Anonymous Games
• Some Results for Discrete Unimodality
• Univariate Discrete Distributions
• Learning mixtures of structured distributions over discrete domains
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Concentration of Measure for the Analysis of Randomized Algorithms
• Combinatorial methods in density estimation

This page was built for publication: Learning Poisson binomial distributions