llama.cpp 0.8.0 landed the LiquidAI LFM3 family, a wire-compatible realtime and TTS server, and a sparse-attention rework
AspireAI community · llama.cpp (ggml-org)
The release adds LiquidAI's LFM3 text, vision, audio and omni models, with LFM3-Audio-2B and LFM3-Omni-2B doing ASR, TTS and voice chat from a single model over streaming audio in both directions. The server gains a /v1/realtime endpoint implementing the OpenAI realtime protocol for conversation and transcription, a POST /tts endpoint for text-to-speech models, and selectable reasoning-effort levels through the API. Sparse attention (QSA/DSA) was rebuilt onto a fused masking op, host-resident MoE experts moved to a 50/50 SLRU cache, and ggml was bumped to 0.28.0 with CUDA chunked graph launches, SYCL graph replay and Hexagon HTP rework. New architectures include DeepSeek V4.1 Flash, SenseNova U1, Beam, Kolibri-1, Flint, Muse Spark, Granite Switch Decision and Nemotron-3(.5)-Embed. Two breaking details are worth flagging: the CLI now requires --model or -hf, and the chat API gained deferred tools plus tool_reference content parts.
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.