Explicit Mutual Information Maximization for Self-Supervised Learning
<|reference_start|>Explicit Mutual Information Maximization for Self-Supervised Learning: Recently, self-supervised learning (SSL) has been extensively studied. Theoretically, mutual information maximization (MIM) is an optimal criterion for SSL, with a strong theoretical foundation in information theory. However, it is difficult to directly apply MIM in SSL since the data distribution is not analytically available in applications. In practice, many existing methods can be viewed as approximate implementations of the MIM criterion. This work shows that, based on the invariance property of MI, explicit MI maximization can be applied to SSL under a generic distribution assumption, i.e., a relaxed condition of the data distribution. We further illustrate this by analyzing the generalized Gaussian distribution. Based on this result, we derive a loss function based on the MIM criterion using only second-order statistics. We implement the new loss for SSL and demonstrate its effectiveness via extensive experiments.<|reference_end|>
@article{chang2024explicit,
    title={Explicit Mutual Information Maximization for Self-Supervised Learning},
    author={Lele Chang and Peilin Liu and Qinghai Guo and Fei Wen},
    journal={arXiv preprint arXiv:2409.04747},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.04747},
    primaryClass={cs.CV cs.LG}
}