Abstract

Covariance structure plays an important role in high-dimensional statistical inference. In a range of applications including imaging analysis and fMRI studies, random variables are observed on a lattice graph. In such a setting, it is important to account for the lattice structure when estimating the covariance operator. In this article, we consider both minimax and adaptive estimation of the covariance operator over collections of polynomially decaying and exponentially decaying parameter spaces. We first establish the minimax rates of convergence for estimating the covariance operator under the operator norm. The results show that the dimension of the lattice graph significantly affects the optimal rates convergence, often much more so than the dimension of the random variables. We then consider adaptive estimation of the covariance operator. A fully data-driven block thresholding procedure is proposed and is shown to be adaptively rate optimal simultaneously over a wide range of polynomially decaying and exponentially decaying parameter spaces. The adaptive block thresholding procedure is easy to implement, and numerical experiments are carried out to illustrate the merit of the procedure. Supplementary materials for this article are available online.

Highlights

  • In many high-dimensional inference problems, random variables are observed on a lattice graph

  • The results show that the dimension of the lattice graph significantly affects the optimal rates convergence, often much more so than the dimension of the random variables

  • In imaging analysis the intensity values are observed on pixels that form a two dimensional lattice, and in fMRI studies the observations are made at voxels that can be described as a three dimensional lattice graph

Read more

Summary

Introduction

In many high-dimensional inference problems, random variables are observed on a lattice graph. In addition to the minimax optimality, we study the problem of adaptive estimation of covariance operators for random variables observed on a lattice graph. Cai and Yuan (2011) showed that a carefully devised block thresholding procedure can adaptively achieve the optimal rate of convergence over F1(α; M0, M ) simultaneously for all α > 0 Unlike these earlier developments where the analysis techniques are tailored for covariance matrices, our treatment here is more general and can handle higher dimensional lattices and covariance operators with arbitrarily decaying rates. A fully datadriven block thresholding estimator is constructed by first carefully dividing the sample covariance operator into blocks and simultaneously estimating the entries in a block by thresholding This estimator is shown to attain the optimal rate of convergence adaptively over the collections of both polynomially decaying and exponentially decaying covariance operators.

Optimal Rates of Convergence
Minimax Lower Bounds
Polynomially decaying covariance operators
Exponentially decaying covariance operators
Upper Bounds
Blockwise Banding Estimator
Adaptive Estimation
Block Thresholding Estimator
Adaptivity
Hyperrectangular Lattices
Numerical Experiments
Discussions
Large blocks
Small blocks
Proof of Lemma 1
Proof of Lemma 3
Findings
Proof of Lemma 5
Full Text
Published version (Free)

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