[NeurIPS 2021 Spotlight] & [IJCV 2024] SOFT: Softmax-free Transformer with Linear Complexity
-
Updated
Mar 16, 2024 - Python
#
linear-complexity
Here are 9 public repositories matching this topic...
Small-Dimensional Quadratic Programming in Linear Time
-
Updated
Aug 4, 2022 - C++
PyTorch implementation of Mamba: Selective State Space Models for efficient linear-time sequence modeling. An alternative to Transformers with O(N) complexity.
deep-learning transformers pytorch ssm mamba state-space-models sequence-modeling linear-complexity selective-scan
-
Updated
Jul 15, 2026 - Python
Algorithm for solving the Hamiltonian cycle problem deterministically and in linear time on all instances of discocube graphs (tested for graphs with over 8 billion vertices). Discocube graphs are 3-dimensional grid graphs derived from: a polycube of an octahedron | a Hauy construction of an octahedron with cubes as identical building blocks...
rust graph-algorithms loops discrete-mathematics grids sculpture hamiltonian-cycle graph-theory-algorithms optmization np-complete-problems linear-complexity 3d-grid 3d-lattice
-
Updated
Jul 23, 2024 - Rust
FluidLM is a Transformer-free language model replacing O(N²) self-attention with reaction-diffusion PDEs - achieving O(N) scaling, adaptive computation, and no KV-cache.
machine-learning natural-language-processing deep-learning language-model fluid-mechanics continuous-time linear-complexity efficient-nlp non-transformer pde-dynamics
-
Updated
Aug 26, 2026 - Python
An algorithm for solving the Hamiltonian cycle problem deterministically and in linear time on all instances of discocube graphs (tested for over graphs with 1 billion vertices).
rust graph-algorithms loops discrete-mathematics grids 3d sculpture hamiltonian-cycle graph-theory-algorithms np-complete-problems linear-complexity
-
Updated
Mar 30, 2023 - Rust
This program takes a string and multiple delimiter characters as input, and splits the string based on said delimiters. The function that performs this returns a vector of tokens, which is actually the input broken down into small strings according to the delimiters provided.
-
Updated
Mar 21, 2024 - C++
GQLSA: Grouped-Query Latent Sparse Attention — A hardware-native attention mechanism combining latent compression, grouped-query sharing, and block-sparse attention for linear O(T) complexity.
machine-learning deep-learning language-modeling pytorch artificial-intelligence transformer attention-mechanism research-paper efficient-transformers linear-complexity sparse-attention llm grouped-query-attention latent-compression hardware-native
-
Updated
Sep 8, 2026 - Python
PyWave
-
Updated
Dec 25, 2025 - Python
Add this topic to your repo
To associate your repository with the linear-complexity topic, visit your repo's landing page and select "manage topics."