mlsanityData to 14 Oct 2026

Gated Target Propagation for Compositional Generalization in Continual Learning

arXiv 2610.04649 ↗First posted 3 Oct 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Continual learning is typically framed as acquiring new knowledge without catastrophically forgetting previous tasks. However, a flexible continual learner should also be able to reuse and recombine previously acquired knowledge to rapidly solve novel task compositions. We introduce Gated Target Propagation (GaTaP), a continual learning algorithm in which task-specific gating variables---learned through a closed-form inner loop update---selectively suppress or enhance network modules. Network parameters are learned in a slower timescale outer loop, using the same local difference target propagation error signal as is used for adapting gating variables. We provide tractable experiments on class-incremental learning scenarios for both multilayer perceptron and convolutional network architectures. We show strong performance retention on previously learned tasks, as well as compositional generalization to unseen tasks, achieved through few-shot gain adaptation at inference. We analyze learned gating patterns and find that related tasks exhibit similar gating patterns, suggesting that inferred gates capture meaningful, reusable task structure. Overall, GaTaP provides a powerful framework for jointly ameliorating catastrophic forgetting and enabling few-shot compositional generalization in neural network models.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 22 of its 37 references that are in the map. First posted on arXiv 3 Oct 2026.

Builds on

22 of 37 references.

References · 22

  1. 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
  2. 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,333
  3. 2017Gradient Episodic Memory for Continual Learningcited by 1,898
  4. 2016Progressive Neural Networkscited by 1,361
  5. 2018Efficient Lifelong Learning with A-GEMcited by 1,058
  6. 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 911
  7. 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 898
  8. 2013An Empirical Investigation of Catastrophic Forgetting in Gradient-Based Neural Networkscited by 722
  9. 2018Overcoming catastrophic forgetting with hard attention to the taskcited by 681
  10. 2017PathNet: Evolution Channels Gradient Descent in Super Neural Networkscited by 364
  11. 2014Difference Target Propagationcited by 148
  12. 2020Efficient Continual Learning with Modular Networks and Task-Driven Priorscited by 88
10 more
  1. 2014How Auto-Encoders Could Provide Credit Assignment in Deep Networks via Target Propagationcited by 79
  2. 2020A Theoretical Framework for Target Propagationcited by 57
  3. 2022Is a Modular Architecture Enough?cited by 36
  4. 2021Credit Assignment in Neural Networks through Deep Feedback Controlcited by 29
  5. 2019An Adaptive Random Path Selection Approach for Incremental Learningcited by 17
  6. 2017Predicting non-linear dynamics by stable local learning in a recurrent spiking neural networkcited by 13
  7. 2024Does learning the right latent variables necessarily improve in-context learning?cited by 13
  8. 2020Biological credit assignment through dynamic inversion of feedforward networkscited by 11
  9. 2023Compositional diversity in visual concept learningcited by 8
  10. 2026Balancing Plasticity and Stability with Fast and Slow Successor Featurescited by 1

Built on by

Not cited yet.