mlsanityData to 7 Oct 2026

FLUID: Continuous-Time Hyperconnected Sparse Transformer for Sink-Free Learning

arXiv 2605.04421 ↗First posted 6 May 2026cs.LG cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Continuous-time (CT) Transformers improve irregular and long-range modeling over CT-RNNs by exploiting inputs or outputs embeddings with continuous dynamics. However, the core scaled-dot-product-attention (SDPA) mechanism remains inherently discrete. We propose FLUID (Flexible Unified Information Dynamics), a CT Transformer that incorporates continuous dynamics directly into the attention computation by replacing it with Liquid Attention Network (LAN). LAN reinterprets attention logits as continuous dynamical system and reformulates them as the solution to a linear ODE modulated by input-dependent nonlinear recurrent gates. Theoretically, we establish stability guarantees for LAN dynamics and show that it serves as an interpolating middle ground between SDPA and CT-RNNs, recovering each as special case under well-defined parameterization of its gating functions. LAN also introduces an explicit attention-sink gate to eliminate disproportionate attention mass on uninformative nodes. FLUID replaces standard residual connections with input-dependent Liquid Hyper-Connections to adaptively regulate interlayer information flow. Empirically, we evaluate FLUID on a broad set of learning tasks, including (i) irregular time-series, (ii) long-range modeling, (iii) lane-keeping control of autonomous vehicles, and (iv) learning physical dynamics under a scarce data regime. Across all the tasks, FLUID consistently matches or outperforms CT baselines, achieving improvements of up to 47% in certain scenarios and enhancing generalization under distributional shifts. Additionally, FLUID demonstrates superior noise robustness and a self-correcting inductive bias in autonomous vehicle control. We also provide a detailed analysis of key hyperparameters to guide tuning and show that FLUID occupies an intermediate position among competing approaches in terms of runtime and memory efficiency.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 32 of its 51 references that are in the map. First posted on arXiv 6 May 2026.

Builds on

32 of 51 references.

References · 32

  1. 2017Attention Is All You Needcited by 59,932
  2. 2017Proximal Policy Optimization Algorithmscited by 14,441
  3. 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,690
  4. 2014Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translationcited by 4,016
  5. 2018Neural Ordinary Differential Equationscited by 3,733
  6. 2021Efficiently Modeling Long Sequences with Structured State Spacescited by 2,424
  7. 2020Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecastingcited by 2,141
  8. 2023Efficient Streaming Language Models with Attention Sinkscited by 2,115
  9. 2020Rethinking Attention with Performerscited by 1,584
  10. 2020Efficient Transformers: A Surveycited by 784
  11. 2025Gated Attention for Large Language Models: Non-linearity, Sparsity, and Attention-Sink-Freecited by 266
  12. 2020Sparse Sinkhorn Attentioncited by 250
20 more
  1. 2021Multi-Time Attention Networks for Irregularly Sampled Time Seriescited by 234
  2. 2019GRU-ODE-Bayes: Continuous modeling of sporadically-observed time seriescited by 230
  3. 2024When Attention Sink Emerges in Language Models: An Empirical Viewcited by 200
  4. 2020Liquid Time-constant Networkscited by 160
  5. 2023Quantizable Transformers: Removing Outliers by Helping Attention Heads Do Nothingcited by 147
  6. 2016Phased LSTM: Accelerating Recurrent Network Training for Long or Event-based Sequencescited by 98
  7. 2020Learning Long-Term Dependencies in Irregularly-Sampled Time Seriescited by 82
  8. 2024Hyper-Connectionscited by 81
  9. 2025mHC: Manifold-Constrained Hyper-Connectionscited by 76
  10. 2021Closed-form Continuous-time Neural Modelscited by 65
  11. 2019Explicit Sparse Transformer: Concentrated Attention Through Explicit Selectioncited by 61
  12. 2024ContiFormer: Continuous-Time Transformer for Irregular Time Series Modelingcited by 61
  13. 2023ODEFormer: Symbolic Regression of Dynamical Systems with Transformerscited by 58
  14. 2025Softpick: No Attention Sink, No Massive Activations with Rectified Softmaxcited by 20
  15. 2023HUST bearing: a practical dataset for ball bearing fault diagnosiscited by 9
  16. 2025OT-Transformer: A Continuous-time Transformer Architecture with Optimal Transport Regularizationcited by 7
  17. 2025Continuous-Time Attention: PDE-Guided Mechanisms for Long-Sequence Transformerscited by 5
  18. 2025CARLE: A Hybrid Deep-Shallow Learning Framework for Robust and Explainable RUL Estimation of Rolling Element Bearingscited by 5
  19. 2025Neuronal Attention Circuit (NAC) for Representation Learningcited by 3
  20. 2025Developing Distance-Aware Physics-Constrained Probabilistic Frameworks for Industrial Prognosticscited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.