SinSim: Sinkhorn-Regularized SimCLR
M. Hadi Sepanj, Paul Fiegth
TL;DR
SinSim addresses the lack of global geometric regularization in self-supervised contrastive learning by integrating Sinkhorn regularization into the SimCLR framework. It adds an entropy-regularized optimal transport objective on intermediate representations $h$ while preserving standard contrastive learning on final embeddings $z$, yielding a geometry-aware latent space. The paper provides theoretical justification for dispersion and demonstrates improved linear and nonlinear classification performance across MNIST, CIFAR-10/100, and STL-10, complemented by UMAP visualizations showing clearer class separation. These results suggest that transport-based regularization is a viable tool to produce robust, well-structured representations and can be extended to larger-scale and multimodal settings.
Abstract
Self-supervised learning has revolutionized representation learning by eliminating the need for labeled data. Contrastive learning methods, such as SimCLR, maximize the agreement between augmented views of an image but lack explicit regularization to enforce a globally structured latent space. This limitation often leads to suboptimal generalization. We propose SinSim, a novel extension of SimCLR that integrates Sinkhorn regularization from optimal transport theory to enhance representation structure. The Sinkhorn loss, an entropy-regularized Wasserstein distance, encourages a well-dispersed and geometry-aware feature space, preserving discriminative power. Empirical evaluations on various datasets demonstrate that SinSim outperforms SimCLR and achieves competitive performance against prominent self-supervised methods such as VICReg and Barlow Twins. UMAP visualizations further reveal improved class separability and structured feature distributions. These results indicate that integrating optimal transport regularization into contrastive learning provides a principled and effective mechanism for learning robust, well-structured representations. Our findings open new directions for applying transport-based constraints in self-supervised learning frameworks.
