Hypersolid: Emergent Vision Representations via Short-Range Repulsion
Esteban Rodríguez-Betancourt, Edgar Casasola-Murillo
TL;DR
This work reframes self-supervised vision learning as a discrete packing problem and introduces Hypersolid, a method that uses short-range repulsion with an exclusion radius $\alpha$ to prevent representation collapse while preserving augmentation diversity. By combining a max-pooled alignment target with a weak $L_2$ normalization, Hypersolid promotes near-injectivity in the embedding space, achieving robust inter-class separation without sacrificing intra-class diversity. Theoretical justification ties the approach to the Data Processing Inequality and probabilistic collision avoidance, while extensive experiments show competitive ImageNet performance and clear gains on fine-grained and low-resolution datasets such as Food-101 and CIFAR-100. The work also reveals a distinct, isotropic-like latent geometry and introduces metrics like Structure Ratio and $d′$ to characterize representation separability, suggesting a shift from volume-maximization to efficient, discrete packing in SSL.
Abstract
A recurring challenge in self-supervised learning is preventing representation collapse. Existing solutions typically rely on global regularization, such as maximizing distances, decorrelating dimensions or enforcing certain distributions. We instead reinterpret representation learning as a discrete packing problem, where preserving information simplifies to maintaining injectivity. We operationalize this in Hypersolid, a method using short-range hard-ball repulsion to prevent local collisions. This constraint results in a high-separation geometric regime that preserves augmentation diversity, excelling on fine-grained and low-resolution classification tasks.
