pith. sign in

arxiv: 1902.10486 · v4 · pith:Q44ECVFVnew · submitted 2019-02-27 · 💻 cs.LG · stat.ML

On Tiny Episodic Memories in Continual Learning

classification 💻 cs.LG stat.ML
keywords tasksmemoryepisodicexampleslearningtrainingcontinualexample
0
0 comments X
read the original abstract

In continual learning (CL), an agent learns from a stream of tasks leveraging prior experience to transfer knowledge to future tasks. It is an ideal framework to decrease the amount of supervision in the existing learning algorithms. But for a successful knowledge transfer, the learner needs to remember how to perform previous tasks. One way to endow the learner the ability to perform tasks seen in the past is to store a small memory, dubbed episodic memory, that stores few examples from previous tasks and then to replay these examples when training for future tasks. In this work, we empirically analyze the effectiveness of a very small episodic memory in a CL setup where each training example is only seen once. Surprisingly, across four rather different supervised learning benchmarks adapted to CL, a very simple baseline, that jointly trains on both examples from the current task as well as examples stored in the episodic memory, significantly outperforms specifically designed CL approaches with and without episodic memory. Interestingly, we find that repetitive training on even tiny memories of past tasks does not harm generalization, on the contrary, it improves it, with gains between 7\% and 17\% when the memory is populated with a single example per class.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 35 Pith papers

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

  1. LIBERO: Benchmarking Knowledge Transfer for Lifelong Robot Learning

    cs.AI 2023-06 conditional novelty 8.0

    LIBERO is a new benchmark for lifelong robot learning that evaluates transfer of declarative, procedural, and mixed knowledge across 130 manipulation tasks with provided demonstration data.

  2. MedCRP-CL: Continual Medical Image Segmentation via Bayesian Nonparametric Semantic Modality Discovery

    cs.CV 2026-05 unverdicted novelty 7.0

    MedCRP-CL discovers semantic modalities online via CRP from text prompts and maintains modality-specific LoRA adapters with intra-modality EWC, achieving 73.3% Dice and 4.1% forgetting on 16 tasks while using 6x fewer...

  3. Continual Learning of Domain-Invariant Representations

    cs.LG 2026-05 unverdicted novelty 7.0

    Introduces replay-based continual learning with sequential invariance alignment to learn domain-invariant representations, outperforming baselines on generalization to unseen domains across six datasets in vision, med...

  4. DRIFT: A Benchmark for Task-Free Continual Graph Learning with Continuous Distribution Shifts

    cs.LG 2026-05 accept novelty 7.0

    DRIFT is a benchmark for task-free continual graph learning under continuous distribution shifts, demonstrating that standard methods degrade without task boundary information.

  5. KAN-CL: Per-Knot Importance Regularization for Continual Learning with Kolmogorov-Arnold Networks

    cs.LG 2026-05 conditional novelty 7.0

    KAN-CL cuts catastrophic forgetting by 88-93% on Split-CIFAR-10/5T and Split-CIFAR-100/10T by anchoring KAN parameters at per-knot granularity while matching baseline accuracy.

  6. Online Continual Learning with Dynamic Label Hierarchies

    cs.LG 2026-05 unverdicted novelty 7.0

    HALO improves online continual learning under evolving label hierarchies by adaptively combining classification heads regularized with organized learnable prototypes for better adaptation and reduced forgetting.

  7. MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound

    cs.LG 2026-05 unverdicted novelty 7.0

    MIST fixes unreliable splits in streaming decision trees for class-incremental learning by using a K-independent McDiarmid bound on Gini impurity, Bayesian moment projection for knowledge transfer, and KLL quantile sk...

  8. MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound

    cs.LG 2026-05 unverdicted novelty 7.0

    MIST fixes unreliable splits in streaming decision trees for class-incremental learning by replacing Hoeffding-style bounds with a K-independent McDiarmid radius on Gini, plus Bayesian parent-to-child inheritance and ...

  9. StrLoRA: Towards Streaming Continual Visual Instruction Tuning for MLLMs

    cs.CV 2026-05 unverdicted novelty 7.0

    StrLoRA is a regularized two-stage expert routing method for streaming CVIT that selects experts via textual instructions and applies token-wise cross-modal weighting with historical routing alignment.

  10. Continual Learning for fMRI-Based Brain Disorder Diagnosis via Functional Connectivity Matrices Generative Replay

    q-bio.TO 2026-04 conditional novelty 7.0

    A structure-aware VAE generates realistic FC matrices for replay, combined with multi-level knowledge distillation and hierarchical contextual bandit sampling, to enable continual fMRI-based brain disorder diagnosis a...

  11. Direct Discrepancy Replay: Distribution-Discrepancy Condensation and Manifold-Consistent Replay for Continual Face Forgery Detection

    cs.CV 2026-04 unverdicted novelty 7.0

    A replay method for continual face forgery detection condenses real-fake distribution discrepancies into compact maps and synthesizes compatible samples from current real faces to reduce forgetting under tight memory ...

  12. SLE-FNO: Single-Layer Extensions for Task-Agnostic Continual Learning in Fourier Neural Operators

    cs.LG 2026-03 unverdicted novelty 7.0

    SLE-FNO achieves zero forgetting and strong plasticity-stability balance in continual learning for FNO surrogate models of pulsatile blood flow by adding minimal single-layer extensions across four out-of-distribution tasks.

  13. Efficient Continual Learning in Language Models via Thalamically Routed Cortical Columns

    cs.LG 2026-02 unverdicted novelty 7.0

    TRC² is a brain-inspired decoder-only architecture that localizes fast plasticity and uses thalamic and hippocampal pathways to substantially reduce cumulative forgetting in sequential language model training on strea...

  14. Modality-Inconsistent Continual Learning of Multimodal Large Language Models

    cs.LG 2024-12 unverdicted novelty 7.0

    The paper introduces the MICL scenario for MLLMs with modality and task shifts and proposes MoInCL using pseudo-target generation and instruction-based distillation, reporting gains over continual learning baselines o...

  15. Privacy Leakage via Output Label Space and Differentially Private Continual Learning

    cs.LG 2024-11 unverdicted novelty 7.0

    Identifies output label space as a privacy side-channel in DP continual learning, formalizes DP for CL, and demonstrates two mitigation methods yielding higher accuracy than prior work.

  16. A Rank Stabilization Scaling Factor for Fine-Tuning with LoRA

    cs.CL 2023-11 unverdicted novelty 7.0

    LoRA adapters should be scaled by 1/sqrt(rank) rather than 1/rank to stabilize learning and enable effective use of higher ranks during fine-tuning of large language models.

  17. Spectral Unforgetting: Post-Hoc Recovery of Damaged Capabilities Without Retraining

    cs.LG 2026-05 unverdicted novelty 6.0

    DG-Hard uses Donoho-Gavish hard thresholding on the fine-tuning weight delta to separate task-aligned signal from noise-like residual, recovering damaged capabilities while preserving target-task gains.

  18. PMF-CL: Pareto-Minimal-Forgetting Continual Learner for Conflicting Tasks

    cs.LG 2026-05 unverdicted novelty 6.0

    PMF-CL derives Pareto-optimal solutions for continual learning on conflicting tasks, yielding memory-efficient algorithms for linear regression and quadratically bounded losses with static O(d^2) memory.

  19. Is One Score Enough? Rethinking the Evaluation of Sequentially Evolving LLM Memory

    cs.LG 2026-05 unverdicted novelty 6.0

    SeqMem-Eval reveals that high final accuracy in sequential LLM memory tasks often coexists with substantial forgetting and negative transfer, exposing stability-adaptability trade-offs hidden by standard aggregate metrics.

  20. TFGN: Task-Free, Replay-Free Continual Pre-Training Without Catastrophic Forgetting at LLM Scale

    cs.LG 2026-05 unverdicted novelty 6.0

    TFGN is an architectural overlay for transformers enabling task-free, replay-free continual pre-training across heterogeneous domains at LLM scale with near-zero backward transfer and high gradient orthogonality.

  21. Continual Fine-Tuning of Large Language Models via Program Memory

    cs.LG 2026-05 unverdicted novelty 6.0

    ProCL organizes LoRA adapters into input-conditioned program memory slots that combine with a distributed adapter to improve retention and reduce forgetting in continual LLM fine-tuning.

  22. DRIFT: A Benchmark for Task-Free Continual Graph Learning with Continuous Distribution Shifts

    cs.LG 2026-05 unverdicted novelty 6.0

    DRIFT benchmark shows substantial performance degradation for continual graph learning methods under task-free continuous distribution shifts modeled via Gaussian mixtures.

  23. Critical Patch-Aware Sparse Prompting with Decoupled Training for Continual Learning on the Edge

    cs.LG 2026-04 unverdicted novelty 6.0

    CPS-Prompt delivers 1.6x gains in peak memory, training time, and energy on edge hardware for continual learning while staying within 2% accuracy of top prompt-based baselines.

  24. Continual Few-shot Adaptation for Synthetic Fingerprint Detection

    cs.CV 2026-03 unverdicted novelty 6.0

    A continual few-shot adaptation method combining binary cross-entropy and supervised contrastive losses with replay achieves a good trade-off between fast adaptation to unseen synthetic fingerprint styles and retentio...

  25. Towards Long-Lived Robots: Continual Learning VLA Models via Reinforcement Fine-Tuning

    cs.RO 2026-02 unverdicted novelty 6.0

    LifeLong-RFT applies chunking-level on-policy reinforcement learning with Quantized Action Consistency Reward, Continuous Trajectory Alignment Reward, and Format Compliance Reward to fine-tune VLA models, achieving a ...

  26. CLARE: Continual Learning for Vision-Language-Action Models via Autonomous Adapter Routing and Expansion

    cs.RO 2026-01 unverdicted novelty 6.0

    CLARE is an exemplar-free continual learning framework for VLAs that autonomously expands modular adapters based on feature similarity and uses autoencoder routing for label-free deployment.

  27. Data-Free Class-Incremental Gesture Recognition with Prototype-Guided Pseudo Feature Replay

    cs.CV 2025-05 unverdicted novelty 6.0

    A data-free class-incremental learning method for gesture recognition using prototype-guided pseudo feature replay with four components that achieves 11.8% and 12.8% mean global accuracy gains on SHREC 2017 3D and Ego...

  28. Don't Forget the Critic: Value-Based Data Rehearsal for Multi-Cyclic Continual Reinforcement Learning

    cs.LG 2026-05 unverdicted novelty 5.0

    Qreg+NWLU improves forgetting mitigation and knowledge transfer in value-based multi-cyclic CRL by using dynamic Q-value rehearsal and immediate regularization instead of waiting after the first task.

  29. MANGO: Meta-Adaptive Network Gradient Optimization for Online Continual Learning

    cs.LG 2026-05 unverdicted novelty 5.0

    MANGO combines gradient-gating and meta-learned regularization to balance stability and plasticity in single-pass online continual learning, reporting state-of-the-art accuracy on CLEAR-10, CIFAR-100, and Tiny-ImageNet.

  30. HEDP: A Hybrid Energy-Distance Prompt-based Framework for Domain Incremental Learning

    cs.AI 2026-05 unverdicted novelty 5.0

    HEDP uses energy regularization inspired by Helmholtz free energy plus hybrid energy-distance weighting in prompts to improve domain selection and achieve a 2.57% accuracy gain on benchmarks like CORe50 while mitigati...

  31. CoMemNet: Contrastive Sampling with Memory Replay Network for Continual Traffic Prediction

    cs.LG 2026-05 unverdicted novelty 5.0

    CoMemNet is a dual-branch continual learning model for dynamic traffic networks that combines contrastive sampling via Wasserstein features and memory replay to achieve SOTA performance while mitigating forgetting.

  32. BRAIN: Bias-Mitigation Continual Learning Approach to Vision-Brain Understanding

    cs.CV 2025-08 unverdicted novelty 5.0

    BRAIN uses bias-mitigation continual learning with a new de-bias contrastive loss and angular forgetting mitigation to achieve SOTA performance on vision-brain understanding benchmarks despite brain signal inconsisten...

  33. On-Device Continual Learning with Dual-Stage Buffer and Dynamic Loss for Point-of-Care Pneumonia Diagnosis

    cs.LG 2026-05 unverdicted novelty 4.0

    PneumoNet uses a lightweight CNN, dual-stage balanced buffer, and dynamic class-weighted loss for domain-incremental learning on simulated PneumoniaMNIST shifts, reporting 86.6% accuracy and 1.4% forgetting.

  34. Domain Incremental Learning for Pandemic-Resilient Chest X-Ray Analysis

    cs.CV 2026-05 unverdicted novelty 4.0

    A class-aware replay method for domain-incremental learning reaches 88.66% average accuracy on five simulated domain shifts in PneumoniaMNIST, beating standard replay, fine-tuning, and joint training.

  35. Face-D(^2)CL: Multi-Domain Synergistic Representation with Dual Continual Learning for Facial DeepFake Detection

    cs.CV 2026-04 unverdicted novelty 4.0

    Face-D²CL fuses spatial and frequency features and uses dual continual learning to reduce forgetting while adapting to new DeepFakes, cutting average error rates by 60.7% and raising unseen-domain AUC by 7.9% over prior SOTA.