Elephant Neural Networks: Born to Be a Continual Learner
Qingfeng Lan, A. Rupam Mahmood
OpenReview ground truth
TL;DR — We propose a new class of activation functions that can generate both sparse activation values and sparse gradients, significantly improving the resilience of neural networks to catastrophic forgetting.
Abstract
Catastrophic forgetting remains a significant challenge to continual learning for decades. While recent works have proposed effective methods to mitigate this problem, they mainly focus on the algorithmic side. Meanwhile, we do not fully understand what architectural properties of neural networks lead to catastrophic forgetting. This study aims to fill this gap by studying the role of activation functions in the training dynamics of neural networks and their impact on catastrophic forgetting. Our study reveals that, besides sparse representations, the gradient sparsity of activation functions also plays an important role in reducing forgetting. Based on this insight, we propose a new class of activation functions, elephant activation functions, that can generate both sparse representations and sparse gradients. We show that by simply replacing classical activation functions with elephant activation functions, we can significantly improve the resilience of neural networks to catastrophic forgetting. Our method has broad applicability and benefits for continual learning in regression, class incremental learning, and reinforcement learning tasks. Specifically, we achieves excellent performance on Split MNIST dataset in just one single pass, without using replay buffer, task boundary information, or pre-training.
Author context
Most prolific author: 4 submissions (credibility 1.00).
No mass-submission penalty for this paper (authors within normal submission volume).
Aggregate statistics only — no individual author rankings.
Ranking trajectory
Percentile by tournament round — convergence indicates rating stability.
Battle history — 32 comparisons
Ranked above opponent in 59% of matchups.
- ▼ lost to ProtoReg: Prioritizing Discriminative Info… ×6
- ▲ beat Forward Explanation : Why Catastrophic For… ×4
- ▲ beat Towards guarantees for parameter isolation… ×4
- ▼ lost to Understanding Catastrophic Forgetting in L… ×4
- ▼ lost to TOAST: Transfer Learning via Top-Down Atte… ×4
Judge assessments
Mean overall score 0.0 ± 0.0 (n = 32)