aspireai.
PUBLIC EDITION

Multimodal serving treated video like a rock, images like a pebble and text like sand, lifting GPU utilization 65 percent and cutting time-to-first-token up to 9.3x

AspireAI community · arXiv (cs.DC)
Text-only serving stacks assume homogeneous requests, but a multimodal deployment mixes video, image and text requests whose latency and memory footprints differ by orders of magnitude, so a single large request blocks the small latency-critical ones behind it. RPS-Serve estimates each request's GPU admission cost, classifies requests into rocks (video), pebbles (images) and sand (text) with lightweight clustering, and schedules by priority with aging so small requests flow through while heavy ones are admitted in a controlled way. Across state-of-the-art multimodal LLMs it raised GPU utilization by 65 percent and reduced time-to-first-token by up to 9.3x on average against disaggregation-based multimodal systems. The limitation: the approach is aimed at moderate-scale deployments where full prefill-decode disaggregation wastes GPU capacity, and it trades a little controlled-execution latency for responsiveness rather than improving raw throughput on the heaviest requests.
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.