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

复合判定问题简单决策的渐近有效性

Asymptotic efficiency of simple decisions for the compound decision problem

Eitan Greenshtein, Ya'acov Ritov

摘要:

我们考虑复合判定问题估计向量的$n$参数,已知的置换,对应于$n$独立的意见,并讨论了两个对称类的估计之间的差异。第一个和更大的类被限制到所有排列不变估计的集合。第二类进一步限制为简单的对称过程。也就是说,估计器使得每个参数仅由相应观测值的函数估计。我们证明了,在温和的条件下,这两个类的最小总平方误差风险是渐近等价的,本质上是O(1)的差异。

英文摘要:

We consider the compound decision problem of estimating a vector of $n$ parameters, known up to a permutation, corresponding to $n$ independent observations, and discuss the difference between two symmetric classes of estimators. The first and larger class is restricted to the set of all permutation invariant estimators. The second class is restricted further to simple symmetric procedures. That is, estimators such that each parameter is estimated by a function of the corresponding observation alone. We show that under mild conditions, the minimal total squared error risks over these two classes are asymptotically equivalent up to essentially O(1) difference.

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

↑