Optimization Problems Connected with Kernel Smoothing

نویسنده

  • IVANA HOROVÁ
چکیده

The present paper is dealing with optimization problems arising in the context of kernel estimates of a density and a regression function. Kernel estimates are one of the most popular nonparametric functional estimates. These estimates depend on a bandwidth which controls the smoothness of the estimate and on a kernel which plays a role of a weight function. In this paper we concentrate on a choice of a kernel from different points of view. We deal with the problem of finding smooth optimal kernels minimizing the asymptotic mean squared error and that of smooth minimum variance kernels minimizing the asymptotic variance. The optimization problems under consideration are shown to be equivalent. Then, using the optimal control theory we arrive at the conclusion that smooth optimal kernels have to be polynomials of prescribed degree and they can be expressed in terms of the Gegenbauer polynomials. This result gives the theoretical evidence for using kernels with polynomials shapes. Key-Words: optimization problem, smooth optimal kernel, smooth minimum variance kernel

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Global Optimization via a Modified Potential Smoothing Kernel

A new potential smoothing method, the shifted-tophat (or stophat) is presented. This method uses a tophat function as the smoothing kernel, instead of the gaussian used in conventional methods. Stophat smoothing is applied, as part of the Potential Smoothing and Search (PSS) procedure for global optimization, to several biomolecular problems, including polyalanine helices, united-atom and all-a...

متن کامل

Splines with non positive kernels

Non parametric regression methods can be presented in two main clusters. The one of smoothing splines methods requiring positive kernels and the other one known as Nonparametric Kernel Regression allowing the use of non positive kernels such as the Epanechnikov kernel. We propose a generalization of the smoothing spline method to include kernels which are still symmetric but not positive semi d...

متن کامل

An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function

In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...

متن کامل

Improved Kernel Based Learning Using Smoothing Parameter Based Linear Kernels

Kernel based learning has already found wide applications to solve several data mining problems. In this paper, we proposed an improved linear kernel with automatic smoothing parameter (Sp) selection compared to the classical approach. Experiment results using some classification related benchmark datasets reveal that the improved linear kernel performed better than some existing kernel techniq...

متن کامل

Statistical Learning in Medical Data Analysis

This article provides a tour of statistical learning regularization methods that have found application in a variety of medical data analysis problems. The uniting feature of these methods is that they involve an optimization problem which balances fidelity to the data with complexity of the model. The two settings for the optimization problems considered here are Reproducing Kernel Hilbert Spa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000