Kernel smoother explained

f: R ^{p} \to R as the weighted average of neighboring observed data. The weight is defined by the kernel, such that closer points are given higher weights. The estimated function is smooth, and the level of smoothness is set by a single parameter.Kernel smoothing is a type of weighted moving average.

Definitions

Let

K _{h _{λ}} (X _{0} ,X) be a kernel defined byK _{h _{λ}} (X _{0} ,X) = D\left( (\left\| X - X _{0} \right\|)/(h _{λ} (X _{0)}) \right)

where:

X,X _{0} \in R ^{p} \left\| ⋅ \right\| is the Euclidean normh _{λ} (X _{0)} is a parameter (kernel radius)

• D(t) is typically a positive real valued function, whose value is decreasing (or not increasing) for the increasing distance between the X and X₀.

Popular kernels used for smoothing include parabolic (Epanechnikov), Tricube, and Gaussian kernels.

Let

Y(X): R ^{p} \to R be a continuous function of X. For each X _{0} \in R ^{p} , the Nadaraya-Watson kernel-weighted average (smooth Y(X) estimation) is defined by\hat{Y}(X _{0} ) = (\sum\limits ^{N} _{i =1} {K _{h _{λ}} (X _{0} ,X _{i} )Y(X _{i} ))/() }

where:

• N is the number of observed points
• Y(X_i) are the observations at X_i points.

In the following sections, we describe some particular cases of kernel smoothers.

Gaussian kernel smoother

The Gaussian kernel is one of the most widely used kernels, and is expressed with the equation below.

K(x ^{*,x} _{i) = \exp\left( - ((x ^{2} _{i)})/(2 b ^{2})} \right)

Here, b is the length scale for the input space.

Nearest neighbor smoother

The k-nearest neighbor algorithm can be used for defining a k-nearest neighbor smoother as follows. For each point X₀, take m nearest neighbors and estimate the value of Y(X₀) by averaging the values of these neighbors.

Formally,

h _{m} (X _{0)=\left\|} X _{0} - X _{[m]} \right\| , where X _{[m]} is the mth closest to X₀ neighbor, andD(t) = \begin{cases} 1 /m & if |t| \le 1 \\ 0 & otherwise \end{cases}

Example:

In this example, X is one-dimensional. For each X₀, the

\hat{Y}(X _{0)} is an average value of 16 closest to X₀ points (denoted by red).

Kernel average smoother

The idea of the kernel average smoother is the following. For each data point X₀, choose a constant distance size λ (kernel radius, or window width for p = 1 dimension), and compute a weighted average for all data points that are closer than

λ to X₀ (the closer to X₀ points get higher weights).

Formally,

h _{λ} (X _{0)=λ} = constant , and D(t) is one of the popular kernels.

Example:

For each X₀ the window width is constant, and the weight of each point in the window is schematically denoted by the yellow figure in the graph. It can be seen that the estimation is smooth, but the boundary points are biased. The reason for that is the non-equal number of points (from the right and from the left to the X₀) in the window, when the X₀ is close enough to the boundary.

Local regression

See main article: Local regression.

Local linear regression

In the two previous sections we assumed that the underlying Y(X) function is locally constant, therefore we were able to use the weighted average for the estimation. The idea of local linear regression is to fit locally a straight line (or a hyperplane for higher dimensions), and not the constant (horizontal line). After fitting the line, the estimation

\hat{Y}(X _{0} ) is provided by the value of this line at X₀ point. By repeating this procedure for each X₀, one can get the estimation function \hat{Y}(X) .Like in previous section, the window width is constant h _{λ} (X _{0)=λ} = constant . Formally, the local linear regression is computed by solving a weighted least square problem.

For one dimension (p = 1):

\begin{align} & min _{\alpha (X _{0),\beta} (X _{0)}} \sum\limits ^{N} _{i =1} {K _{h _{λ}} (X _{0,X} _{i)\left(} Y(X _{i)-\alpha} (X _{0)-\beta} (X _{0} )X _{i} \right) ^{2}} \ & \Downarrow \ & \hat{Y}(X _{0} ) = \alpha (X _{0} ) + \beta (X _{0} )X _{0} \ \end{align}

The closed form solution is given by:

\hat{Y}(X _{0)=\left(} 1 ,X _{0} \right)\left( B ^{T} W(X _{0)B} \right) ^{-1} B ^{T} W(X _{0)y}

where:

y = \left( Y(X _{1),...,Y(X} _{N)} \right) ^{T} W(X _{0)=} \operatorname{diag} \left( K _{h _{λ}} (X _{0,X} _{i)} \right) _{N x} B ^{T} = \left( \begin{matrix} 1 & 1 & ... & 1 \\ X _{1} & X _{2} & ... & X _{N} \\ \end{matrix} \right) Example:

The resulting function is smooth, and the problem with the biased boundary points is reduced.

Local linear regression can be applied to any-dimensional space, though the question of what is a local neighborhood becomes more complicated. It is common to use k nearest training points to a test point to fit the local linear regression. This can lead to high variance of the fitted function. To bound the variance, the set of training points should contain the test point in their convex hull (see Gupta et al. reference).

Local polynomial regression

Instead of fitting locally linear functions, one can fit polynomial functions.For p=1, one should minimize:

\underset{\alpha (X _{0} ),\beta _{j} (X _{0} ),j =1 ,...,d}{ min }\,\sum\limits_^

with

\hat{Y}(X _{0} ) = \alpha (X _{0} ) + \sum\limits ^{d} _{j =1} {\beta _{j} (X _{0} )X ^{j} _{0} }

In general case (p>1), one should minimize:

\begin{align} & \hat{\beta }(X _{0} ) = \underset{\beta (X _{0} )}{ \argmin }\,\sum\limits_^^ \\ & b(X)=\left(\begin 1, & X_, & X_,... & X_^, & X_^,... & X_X_\,\,\,... \\\end \right) \\ & \hat(X_)=b(X_)^\hat(X_) \\ \end

See also

• Savitzky–Golay filter
• Kernel methods
• Kernel density estimation
• Local regression
• Kernel regression

References

• Li, Q. and J.S. Racine. Nonparametric Econometrics: Theory and Practice. Princeton University Press, 2007, .
• T. Hastie, R. Tibshirani and J. Friedman, The Elements of Statistical Learning, Chapter 6, Springer, 2001. (companion book site).
• M. Gupta, E. Garcia and E. Chin, "Adaptive Local Linear Regression with Application to Printer Color Management," IEEE Trans. Image Processing 2008.