The theory and application of penalized methods or reproducing Kernel Hilbert spaces made easy

9Citations
Citations of this article
45Readers
Mendeley users who have this article in their library.

Abstract

The popular cubic smoothing spline estimate of a regression function arises as the minimizer of the penalized sum of squares ∑j(Yj-μ(tj))2+λ∫ba[μ′′(t)]2dt, where the data are tj,Yj, j=1,...,n. The minimization is taken over an infinite-dimensional function space, the space of all functions with square integrable second derivatives. But the calculations can be carried out in a finite-dimensional space. The reduction from minimizing over an infinite dimensional space to minimizing over a finite dimensional space occurs for more general objective functions: the data may be related to the function μ in another way, the sum of squares may be replaced by a more suitable expression, or the penalty, ∫ba[μ′′(t)]2dt, might take a different form. This paper reviews the Reproducing Kernel Hilbert Space structure that provides a finite-dimensional solution for a general minimization problem. Particular attention is paid to the construction and study of the Reproducing Kernel Hilbert Space corresponding to a penalty based on a linear differential operator. In this case, one can often calculate the minimizer explicitly, using Green's functions. © 2013 The author, under a Creative Commons Attribution License.

Cite

CITATION STYLE

APA

Heckman, N. (2012). The theory and application of penalized methods or reproducing Kernel Hilbert spaces made easy. Statistics Surveys, 6(1), 113–141. https://doi.org/10.1214/12-SS101

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free