Smooth InfoMax -- Towards Easier Post-Hoc Interpretability

Fabian Denoodt, Bart de Boer, José Oramas
8/23/2024
cs.LGcs.AI

No official code found. Best implementation: fdenoodt/Smooth-InfoMax (5 stars, MIT, last commit 2025-08-22).

Abstract

We introduce Smooth InfoMax (SIM), a self-supervised representation learning method that incorporates interpretability constraints into the latent representations at different depths of the network. Based on $β$-VAEs, SIM's architecture consists of probabilistic modules optimized locally with the InfoNCE loss to produce Gaussian-distributed representations regularized toward the standard normal distribution. This creates smooth, well-defined, and better-disentangled latent spaces, enabling easier post-hoc analysis. Evaluated on speech data, SIM preserves the large-scale training benefits of Greedy InfoMax while improving the effectiveness of post-hoc interpretability methods across layers.

View on arXivView PDF

Code Implementations(1)

MIT
50Shell, PythonOct 11, 20221 years agoMIT

Similar Papers

Cite this paper

@article{denoodt2024smooth,
  title  = {Smooth InfoMax -- Towards Easier Post-Hoc Interpretability},
  author = {Fabian Denoodt and Bart de Boer and José Oramas},
  year   = {2024},
  eprint = {2408.12936},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2408.12936v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2408.12936.svg)](https://codeofpaper.com/paper/2408.12936)

Discussion