Pith. sign in

REVIEW 1 cited by

Pseudo-Recursal: Solving the Catastrophic Forgetting Problem in Deep Neural Networks

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 1802.03875 v2 pith:5EWXTZPE submitted 2018-02-12 cs.LG cs.AIstat.ML

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

In general, neural networks are not currently capable of learning tasks in a sequential fashion. When a novel, unrelated task is learnt by a neural network, it substantially forgets how to solve previously learnt tasks. One of the original solutions to this problem is pseudo-rehearsal, which involves learning the new task while rehearsing generated items representative of the previous task/s. This is very effective for simple tasks. However, pseudo-rehearsal has not yet been successfully applied to very complex tasks because in these tasks it is difficult to generate representative items. We accomplish pseudo-rehearsal by using a Generative Adversarial Network to generate items so that our deep network can learn to sequentially classify the CIFAR-10, SVHN and MNIST datasets. After training on all tasks, our network loses only 1.67% absolute accuracy on CIFAR-10 and gains 0.24% absolute accuracy on SVHN. Our model's performance is a substantial improvement compared to the current state of the art solution.

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. Continual Learning in Machine Speech Chain Using Gradient Episodic Memory

    cs.CL 2024-11 reject novelty 5.0 of 10

    The paper combines machine speech chain text-to-speech replay with gradient episodic memory to let an ASR model learn a noisy speech task without forgetting clean speech, reporting a 40% average CER reduction over fin...

Pith tools