Papers › LMUFormer: Low Complexity Yet Powerful Spiking Model With Legendre Memory Units

LMUFormer: Low Complexity Yet Powerful Spiking Model With Legendre Memory Units

20 Jan 2024arXiv:2402.04882archive 2025-07-28

Zeyu Liu, Gourav Datta, Anni Li, Peter Anthony Beerel

Transformer models have demonstrated high accuracy in numerous applications but have high complexity and lack sequential processing capability making them ill-suited for many streaming applications at the edge where devices are heavily resource-constrained. Thus motivated, many researchers have proposed reformulating the transformer models as RNN modules which modify the self-attention computation with explicit states. However, these approaches often incur significant performance degradation. The ultimate goal is to develop a model that has the following properties: parallel training, streaming and low-cost inference, and SOTA performance. In this paper, we propose a new direction to achieve this goal. We show how architectural modifications to a recurrent model can help push its performance toward Transformer models while retaining its sequential processing capability. Specifically, inspired by the recent success of Legendre Memory Units (LMU) in sequence learning tasks, we propose LMUFormer, which augments the LMU with convolutional patch embedding and convolutional channel mixer. Moreover, we present a spiking version of this architecture, which introduces the benefit of states within the patch embedding and channel mixer modules while simultaneously reducing the computing complexity. We evaluated our architectures on multiple sequence datasets. In comparison to SOTA transformer-based models within the ANN domain on the SCv2 dataset, our LMUFormer demonstrates comparable performance while necessitating a remarkable 53 times reduction in parameters and a substantial 65 times decrement in FLOPs. Additionally, owing to our model's proficiency in real-time data processing, we can achieve a 32.03% reduction in sequence length, all while incurring an inconsequential decline in performance. Our code is publicly available at https://github.com/zeyuliu1037/LMUFormer.git.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2402.04882")

Code

Syntology Ran 9 of 12 code samples harvested from 1 repository linked to this paper; 3 have no recorded run. Of those that ran: 9 ran with no contract checked.

By repository: official repository: 12 samples from 1 repository, 9 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

zeyuliu1037/lmuformer officialmentioned in papermentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

12 samples harvested; 9 ran; 0 honoured the contract we drafted; 3 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

9ran
3unverified

Licence: 0 of the 12 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from zeyuliu1037/lmuformer. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

LMUFFTCell zeyuliu1037/lmuformer/src/blocks/lmu.py official repository ran · metamorphic tier: deterministic MIT (permissive) · 6b8fea6e27713ec3 · report
calculate_stats zeyuliu1037/LMUFormer/src/utilities/stats.py official repository ran MIT (permissive) · 571ae4f8e76e6bc8 · report
computeMatchmap zeyuliu1037/LMUFormer/src/utilities/util.py official repository ran fingerprinted MIT (permissive) · 5ee11f4af0d2fc1e · report
d_prime zeyuliu1037/LMUFormer/src/utilities/stats.py official repository ran fingerprinted MIT (permissive) · e469cef4384ff73a · report
lookup_list zeyuliu1037/LMUFormer/src/dataloader.py official repository ran MIT (permissive) · c15efdd12442aeb4 · report
make_index_dict zeyuliu1037/LMUFormer/src/dataloader.py official repository ran MIT (permissive) · a8fb3f62e2a901d7 · report
make_name_dict zeyuliu1037/LMUFormer/src/dataloader.py official repository ran MIT (permissive) · cbf115a314bcd23e · report
matchmapSim zeyuliu1037/LMUFormer/src/utilities/util.py official repository ran MIT (permissive) · 546678fcbd2854db · report
validate_ensemble zeyuliu1037/LMUFormer/src/traintest.py official repository ran MIT (permissive) · ecb5ae1f3a358b96 · report
SLMU zeyuliu1037/lmuformer/src/blocks/lmu.py official repository unverified MIT (permissive) · f4bcb5b173cf2e51 · report
SpikingLMUFFTCell zeyuliu1037/lmuformer/src/blocks/lmu.py official repository unverified MIT (permissive) · 72efcd381a467f79 · report
calc_recalls zeyuliu1037/LMUFormer/src/utilities/util.py official repository unverified MIT (permissive) · 0bed13389f791924 · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Absolute Position EncodingsAdamAttentionBPEDense ConnectionsDropoutLMULabel SmoothingLayer NormalizationLinear LayerMulti-Head AttentionPosition-Wise Feed-Forward LayerResidual ConnectionSoftmaxTransformer

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections