Learnable Subspace Clustering

TL;DR

This paper introduces a learnable subspace clustering approach that efficiently handles million-scale datasets by learning a parametric function to partition high-dimensional data into low-dimensional subspaces, outperforming existing methods in speed and accuracy.

Contribution

It proposes a novel learnable paradigm with a unified robust predictive coding machine for large-scale subspace clustering, addressing scalability issues of prior methods.

Findings

Outperforms state-of-the-art methods on million-scale datasets

Achieves significant improvements in efficiency and effectiveness

First to cluster millions of data points among subspace clustering methods

Abstract

This paper studies the large-scale subspace clustering (LSSC) problem with million data points. Many popular subspace clustering methods cannot directly handle the LSSC problem although they have been considered as state-of-the-art methods for small-scale data points. A basic reason is that these methods often choose all data points as a big dictionary to build huge coding models, which results in a high time and space complexity. In this paper, we develop a learnable subspace clustering paradigm to efficiently solve the LSSC problem. The key idea is to learn a parametric function to partition the high-dimensional subspaces into their underlying low-dimensional subspaces instead of the expensive costs of the classical coding models. Moreover, we propose a unified robust predictive coding machine (RPCM) to learn the parametric function, which can be solved by an alternating minimization algorithm. In addition, we provide a bounded contraction analysis of the parametric function. To the best of our knowledge, this paper is the first work to efficiently cluster millions of data points among the subspace clustering methods. Experiments on million-scale datasets verify that our paradigm outperforms the related state-of-the-art methods in both efficiency and effectiveness.