mlsanityData to 7 Oct 2026

The Championship-Winning Solution for the 5th CLVISION Challenge 2024

arXiv 2406.16615 ↗First posted 24 Jun 2024cs.CVcited by 0

Not on the map. Why?

Abstract (arXiv)

In this paper, we introduce our approach to the 5th CLVision Challenge, which presents distinctive challenges beyond traditional class incremental learning. Unlike standard settings, this competition features the recurrence of previously encountered classes and includes unlabeled data that may contain Out-of-Distribution (OOD) categories. Our approach is based on Winning Subnetworks to allocate independent parameter spaces for each task addressing the catastrophic forgetting problem in class incremental learning and employ three training strategies: supervised classification learning, unsupervised contrastive learning, and pseudo-label classification learning to fully utilize the information in both labeled and unlabeled data, enhancing the classification performance of each subnetwork. Furthermore, during the inference stage, we have devised an interaction strategy between subnetworks, where the prediction for a specific class of a particular sample is the average logits across different subnetworks corresponding to that class, leveraging the knowledge learned from different subnetworks on recurring classes to improve classification accuracy. These strategies can be simultaneously applied to the three scenarios of the competition, effectively solving the difficulties in the competition scenarios. Experimentally, our method ranks first in both the pre-selection and final evaluation stages, with an average accuracy of 0.4535 during the preselection stage and an average accuracy of 0.4805 during the final evaluation stage.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 18 of its 24 references that are in the map. First posted on arXiv 24 Jun 2024.

Builds on

18 of 24 references.

References · 18

  1. 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
  2. 2020FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidencecited by 2,080
  3. 2017Gradient Episodic Memory for Continual Learningcited by 1,871
  4. 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 895
  5. 2023A Comprehensive Survey of Continual Learning: Theory, Method and Applicationcited by 860
  6. 2018Overcoming catastrophic forgetting with hard attention to the taskcited by 672
  7. 2020Class-incremental learning: survey and performance evaluation on image classificationcited by 446
  8. 2019Orthogonal Gradient Descent for Continual Learningcited by 361
  9. 2021Self-Supervised Models are Continual Learnerscited by 149
  10. 2021Training Networks in Null Space of Feature Covariance for Continual Learningcited by 139
  11. 2022POEM: Out-of-Distribution Detection with Posterior Samplingcited by 108
  12. 2021AFEC: Active Forgetting of Negative Transfer in Continual Learningcited by 73
6 more
  1. 2021Towards Better Plasticity-Stability Trade-off in Incremental Learning: A Simple Linear Connectorcited by 34
  2. 2020Learning Adaptive Embedding Considering Incremental Classcited by 21
  3. 2024Robust Semi-supervised Learning by Wisely Leveraging Open-set Datacited by 20
  4. 2020S2OSC: A Holistic Semi-Supervised Approach for Open Set Classificationcited by 15
  5. 2024Robust Semi-Supervised Learning for Self-learning Open-World Classescited by 9
  6. 2023Semi-Supervised Learning via Weight-aware Distillation under Class Distribution Mismatchcited by 8

Built on by

Not cited yet.