Open Access
2019 Nonparametric estimation of low rank matrix valued function
Fan Zhou
Electron. J. Statist. 13(2): 3851-3892 (2019). DOI: 10.1214/19-EJS1582

Abstract

Let $A:[0,1]\rightarrow\mathbb{H}_{m}$ (the space of Hermitian matrices) be a matrix valued function which is low rank with entries in Hölder class $\Sigma(\beta,L)$. The goal of this paper is to study statistical estimation of $A$ based on the regression model $\mathbb{E}(Y_{j}|\tau_{j},X_{j})=\langle A(\tau_{j}),X_{j}\rangle,$ where $\tau_{j}$ are i.i.d. uniformly distributed in $[0,1]$, $X_{j}$ are i.i.d. matrix completion sampling matrices, $Y_{j}$ are independent bounded responses. We propose an innovative nuclear norm penalized local polynomial estimator and establish an upper bound on its point-wise risk measured by Frobenius norm. Then we extend this estimator globally and prove an upper bound on its integrated risk measured by $L_{2}$-norm. We also propose another new estimator based on bias-reducing kernels to study the case when $A$ is not necessarily low rank and establish an upper bound on its risk measured by $L_{\infty}$-norm. We show that the obtained rates are all optimal up to some logarithmic factor in minimax sense. Finally, we propose an adaptive estimation procedure based on Lepskii’s method and model selection with data splitting technique, which is computationally efficient and can be easily implemented and parallelized on distributed systems.

Citation

Download Citation

Fan Zhou. "Nonparametric estimation of low rank matrix valued function." Electron. J. Statist. 13 (2) 3851 - 3892, 2019. https://doi.org/10.1214/19-EJS1582

Information

Received: 1 March 2018; Published: 2019
First available in Project Euclid: 3 October 2019

zbMATH: 07113732
MathSciNet: MR4015337
Digital Object Identifier: 10.1214/19-EJS1582

Subjects:
Primary: 62G05 , 62G08
Secondary: 62H12

Keywords: local polynomial estimator , low rank , Matrix completion , minimax lower bound , Model selection , nonparametric estimation , nuclear norm penalization

Vol.13 • No. 2 • 2019
Back to Top