arXiv:2503.21436cs.LG2025-03被引 1

用随机激活的记忆痕迹提升二值化网络的持续学习能力

Stochastic Engrams for Efficient Continual Learning with Binarized Neural Networks

  • 借鉴神经科学记忆编码机制,用随机触发的记忆单元作为门控
  • 在类别增量场景下平均准确率超20%,显存占用低于20%
  • 适合资源受限场景下的高效持续学习研究

人工神经网络在持续学习中常受灾难性遗忘困扰,新知识会覆盖旧知识。受神经科学中记忆痕迹(engrams)启发,我们提出一种新方法:在元塑性二值化神经网络(mBNNs)中引入随机激活的记忆痕迹作为门控机制。该方法结合了mBNN的计算效率与概率性记忆痕迹的鲁棒性,有效缓解遗忘并保持模型可靠性。通过集成已验证的元塑性优化技术,进一步增强突触稳定性。相比基线二值化模型和主流全连接持续学习方法,本方法是唯一能在类别增量场景中实现平均准确率超20%的方法,并在领域增量任务上达到与全精度先进方法相当的性能。同时,峰值GPU使用率低于5%,内存占用低于20%。结果表明:(A)提升了稳定性和可塑性的平衡;(B)显著降低内存开销;(C)增强了二值化架构的表现。该工作融合神经科学原理与高效计算,为可扩展、鲁棒的深度学习系统设计提供新思路。

原文摘要 · Abstract (English)

The ability to learn continuously in artificial neural networks (ANNs) is often limited by catastrophic forgetting, a phenomenon in which new knowledge becomes dominant. By taking mechanisms of memory encoding in neuroscience (aka. engrams) as inspiration, we propose a novel approach that integrates stochastically-activated engrams as a gating mechanism for metaplastic binarized neural networks (mBNNs). This method leverages the computational efficiency of mBNNs combined with the robustness of probabilistic memory traces to mitigate forgetting and maintain the model's reliability. Previously validated metaplastic optimization techniques have been incorporated to enhance synaptic stability further. Compared to baseline binarized models and benchmark fully connected continual learning approaches, our method is the only strategy capable of reaching average accuracies over 20% in class-incremental scenarios and achieving comparable domain-incremental results to full precision state-of-the-art methods. Furthermore, we achieve a significant reduction in peak GPU and RAM usage, under 5% and 20%, respectively. Our findings demonstrate (A) an improved stability vs. plasticity trade-off, (B) a reduced memory intensiveness, and (C) an enhanced performance in binarized architectures. By uniting principles of neuroscience and efficient computing, we offer new insights into the design of scalable and robust deep learning systems.

持续学习二值化网络记忆痕迹高效计算

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。