atlas

Research map / Architectures and efficiency / Attention and transformers

The Expressive Capacity of State Space Models: A Formal Language Perspective

NeurIPS 2024 · Architectures and efficiency › Attention and transformers · approach: State space and recurrent sequence models · 4 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Gives a formal-language theory of expressivity for linear state space models (SSMs) versus transformers and RNNs, showing SSMs handle star-free state tracking, bounded Dyck, and counters, but a nonnegative-gate design choice prevents PARITY, and checks this empirically on Mamba.

Problem

Understanding the in-principle expressive capacity of recent linear state space language models (e.g., Mamba) relative to transformers and traditional RNNs, using formal languages and automata.

Approach

Characterizes SSM expressivity via formal languages: nonnegative (exponential/sigmoid) gates provably block PARITY and modular counting, so non-time-invariant nonnegative SSMs recognize/predictively model exactly the star-free regular languages at finite precision; SSMs also solve Flip-Flop length-generally and model bounded Dyck with optimal width without a stack.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use a one-layer Mamba for Flip Flop state trackingMamba · Flip Flop, in-distribution and out-of-distribution validation setstest error: 0 error after ~ 1400 stepsHelped
Use Mamba for star-free formal languagesMamba · Test suite of 27 formal languages, star-free subsetaccuracyHelped
Use Mamba for non-star-free formal languagesMamba · Test suite of 27 formal languages, non-star-free subsetaccuracyHurt
Use Mamba to model counter languagesMamba · Test suite of 27 formal languages, counter languagesaccuracyMixed
Increase the number of Mamba layers from 1 to 2 (ablation)Mamba · Bounded-depth Dyck(K, h), test strings of length 700–1400accuracyHelped

Surprising findings

Limitations

Experimental setup

Datasets: Delétang et al. 2023 formal language test suite (27 languages) FlipFlop dataset from Liu et al. 2023 Dyck_{K,h} synthetic data

Benchmarks: 27 formal languages (Delétang et al. 2023) FlipFlop Dyck_{K,h}

Metrics: accuracy (all positions correct) length generalization accuracy

Baselines: Transformer LSTM Transformer results from Delétang et al. 2023

Builds on: Mamba S4 Krohn-Rhodes theorem Deletang et al. formal language benchmark Merrill et al. saturated transformer analysis

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy