A non-iterative algorithm to estimate the modes of univariate mixtures with well separated components
Nicolas Paul, Luc Fety, Michel Terre
Abstract
This paper deals with the estimation of the modes of an univariate mixture when the number of components is known and when the component density are well separated. We propose an algorithm based on the minimization of the "kp" criterion we introduced in a previous work. In this paper we show that the global minimum of this criterion can be reached with a linear least square minimization followed by a roots finding algorithm. This is a major advantage compared to classical iterative algorithms such as K-means or EM which suffer from the potential convergence to some local extrema of the cost function they use. Our algorithm performances are finally illustrated through simulations of a five components mixture.
Create a lesson
Related papers
Multivariate amplitude analysis of the cascade particle decays based on the Nearest Neighbors fitting
I. V. Yeletskikh, A. O. Vasyukov
The geometry of uncertainty decomposition in profile-likelihood fits
Rafael Coelho Lopes de Sá
Statistical validation of calorimeter inpainting with generative diffusion priors
Himanshu Raj, Roli Esha
Unknown Unknowns: Model Misspecification in Machine Learning for Physics
Juan Cruz-Martinez, Carolina Cuesta-Lazaro, Alexander Held et al.
Exploring new directions in enhancing the ACTS parameter optimization suite
Chance LaVoie, Qi Bin Lei, Rocky Bala Garg et al.
Analytically Consistent Reconstruction of Finite Data Using Padé Sequences
Emerson Díaz, Balma Duch, Pere Masjuan