Mamba and State Space Models (SSMs) are a class of sequence modeling architectures based on continuous-time dynamical systems that process sequences through learned linear recurrences with selective gating mechanisms — offering an alternative to Transformers that achieves linear computational complexity in sequence length while maintaining competitive or superior performance on language modeling, audio processing, and genomic analysis tasks.

State Space Model Foundations:

• Continuous-Time Formulation: An SSM maps an input signal u(t) to an output y(t) through a hidden state h(t) governed by differential equations: dh/dt = Ah(t) + Bu(t), y(t) = Ch(t) + Du(t), where A, B, C, D are learned parameter matrices
• Discretization: Convert the continuous-time system to discrete time steps using zero-order hold (ZOH) or bilinear transform, producing recurrence equations: h_k = A_barh_{k-1} + B_baru_k, suitable for processing discrete token sequences
• Dual Computation Modes: The recurrence can be unrolled as a global convolution during training (parallelizable across sequence positions) and computed as an efficient recurrence during inference (constant memory per step)
• HiPPO Initialization: Initialize matrix A using the HiPPO (High-Order Polynomial Projection Operators) framework, which compresses the input history into a polynomial approximation optimized for long-range memory retention

S4 and Structured State Spaces:

• S4 (Structured State Spaces for Sequence Modeling): The foundational work that made SSMs practical by parameterizing A as a diagonal plus low-rank matrix (DPLR) and using the NPLR decomposition for stable, efficient computation
• S4D (Diagonal SSM): Simplifies S4 by restricting A to a purely diagonal matrix, achieving comparable performance with significantly simpler implementation and fewer parameters
• S5 (Simplified S4): Further simplifications using MIMO (multi-input multi-output) state spaces and parallel scan algorithms for efficient training on modern hardware
• Long Range Arena Benchmark: SSMs dramatically outperform Transformers on the Path-X task (16K sequence length), demonstrating superior long-range dependency modeling with linear scaling

Mamba Architecture:

• Selective State Spaces: Mamba's key innovation is making the SSM parameters (B, C, and the discretization step Delta) input-dependent rather than fixed, enabling content-aware filtering that selectively propagates or forgets information based on the input at each position
• Selection Mechanism: Input-dependent gating allows the model to dynamically adjust its effective memory horizon — attending closely to important tokens while rapidly forgetting irrelevant ones
• Hardware-Aware Design: Fused CUDA kernels compute the selective scan operation entirely in GPU SRAM, avoiding materializing the full state matrix in HBM and achieving near-optimal hardware utilization
• Simplified Architecture: Removes attention and MLP blocks entirely, replacing the full Transformer block with an SSM block containing linear projections, depthwise convolution, selective SSM, and element-wise gating
• Linear Scaling: Computational cost scales as O(n) in sequence length for both training and inference, compared to O(n²) for standard self-attention

Mamba-2 and Recent Advances:

• State Space Duality (SSD): Mamba-2 reveals a mathematical equivalence between selective SSMs and a structured form of linear attention, unifying the SSM and Transformer perspectives
• Larger State Dimension: Mamba-2 uses larger state sizes (128–256 vs. Mamba's 16) enabled by the more efficient SSD algorithm, improving expressiveness
• Hybrid Architectures: Jamba (AI21) and Zamba combine Mamba layers with sparse attention layers, achieving the best of both worlds — linear scaling for most of the computation with occasional full attention for tasks requiring global context
• Vision Mamba (Vim): Adapt Mamba for image processing by scanning image patches in bidirectional sequences, achieving competitive results with ViT on image classification

Performance and Scaling:

• Language Modeling: Mamba matches Transformer++ (with FlashAttention-2) at scales from 130M to 2.8B parameters on language modeling benchmarks, with 3–5x higher throughput during inference
• Inference Efficiency: The recurrent formulation enables constant-time per-token generation regardless of sequence length, compared to Transformer's linearly growing KV-cache computation
• Training Throughput: Despite linear theoretical complexity, practical training speed depends heavily on hardware utilization — Mamba's custom CUDA kernels are essential for realizing the theoretical advantage
• Context Length: SSMs naturally handle sequences of 100K+ tokens without the memory explosion of quadratic attention, though whether they fully utilize such long contexts is still under investigation
• Scaling Laws: Preliminary results suggest SSMs follow similar scaling laws as Transformers (performance improves predictably with model size and data), though the constants may differ

Limitations and Open Questions:

• In-Context Learning: SSMs may be weaker at in-context learning (few-shot prompting) compared to Transformers, as they compress context into a fixed-size state rather than maintaining explicit key-value storage
• Copying and Retrieval: Tasks requiring verbatim copying or precise retrieval from long contexts remain challenging for pure SSM architectures, motivating hybrid designs
• Ecosystem Maturity: Transformer tooling (FlashAttention, vLLM, TensorRT) is far more mature than SSM infrastructure, creating practical deployment barriers

Mamba and state space models represent the most compelling architectural alternative to the Transformer paradigm — offering theoretically and practically linear sequence processing while raising fundamental questions about the relative importance of attention-based explicit memory versus recurrent implicit memory for different classes of sequence modeling tasks.