Pith. sign in

REVIEW 3 cited by

Closed-Loop Memory GAN 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 1811.01146 v3 pith:W4HCSEYK submitted 2018-11-03 cs.LG cs.AIstat.ML

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

Sequential learning of tasks using gradient descent leads to an unremitting decline in the accuracy of tasks for which training data is no longer available, termed catastrophic forgetting. Generative models have been explored as a means to approximate the distribution of old tasks and bypass storage of real data. Here we propose a cumulative closed-loop memory replay GAN (CloGAN) provided with external regularization by a small memory unit selected for maximum sample diversity. We evaluate incremental class learning using a notoriously hard paradigm, single-headed learning, in which each task is a disjoint subset of classes in the overall dataset, and performance is evaluated on all previous classes. First, we show that when constructing a dynamic memory unit to preserve sample heterogeneity, model performance asymptotically approaches training on the full dataset. We then show that using a stochastic generator to continuously output fresh new images during training increases performance significantly further meanwhile generating quality images. We compare our approach to several baselines including fine-tuning by gradient descent (FGD), Elastic Weight Consolidation (EWC), Deep Generative Replay (DGR) and Memory Replay GAN (MeRGAN). Our method has very low long-term memory cost, the memory unit, as well as negligible intermediate memory storage.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. CONCLAD: COntinuous Novel CLAss Detector

    cs.LG 2024-12 conditional novelty 6.0 of 10

    CONCLAD combines iterative PCA-based uncertainty scores, a small active-labeling budget, and pseudo-labeling to continuously separate and learn multiple novel classes from old classes.

  2. Uncertainty Quantification in Continual Open-World Learning

    cs.LG 2024-12 conditional novelty 5.0 of 10

    COUQ iteratively combines old-class and novel-class feature reconstruction errors to produce uncertainty scores that stay reliable as new classes arrive, improving continual novelty detection and active learning.

  3. CUAL: Continual Uncertainty-aware Active Learner

    cs.LG 2024-12 conditional novelty 5.0 of 10

    CUAL combines ambiguity-based active querying with confidence-filtered pseudo-labeling so a continual learner can handle unlabeled streams containing both old and novel classes under a tiny labeling budget.

Pith tools