FG2-GDN: Enhancing Long-Context Gated Delta Networks with Doubly Fine-Grained Control
Not on the map. Why?
Abstract (arXiv)
Linear attention mechanisms have emerged as promising alternatives to softmax attention, offering linear-time complexity during inference. Recent advances such as Gated DeltaNet (GDN) and Kimi Delta Attention (KDA) have demonstrated that the delta rule, an online gradient descent update, enables superior associative recall compared to simple additive updates. While KDA refined the coarse head-wise decay gate into channel-wise decay, the learning rate βt in the delta update remains a scalar, limiting the model's capacity for dimension-specific adaptation. We introduce FG2-GDN, which replaces the scalar βt with a channel-wise vector analogous to the transition from SGD to per-coordinate adaptive optimizers such as AdaGrad and Adam. We further propose FG2-GDN+, which decouples the scaling for keys and values, enabling independent control of erasure strength and write strength. Experiments on synthetic and real-world benchmarks show that FG2-GDN and its variant improve associative recall and long-context understanding over GDN and KDA, with comparable computational efficiency.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 27 of its 38 references that are in the map. First posted on arXiv 21 Apr 2026.
Builds on
27 of 38 references.
References · 27
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,616
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2021Efficiently Modeling Long Sequences with Structured State Spacescited by 2,424
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
- 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 1,979
- 2020Rethinking Attention with Performerscited by 1,584
- 2023LongBench: A Bilingual, Multitask Benchmark for Long Context Understandingcited by 1,378
- 2024Transformers are SSMs: Generalized Models and Efficient Algorithms Through Structured State Space Dualitycited by 1,283
- 2024RULER: What's the Real Context Size of Your Long-Context Language Models?cited by 1,270
15 more
- 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 960
- 2023RWKV: Reinventing RNNs for the Transformer Eracited by 814
- 2023Retentive Network: A Successor to Transformer for Large Language Modelscited by 594
- 2023Gated Linear Attention Transformers with Hardware-Efficient Trainingcited by 490
- 2024Gated Delta Networks: Improving Mamba2 with Delta Rulecited by 483
- 2021Linear Transformers Are Secretly Fast Weight Programmerscited by 471
- 2024Parallelizing Linear Transformers with the Delta Rule over Sequence Lengthcited by 373
- 2024Titans: Learning to Memorize at Test Timecited by 303
- 2022Transformer Quality in Linear Timecited by 189
- 2025Kimi Linear: An Expressive, Efficient Attention Architecturecited by 169
- 2025RWKV-7 "Goose" with Expressive Dynamic State Evolutioncited by 134
- 2024HGRN2: Gated Linear RNNs with State Expansioncited by 122
- 2021Going Beyond Linear Transformers with Recurrent Fast Weight Programmerscited by 84
- 2024Longhorn: State Space Models are Amortized Online Learnerscited by 58
- 2025ATLAS: Learning to Optimally Memorize the Context at Test Timecited by 57
Built on by
Citing papers per year: 2026: 1.
1 paper.