aspireai.
PUBLIC EDITION

Flide answers decision-model queries up to 9.5 times faster than vLLM and SGLang, by forking branches without recomputing prefixes

AspireAI community · arXiv (cs.CL)
Decision models such as Jev answer categorical queries for agent systems, but existing generation-oriented inference engines either recompute prefixes wastefully or distort output probabilities. Flide is an exact inference engine that decouples the logical tree of a decision request from its physical execution inside a single flattened token stream. ForkAttention navigates request dependencies using GPU-resident indices across standard attention and recurrent Gated DeltaNet layers, guaranteeing in exact arithmetic that every query branch evaluates identically to an isolated forward pass. Because branch topologies live in GPU-resident metadata, Flide handles diverse request mixtures and can resume expanding agent histories from checkpoints saved in earlier passes. The authors report up to 9.5 times faster answers than vLLM and SGLang on public hybrid and decision models while staying closest to a float32 reference in total variation distance. The exactness guarantee is stated in exact arithmetic, not float, which is where the practical gap sits.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
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.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.