vix.ing · top · new · best · stats

Fast-MoCo: Boost Momentum-based Contrastive Learning with Combinatorial Patches

2022/07/17 by Yuanzheng Ci, Ci, Yuanzheng, Lin Chen +6 · 6 citations
Computer Science · #Computer Vision and Pattern Recognition (cs.CV) #Domain Adaptation and Few-Shot Learning #FOS: Computer and information sciences #Image Enhancement Techniques #Video Surveillance and Tracking Methods #cs.CV

paper · pdf · doi:10.48550/arxiv.2207.08220

Accepted for publication at the 2022 European Conference on Computer Vision (ECCV 2022)

openalex publication_date 2022/07/17 · arxiv created 2022/07/19 · arxiv updated 2022/07/20 · openalex created_date 2022/07/21 · openalex updated_date 2026/07/28

Abstract

Contrastive-based self-supervised learning methods achieved great success in recent years. However, self-supervision requires extremely long training epochs (e.g., 800 epochs for MoCo v3) to achieve promising results, which is unacceptable for the general academic community and hinders the development of this topic. This work revisits the momentum-based contrastive learning frameworks and identifies the inefficiency in which two augmented views generate only one positive pair. We propose Fast-MoCo - a novel framework that utilizes combinatorial patches to construct multiple positive pairs from two augmented views, which provides abundant supervision signals that bring significant acceleration with neglectable extra computational cost. Fast-MoCo trained with 100 epochs achieves 73.5% linear evaluation accuracy, similar to MoCo v3 (ResNet-50 backbone) trained with 800 epochs. Extra training (200 epochs) further improves the result to 75.1%, which is on par with state-of-the-art methods. Experiments on several downstream tasks also confirm the effectiveness of Fast-MoCo.

Cited by

Related