DN-DETR: Accelerate DETR Training by Introducing Query DeNoising

Hong Kong University of Science and Technology · Tsinghua University

Indexed incrossref

Abstract

We present in this paper a novel denoising training method to speedup DETR (DEtection TRansformer) training and offer a deepened understanding of the slow convergence issue of DETR-like methods. We show that the slow convergence results from the instability of bipartite graph matching which causes inconsistent optimization goals in early training stages. To address this issue, except for the Hungarian loss, our method additionally feeds ground-truth bounding boxes with noises into Transformer decoder and trains the model to reconstruct the original boxes, which effectively reduces the bipartite graph matching difficulty and leads to a faster convergence. Our method is universal and can be easily plugged into…

Citation impact

896
total citations
FWCI
47.97
Percentile
100%
References
21
Citations per year

Authors

6

Topics & keywords

Keywords
  • Computer science
  • Bipartite graph
  • Matching (statistics)
  • Data mining
  • Graph
  • Artificial intelligence
  • Theoretical computer science
  • Mathematics
No related works found for this paper.