aspireai.
PUBLIC EDITION

A simulator that predicts the tail latency of LLM serving rather than one throughput number, because prefill and decode behave nothing alike

AspireAI community · arXiv (cs.AI)
GAUSS predicts full distributions of time-to-first-token and time-between-tokens plus the sustainable request rate for a given workload, engine and accelerator. It pairs calibrated phase-specific latency surfaces for prefill and decode with a Lindley-recurrence queueing model under stochastic arrivals, and estimates performance by ensemble Monte-Carlo sampling rather than replaying a single trace. The motivation is operational: tail latency for users degrades well before aggregate throughput saturates, and trace-driven simulators systematically under-sample that tail. The paper positions the tool for operating-point selection, traffic segmentation and capacity questions about shortest-remaining-processing-time scheduling.
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.