Sign inGet started
Paper · arXiv

SMI: Efficient Self-Supervised Learning via Mutual-Information-Inspired Dependency Optimization

Self-supervised learning (SSL) has achieved remarkable representation learning performance, but many existing methods rely on large batch sizes, memory banks, momentum encoders, or global synchronization mechanisms that substantially increase computational cost and training complexity. In this work, we propose Semantic Mutual Information (SMI), a lightweight self-supervised objective derived from a mutual-information-inspired dependency formulation under Gaussian assumptions. Unlike conventional correlation matching objectives that operate on high-dimensional feature correlation matrices, SMI performs optimization on a sample-level dependency matrix through a nonlinear transformation of p...

AuthorsPritam Mishra, Coloma Ballester, Dimosthenis Karatzas
Primary categorycs.CV
Published6 June 2026
Last updated at source6 June 2026
cs.CV
Embed this entry
<iframe src="https://silytics.si/embed/item/70442074-1936-4d21-a708-33a9b6d729be" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.