A New Computational Approach to Density Estimation with Semidefinite Programming

نویسندگان

  • Tadayoshi Fushiki
  • Shingo Horiuchi
  • Takashi Tsuchiya
چکیده

Density estimation is a classical and important problem in statistics. The aim of this paper is to develop a new computational approach to density estimation based on semidefinite programming (SDP), a new technology developed in optimization in the last decade. We express a density as the product of a nonnegative polynomial and a base density such as normal distribution, exponential distribution and uniform distribution. The difficult nonnegativity constraint imposed on the polynomial is expressed as a semidefinite constraint. Under the condition that the base density is specified, the maximum likelihood estimation of the coefficients of the polynomial is formulated as a variant of SDP which can be solved in polynomial-time with the recently developed interior-point methods. Since the base density typically contains just one or two parameters, if the likelihood function is easily maximized with respect to the polynomial part by SDP, then it is possible to compute the global maximum of the likelihood function by further maximizing the partially-maximized likelihood function with respect to the base density parameter. The primal-dual interior-point algorithms are used to solve the variant of SDP. The proposed model is flexible enough to express such properties as unimodality and symmetry which would be reasonably imposed on the density function. AIC (Akaike information criterion) is used to choose the best model. Through applications to several instances we demonstrate flexibility of the model and performance of the proposed procedure. ∗The Institute of Statistical Mathematics, 4-6-7 Minami-Azabu, Minato-ku, Tokyo 106-8569, JAPAN. e-mail: [email protected] †Access Network Service Systems Laboratories, NTT Corp., Makuhari, Chiba, 261-0023 Japan. e-mail: [email protected] ‡The Institute of Statistical Mathematics, 4-6-7 Minami-Azabu, Minato-ku, Tokyo 106-8569, JAPAN. email: [email protected] . This research was partially supported by the Ministry of Education, Science, Sports and Culture, Grant-in-Aid for Scientific Research (C), 15510144, 2003.

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

ثبت نام

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

منابع مشابه

Shape constrained estimation using nonnegative splines

We consider the problem of nonparametric estimation of unknown smooth functions in the presence of restrictions on the shape of the estimator and on its support, using polynomial splines. We provide a general computational framework that treats these estimation problems in a unified manner, without the limitations of the existing methods. Applications of our approach include computing optimal s...

متن کامل

A Maximum Likelihood Approach to Density Estimation with Semidefinite Programming

Density estimation plays an important and fundamental role in pattern recognition, machine learning, and statistics. In this article, we develop a parametric approach to univariate (or low-dimensional) density estimation based on semidefinite programming (SDP). Our density model is expressed as the product of a nonnegative polynomial and a base density such as normal distribution, exponential d...

متن کامل

A path following interior-point algorithm for semidefinite optimization problem based on new kernel function

In this paper, we deal to obtain some new complexity results for solving semidefinite optimization (SDO) problem by interior-point methods (IPMs). We define a new proximity function for the SDO by a new kernel function. Furthermore we formulate an algorithm for a primal dual interior-point method (IPM) for the SDO by using the proximity function and give its complexity analysis, and then we sho...

متن کامل

A path-following infeasible interior-point algorithm for semidefinite programming

We present a new algorithm obtained by changing the search directions in the algorithm given in [8]. This algorithm is based on a new technique for finding the search direction and the strategy of the central path. At each iteration, we use only the full Nesterov-Todd (NT)step. Moreover, we obtain the currently best known iteration bound for the infeasible interior-point algorithms with full NT...

متن کامل

A Recurrent Neural Network Model for Solving Linear Semidefinite Programming

In this paper we solve a wide rang of Semidefinite Programming (SDP) Problem by using Recurrent Neural Networks (RNNs). SDP is an important numerical tool for analysis and synthesis in systems and control theory. First we reformulate the problem to a linear programming problem, second we reformulate it to a first order system of ordinary differential equations. Then a recurrent neural network...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2003