Asymptotic efficiency of simple decisions for the compound decision problem
| dc.creator | Greenshtein, Eitan | |
| dc.creator | Ritov, Ya'acov | |
| dc.date | 2008-02-10 | |
| dc.date.accessioned | 2026-07-07T09:19:49Z | |
| dc.date.available | 2026-07-07T09:19:49Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/0802.1319 | |
| dc.identifier | http://arxiv.org/abs/0802.1319 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/154532 | |
| dc.subject | Statistics Theory | |
| dc.title | Asymptotic efficiency of simple decisions for the compound decision problem | |
| dc.type | text |