Fetching from the wire…
Public story · 2026-08-16 · high
The blocks train inside a frozen aligner, then recompose to match a monolithic model's perplexity, using more total compute.
Why now: The paper describing MoT lands in the August 16 briefing as a proof-of-mechanism result, with no report yet of the aligner getting reused across separate runs.
Researchers split a 1.3B-parameter model into independently trained layer blocks that recompose to match its original perplexity, per the arXiv paper describing MoT, short for Mixture of Training.
That matters for teams that schedule pretraining runs. MoT lets pretraining decompose into small, independently schedulable jobs instead of one continuous run. Its schedule cut the idealized critical path versus a monolithic run, once the shared aligner scaffold already existed.
The method partitions a Transformer into contiguous blocks of layers. Each block trains inside a frozen aligner pretrained ahead of time. The blocks then recompose with an optional short end-to-end adaptation pass. On a 1.3B Gemma-style model trained on the C4 dataset, a quality-parity schedule matched the monolithic baseline's perplexity.
Yes, but the blocks process more aggregate tokens than the monolithic run does. The shorter critical path only becomes a real compute win if the aligner gets reused across many training runs, not built once and discarded. The paper's own authors call MoT a proof of mechanism, not a replacement for standard pretraining.
Each link below shares sources, entities, or timing with this story.
Amid a week of pricing and commerce stories, here's hard tech you can actually download. Google released DiffusionGemma on June 10, a 26B-parameter Mixture-of-Experts model (3.8B active) that generates text by diffusion instead of left-to-right decoding. The architecture is th...
Google's HF org lists diffusiongemma-26B-A4B-it (~4B active), an image-text-to-text Gemma member that's diffusion-style rather than purely autoregressive (Hugging Face). No detailed announcement yet, which is why I'm flagging it low. But a diffusion approach inside the Gemma o...
Google DeepMind shipped Quantization-Aware Training checkpoints for every Gemma 4 size, and the headline number is genuinely useful: the smallest model goes from 11.4GB to 1.1GB. That's 0.84GB if you go text-only. Up to ~72% lower VRAM and 2x faster inference on mobile NPUs, w...
Google released open-source Multi-Token Prediction (MTP) drafters for the Gemma 4 model family. The concept: pair a heavy target model (Gemma 4 31B) with a lightweight drafter that predicts several future tokens in parallel. The target model verifies the predictions in a singl...
Google DeepMind released Gemma 4 on April 2 with four model sizes (E2B, E4B, 26B MoE, 31B Dense) under Apache 2.0. Multimodal (text, vision, audio). 256K context. Native thinking and tool-calling optimized for agentic workflows. Day-zero ecosystem support across vLLM, llama.cp...
The models are good. The license is the real story. Google released Gemma 4 on April 2 with four variants: E2B, E4B, 26B MoE, and 31B Dense. All built on the Gemini 3 architecture. The 31B Dense variant claimed #3 on Arena AI's text leaderboard, beating models 20x its size. Th...
MindPattern daily
One email a day at 7 AM. Sources and a take on every story. Unsubscribe anytime.