Penalized spline estimation of principal components for sparse functional data: rates of convergence

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: He, Shiyuan, Huang, Jianhua Z., He, Kejun
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866917585023401984
author He, Shiyuan
Huang, Jianhua Z.
He, Kejun
author_facet He, Shiyuan
Huang, Jianhua Z.
He, Kejun
contents This paper gives a comprehensive treatment of the convergence rates of penalized spline estimators for simultaneously estimating several leading principal component functions, when the functional data is sparsely observed. The penalized spline estimators are defined as the solution of a penalized empirical risk minimization problem, where the loss function belongs to a general class of loss functions motivated by the matrix Bregman divergence, and the penalty term is the integrated squared derivative. The theory reveals that the asymptotic behavior of penalized spline estimators depends on the interesting interplay between several factors, i.e., the smoothness of the unknown functions, the spline degree, the spline knot number, the penalty order, and the penalty parameter. The theory also classifies the asymptotic behavior into seven scenarios and characterizes whether and how the minimax optimal rates of convergence are achievable in each scenario.
format Preprint
id arxiv_https___arxiv_org_abs_2402_05438
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Penalized spline estimation of principal components for sparse functional data: rates of convergence
He, Shiyuan
Huang, Jianhua Z.
He, Kejun
Statistics Theory
Methodology
This paper gives a comprehensive treatment of the convergence rates of penalized spline estimators for simultaneously estimating several leading principal component functions, when the functional data is sparsely observed. The penalized spline estimators are defined as the solution of a penalized empirical risk minimization problem, where the loss function belongs to a general class of loss functions motivated by the matrix Bregman divergence, and the penalty term is the integrated squared derivative. The theory reveals that the asymptotic behavior of penalized spline estimators depends on the interesting interplay between several factors, i.e., the smoothness of the unknown functions, the spline degree, the spline knot number, the penalty order, and the penalty parameter. The theory also classifies the asymptotic behavior into seven scenarios and characterizes whether and how the minimax optimal rates of convergence are achievable in each scenario.
title Penalized spline estimation of principal components for sparse functional data: rates of convergence
topic Statistics Theory
Methodology
url https://arxiv.org/abs/2402.05438