Pith. sign in

REVIEW 5 cited by

GateLoop: Fully Data-Controlled Linear Recurrence for Sequence Modeling

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2311.01927 v2 pith:KBJ3S4FV submitted 2023-11-03 cs.LG cs.AIcs.CLcs.DS

classification cs.LGcs.AIcs.CLcs.DS
keywords data-controlledmodelsexistinggatelooplinearmodemodelingsequence
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

Linear Recurrence has proven to be a powerful tool for modeling long sequences efficiently. In this work, we show that existing models fail to take full advantage of its potential. Motivated by this finding, we develop GateLoop, a foundational sequence model that generalizes linear recurrent models such as S4, S5, LRU and RetNet, by employing data-controlled state transitions. Utilizing this theoretical advance, GateLoop empirically outperforms existing models for auto-regressive language modeling. Our method comes with a low-cost $O(l)$ recurrent mode and an efficient $O(l \log_{2} l)$ parallel mode making use of highly optimized associative scan implementations. Furthermore, we derive an $O(l^2)$ surrogate attention mode, revealing remarkable implications for Transformer and recently proposed architectures. Specifically, we prove that our approach can be interpreted as providing data-controlled relative-positional information to Attention. While many existing models solely rely on data-controlled cumulative sums for context aggregation, our findings suggest that incorporating data-controlled complex cumulative products may be a crucial step towards more powerful sequence models.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Let SSMs be ConvNets: State-space Modeling with Optimal Tensor Contractions

    cs.LG 2025-01 conditional novelty 7.0 of 10

    Treating state-space layers as tensor networks with CNN-style connectivity and optimized contraction orders yields hybrid SSM networks that outperform homogeneous SSMs on raw audio tasks and enable competitive streami...

  2. Test-time regression: a unifying framework for designing sequence models with associative memory

    cs.LG 2025-01 conditional novelty 6.0 of 10

    Sequence models that perform associative recall are unified as 'test-time regression' layers, reducing to weighted, kernel, or online least-squares regression depending on three design choices.

  3. Selective Attention: Enhancing Transformer through Principled Context Control

    cs.LG 2024-11 conditional novelty 6.0 of 10

    Selective Self-Attention adds query- and value-dependent temperature scaling to transformer attention, improving language modeling accuracy and passkey retrieval with under 0.5% extra parameters.

  4. MetaLA: Unified Optimal Linear Approximation to Softmax Attention Map

    cs.LG 2024-11 reject novelty 6.0 of 10

    MetaLA removes the Key matrix from linear attention, adds input-dependent decay plus self-augmentation, and reports gains over many linear baselines.

  5. Latent Mamba Operator for Partial Differential Equations

    cs.LG 2025-05 conditional novelty 5.0 of 10

    LaMO replaces attention in latent-token neural operators with bidirectional state-space models and reports consistent accuracy gains on six PDE benchmarks.

Pith tools