Towards Faster Training of Global Covariance Pooling Networks by Iterative Matrix Square Root Normalization
share
Global covariance pooling in Convolutional neural neworks has achieved impressive improvement over the classical first-order pooling. Recent works have shown matrix square root normalization plays a central role in achieving state-of-the-art performance. However, existing methods depending heavily on eigenvalue decomposition (EIG) or singular value decomposition (SVD), suffering from inefficient training due to limited support of EIG and SVD on GPU. Towards addressing this problem, we propose an iterative matrix square root normalization method for end-to-end training of covariance pooling networks. At the core of our method is a meta-layer designed with loop-embedded directed graph structure. The meta-layer consists of three consecutive nonlinear structured layers, which perform pre-normalization, coupled matrix iteration and post-compensation, respectively. Our method is much faster than EIG or SVD based ones, since it involves only matrix multiplications, suitable for parallel implementation on GPU. Moreover, the proposed network with ResNet architecture can converge in much less epochs, further accelerating network training. On large-scale ImageNet, we achieve competitive performance superior to existing covariance pooling networks. By finetuning our models pretrained on ImageNet, we establish state-of-the-art results on three challenging fine-grained benchmarks.
READ FULL TEXT
