SuperMix: Sparse Regularization for Mixtures

2019-07-23 · Yohann de Castro, Sébastien Gadat, Clément Marteau, Cathy Maugis

This paper investigates the statistical estimation of a discrete mixing measure $\mu$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 $\mu$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 $\mu$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 $\mu$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.

📄 PDF Abstract BibTeX arXiv:1907.10592

Code (0)

등록된 구현이 없습니다.

SuperMix: Supervising the Mixing Data Augmentation

2020-03-10 · CVPR 2021 1 · Ali Dabouei, Sobhan Soleymani, Fariborz Taherkhani, Nasser M. Nasrabadi

This paper presents a supervised mixing augmentation method termed SuperMix, which exploits the salient regions within input images to construct mixed training samples. SuperMix is designed to obtain mixed images rich in…

Data Augmentation General Classification Knowledge Distillation

Bayesian sparse convex clustering via global-local shrinkage priors

2019-11-20 · Kaito Shimamura, Shuichi. Kawano

Sparse convex clustering is to cluster observations and conduct variable selection simultaneously in the framework of convex clustering. Although a weighted $L_1$ norm is usually employed for the regularization term in s…

Clustering Variable Selection

Hidden Markov Models and their Application for Predicting Failure Events

2020-05-20 · Paul Hofmann, Zaid Tashman

We show how Markov mixed membership models (MMMM) can be used to predict the degradation of assets. We model the degradation path of individual assets, to predict overall failure rates. Instead of a separate distribution…

Transfer Learning

Sparse Domain Transfer via Elastic Net Regularization

2024-05-13 · Jingwei Zhang, Farzan Farnia

Transportation of samples across different domains is a central task in several machine learning problems. A sensible requirement for domain transfer tasks in computer vision and language domains is the sparsity of the t…

feature selection

On the Aggregation of Probability Assessments: Regularized Mixtures of Predictive Densities for Eurozone Inflation and Real Interest Rates

2020-12-21 · Francis X. Diebold, Minchul Shin, Boyuan Zhang

We propose methods for constructing regularized mixtures of density forecasts. We explore a variety of objectives and regularization penalties, and we use them in a substantive exploration of Eurozone inflation and real …