Sparse covers for sums of indicators
For all n, ε > 0), we show that the set of Poisson Binomial distributions on n variables admits a proper ε-cover in total variation distance of size n[superscript 2] + n · (1/ε)[superscript O(log[superscript 2] (1/ε)), which can also be computed in polynomial time. We discuss the implications of...
Үндсэн зохиолчид: | Papadimitriou, Christos, Daskalakis, Konstantinos |
---|---|
Бусад зохиолчид: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Формат: | Өгүүллэг |
Хэл сонгох: | en_US |
Хэвлэсэн: |
Springer-Verlag
2015
|
Онлайн хандалт: | http://hdl.handle.net/1721.1/99971 https://orcid.org/0000-0002-5451-0490 |
Ижил төстэй зүйлс
Ижил төстэй зүйлс
-
Zero-Sum Polymatrix Games: A Generalization of Minmax
-н: Cai, Yang, зэрэг
Хэвлэсэн: (2017) -
On the Structure, Covering, and Learning of Poisson Multinomial Distributions
-н: Daskalakis, Konstantinos, зэрэг
Хэвлэсэн: (2017) -
Does Information Revelation Improve Revenue?
-н: Daskalakis, Konstantinos, зэрэг
Хэвлэсэн: (2017) -
Covering energy, linear sum and vertical sum of posets
-н: Vandana P. Bhamre, зэрэг
Хэвлэсэн: (2024-07-01) -
A lava attack on the recovery of sums of dense and sparse signals
-н: Liao, Yuan, зэрэг
Хэвлэсэн: (2018)