Robust convex clustering: How does fusion penalty enhance robustness?

06/23/2019
by   Chenyu Liu, et al.
0

Convex clustering has gained popularity recently due to its desirable performance in empirical studies. It involves solving a convex optimization problem with the cost function being a squared error loss plus a fusion penalty that encourages the estimated centroids for observations in the same cluster to be identical. However, when data are contaminated, convex clustering with a squared error loss will fail to identify correct cluster memberships even when there is only one arbitrary outlier. To address this challenge, we propose a robust convex clustering method. Theoretically, we show that the new estimator is resistant to arbitrary outliers: it does not break down until more than half of the observations are arbitrary outliers. In particular, we observe a new phenomenon that the fusion penalty can help enhance robustness. Numerical studies are performed to demonstrate the competitive performance of the proposed method.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/17/2014

Outlier-Robust Convex Segmentation

We derive a convex optimization problem for the task of segmenting seque...
research
01/18/2016

Sparse Convex Clustering

Convex clustering, a convex relaxation of k-means clustering and hierarc...
research
06/05/2019

Robustness and Tractability for Non-convex M-estimators

We investigate two important properties of M-estimator, namely, robustne...
research
11/01/2021

Network Clustering for Latent State and Changepoint Detection

Network models provide a powerful and flexible framework for analyzing a...
research
09/06/2017

Clustering of Data with Missing Entries using Non-convex Fusion Penalties

The presence of missing entries in data often creates challenges for pat...
research
06/20/2021

Robust Regression via Model Based Methods

The mean squared error loss is widely used in many applications, includi...
research
12/26/2019

Second order Poincaré inequalities and de-biasing arbitrary convex regularizers when p/n → γ

A new Central Limit Theorem (CLT) is developed for random variables of t...

Please sign up or login with your details

Forgot password? Click here to reset