atlas

Research map / Architectures and efficiency / RNNs and normalization

Hankel Singular Value Regularization for Highly Compressible State Space Models

NeurIPS 2025 · Architectures and efficiency › RNNs and normalization · approach: Theory of depth and width · 1 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.

Regularizes the nuclear norm of Hankel singular values during training of S5-style rotation-parametrized SSM layers so they can be compressed via balanced truncation with little accuracy loss.

Problem

SSM layers trained with standard optimization have slowly decaying Hankel singular values, so they cannot be compressed to lower state order without large accuracy loss.

Approach

Add a differentiable Hankel nuclear norm regularizer during training, enabled by a block-rotation SSM parametrization whose Lyapunov equations decompose into 2x2 blocks, giving O(n^2) gramian computation; compress afterward with balanced truncation and layer-adaptive rank selection.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
add Hankel singular value regularization during trainingSSM · sCIFAR (grayscale), 80% truncationtest accuracy: 21.14 -> 81.37Helped
add Hankel singular value regularization during trainingSSM · sMNIST, 80% truncationtest accuracy: 11.05 -> 98.90Helped
add Hankel singular value regularization during trainingSSM · IMDB, 80% truncationtest accuracy: 51.32 -> 86.97Helped
add Hankel singular value regularization during trainingSSM · PATH, 80% truncationtest accuracy: 50.35 -> 50.50No clear effect
add Hankel singular value regularization during trainingSSM · PATH-X, 80% truncationtest accuracy: 50.16 -> 54.02Helped
use Hankel singular value regularization instead of L1 regularizationSSM · sCIFAR (grayscale), 80% truncationtest accuracy: 69.90 -> 81.37Helped
use Hankel singular value regularization instead of L1 regularizationSSM · IMDB, 80% truncationtest accuracy: 50.16 -> 86.97Helped
use Hankel singular value regularization instead of L1 regularizationSSM · sMNIST, 80% truncationtest accuracy: 90.12 -> 98.90Helped
replace block-wise Lyapunov solver with naive Lyapunov solver for HSVRSSM training · sMNISTrelative training time: 1.12× -> 27.3×Hurt
compress the trained SSM at 80% truncationHSVR sCIFAR model · sCIFAR (grayscale)runtime ratio: 0.45Helped

Surprising findings

Limitations

Experimental setup

Datasets: CIFAR-10 grayscale (sCIFAR) MNIST (sMNIST) IMDB PATH PATH-X

Benchmarks: sCIFAR (grayscale) sMNIST IMDB PATH PATH-X

Metrics: test accuracy truncation ratio inference runtime ratio relative training time

Baselines: LAST global pruning uniform pruning no regularization L1 regularization of diagonal blocks

Builds on: S5 HiPPO balanced truncation Bartels-Stewart algorithm Long Range Arena

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