mlsanityData to 7 Oct 2026

Reducing catastrophic forgetting with learning on synthetic data

arXiv 2004.14046 ↗First posted 29 Apr 2020cs.LG stat.MLcited by 26

Not on the map. Why?

Abstract (arXiv)

Catastrophic forgetting is a problem caused by neural networks' inability to learn data in sequence. After learning two tasks in sequence, performance on the first one drops significantly. This is a serious disadvantage that prevents many deep learning applications to real-life problems where not all object classes are known beforehand; or change in data requires adjustments to the model. To reduce this problem we investigate the use of synthetic data, namely we answer a question: Is it possible to generate such data synthetically which learned in sequence does not result in catastrophic forgetting? We propose a method to generate such data in two-step optimisation process via meta-gradients. Our experimental results on Split-MNIST dataset show that training a model on such synthetic data in sequence does not result in catastrophic forgetting. We also show that our method of generating data is robust to different learning scenarios.

Key facts. Cited by 26 papers in the map (data through 7 Oct 2026). First posted on arXiv 29 Apr 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 3; 2023: 10; 2024: 8; 2025: 4; 2026: 1.

26 papers.

Sort:

By area:

  1. 2022Dataset Distillation by Matching Training Trajectoriescited by 437
  2. 2023Dataset Distillation: A Comprehensive Reviewcited by 126
  3. 2023Generalizing Dataset Distillation via Deep Generative Priorcited by 125
  4. 2023Improved Distribution Matching for Dataset Condensationcited by 124
  5. 2023Towards Lossless Dataset Distillation via Difficulty-Aligned Trajectory Matchingcited by 118
  6. 2022Dataset Distillation via Factorizationcited by 115
  7. 2023Generalized Large-Scale Data Condensation via Various Backbone and Statistical Matchingcited by 69
  8. 2022Accelerating Dataset Distillation via Model Augmentationcited by 62
  9. 2023CaT: Balanced Continual Graph Learning with Graph Condensationcited by 50
  10. 2023M3D: Dataset Condensation by Minimizing Maximum Mean Discrepancycited by 49
  11. 2024Elucidating the Design Space of Dataset Condensationcited by 40
  12. 2024Navigating Complexity: Toward Lossless Graph Condensation via Expanding Window Matchingcited by 28
14 more
  1. 2024Emphasizing Discriminative Features for Dataset Distillation in Complex Scenarioscited by 18
  2. 2024Not All Samples Should Be Utilized Equally: Towards Understanding and Improving Dataset Distillationcited by 14
  3. 2025TD3: Tucker Decomposition Based Dataset Distillation Method for Sequential Recommendationcited by 13
  4. 2025CaO2: Rectifying Inconsistencies in Diffusion-Based Dataset Distillationcited by 13
  5. 2024Distilling Long-tailed Datasetscited by 9
  6. 2023PUMA: Efficient Continual Graph Learning for Node Classification with Graph Condensationcited by 8
  7. 2025Task-Specific Generative Dataset Distillation with Difficulty-Guided Samplingcited by 8
  8. 2024Improve Cross-Architecture Generalization on Dataset Distillationcited by 7
  9. 2024Prioritize Alignment in Dataset Distillationcited by 4
  10. 2024Exemplar-condensed Federated Class-incremental Learningcited by 2
  11. 2023Differentially Private Kernel Inducing Points using features from ScatterNets (DP-KIP-ScatterNet) for Privacy Preserving Data Distillationcited by 1
  12. 2023Towards Efficient Deep Hashing Retrieval: Condensing Your Data via Feature-Embedding Matchingcited by 0
  13. 2025Generalized Kernel Inducing Points by Duality Gap for Dataset Distillationcited by 0
  14. 2026GLOBE: Trajectory-Aligned Gradient Matching with Structured SparseOptimization for Coreset Selectioncited by 0