Pith. sign in

REVIEW 1 cited by

Gradient Episodic Memory with a Soft Constraint 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 2011.07801 v1 pith:3Q6SA5YJ submitted 2020-11-16 cs.LG cs.AI

classification cs.LGcs.AI
keywords knowledgelearningepsilonmemorya-gemconstraintcontinualepisodic
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Catastrophic forgetting in continual learning is a common destructive phenomenon in gradient-based neural networks that learn sequential tasks, and it is much different from forgetting in humans, who can learn and accumulate knowledge throughout their whole lives. Catastrophic forgetting is the fatal shortcoming of a large decrease in performance on previous tasks when the model is learning a novel task. To alleviate this problem, the model should have the capacity to learn new knowledge and preserve learned knowledge. We propose an average gradient episodic memory (A-GEM) with a soft constraint $\epsilon \in [0, 1]$, which is a balance factor between learning new knowledge and preserving learned knowledge; our method is called gradient episodic memory with a soft constraint $\epsilon$ ($\epsilon$-SOFT-GEM). $\epsilon$-SOFT-GEM outperforms A-GEM and several continual learning benchmarks in a single training epoch; additionally, it has state-of-the-art average accuracy and efficiency for computation and memory, like A-GEM, and provides a better trade-off between the stability of preserving learned knowledge and the plasticity of learning new knowledge.

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. Reducing Per-Sample Harm in Stochastic Optimization

    cs.LG 2026-06 conditional novelty 7.0 of 10

    A batch-space trust-region step that reweights samples by last-layer gradient structure yields small but consistent accuracy gains for SGD and AdamW on image classification.

Pith tools