Hard Negative Sample Mining for Whole Slide Image Classification
Wentao Huang, Xiaoling Hu, Shahira Abousamra, Prateek Prasanna, Chao Chen
TL;DR
The paper tackles weakly supervised whole slide image (WSI) classification where only slide-level labels are available, and MIL-based approaches must infer instance-level information. It introduces hard negative mining during fine-tuning via supervised contrastive learning and a patch-wise multiple instance ranking loss defined as $\mathcal{L}_{MIRank} = \max(0, 1 - \frac{1}{K} \sum_{top_K} \hat{s}_{i}^p + \frac{1}{K} \sum_{top_K} \hat{s}_{i}^n)$ to separately optimize top positive and hard negative patches, integrated in an iterative MIL training loop. Experiments on Camelyon16 and TCGA-LUAD demonstrate state-of-the-art performance and notable reductions in training time when using a small fraction of hard negatives (e.g., 5%). The combined approach improves both instance-level and slide-level predictions, offering practical benefits for MIL-based WSI analysis.
Abstract
Weakly supervised whole slide image (WSI) classification is challenging due to the lack of patch-level labels and high computational costs. State-of-the-art methods use self-supervised patch-wise feature representations for multiple instance learning (MIL). Recently, methods have been proposed to fine-tune the feature representation on the downstream task using pseudo labeling, but mostly focusing on selecting high-quality positive patches. In this paper, we propose to mine hard negative samples during fine-tuning. This allows us to obtain better feature representations and reduce the training cost. Furthermore, we propose a novel patch-wise ranking loss in MIL to better exploit these hard negative samples. Experiments on two public datasets demonstrate the efficacy of these proposed ideas. Our codes are available at https://github.com/winston52/HNM-WSI
