Abstract

An efficient algorithm for computing the GCV (generalized cross-validation) function for the general cross-validated regularization/smoothing problem is provided. This algorithm is based on the Householder tridiagonalization, similar to Elden’s [BIT, 24 (1984), pp. 467–472] bidiagonalization and is appropriate for problems where no natural structure is available, and the regularization /smoothing problem is solved (exactly) in a reproducing kernel Hilbert space. It is particularly appropriate for certain multivariate smoothing problems with irregularly spaced data, and certain remote sensing problems, such as those that occur in meteorology, where the sensors are arranged irregularly. The algorithm is applied to the fitting of interaction spline models with irregularly spaced data and two smoothing parameters, and favorable timing results are presented. The algorithm may be extended to the computation of certain GML (generalized maximum likelihood) functions. Application of the GML algorithm

Keywords

SmoothingSmoothing splineRegularization (linguistics)Cross-validationComputationMathematicsAlgorithmSpline (mechanical)Kernel (algebra)Reproducing kernel Hilbert spaceMathematical optimizationBasis functionHilbert spaceApplied mathematicsComputer scienceSpline interpolationArtificial intelligenceCombinatoricsMathematical analysisStatistics

Affiliated Institutions

Related Publications

Publication Info

Year
1989
Type
article
Volume
10
Issue
4
Pages
457-480
Citations
80
Access
Closed

Citation Metrics

80
OpenAlex
1
Influential
56
CrossRef

Cite This

Chong Gu, Douglas M. Bates, Zehua Chen et al. (1989). The Computation of Generalized Cross-Validation Functions Through Householder Tridiagonalization with Applications to the Fitting of Interaction Spline Models. SIAM Journal on Matrix Analysis and Applications , 10 (4) , 457-480. https://doi.org/10.1137/0610033

Identifiers

DOI
10.1137/0610033

Data Quality

Data completeness: 77%