Abstract
Loosely speaking, the effective support size of a distribution is the size of the support of adistribution that is close to it (in totally variation distance). We study the complexity of estimatingthe effective support size of an unknown distribution when given samples of the distributions aswell as an evaluation oracle (which returns the probability that the queried element appears in thedistribution). In this context, we present several algorithms that exhibit a trade-off between thequality of the approximation and the complexity of obtaining it, and leave open the question of theiroptimality
| Original language | English |
|---|---|
| Number of pages | 22 |
| Journal | Electronic colloquium on computational complexity ECCC ; research reports, surveys and books in computational complexity |
| State | In preparation - 30 Jun 2019 |