arXiv:2412.13096cs.LGcs.CV2024-12TPAMI被引 7

提出新型在线学习框架,解决深度网络持续学习中的遗忘与内存问题。

Incremental Online Learning of Randomized Neural Network with Forward Regularization

  • 用前向正则化实现无回溯的增量更新,避免灾难性遗忘。
  • 在非平稳数据流上表现更优,累积遗憾低于传统方法。
  • 适合资源受限环境下的持续学习任务,如边缘计算场景。

深度神经网络的在线学习面临滞后更新、内存增长、回溯重训和灾难性遗忘等挑战。为缓解这些问题并实现即时决策,本文提出随机神经网络(Randomized NN)的增量在线学习(IOL)框架,在限制性在线场景下持续优化模型性能。引入基于岭正则化(-R)和前向正则化(-F)的IOL方法,其中 -R 实现无需回溯重训的分步更新并抑制遗忘;进一步以 -F 替代 -R,利用半监督信息增强预知学习能力,在非平稳批次流上取得比 -R 更低的在线遗憾值。分别推导了 -R/-F 在非平稳批量流上的递归权重更新与可变学习率算法。通过新方法进行理论分析,建立了对抗环境下随机神经网络学习者的相对累积遗憾界,并推导多个推论,证实 -F 在学习加速和遗憾界上的优势。最后,在多个回归与分类任务的数据集上严格验证,显著证明了 IOL 框架及前向正则化的有效性。

原文摘要 · Abstract (English)

Online learning of deep neural networks suffers from challenges such as hysteretic non-incremental updating, increasing memory usage, past retrospective retraining, and catastrophic forgetting. To alleviate these drawbacks and achieve progressive immediate decision-making, we propose a novel Incremental Online Learning (IOL) process of Randomized Neural Networks (Randomized NN), a framework facilitating continuous improvements to Randomized NN performance in restrictive online scenarios. Within the framework, we further introduce IOL with ridge regularization (-R) and IOL with forward regularization (-F). -R generates stepwise incremental updates without retrospective retraining and avoids catastrophic forgetting. Moreover, we substituted -R with -F as it enhanced precognition learning ability using semi-supervision and realized better online regrets to offline global experts compared to -R during IOL. The algorithms of IOL for Randomized NN with -R/-F on non-stationary batch stream were derived respectively, featuring recursive weight updates and variable learning rates. Additionally, we conducted a detailed analysis and theoretically derived relative cumulative regret bounds of the Randomized NN learners with -R/-F in IOL under adversarial assumptions using a novel methodology and presented several corollaries, from which we observed the superiority on online learning acceleration and regret bounds of employing -F in IOL. Finally, our proposed methods were rigorously examined across regression and classification tasks on diverse datasets, which distinctly validated the efficacy of IOL frameworks of Randomized NN and the advantages of forward regularization.

在线学习随机网络正则化持续学习

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