Subspace Clustering on Incomplete Data with Self-Supervised Contrastive Learning

Huanran Li, Daniel Pimentel-Alarcón
1/30/2026
cs.CVcs.AI

No confident code implementation found for this paper.

Abstract

Subspace clustering aims to group data points that lie in a union of low-dimensional subspaces and finds wide application in computer vision, hyperspectral imaging, and recommendation systems. However, most existing methods assume fully observed data, limiting their effectiveness in real-world scenarios with missing entries. In this paper, we propose a contrastive self-supervised framework, Contrastive Subspace Clustering (CSC), designed for clustering incomplete data. CSC generates masked views of partially observed inputs and trains a deep neural network using a SimCLR-style contrastive loss to learn invariant embeddings. These embeddings are then clustered using sparse subspace clustering. Experiments on six benchmark datasets show that CSC consistently outperforms both classical and deep learning baselines, demonstrating strong robustness to missing data and scalability to large datasets.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{li2026subspace,
  title  = {Subspace Clustering on Incomplete Data with Self-Supervised Contrastive Learning},
  author = {Huanran Li and Daniel Pimentel-Alarcón},
  year   = {2026},
  eprint = {2602.00262},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2602.00262v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2602.00262.svg)](https://codeofpaper.com/paper/2602.00262)

Discussion