Long-tail Detection with Effective Class-Margins
About
Large-scale object detection and instance segmentation face a severe data imbalance. The finer-grained object classes become, the less frequent they appear in our datasets. However, at test-time, we expect a detector that performs well for all classes and not just the most frequent ones. In this paper, we provide a theoretical understanding of the long-trail detection problem. We show how the commonly used mean average precision evaluation metric on an unknown test set is bound by a margin-based binary classification error on a long-tailed object detection training set. We optimize margin-based binary classification error with a novel surrogate objective called \textbf{Effective Class-Margin Loss} (ECM). The ECM loss is simple, theoretically well-motivated, and outperforms other heuristic counterparts on LVIS v1 benchmark over a wide range of architecture and detectors. Code is available at \url{https://github.com/janghyuncho/ECM-Loss}.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Object Detection | LVIS v1.0 (val) | APbbox29.4 | 518 | |
| Instance Segmentation | LVIS v1.0 (val) | AP (Rare)21.9 | 189 | |
| Instance Segmentation | LVIS v1 (val) | AP (m, r)21.9 | 34 | |
| Instance Segmentation | LVIS v1.0 | AP28.7 | 12 | |
| Object Detection | LVIS v1.0 | APbb29.4 | 12 | |
| Oriented Object Detection | DOTA long-tailed | mAP (Head)78.1 | 6 | |
| Object Detection | COCO-LT v1.0 (test) | AP22.9 | 6 |