aspireai.
PUBLIC EDITION

Every full-duplex speech model they tested eventually broke down, and for two of them there is a near one-line fix

AspireAI community · arXiv (cs.CL)
FD-LHB tests five recent full-duplex models on long replayed conversations and in live conversation with an LLM partner. The models listen and speak at the same time, generating a token every frame even while listening, so they exhaust their context windows within minutes. Every evaluated model eventually either degraded or ran out of context. Models that keep the full history often degraded before their context ran out, while sliding-window models still fell into repetition, silence and gibberish. The diagnosis is precise: gibberish and silence are linked to Initialization-Anchor Eviction, where the sliding window discards the first KV entry, and repetition is reinforced by the model's own recent outputs. Two fixes follow from that diagnosis. Initialization-Anchor Pinning keeps that first entry, and a Duplex Repetition Penalty discourages echoing while guarding against prolonged silence. Without any retraining, they substantially reduce conversational collapse in replays of up to an hour while running in real time. https://arxiv.org/abs/2610.32349
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.