LaFAM: Unsupervised Feature Attribution with Label-free Activation Maps
Aray Karjauv, Sahin Albayrak
TL;DR
The paper addresses explainability for CNNs in the absence of labels, particularly within self-supervised learning (SSL). It introduces Label-free Activation Map (LaFAM), which computes a label-free saliency map by averaging activations across channels at a chosen convolutional layer and normalizing/up-sampling the result to the input size, yielding $M_ ext{LaFAM} = \text{Up}\left( N\left(\bar{A}^l\right)\right)$ with $\bar{A}^l_{i,j} = \frac{1}{K}\sum_{k=1}^{K} A_{i,j}^{l,k}$; this avoids labels and enables efficient post-hoc explanations from a single forward pass. Empirically, LaFAM outperforms RELAX across SSL benchmarks on ImageNet-S and PASCAL VOC 2012, while remaining competitive with Grad-CAM in supervised settings and capable of highlighting multiple concepts in complex scenes. The approach expands the XAI toolbox with a robust, label-free, and computationally efficient saliency method suitable for both SSL and supervised tasks, facilitating better inspection of model behavior without relying on class predictions. The work also provides code and a live demo to support reproducibility and broader adoption.
Abstract
Convolutional Neural Networks (CNNs) are known for their ability to learn hierarchical structures, naturally developing detectors for objects, and semantic concepts within their deeper layers. Activation maps (AMs) reveal these saliency regions, which are crucial for many Explainable AI (XAI) methods. However, the direct exploitation of raw AMs in CNNs for feature attribution remains underexplored in literature. This work revises Class Activation Map (CAM) methods by introducing the Label-free Activation Map (LaFAM), a streamlined approach utilizing raw AMs for feature attribution without reliance on labels. LaFAM presents an efficient alternative to conventional CAM methods, demonstrating particular effectiveness in saliency map generation for self-supervised learning while maintaining applicability in supervised learning scenarios.
