arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2112.03390math.STmath.OCstat.TH
收藏

关于非参数估计的凸优化计算

On the computation of a non-parametric estimator by convex optimization

Akshay Seshadri, Stephen Becker

摘要:

从观测数据中估计线性泛函是许多学科中的一项重要任务。Juditsky & Nemirovski [The Annals of Statistics 37.5A(2009):2278 - 2300]提出了一个在非常一般的设置中对线性泛函进行非参数估计的框架,具有近似最小最大最优置信区间。他们通过近似函数的鞍点来计算这个估计量和相关的置信区间。虽然这个最优化问题是凸的,但是使用现有的现成的优化软件来求解是相当困难的。此外,当估计量存在于高维空间中时,这种计算可能是昂贵的。我们提出了一个不同的算法来构建这个估计。我们的算法可以使用现有的优化软件,是更便宜的实现,即使当估计是在一个高维空间,只要Hellinger亲和性(或Bhattacharyya系数)的选择参数分布可以有效地计算给定的参数。我们希望,我们的算法将促进采用这种估计技术,以更广泛的各种问题相对容易。

英文摘要:

Estimation of linear functionals from observed data is an important task in many subjects. Juditsky & Nemirovski [The Annals of Statistics 37.5A (2009): 2278-2300] propose a framework for non-parametric estimation of linear functionals in a very general setting, with nearly minimax optimal confidence intervals. They compute this estimator and the associated confidence interval by approximating the saddle-point of a function. While this optimization problem is convex, it is rather difficult to solve using existing off-the-shelf optimization software. Furthermore, this computation can be expensive when the estimators live in a high-dimensional space. We propose a different algorithm to construct this estimator. Our algorithm can be used with existing optimization software and is much cheaper to implement even when the estimators are in a high-dimensional space, as long as the Hellinger affinity (or the Bhattacharyya coefficient) for the chosen parametric distribution can be efficiently computed given the parameters. We hope that our algorithm will foster the adoption of this estimation technique to a wider variety of problems with relative ease.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑