Self-Supervised Learning by Curvature Alignment

Generative AI & LLMs
Published: arXiv: 2511.17426v1
Authors

Benyamin Ghojogh M. Hadi Sepanj Paul Fieguth

Abstract

Self-supervised learning (SSL) has recently advanced through non-contrastive methods that couple an invariance term with variance, covariance, or redundancy-reduction penalties. While such objectives shape first- and second-order statistics of the representation, they largely ignore the local geometry of the underlying data manifold. In this paper, we introduce CurvSSL, a curvature-regularized self-supervised learning framework, and its RKHS extension, kernel CurvSSL. Our approach retains a standard two-view encoder-projector architecture with a Barlow Twins-style redundancy-reduction loss on projected features, but augments it with a curvature-based regularizer. Each embedding is treated as a vertex whose $k$ nearest neighbors define a discrete curvature score via cosine interactions on the unit hypersphere; in the kernel variant, curvature is computed from a normalized local Gram matrix in an RKHS. These scores are aligned and decorrelated across augmentations by a Barlow-style loss on a curvature-derived matrix, encouraging both view invariance and consistency of local manifold bending. Experiments on MNIST and CIFAR-10 datasets with a ResNet-18 backbone show that curvature-regularized SSL yields competitive or improved linear evaluation performance compared to Barlow Twins and VICReg. Our results indicate that explicitly shaping local geometry is a simple and effective complement to purely statistical SSL regularizers.

Paper Summary

Problem
The main problem addressed in this research paper is the limitation of current self-supervised learning (SSL) methods in capturing the local geometry of the underlying data manifold. These methods often rely on statistical regularizers that shape first- and second-order statistics of the representation, but ignore the local curvature of the data.
Key Innovation
The authors introduce a new self-supervised learning framework called CurvSSL, which augments a standard two-view encoder-projector architecture with a curvature-based regularizer. This regularizer encourages the alignment and decorrelation of local curvature scores across augmentations and samples, promoting both view invariance and consistency of local manifold bending.
Practical Impact
The proposed CurvSSL method has several practical implications. Firstly, it can be easily integrated into existing two-view pipelines, making it a simple and effective complement to standard SSL regularizers. Secondly, the method's ability to capture local geometry can improve the performance of SSL on manifold-sensitive tasks such as semi-supervised learning and retrieval. Finally, the kernel extension of CurvSSL enables its application to larger datasets and more complex architectures.
Analogy / Intuitive Explanation
Imagine a landscape with hills and valleys, where each point represents a data sample. Traditional SSL methods focus on the overall shape of the landscape, but ignore the local curvature of each hill or valley. CurvSSL, on the other hand, uses a "compass" to measure the curvature of each point, and encourages the alignment of these compass readings across different views of the landscape. This helps the model capture the local geometry of the data, leading to better performance on tasks that require understanding the intricate structure of the data.
Paper Information
Categories:
cs.LG cs.CV stat.ML
Published Date:

arXiv ID:

2511.17426v1

Quick Actions