{"title":"基于局部多头自注意的长期记忆稀疏访问神经图灵机","authors":"Dongjing Shan , Jing Zhu , Yamei Luo","doi":"10.1016/j.asoc.2025.113448","DOIUrl":null,"url":null,"abstract":"<div><div>In this paper, we propose a Sparse Access Neural Turing Machine (SANTM) to address long-term memorization challenges in sequence learning. The SANTM integrates a three-level neural controller with external memory: (1) a bottom layer for segmenting inputs into variable-length chunks, (2) a middle layer for short-term memory integration, and (3) a top layer that selectively accesses external memory via a locality-biased multi-head self-attention mechanism based on ChebNet spectral graph convolution. A sparse mask, trained through an <span><math><msub><mrow><mi>ℓ</mi></mrow><mrow><mn>0</mn></mrow></msub></math></span>-constrained optimization scheme, reduces memory access rates while enabling pre-fetching. Theoretical analysis derives an optimal access rate under idealized conditions. Experiments on sequential image classification (MNIST, CIFAR10), text classification, speaker discrimination, and language modeling (WikiText-103, enwik8) demonstrate SANTM’s superiority over state-of-the-art sequential models. Key results include 95.7% accuracy on permuted MNIST (vs. NTM’s 94.0%), 85.4% on TC-Speech (vs. 79.6% for NTM), and 24.2 perplexity on WikiText-103 (vs. Transformer-XL’s 27.0). The sparse mask reduces FLOPs by 37%–54% compared to traditional NTMs, validating its efficiency.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"181 ","pages":"Article 113448"},"PeriodicalIF":7.2000,"publicationDate":"2025-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"SANTM: A Sparse Access Neural Turing Machine with local multi-head self-attention for long-term memorization\",\"authors\":\"Dongjing Shan , Jing Zhu , Yamei Luo\",\"doi\":\"10.1016/j.asoc.2025.113448\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In this paper, we propose a Sparse Access Neural Turing Machine (SANTM) to address long-term memorization challenges in sequence learning. The SANTM integrates a three-level neural controller with external memory: (1) a bottom layer for segmenting inputs into variable-length chunks, (2) a middle layer for short-term memory integration, and (3) a top layer that selectively accesses external memory via a locality-biased multi-head self-attention mechanism based on ChebNet spectral graph convolution. A sparse mask, trained through an <span><math><msub><mrow><mi>ℓ</mi></mrow><mrow><mn>0</mn></mrow></msub></math></span>-constrained optimization scheme, reduces memory access rates while enabling pre-fetching. Theoretical analysis derives an optimal access rate under idealized conditions. Experiments on sequential image classification (MNIST, CIFAR10), text classification, speaker discrimination, and language modeling (WikiText-103, enwik8) demonstrate SANTM’s superiority over state-of-the-art sequential models. Key results include 95.7% accuracy on permuted MNIST (vs. NTM’s 94.0%), 85.4% on TC-Speech (vs. 79.6% for NTM), and 24.2 perplexity on WikiText-103 (vs. Transformer-XL’s 27.0). The sparse mask reduces FLOPs by 37%–54% compared to traditional NTMs, validating its efficiency.</div></div>\",\"PeriodicalId\":50737,\"journal\":{\"name\":\"Applied Soft Computing\",\"volume\":\"181 \",\"pages\":\"Article 113448\"},\"PeriodicalIF\":7.2000,\"publicationDate\":\"2025-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied Soft Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1568494625007598\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1568494625007598","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
SANTM: A Sparse Access Neural Turing Machine with local multi-head self-attention for long-term memorization
In this paper, we propose a Sparse Access Neural Turing Machine (SANTM) to address long-term memorization challenges in sequence learning. The SANTM integrates a three-level neural controller with external memory: (1) a bottom layer for segmenting inputs into variable-length chunks, (2) a middle layer for short-term memory integration, and (3) a top layer that selectively accesses external memory via a locality-biased multi-head self-attention mechanism based on ChebNet spectral graph convolution. A sparse mask, trained through an -constrained optimization scheme, reduces memory access rates while enabling pre-fetching. Theoretical analysis derives an optimal access rate under idealized conditions. Experiments on sequential image classification (MNIST, CIFAR10), text classification, speaker discrimination, and language modeling (WikiText-103, enwik8) demonstrate SANTM’s superiority over state-of-the-art sequential models. Key results include 95.7% accuracy on permuted MNIST (vs. NTM’s 94.0%), 85.4% on TC-Speech (vs. 79.6% for NTM), and 24.2 perplexity on WikiText-103 (vs. Transformer-XL’s 27.0). The sparse mask reduces FLOPs by 37%–54% compared to traditional NTMs, validating its efficiency.
期刊介绍:
Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities.
Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.