Learning Poisson binomial distributions

DOI10.1145/2213977.2214042MaRDI QIDQ6828344zbMATH OpenFDO

Authors Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio

Publication date 13 May 2014

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

Full work available at URL https://www.pure.ed.ac.uk/ws/files/19485092/Daskalakis_Diakonikolas_ET_AL_2015_Learning_Poisson_Binomial_Distributions.pdf

zbMATH Keywords

applied probabilitycomputational learning theorylearning distributions

Mathematics Subject Classification ID

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

Cited in

(3)

• Not all learnable distribution classes are privately learnable
• On the sample complexity of privately learning unbounded high-dimensional Gaussians
• Robustly learning mixtures of k arbitrary Gaussians

This page was built for publication: Learning Poisson binomial distributions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6828344)