Supermix: sparse regularization for mixtures
From MaRDI portal
Publication:820833
Abstract: This paper investigates the statistical estimation of a discrete mixing measure 0 involved in a kernel mixture model. Using some recent advances in l1-regularization over the space of measures, we introduce a "data fitting and regularization" convex program for estimating 0 in a grid-less manner from a sample of mixture law, this method is referred to as Beurling-LASSO. Our contribution is twofold: we derive a lower bound on the bandwidth of our data fitting term depending only on the support of 0 and its so-called "minimum separation" to ensure quantitative support localization error bounds; and under a so-called "non-degenerate source condition" we derive a non-asymptotic support stability property. This latter shows that for a sufficiently large sample size n, our estimator has exactly as many weighted Dirac masses as the target 0 , converging in amplitude and localization towards the true ones. Finally, we also introduce some tractable algorithms for solving this convex program based on "Sliding Frank-Wolfe" or "Conic Particle Gradient Descent". Statistical performances of this estimator are investigated designing a so-called "dual certificate", which is appropriate to our setting. Some classical situations, as e.g. mixtures of super-smooth distributions (e.g. Gaussian distributions) or ordinary-smooth distributions (e.g. Laplace distributions), are discussed at the end of the paper.
Recommendations
- Stable separation and super-resolution of mixture models
- A deconvolution path for mixtures
- Support recovery for sparse super-resolution of positive measures
- Multi-kernel unmixing and super-resolution using the modified matrix pencil method
- The Support Reduction Algorithm for Computing Non‐Parametric Function Estimates in Mixture Models
Cites work
- scientific article; zbMATH DE number 45848 (Why is no real title available?)
- scientific article; zbMATH DE number 1022519 (Why is no real title available?)
- scientific article; zbMATH DE number 5055767 (Why is no real title available?)
- A non asymptotic penalized criterion for Gaussian mixture model selection
- Atomic Norm Denoising With Applications to Line Spectral Estimation
- Convergence of latent mixing measures in finite and infinite mixture models
- Deconvolution problems in nonparametric statistics
- Efficient maximum likelihood estimation in semiparametric mixture models
- Exact Solutions to Super Resolution on Semi-Algebraic Domains in Higher Dimensions
- Exact reconstruction using Beurling minimal extrapolation
- Exact support recovery for sparse spikes deconvolution
- Finite mixture and Markov switching models.
- Finite mixture models
- Maximum Likelihood: An Introduction
- On the convergence properties of the EM algorithm
- On the optimal rates of convergence for nonparametric deconvolution problems
- Parameter recovery in two-component contamination mixtures: the \(L^2\) strategy
- SPADES and mixture models
- Semiparametric Mixtures of Symmetric Distributions
- Semiparametric estimation of a two-component mixture model
- Singularity, misspecification and the convergence rate of EM
- Spike detection from inaccurate samplings
- Statistical guarantees for the EM algorithm: from population to sample-based analysis
- Strong identifiability and optimal minimax rates for finite mixture estimation
- The sliding Frank-Wolfe algorithm and its application to super-resolution microscopy
- Towards a Mathematical Theory of Super‐resolution
- Universality, Characteristic Kernels and RKHS Embedding of Measures
Cited in
(3)
This page was built for publication: Supermix: sparse regularization for mixtures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q820833)
