Smoothing spline Gaussian regression: more scalable computation via efficient approximation

By Young-Ju Kim, Chong Gu. 2004

321 citations recorded by the source corpus.

Summary.  Smoothing splines via the penalized least squares method provide versatile and effective nonparametric models for regression with Gaussian responses. The computation of smoothing splines is generally of the order O(n3), n being the sample size, which severely limits its practical applicability. We study more scalable computation of smoothing spline regression via certain low dimensional approximations that are asymptotically as efficient. A simple algorithm is presented and the Bayes model that is associated with the approximations is derived, with the latter guiding the porting of Bayesian confidence intervals. The practical choice of the dimension of the approximating space is determined through simulation studies, and empirical comparisons of the approximations with the exact solution are presented. Also evaluated is a simple modification of the generalized cross‐validation method for smoothing parameter selection, which to a large extent fixes the occasional undersmoothing problem that is suffered by generalized cross‐validation.

Subfields: Analytical Chemistry, Artificial Intelligence, Statistics and Probability

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Analytical Chemistry

  1. Simon N. Wood
  2. Stelios Katsanevakis
  3. Giampiero Marra
  4. Rosalba Radice
  5. Ping Ma
  6. Jay Barlow
  7. Chong Gu
  8. Sylvie Charlot

In Artificial Intelligence

  1. Simon N. Wood
  2. Stelios Katsanevakis
  3. Giampiero Marra
  4. Rosalba Radice
  5. Ping Ma
  6. Jay Barlow
  7. Chong Gu
  8. Margaux Zaffran

In Statistics and Probability

  1. Simon N. Wood
  2. Giampiero Marra
  3. Stelios Katsanevakis
  4. Jay Barlow
  5. Antonio Musolesi
  6. R. Crescenzi
  7. Sylvie Charlot
  8. Rosalba Radice

Citations in the corpus