普适对称性质估计的有效轮廓极大似然法
Efficient Profile Maximum Likelihood for Universal Symmetric Property Estimation
摘要:
估计分布的对称属性,例如支持大小,覆盖率,熵,均匀性距离,是算法统计中最基本的问题之一。虽然这些属性中的每一个都被广泛研究,并且每个属性都有单独的最佳估计量,但在最近的工作中,Acharya et al. 2016表明,有一个单一的估计量对所有对称属性都有竞争力。这项工作证明,计算的分布,近似最大化\emph{profile likelihood (PML)},即观察到的频率的频率的概率,并返回该分布上的属性值是样本竞争相对于一个广泛的类的对称属性的估计。此外,他们表明,即使计算PML的近似值也足以实现这样一个通用的插件估计器。不幸的是,在此之前的工作有没有已知的多项式时间算法来计算一个近似的PML,它是开放的,以获得一个多项式时间通用插件估计通过使用近似的PML。在本文中,我们提供了一个算法(在样本数),给定$n$样本的分布,计算近似的PML分布的乘法误差$\exp(n^{2/3} \mathrm{poly} \log(n))$在时间接近线性$n$。Acharya等人2016年关于近似PML效用的推广工作表明,我们的算法为所有对称函数提供了一个接近线性时间的通用插件估计器,精度高达$ε= Ω(n^{-0.166})$。此外,我们将展示如何扩展我们的工作,以提供有效的多项式时间算法计算的$d$维推广的PML(为常数$d$),允许通用插件估计分布之间的对称关系。
英文摘要:
Estimating symmetric properties of a distribution, e.g. support size, coverage, entropy, distance to uniformity, are among the most fundamental problems in algorithmic statistics. While each of these properties have been studied extensively and separate optimal estimators are known for each, in striking recent work, Acharya et al. 2016 showed that there is a single estimator that is competitive for all symmetric properties. This work proved that computing the distribution that approximately maximizes \emph{profile likelihood (PML)}, i.e. the probability of observed frequency of frequencies, and returning the value of the property on this distribution is sample competitive with respect to a broad class of estimators of symmetric properties. Further, they showed that even computing an approximation of the PML suffices to achieve such a universal plug-in estimator. Unfortunately, prior to this work there was no known polynomial time algorithm to compute an approximate PML and it was open to obtain a polynomial time universal plug-in estimator through the use of approximate PML. In this paper we provide a algorithm (in number of samples) that, given $n$ samples from a distribution, computes an approximate PML distribution up to a multiplicative error of $\exp(n^{2/3} \mathrm{poly} \log(n))$ in time nearly linear in $n$. Generalizing work of Acharya et al. 2016 on the utility of approximate PML we show that our algorithm provides a nearly linear time universal plug-in estimator for all symmetric functions up to accuracy $ε= Ω(n^{-0.166})$. Further, we show how to extend our work to provide efficient polynomial-time algorithms for computing a $d$-dimensional generalization of PML (for constant $d$) that allows for universal plug-in estimation of symmetric relationships between distributions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。