AI & ML
Centroid Spectral Coupling: Implicit Alignment and Representation Diversity in Self-Supervised Learning
arXiv stat.ML0 views
arXiv:2611.22158v1 Announce Type: cross Abstract: Self-Supervised Learning (SSL) aims to align augmented views while preserving representation diversity and preventing collapse. Existing non-contrastive methods often address these goals using multiple weighted loss terms. We introduce Centroid Spectral Coupling (CSC), a single-term SSL objective that implicitly couples view alignment, representation diversity, and collapse resistance. CSC constructs centroids from independently normalized augmented-view pairs and applies a ridge-based spectral objective to their uncentered second-moment matrix. Preserving centroid magnitudes encodes view agreement while encouraging balanced representation energy across spectral directions. We establish an exact decomposition into nonnegative alignment and spectral-imbalance components, characterize the geometry of global optima, and derive finite-loss guarantees for alignment and diversity. We also show that complete constant-output collapse is a strict saddle in normalized representation space. Experiments on CIFAR-10, CIFAR-100, and Imagenette show that CSC achieves the highest linear Top-1 accuracy among the evaluated non-contrastive methods on all three benchmarks, and the highest kNN Top-1 accuracy on both CIFAR datasets. A ridge-parameter sensitivity study reveals an empirical alignment--diversity trade-off: increasing $\kappa$ strengthens view alignment but reduces representation effective rank. These results show that a unified spectral objective yields competitive visual representations without explicit contrastive negatives or separately weighted alignment and diversity penalties.
Source:https://arxiv.org/abs/2611.22158PreviousCOSI: A Framework for Robustly Valid InferenceNextTraining Neural Networks to be Locally Adaptive
Related posts
Discontinuity-Aware Solvers for Vapor-Compression Cycles
0arXiv cs.NA
Memorization capacity of deep ReLU neural networks characterized by width and depth
0arXiv cs.NA
Time-Delayed Transformers for Data-Driven Modeling of Low-Dimensional Dynamics
0arXiv cs.NA
First-order methods for stochastic and finite-sum convex optimization with deterministic constraints
0arXiv cs.NA
Smooth Surfaces via Nets of Geodesics
0arXiv cs.NA
A Large Gap between Galerkin Errors with and without Mesh-Uniform Regularity for the KdV Equation with Boundary Dissipation
0arXiv cs.NA