Bridging Mini-Batch and Asymptotic Analysis in Contrastive Learning: From InfoNCE to Kernel-Based Losses
<|reference_start|>Bridging Mini-Batch and Asymptotic Analysis in Contrastive Learning: From InfoNCE to Kernel-Based Losses: What do different contrastive learning (CL) losses actually optimize for? Although multiple CL methods have demonstrated remarkable representation learning capabilities, the differences in their inner workings remain largely opaque. In this work, we analyse several CL families and prove that, under certain conditions, they admit the same minimisers when optimizing either their batch-level objectives or their expectations asymptotically. In both cases, an intimate connection with the hyperspherical energy minimisation (HEM) problem resurfaces. Drawing inspiration from this, we introduce a novel CL objective, coined Decoupled Hyperspherical Energy Loss (DHEL). DHEL simplifies the problem by decoupling the target hyperspherical energy from the alignment of positive examples while preserving the same theoretical guarantees. Going one step further, we show the same results hold for another relevant CL family, namely kernel contrastive learning (KCL), with the additional advantage of the expected loss being independent of batch size, thus identifying the minimisers in the non-asymptotic regime. Empirical results demonstrate improved downstream performance and robustness across combinations of different batch sizes and hyperparameters and reduced dimensionality collapse, on several computer vision datasets.<|reference_end|>
@article{koromilas2024bridging,
    title={Bridging Mini-Batch and Asymptotic Analysis in Contrastive Learning:
  From InfoNCE to Kernel-Based Losses},
    author={Panagiotis Koromilas, Giorgos Bouritsas, Theodoros Giannakopoulos,
  Mihalis Nicolaou, Yannis Panagakis},
    journal={arXiv preprint arXiv:2405.18045},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.18045},
    primaryClass={cs.LG cs.CV}
}