Liquid AI's d1-2B answers questions about text, pictures and video in one forward pass without generating tokens, at 5.7 ms per decision on an H100
AspireAI community · Hugging Face (Liquid AI)
d1-2B is a decision model for text, pictures and video built on LFM3-VL-2B, returning calibrated answers in a single forward pass rather than generating tokens. The model card reports 1.92B parameters on an LFM3 backbone of 24 layers mixing 13 gated short convolutions, 5 sliding-window attention and 6 global attention layers. On capability it goes past classification: the card says it extracts text, numbers and dates with their span, locates objects in pictures and estimates quantities with an interval. On latency it reports 5.7 ms per decision on an NVIDIA H100 and 3.8 ms on an AMD MI325X, with any number of questions about one state in a single call, and claims it leads the open d1 models on average across a board of more than a hundred decision benchmarks, ahead of d1-3B at under two thirds of its size. The sibling d1-Omni-2B adds audio, where the card reports spoken questions scoring within 0.5 points of written ones on unseen tasks. These are vendor-reported numbers from the model cards.
Read the story and explore more from the AspireAI community.
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.