Orthrus-Qwen3: up to 7.8×tokens/forward on Qwen3, identical output distribution
FranckDernoncou
34 points
3 comments
May 15, 2026
Related Discussions
Found 5 related stories in 89.0ms across 8,303 title embeddings via pgvector HNSW
- Qwen-3.6-Plus is the first model to break 1T tokens processed in a day Alifatisk · 49 pts · April 05, 2026 · 63% similar
- We got 207 tok/s with Qwen3.5-27B on an RTX 3090 GreenGames · 162 pts · April 20, 2026 · 57% similar
- Qwen3.5-Omni meetpateltech · 18 pts · March 30, 2026 · 54% similar
- Qwen3.6-35B-A3B on my laptop drew me a better pelican than Claude Opus 4.7 simonw · 363 pts · April 16, 2026 · 50% similar
- Qwen3.7-Max: The Agent Frontier kevinsimper · 650 pts · May 20, 2026 · 50% similar
Discussion Highlights (2 comments)
FranckDernoncou
Paper: https://arxiv.org/abs/2605.12825 ; Code+models: https://github.com/chiennv2000/orthrus ; Disclosure: co-author. Idea: Inject a trainable diffusion attention module into each layer of a frozen AR Transformer. Both heads share one KV cache. Diffusion head projects K=32 tokens in parallel; AR head verifies in a second pass and accepts the longest matching prefix. Output distribution is provably identical to the base model. Results: - Up to 7.8x TPF, ~6x wall-clock on MATH-500. - 16% of params trained, <1B tokens, 24h on 8xH200. - vs. diffusion LMs (Dream, Fast-dLLM-v2, SDAR, Mercury, Gemini Diffusion): they modify base weights and lose accuracy (Fast-dLLM-v2: -11 pts on MATH-500). Orthrus freezes the backbone; accuracy matches Qwen3-8B exactly. - vs. Speculative Decoding (EAGLE-3, DFlash): no external drafter, no separate cache, zero TTFT penalty (no drafter to init/sync). KV overhead is O(1) (~4.5 MiB flat). Acceptance length on MATH-500: 11.7 vs. 7.9 (DFlash) vs. 3.5 (EAGLE-3). - Single-step denoising beats multi-step (6.35 vs. 3.53 TPF). KL distillation beats CE on acceptance rate. Limitations: strictly bounded by the frozen base model (inherits its biases, hallucinations, knowledge gaps); Qwen3-only evaluation; greedy + rejection sampling only.
xiphias2
The most interesting part of this idea for me is how it wasn't tried / implemented before, as it makes sense. I haven't read the paper but of course DTree tricks work here as well