mlsanityData to 14 Oct 2026

Pathway-based Progressive Inference (PaPI) for Energy-Efficient Continual Learning

arXiv 2506.17848 ↗First posted 21 Jun 2025cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Continual learning systems face the dual challenge of preventing catastrophic forgetting while maintaining energy efficiency, particularly in resource-constrained environments. This paper introduces Pathway-based Progressive Inference (PaPI), a novel theoretical framework that addresses these challenges through a mathematically rigorous approach to pathway selection and adaptation. We formulate continual learning as an energy-constrained optimization problem and provide formal convergence guarantees for our pathway routing mechanisms. Our theoretical analysis demonstrates that PaPI achieves an O(K) improvement in the stability-plasticity trade-off compared to monolithic architectures, where K is the number of pathways. We derive tight bounds on forgetting rates using Fisher Information Matrix analysis and prove that PaPI's energy consumption scales with the number of active parameters rather than the total model size. Comparative theoretical analysis shows that PaPI provides stronger guarantees against catastrophic forgetting than Elastic Weight Consolidation (EWC) while maintaining better energy efficiency than both EWC and Gradient Episodic Memory (GEM). Our experimental validation confirms these theoretical advantages across multiple benchmarks, demonstrating PaPI's effectiveness for continual learning in energy-constrained settings. Our codes are available at https://github.com/zser092/PAPIFILES.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 14 of its 24 references that are in the map. First posted on arXiv 21 Jun 2025.

Builds on

14 of 24 references.

References · 14

  1. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  2. 2015Distilling the Knowledge in a Neural Networkcited by 10,324
  3. 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,682
  4. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
  5. 2017Gradient Episodic Memory for Continual Learningcited by 1,898
  6. 2018Experience Replay for Continual Learningcited by 1,095
  7. 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 898
  8. 2019Once-for-All: Train One Network and Specialize it for Efficient Deploymentcited by 787
  9. 2018Riemannian Walk for Incremental Learning: Understanding Forgetting and Intransigencecited by 742
  10. 2019Green AIcited by 627
  11. 2020Understanding the Role of Training Regimes in Continual Learningcited by 180
  12. 2019Online Meta-Learningcited by 137
2 more
  1. 2017Routing Networks: Adaptive Selection of Non-linear Functions for Multi-Task Learningcited by 126
  2. 2013A PAC-Bayesian bound for Lifelong Learningcited by 69

Built on by

Not cited yet.