mlsanityData to 7 Oct 2026

Learning Adaptive Embedding Considering Incremental Class

arXiv 2008.13351 ↗First posted 31 Aug 2020cs.LG cs.AI stat.MLcited by 21

Not on the map. Why?

Abstract (arXiv)

Class-Incremental Learning (CIL) aims to train a reliable model with the streaming data, which emerges unknown classes sequentially. Different from traditional closed set learning, CIL has two main challenges: 1) Novel class detection. The initial training data only contains incomplete classes, and streaming test data will accept unknown classes. Therefore, the model needs to not only accurately classify known classes, but also effectively detect unknown classes; 2) Model expansion. After the novel classes are detected, the model needs to be updated without re-training using entire previous data. However, traditional CIL methods have not fully considered these two challenges, first, they are always restricted to single novel class detection each phase and embedding confusion caused by unknown classes. Besides, they also ignore the catastrophic forgetting of known categories in model update. To this end, we propose a Class-Incremental Learning without Forgetting (CILF) framework, which aims to learn adaptive embedding for processing novel class detection and model update in a unified framework. In detail, CILF designs to regularize classification with decoupled prototype based loss, which can improve the intra-class and inter-class structure significantly, and acquire a compact embedding representation for novel class detection in result. Then, CILF employs a learnable curriculum clustering operator to estimate the number of semantic clusters via fine-tuning the learned network, in which curriculum operator can adaptively learn the embedding in self-taught form. Therefore, CILF can detect multiple novel classes and mitigate the embedding confusion problem. Last, with the labeled streaming test data, CILF can update the network with robust regularization to mitigate the catastrophic forgetting. Consequently, CILF is able to iteratively perform novel class detection and model update.

Key facts. Cited by 21 papers in the map (data through 7 Oct 2026). First posted on arXiv 31 Aug 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 3; 2024: 16; 2025: 1; 2026: 1.

21 papers.

Sort:

  1. 2024Exploiting Inter-sample and Inter-feature Relations in Dataset Distillationcited by 31
  2. 2024Robust Semi-supervised Learning by Wisely Leveraging Open-set Datacited by 20
  3. 2024Learning to Rebalance Multi-Modal Optimization by Adaptively Masking Subnetworkscited by 15
  4. 2024Robust Semi-Supervised Learning for Self-learning Open-World Classescited by 9
  5. 2024Arithmetic Feature Interaction Is Necessary for Deep Tabular Learningcited by 8
  6. 2024MAP: Model Aggregation and Personalization in Federated Learning with Incomplete Classescited by 7
  7. 2023MrTF: Model Refinery for Transductive Federated Learningcited by 2
  8. 2023Hessian Aware Low-Rank Perturbation for Order-Robust Continual Learningcited by 2
  9. 2024DP-CRE: Continual Relation Extraction via Decoupled Contrastive Learning and Memory Structure Preservationcited by 2
  10. 2024Cross-Modal Attention Alignment Network with Auxiliary Text Description for zero-shot sketch-based image retrievalcited by 2
  11. 2024Proposal Report for the 2nd SciCAP Competition 2024cited by 2
  12. 2024Domain Generalizable Knowledge Tracing via Concept Aggregation and Relation-Based Attentioncited by 2
9 more
  1. 2024Self Adaptive Threshold Pseudo-labeling and Unreliable Sample Contrastive Loss for Semi-supervised Image Classificationcited by 2
  2. 2026A Multihead Continual Learning Framework for Fine-Grained Fashion Image Retrieval with Contrastive Learning and Exponential Moving Average Distillationcited by 1
  3. 2023Information Fusion for Assistance Systems in Production Assessmentcited by 0
  4. 2024The Solution for the CVPR 2023 1st foundation model challenge-Track2cited by 0
  5. 2024The Championship-Winning Solution for the 5th CLVISION Challenge 2024cited by 0
  6. 2024The Solution for the AIGC Inference Performance Optimization Competitioncited by 0
  7. 2024The Solution for the sequential task continual learning track of the 2nd Greater Bay Area International Algorithm Competitioncited by 0
  8. 2024The Solution for The PST-KDD-2024 OAG-Challengecited by 0
  9. 2025Few-shot Class-incremental Fault Diagnosis by Preserving Class-Agnostic Knowledge with Dual-Granularity Representationscited by 0