Lower bounds of minimax risk in estimation problems without lan condition

1992 ◽  
Vol 38 (2) ◽  
pp. 67-93 ◽  
Author(s):  
V. G. Spokoiny
2010 ◽  
Vol 27 (3) ◽  
pp. 497-521 ◽  
Author(s):  
Xiaohong Chen ◽  
Markus Reiss

In this paper we clarify the relations between the existing sets of regularity conditions for convergence rates of nonparametric indirect regression (NPIR) and nonparametric instrumental variables (NPIV) regression models. We establish minimax risk lower bounds in mean integrated squared error loss for the NPIR and NPIV models under two basic regularity conditions: the approximation number and the link condition. We show that both a simple projection estimator for the NPIR model and a sieve minimum distance estimator for the NPIV model can achieve the minimax risk lower bounds and are rate optimal uniformly over a large class of structure functions, allowing for mildly ill-posed and severely ill-posed cases.


Statistics ◽  
1996 ◽  
Vol 28 (2) ◽  
pp. 123-129
Author(s):  
Beata Mizera
Keyword(s):  

Author(s):  
Di Wang ◽  
Jinhui Xu

In this paper, we study the sparse covariance matrix estimation problem in the local differential privacy model, and give a non-trivial lower bound on the non-interactive private minimax risk in the metric of squared spectral norm. We show that the lower bound is actually tight, as it matches a previous upper bound. Our main technique for achieving this lower bound is a general framework, called General Private Assouad Lemma, which is a considerable generalization of the previous private Assouad lemma and can be used as a general method for bounding the private minimax risk of matrix-related estimation problems.


Sign in / Sign up

Export Citation Format

Share Document