Pith. sign in

REVIEW 1 cited by

Overcoming Catastrophic Interference by Conceptors

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 1707.04853 v2 pith:FBMC3KLU submitted 2017-07-16 cs.NE cs.LG

classification cs.NEcs.LG
keywords catastrophicbeenconceptorsinterferencedeeplearningpreviouslyalgorithm
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Catastrophic interference has been a major roadblock in the research of continual learning. Here we propose a variant of the back-propagation algorithm, "conceptor-aided back-prop" (CAB), in which gradients are shielded by conceptors against degradation of previously learned tasks. Conceptors have their origin in reservoir computing, where they have been previously shown to overcome catastrophic forgetting. CAB extends these results to deep feedforward networks. On the disjoint MNIST task CAB outperforms two other methods for coping with catastrophic interference that have recently been proposed in the deep learning field.

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. Modality-Incremental Learning with Disjoint Relevance Mapping Networks for Image-based Semantic Segmentation

    cs.CV 2024-11 conditional novelty 4.0 of 10

    Disjoint Relevance Mapping Networks, which forbid weight sharing across sensor modalities, reduce forgetting in incremental semantic segmentation but only slightly outperform the shared-weight RMN baseline.

Pith tools