Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularization

01/06/2019
by   Michael Weylandt, et al.
0

Convex clustering is a promising new approach to the classical problem of clustering, combining strong performance in empirical studies with rigorous theoretical foundations. Despite these advantages, convex clustering has not been widely adopted, due to its computationally intensive nature and its lack of compelling visualizations. To address these impediments, we introduce Algorithmic Regularization, an innovative technique for obtaining high-quality estimates of regularization paths using an iterative one-step approximation scheme. We justify our approach with a novel theoretical result, guaranteeing global convergence of the approximate path to the exact solution under easily-checked non-data-dependent assumptions. The application of algorithmic regularization to convex clustering yields the Convex Clustering via Algorithmic Regularization Paths (CARP) algorithm for computing the clustering solution path. On example data sets from genomics and text analysis, CARP delivers over a 100-fold speed-up over existing methods, while attaining a finer approximation grid than standard methods. Furthermore, CARP enables improved visualization of clustering solutions: the fine solution grid returned by CARP can be used to construct a convex clustering-based dendrogram, as well as forming the basis of a dynamic path-wise visualization based on modern web technologies. Our methods are implemented in the open-source R package clustRviz, available at https://github.com/DataSlingers/clustRviz.

READ FULL TEXT
research
01/06/2019

Dynamic Visualization and Fast Computation for Convex Clustering and Bi-Clustering

Convex clustering is a promising new approach to the classical problem o...
research
09/08/2019

On the connections between algorithmic regularization and penalization for convex losses

In this work we establish the equivalence of algorithmic regularization ...
research
10/29/2020

An Exact Solution Path Algorithm for SLOPE and Quasi-Spherical OSCAR

Sorted L_1 penalization estimator (SLOPE) is a regularization technique ...
research
07/07/2021

An algorithmic view of ℓ_2 regularization and some path-following algorithms

We establish an equivalence between the ℓ_2-regularized solution path fo...
research
06/07/2023

Towards High-Performance Exploratory Data Analysis (EDA) Via Stable Equilibrium Point

Exploratory data analysis (EDA) is a vital procedure for data science pr...
research
08/05/2014

Convex Biclustering

In the biclustering problem, we seek to simultaneously group observation...
research
08/10/2022

Moreau–Yosida regularization in DFT

Moreau-Yosida regularization is introduced into the framework of exact D...

Please sign up or login with your details

Forgot password? Click here to reset