Pith. sign in

REVIEW 1 cited by

Reducing Catastrophic Forgetting in Online Class Incremental Learning Using Self-Distillation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2409.11329 v1 pith:CHWSRJAX submitted 2024-09-17 cs.CV

classification cs.CV
keywords learningmethodsproblemreplaycatastrophicdataforgettingknowledge
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

In continual learning, there is a serious problem of catastrophic forgetting, in which previous knowledge is forgotten when a model learns new tasks. Various methods have been proposed to solve this problem. Replay methods which replay data from previous tasks in later training, have shown good accuracy. However, replay methods have a generalizability problem from a limited memory buffer. In this paper, we tried to solve this problem by acquiring transferable knowledge through self-distillation using highly generalizable output in shallow layer as a teacher. Furthermore, when we deal with a large number of classes or challenging data, there is a risk of learning not converging and not experiencing overfitting. Therefore, we attempted to achieve more efficient and thorough learning by prioritizing the storage of easily misclassified samples through a new method of memory update. We confirmed that our proposed method outperformed conventional methods by experiments on CIFAR10, CIFAR100, and MiniimageNet datasets.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Leveraging Lightweight Generators for Memory Efficient Continual Learning

    cs.LG 2025-06 conditional novelty 5.0 of 10

    A rank-5 SVD per class plus a Gaussian model of latent coefficients generates replay samples that let A-GEM and Experience Replay match or beat random raw replay at equal memory on MNIST-like datasets and MLP architectures.

Pith tools