Selective inference after convex clustering with ${\ell }_1$ penalization

Abstract

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.

40 pages, 12 figures

References in corpus (9)

• Valid post-selection inference
• The solution path of the generalized lasso
• Exact post-selection inference, with application to the lasso
• Splitting Methods for Convex Clustering
• Convergence of latent mixing measures in finite and infinite mixture models
• Sparse Convex Clustering
• Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularization
• Generalized Data Thinning Using Sufficient Statistics
• Non-asymptotic detection of two-component mixtures with unknown means