Rates of Convergence for Spline Estimates of Additive Principal Components
โ Scribed by Nour Eddin El Faouzi; Pascal Sarda
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 159 KB
- Volume
- 68
- Category
- Article
- ISSN
- 0047-259X
No coin nor oath required. For personal study only.
โฆ Synopsis
Additive principal components (APCs) generalize classical principal component analysis to additive nonlinear transformations. Smallest APCs are additive functions of the vector X=(X 1 , ..., X p ) minimizing the variance under orthogonality constraints and are characterized as eigenfunctions of an operator which is compact under a standard condition on the joint distribution of (X 1 , ..., X p ). As a byproduct, smallest APC nearly satisfies the equation j , j (X j )=0 and then provides powerful tools for regression and data analysis diagnostics.
The principal aim of this paper is the estimation of smallest APCs based on a sample from the distribution of X. This is achieved using additive splines, which have been recently investigated in several functional estimation problems. The rates of convergence are then derived under mild conditions on the component functions. These rates are the same as the optimal rates for a nonparametric estimate of a univariate regression function.
๐ SIMILAR VOLUMES
New uniform estimates for multigrid algorithms are established for certain non-symmetric indefinite problems. In particular, we are concerned with the simple additive algorithm and multigrid (V(1, 0)-cycle) algorithms given in [5]. We prove, without full elliptic regularity assumption, that these al