Learning Sums of Independent Integer Random Variables
Let S = X[subscript 1]+···+X[subscript n] be a sum of n independent integer random variables X[subscript i], where each X[subscript i] is supported on {0, 1, ..., k - 1} but otherwise may have an arbitrary distribution (in particular the Xi's need not be identically distributed). How many sampl...
Main Authors: | Diakonikolas, Ilias (Author), O'Donnell, Ryan (Author), Servedio, Rocco A. (Author), Tan, Li-Yang (Author), Daskalakis, Konstantinos (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers (IEEE),
2015-11-20T18:38:04Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Learning poisson binomial distributions
by: Daskalakis, Constantinos, et al.
Published: (2012) -
Learning poisson binomial distributions
by: Daskalakis, Constantinos, et al.
Published: (2021) -
Learning k-modal distributions via testing
by: Daskalakis, Constantinos, et al.
Published: (2012) -
Testing k-Modal Distributions: Optimal Algorithms via Reductions
by: Diakonikolas, Ilias, et al.
Published: (2015) -
Learning k-modal distributions via testing
by: Daskalakis, C, et al.
Published: (2022)