Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularizationstat.ML
CARP speeds up convex clustering by 100x and offers better visualization.
problem Computational intensity and lack of compelling visualizations in convex clustering.
method Algorithmic Regularization for iterative approximation of regularization paths.
result CARP delivers over 100-fold speed-up and finer approximation grid.