Pith. sign in

REVIEW 1 cited by

Fixed Random Classifier Rearrangement for Continual Learning

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 2402.15227 v1 pith:YEK3CJYC submitted 2024-02-23 cs.LG cs.AI

classification cs.LGcs.AI
keywords classifiersforgettingfrcrlearningcontinualfixedrandomalgorithm
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

With the explosive growth of data, continual learning capability is increasingly important for neural networks. Due to catastrophic forgetting, neural networks inevitably forget the knowledge of old tasks after learning new ones. In visual classification scenario, a common practice of alleviating the forgetting is to constrain the backbone. However, the impact of classifiers is underestimated. In this paper, we analyze the variation of model predictions in sequential binary classification tasks and find that the norm of the equivalent one-class classifiers significantly affects the forgetting level. Based on this conclusion, we propose a two-stage continual learning algorithm named Fixed Random Classifier Rearrangement (FRCR). In first stage, FRCR replaces the learnable classifiers with fixed random classifiers, constraining the norm of the equivalent one-class classifiers without affecting the performance of the network. In second stage, FRCR rearranges the entries of new classifiers to implicitly reduce the drift of old latent representations. The experimental results on multiple datasets show that FRCR significantly mitigates the model forgetting; subsequent experimental analyses further validate the effectiveness of the algorithm.

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. Out-of-Distribution Detection with Prototypical Outlier Proxy

    cs.CV 2024-12 conditional novelty 6.0 of 10

    POP uses fixed hierarchical prototypes plus virtual outlier proxies and a similarity-aware margin loss to improve out-of-distribution image detection without outlier exposure.

Pith tools