Command Palette
Search for a command to run...
Xingyang Ni Liang Fang Heikki Huttunen

Abstract
We introduce an adaptive L2 regularization mechanism in the setting of person re-identification. In the literature, it is common practice to utilize hand-picked regularization factors which remain constant throughout the training procedure. Unlike existing approaches, the regularization factors in our proposed method are updated adaptively through backpropagation. This is achieved by incorporating trainable scalar variables as the regularization factors, which are further fed into a scaled hard sigmoid function. Extensive experiments on the Market-1501, DukeMTMC-reID and MSMT17 datasets validate the effectiveness of our framework. Most notably, we obtain state-of-the-art performance on MSMT17, which is the largest dataset for person re-identification. Source code is publicly available at https://github.com/nixingyang/AdaptiveL2Regularization.
Code Repositories
Benchmarks
| Benchmark | Methodology | Metrics |
|---|---|---|
| person-re-identification-on-dukemtmc-reid | Adaptive L2 Regularization (with re-ranking) | Rank-1: 92.2 mAP: 90.7 |
| person-re-identification-on-dukemtmc-reid | Adaptive L2 Regularization (without re-ranking) | Rank-1: 90.2 mAP: 81.0 |
| person-re-identification-on-market-1501 | Adaptive L2 Regularization (without re-ranking) | Rank-1: 95.6 mAP: 88.9 |
| person-re-identification-on-market-1501 | Adaptive L2 Regularization (with re-ranking) | Rank-1: 96.0 mAP: 94.4 |
| person-re-identification-on-msmt17 | Adaptive L2 Regularization (without re-ranking) | Rank-1: 81.7 mAP: 62.2 |
| person-re-identification-on-msmt17 | Adaptive L2 Regularization (with re-ranking) | Rank-1: 84.9 mAP: 76.7 |
Build AI with AI
From idea to launch — accelerate your AI development with free AI co-coding, out-of-the-box environment and best price of GPUs.