Graph-based Knowledge Distillation by Multi-head Attention Network

Seunghyun Lee, Byung Cheol Song
7/4/2019
cs.LGstat.ML

Official code: sseung0703/Knowledge_distillation_via_TF2.0 (111 stars, last commit 2022-04-06).

Abstract

Knowledge distillation (KD) is a technique to derive optimal performance from a small student network (SN) by distilling knowledge of a large teacher network (TN) and transferring the distilled knowledge to the small SN. Since a role of convolutional neural network (CNN) in KD is to embed a dataset so as to perform a given task well, it is very important to acquire knowledge that considers intra-data relations. Conventional KD methods have concentrated on distilling knowledge in data units. To our knowledge, any KD methods for distilling information in dataset units have not yet been proposed. Therefore, this paper proposes a novel method that enables distillation of dataset-based knowledge from the TN using an attention network. The knowledge of the embedding procedure of the TN is distilled to graph by multi-head attention (MHA), and multi-task learning is performed to give relational inductive bias to the SN. The MHA can provide clear information about the source dataset, which can greatly improves the performance of the SN. Experimental results show that the proposed method is 7.05% higher than the SN alone for CIFAR100, which is 2.46% higher than the state-of-the-art.

View on arXivView PDF

Code Implementations(1)

The codes for recent knowledge distillation algorithms and benchmark results via TF2.0 low-level API

11130PythonNov 20, 20194 years ago
benchmarkknowledge-distillationtensorflow2tensorflow2-models

Similar Papers

Cite this paper

@article{lee2019graphbased,
  title  = {Graph-based Knowledge Distillation by Multi-head Attention Network},
  author = {Seunghyun Lee and Byung Cheol Song},
  year   = {2019},
  eprint = {1907.02226},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1907.02226}
}

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

Discussion