Relative Difficulty Distillation for Semantic Segmentation

Dong Liang, Yue Sun, Yun Du, Songcan Chen, Sheng-Jun Huang
7/4/2024
cs.CV

No official code found. Best implementation: sunyueue/RDD (3 stars, last commit 2023-07-15).

Abstract

Current knowledge distillation (KD) methods primarily focus on transferring various structured knowledge and designing corresponding optimization goals to encourage the student network to imitate the output of the teacher network. However, introducing too many additional optimization objectives may lead to unstable training, such as gradient conflicts. Moreover, these methods ignored the guidelines of relative learning difficulty between the teacher and student networks. Inspired by human cognitive science, in this paper, we redefine knowledge from a new perspective -- the student and teacher networks' relative difficulty of samples, and propose a pixel-level KD paradigm for semantic segmentation named Relative Difficulty Distillation (RDD). We propose a two-stage RDD framework: Teacher-Full Evaluated RDD (TFE-RDD) and Teacher-Student Evaluated RDD (TSE-RDD). RDD allows the teacher network to provide effective guidance on learning focus without additional optimization goals, thus avoiding adjusting learning weights for multiple losses. Extensive experimental evaluations using a general distillation loss function on popular datasets such as Cityscapes, CamVid, Pascal VOC, and ADE20k demonstrate the effectiveness of RDD against state-of-the-art KD methods. Additionally, our research showcases that RDD can integrate with existing KD methods to improve their upper performance bound.

View on arXivView PDF

Code Implementations(1)

sunyueue/RDDCommunity100%

RDD

31Shell, PythonJul 15, 20233 years ago

Similar Papers

Cite this paper

@article{liang2024relative,
  title  = {Relative Difficulty Distillation for Semantic Segmentation},
  author = {Dong Liang and Yue Sun and Yun Du and Songcan Chen and Sheng-Jun Huang},
  year   = {2024},
  eprint = {2407.03719},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2407.03719v1}
}

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/2407.03719.svg)](https://codeofpaper.com/paper/2407.03719)

Discussion