Fetching from the wire…
Public story · 2026-07-20 · high
It matches a standard Transformer's loss using about a third less compute on an 18-billion-parameter mixture-of-experts model, per the paper.
Why now: The paper posted in July 2026, and compute-matched ledgers like this are still rare in architecture papers.
Researchers scaled a Transformer connection method called xHC to 16 parallel residual streams, past mHC's four-stream ceiling, per a new paper.
That matters for anyone training large mixture-of-experts models on a compute budget. On an 18-billion-parameter MoE, xHC scores 4.0 points higher on average downstream than mHC.
A standard Transformer needs 1.50 times xHC's compute to match its training loss; mHC needs 1.19 times.
The trick is sparsity. xHC only updates 4 of its 16 streams each step, then adds what the paper calls temporal feature augmentation to keep the rest useful. A separate variant, xHC-Flash, cuts memory traffic per sublayer from 73.5C to 40C.
The paper doesn't say whether these results hold above 18B parameters, or whether anyone outside this lab has reproduced them. One paper on one model size is a data point, not a trend.
Most architecture papers publish a score delta and move on. This one attaches a compute-matched ledger, the only way these comparisons mean anything. If the numbers hold up in a second lab and a bigger model, xHC replaces mHC as the default multi-stream design.
Each link below shares sources, entities, or timing with this story.
Google released Flash / Shared entity: Flash / Earlier coverage / Tension
Linked by a graph relationship (Google released Flash); both cover Flash; earlier Flash coverage from 2026-06-19.
Google released Flash / Shared entity: MoE / Earlier coverage / Tension
Linked by a graph relationship (Google released Flash); both cover MoE; earlier MoE coverage from 2026-04-20.
Shared entities / Earlier coverage / Tension
Both cover Flash, MoE; earlier Flash coverage from 2026-06-07; pushes against this story (versus).
Google released Flash / Shared entity: Flash / Earlier coverage
Linked by a graph relationship (Google released Flash); both cover Flash; earlier Flash coverage from 2026-07-19.
Linked by a graph relationship (Google released Flash); both cover Flash; earlier Flash coverage from 2026-07-13.
Linked by a graph relationship (Google released Flash); both cover Flash; earlier Flash coverage from 2026-07-01.
Linked by a graph relationship (Google released Flash); both cover Flash; earlier Flash coverage from 2026-06-28.
Linked by a graph relationship (Google released Flash); both cover Flash; earlier Flash coverage from 2026-06-26.