Pith. sign in

REVIEW 4 cited by

Toward Understanding Catastrophic Forgetting in 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 1908.01091 v1 pith:QFWKTVLQ submitted 2019-08-02 cs.LG cs.CVstat.ML

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

We study the relationship between catastrophic forgetting and properties of task sequences. In particular, given a sequence of tasks, we would like to understand which properties of this sequence influence the error rates of continual learning algorithms trained on the sequence. To this end, we propose a new procedure that makes use of recent developments in task space modeling as well as correlation analysis to specify and analyze the properties we are interested in. As an application, we apply our procedure to study two properties of a task sequence: (1) total complexity and (2) sequential heterogeneity. We show that error rates are strongly and positively correlated to a task sequence's total complexity for some state-of-the-art algorithms. We also show that, surprisingly, the error rates have no or even negative correlations in some cases to sequential heterogeneity. Our findings suggest directions for improving continual learning benchmarks and methods.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

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

  1. RING: Retrieval-Internalized Generation for Continual Large-Scale Knowledge Injection

    cs.CL 2026-08 conditional novelty 6.0 of 10

    A mixture-of-experts LLM trained with reinforcement learning to perform retrieval from its own parametric memory can replace external retrieval in some settings, at lower latency.

  2. DrugMCTS: a drug repurposing framework combining multi-agent, RAG and Monte Carlo Tree Search

    cs.AI 2025-07 conditional novelty 6.0 of 10

    A multi-agent, retrieval-augmented search framework lets a 7B language model outperform larger baselines on drug-target interaction prediction, but its headline recall relies on knowing the ground-truth output count.

  3. DA-VPT: Semantic-Guided Visual Prompt Tuning for Vision Transformers

    cs.CV 2025-05 conditional novelty 6.0 of 10

    DA-VPT guides visual prompts with a proxy-anchor metric loss and dynamic class-to-prompt clustering, reporting consistent gains over VPT baselines across classification and segmentation.

  4. UrbanMind: Towards Urban General Intelligence via Tool-Enhanced Retrieval-Augmented Generation and Multilevel Optimization

    cs.LG 2025-07 reject novelty 4.0 of 10

    The paper introduces UrbanMind, a tool-enhanced RAG framework with a multilevel optimization formulation for continual adaptation in urban AI, but offers only qualitative prototype results.

Pith tools