Selective inference after convex clustering with $\ell_1$ penalization - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2023

Selective inference after convex clustering with $\ell_1$ penalization

Résumé

Classical inference methods notoriously fail when applied to data-driven test hypotheses or inference targets. Instead, dedicated methodologies are required to obtain statistical guarantees for these selective inference problems. Selective inference is particularly relevant post-clustering, typically when testing a difference in mean between two clusters. In this paper, we address convex clustering with $\ell_1$ penalization, by leveraging related selective inference tools for regression, based on Gaussian vectors conditioned to polyhedral sets. In the one-dimensional case, we prove a polyhedral characterization of obtaining given clusters, than enables us to suggest a test procedure with statistical guarantees. This characterization also allows us to provide a computationally efficient regularization path algorithm. Then, we extend the above test procedure and guarantees to multi-dimensional clustering with $\ell_1$ penalization, and also to more general multi-dimensional clusterings that aggregate one-dimensional ones. With various numerical experiments, we validate our statistical guarantees and we demonstrate the power of our methods to detect differences in mean between clusters. Our methods are implemented in the R package poclin.
Fichier principal
Vignette du fichier
2309.01492.pdf (1.57 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04200062 , version 1 (08-09-2023)

Licence

Paternité

Identifiants

Citer

François Bachoc, Cathy Maugis, Pierre Neuvial. Selective inference after convex clustering with $\ell_1$ penalization. 2023. ⟨hal-04200062⟩
90 Consultations
14 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More