Abstract

This paper considers the minimax estimation of the high-dimensional sparse covariance matrices in the presence of missing observations. Based on random missing data, the upper bounds of convergence rate about the data-driven thresholding estimator are constructed over a large class of sparse covariance matrices under the [Formula: see text] norm and the Frobenius norm. In addition, we use Le Cam’s lemma and the relation between the total variation affinity and the Kullback–Leibler divergence to establish the lower bounds which illustrate the desired upper bounds cannot be improved. It is worth mentioning that the approach we adopt to get the lower bounds is simpler than the existing ones.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.