Optimal Boundary Kernels and Weightings for Local Polynomial Regression

03/16/2018
by   Alexander Sidorenko, et al.
0

Kernel smoothers are considered near the boundary of the interval. Kernels which minimize the expected mean square error are derived. These kernels are equivalent to using a linear weighting function in the local polynomial regression. It is shown that any kernel estimator that satisfies the moment conditions up to order m is equivalent to a local polynomial regression of order m with some non-negative weight function if and only if the kernel has at most m sign changes. A fast algorithm is proposed for computing the kernel estimate in the boundary region for an arbitrary placement of data points.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/16/2018

Sufficient Conditions for a Linear Estimator to be a Local Polynomial Regression

It is shown that any linear estimator that satisfies the moment conditio...
research
12/22/2017

Learning the Kernel for Classification and Regression

We investigate a series of learning kernel problems with polynomial comb...
research
10/28/2020

Kernel Aggregated Fast Multipole Method: Efficient summation of Laplace and Stokes kernel functions

Many different simulation methods for Stokes flow problems involve a com...
research
08/03/2022

Estimating the Spectral Density at Frequencies Near Zero

Estimating the spectral density function f(w) for some w∈ [-π, π] has be...
research
05/28/2020

Boundary-free Kernel-smoothed Goodness-of-fit Tests for Data on General Interval

We propose kernel-type smoothed Kolmogorov-Smirnov and Cramér-von Mises ...
research
12/27/2017

Sketching for Kronecker Product Regression and P-splines

TensorSketch is an oblivious linear sketch introduced in Pagh'13 and lat...
research
07/11/2012

On-line Prediction with Kernels and the Complexity Approximation Principle

The paper describes an application of Aggregating Algorithm to the probl...

Please sign up or login with your details

Forgot password? Click here to reset