A Critique of Self-Expressive Deep Subspace Clustering

by   Benjamin D. Haeffele, et al.

Subspace clustering is an unsupervised clustering technique designed to cluster data that is supported on a union of linear subspaces, with each subspace defining a cluster with dimension lower than the ambient space. Many existing formulations for this problem are based on exploiting the self-expressive property of linear subspaces, where any point within a subspace can be represented as linear combination of other points within the subspace. To extend this approach to data supported on a union of non-linear manifolds, numerous studies have proposed learning an appropriate kernel embedding of the original data using a neural network, which is regularized by a self-expressive loss function on the data in the embedded space to encourage a union of linear subspaces prior on the data in the embedded space. Here we show that there are a number of potential flaws with this approach which have not been adequately addressed in prior work. In particular, we show the model formulation is often ill-posed in multiple ways, which can lead to a degenerate embedding of the data, which need not correspond to a union of subspaces at all. We validate our theoretical results experimentally and additionally repeat prior experiments reported in the literature, where we conclude that a significant portion of the previously claimed performance benefits can be attributed to an ad-hoc post processing step rather than the clustering model.



There are no comments yet.


page 8

page 19


Multilinear Subspace Clustering

In this paper we present a new model and an algorithm for unsupervised c...

Beyond Linear Subspace Clustering: A Comparative Study of Nonlinear Manifold Clustering Algorithms

Subspace clustering is an important unsupervised clustering approach. It...

Theory of Spectral Method for Union of Subspaces-Based Random Geometry Graph

Spectral Method is a commonly used scheme to cluster data points lying c...

Neural Manifold Clustering and Embedding

Given a union of non-linear manifolds, non-linear subspace clustering or...

Filtrated Algebraic Subspace Clustering

Subspace clustering is the problem of clustering data that lie close to ...

Multi-Level Representation Learning for Deep Subspace Clustering

This paper proposes a novel deep subspace clustering approach which uses...

Multiple Independent Subspace Clusterings

Multiple clustering aims at discovering diverse ways of organizing data ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.