المساق
arXiv 2014-10-13 0 مشاهدة

Testing Poisson Binomial Distributions

Acharya, Jayadev · Daskalakis, Constantinos

الأصل · EN

A Poisson Binomial distribution over n variables is the distribution of the sum of n independent Bernoullis. We provide a sample near-optimal algorithm for testing whether a distribution P supported on {0,...,n} to which we have sample access is a Poisson Binomial distribution, or far from all Poisson Binomial distributions. The sample complexity of our algorithm is O(n¹/⁴) to which we provide a matching lower bound. We note that our sample complexity improves quadratically upon that of the naive "learn followed by tolerant-test" approach, while instance optimal identity testing [VV14] is not applicable since we are looking to simultaneously test against a whole family of distributions.

الترجمة العربية

لا توجد ترجمة عربية لهذا البحث بعد. كن أوّل من يطلبها: تستغرق ثوانيَ معدودة، وتُحفظ النتيجة لكل قارئ قادم.

تحقّق أمني

اكتب الأحرف الظاهرة أعلاه

حتى 10 ترجمات لكل شخص يومياً.