arXivDaily arXiv每日学术速递 周一至周五更新
​通知:联邦节假日调休:哥伦布日 / 原住民日(Columbus Day / Indigenous Peoples' Day),今日(13日)无更新。
arXiv 2305.17244cs.LG

缓解长短期记忆网络中的灾难性遗忘

Mitigating Catastrophic Forgetting in Long Short-Term Memory Networks

Yale University(耶鲁大学)

Ketaki Joshi, Raghavendra Pradyumna Pothukuchi, Andre Wibisono, Abhishek Bhattacharjee

AI总结:

本文提出通过按任务或目标标签分离LSTM记忆来缓解灾难性遗忘,无需正则化或超网络,并在内存预取和离线自然语言处理任务上验证其简单有效且学习更快。

摘要:

对许多机器学习(ML)部署而言,在序列数据上进行持续学习至关重要。遗憾的是,常用于学习序列数据的LSTM网络会遭受灾难性遗忘,并且在持续学习多个任务方面能力有限。我们发现,LSTM网络中的灾难性遗忘可以通过两种新颖且易于实现的方式加以克服——将LSTM记忆按任务或按目标标签进行分离。我们的方法无需显式正则化、超网络以及其他复杂方法。我们在最近提出的用于计算机内存访问预取的LSTM网络上量化了该方法的优势,这是基于ML的计算机系统优化中的一个重要序列学习问题。与用于缓解灾难性遗忘的最先进的权重正则化方法相比,我们的方法简单、有效,并且能够实现更快的学习。我们还表明,我们的方案使得在离线学习场景中可以使用小型的、非正则化的LSTM网络来处理复杂的自然语言处理任务,而这在以前被认为是困难的。

英文摘要:

Continual learning on sequential data is critical for many machine learning (ML) deployments. Unfortunately, LSTM networks, which are commonly used to learn on sequential data, suffer from catastrophic forgetting and are limited in their ability to learn multiple tasks continually. We discover that catastrophic forgetting in LSTM networks can be overcome in two novel and readily-implementable ways -- separating the LSTM memory either for each task or for each target label. Our approach eschews the need for explicit regularization, hypernetworks, and other complex methods. We quantify the benefits of our approach on recently-proposed LSTM networks for computer memory access prefetching, an important sequential learning problem in ML-based computer system optimization. Compared to state-of-the-art weight regularization methods to mitigate catastrophic forgetting, our approach is simple, effective, and enables faster learning. We also show that our proposal enables the use of small, non-regularized LSTM networks for complex natural language processing in the offline learning scenario, which was previously considered difficult.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑