I/O高效采样与序贯估计中的实例最优性
Instance-Optimality in I/O-Efficient Sampling and Sequential Estimation
AI总结:
本文研究I/O高效采样与序贯估计问题,提出对块顺序不敏感且具有实例最优性的自适应采样算法,并给出均值、分位数、直方图及混合分布学习等任务的实例最优保证。
摘要:
假设我们有一个存储0和1的内存,并且我们想通过采样来估计1的频率。我们希望以I/O高效的方式完成这一任务,利用每次读取以单位成本给出一个包含B位的块,而不仅仅是一位。如果输入由均匀块组成:要么全是1,要么全是0,那么一次采样整个块并不会减少估计所需的样本数量。另一方面,如果位是随机排列的,那么获得一个包含B位的块就相当于获得B个独立的位样本。然而,我们不想对输入做任何此类假设。相反,我们的目标是设计一种具有实例相关性能保证的算法,一旦我们知道已经获得了概率上可靠的估计,就停止采样块。我们证明,我们的算法在对块顺序不敏感的算法中具有实例最优性,我们认为这是我们所能期望的最强形式的实例最优性。我们还给出了类似的I/O高效估计结果,包括具有加性误差和乘性误差的均值估计、直方图估计、分位数估计以及经验累积分布函数估计。我们通过将上述I/O高效采样问题归约到所谓的序贯估计中的相应问题,得到了上述结果。在该设定下,人们从未知分布中采样,直到能够以某个期望的错误概率给出估计。然后,我们为几个基本问题提供了非参数的实例最优结果:均值和分位数估计,以及关于$\ell_\infty$和所谓的Kolmogorov-Smirnov距离学习混合分布。
英文摘要:
Suppose we have a memory storing $0$s and $1$s and we want to estimate the frequency of $1$s by sampling. We want to do this I/O-efficiently, exploiting that each read gives a block of $B$ bits at unit cost; not just one bit. If the input consists of uniform blocks: either all 1s or all 0s, then sampling a whole block at a time does not reduce the number of samples needed for estimation. On the other hand, if bits are randomly permuted, then getting a block of $B$ bits is as good as getting $B$ independent bit samples. However, we do not want to make any such assumptions on the input. Instead, our goal is to have an algorithm with instance-dependent performance guarantees which stops sampling blocks as soon as we know that we have a probabilistically reliable estimate. We prove our algorithms to be instance-optimal among algorithms oblivious to the order of the blocks, which we argue is the strongest form of instance optimality we can hope for. We also present similar results for I/O-efficiently estimating mean with both additive and multiplicative error, estimating histograms, quantiles, as well as the empirical cumulative distribution function. We obtain our above results on I/O-efficient sampling by reducing to corresponding problems in the so-called sequential estimation. In this setting, one samples from an unknown distribution until one can provide an estimate with some desired error probability. We then provide non-parametric instance-optimal results for several fundamental problems: mean and quantile estimation, as well as learning mixture distributions with respect to $\ell_\infty$ and the so-called Kolmogorov-Smirnov distance.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。