arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1901.06976math.OCmath.STstat.TH
收藏

随机最优化解估计的可容许性

Admissibility of solution estimators for stochastic optimization

Amitabh Basu, Tu Nguyen, Ao Sun

摘要:

我们通过统计决策论的视角来看待随机最优化问题。特别是,我们解决的可接受性,在统计决策论的意义上,自然样本平均估计的随机最优化问题(这也被称为经验风险最小化(ERM)规则在学习文献)。众所周知,对于一些简单的随机最优化问题,样本平均估计量可能是不可容许的。这在统计学文献中被称为{ \em Stein's paradox}。本文证明了对于紧集上随机线性函数的最优化问题,样本平均估计是容许的。此外,我们研究了凸二次目标受框约束的问题。当没有约束且问题的维度至少为3时,斯坦悖论成立。我们表明,在盒子的约束存在下,可接受性恢复为3和4维。

英文摘要:

We look at stochastic optimization problems through the lens of statistical decision theory. In particular, we address admissibility, in the statistical decision theory sense, of the natural sample average estimator for a stochastic optimization problem (which is also known as the empirical risk minimization (ERM) rule in learning literature). It is well known that for some simple stochastic optimization problems, the sample average estimator may not be admissible. This is known as {\em Stein's paradox} in the statistics literature. We show in this paper that for optimizing stochastic linear functions over compact sets, the sample average estimator is admissible. Moreover, we study problems with convex quadratic objectives subject to box constraints. Stein's paradox holds when there are no constraints and the dimension of the problem is at least three. We show that in the presence of box constraints, admissibility is recovered for dimensions 3 and 4.

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

↑