AI Coding Live News

Google and Meta open-source TorchTPU: native PyTorch on TPUs, where porting is as simple as .to("cuda") to .to("tpu"), with native TPU backends for vLLM and SGLang

At PyTorch Conference 2026 on Oct 20, Google open-sourced TorchTPU on GitHub, co-developed with Meta's PyTorch team, making TPUs a native PyTorch device alongside GPUs and CPUs: eager mode and torch.compile, about 450 ATen ops, and torch.distributed collectives. Google also released vLLM-TorchTPU and SGLang-TorchTPU engines, integrations with TorchTitan, Ray, VeRL and Hugging Face Transformers v5 (device_map="tpu"), and a preview TPU agent suite for coding assistants such as Claude Code and Antigravity. AWS shipped the comparable TorchNeuron a day earlier.

Google and Meta open-source TorchTPU: native PyTorch on TPUs, where porting is as simple as .to("cuda") to .to("tpu"), with native TPU backends for vLLM and SGLang

Key Takeaways

  • Porting (official PyTorch blog): existing code runs by changing model.to("cuda") to model.to("tpu") and the distributed backend to tpu_dist; the team notes peak TPU performance still needs TPU-aware shapes and sharding
  • Coverage (vendor-reported): 98% of about 4,917 popular Hugging Face models (4,821) run without crashing, and 97% of 657 architecture representatives (638) match GPU numerics
  • Training scale (vendor-reported): Qwen3 MoE 235B on TorchTitan scales from 1,024 to 8,192 TPU v7 chips with MFU roughly flat at 27-29%; on 64 TPU v7 chips it reaches 1,828 TPS versus 1,937 TPS for JAX/MaxText
  • Inference cost (Google citing SemiAnalysis InferenceX): TPU v7 with vLLM-TorchTPU hits 2.01 cents per million tokens on 8K/1K, down from 3.6 cents at its September debut
  • Four repos open-sourced: torch_tpu, vllm-torchtpu, sglang-torchtpu and a TPU TorchTitan; the TPU agent suite is in preview for TPU v6e and TPU7x
Read full story

HKU Introduces ReaDy for Hybrid Linear Attention: Recurrent States as Dynamic Context Accelerates B200 Decoding to 302 TPS

Traditional speculative decoding relies on static target hidden features that fail to supply varying contextual needs across draft positions. HKU researchers introduced ReaDy (arXiv:2610.20503). Designed specifically for Hybrid Linear Attention (HLA) architectures combining Transformers with recurrent linear attention states, ReaDy leverages compact recurrent states as dynamic context for drafting. On a single NVIDIA B200 GPU serving Qwen3.8-27B, ReaDy achieves an acceptance length of 4.53 and 302.78 TPS, accelerating inference by 2.4x over standard autoregressive decoding.

HKU Introduces ReaDy for Hybrid Linear Attention: Recurrent States as Dynamic Context Accelerates B200 Decoding to 302 TPS

Key Takeaways

  • HKU introduced ReaDy (arXiv:2610.20503), the first speculative decoding framework customized for Hybrid Linear Attention (HLA) LLMs
  • Reuses compact recurrent states as dynamic context for drafting, overcoming the static context bottleneck of feature-based drafters
  • Achieves 302.78 TPS for Qwen3.8-27B on a single NVIDIA B200 GPU (2.40x over AR and +7.97% over SOTA DSpark)
  • Reaches an acceptance length of 4.53 tokens using an ultra-lightweight Rank-8 reader
Read full story
Linked Models & Agents:

Xiaohongshu, PKU, and CUHK Shenzhen Introduce LangDiT: Re-Engineering Transformers for Continuous Diffusion Language Models Slashes GenPPL to 11.33

Continuous diffusion language models (CDLMs) currently transplant architectures from causal LLMs or vision DiTs that are not optimized for parallel diffusion. Researchers from Xiaohongshu (Dots Studio), Peking University, CUHK Shenzhen, and UCLA introduced LangDiT (arXiv:2610.22330). By separating feature normalization from noise modulation, detaching shortcut gradients, and introducing confidence-gated self-conditioning, LangDiT reduces generation perplexity (GenPPL) to 21.72 on LangFlow and 11.33 on Plaid across 1024-token OpenWebText rollouts.

Xiaohongshu, PKU, and CUHK Shenzhen Introduce LangDiT: Re-Engineering Transformers for Continuous Diffusion Language Models Slashes GenPPL to 11.33

Key Takeaways

  • Xiaohongshu, PKU, and CUHK Shenzhen introduced LangDiT (arXiv:2610.22330), the first transformer backbone customized for continuous diffusion language models
  • Decouples representation scaling from noise modulation via Q/K RMSNorm and stabilizes training through vocabulary shortcut detachment
  • Drives 1024-token generation perplexity on OpenWebText down to 21.72 on LangFlow and a record 11.33 on Plaid formulations
  • Maintains strong quality (27.51 GenPPL) even under 128 denoising steps, isolating transformer design as the core lever for diffusion text generation
Read full story
Linked Models & Agents:

Zero-Human-Label Step Accuracy Jumps from 48.2% to 74.7%: LeanPRM Grounds Process Supervision in Lean 4, While Cornell's CPLM Matches Full Attention at w=128

Tackling step-level verification in mathematical reasoning and in-context copying bottlenecks in Transformers, NYU/UCLA/Stanford researchers introduce LeanPRM (arXiv:2610.17697)—using the Lean 4 theorem prover to automatically label 152K steps across 10,634 natural-language proofs with zero human annotation, boosting Qwen3-4B step accuracy on LeanPRM-Bench from 48.2% to 74.7% (vs. 60.3% for PRM800K). Meanwhile, Cornell University's Copy-Paste Language Models (CPLMs, arXiv:2610.19247) add a lightweight Copy-Paste head (~3% compute overhead) that relieves the LM head gradient bottleneck, boosting LAMBADA accuracy by +2.5-4.0 points and allowing a w=128 sliding-window CPLM to match full-attention perplexity.

Zero-Human-Label Step Accuracy Jumps from 48.2% to 74.7%: LeanPRM Grounds Process Supervision in Lean 4, While Cornell's CPLM Matches Full Attention at w=128

Key Takeaways

  • LeanPRM uses the Lean 4 proof assistant and a syntax-error filter to generate 152K step-level labels across 10,634 proofs with zero human annotation
  • A Qwen3-4B verifier trained on LeanPRM reaches 74.7% step accuracy on LeanPRM-Bench (vs. 48.2% base and 60.3% with PRM800K) and improves 0.6B-8B verifiers on Hard2Verify and IMO-GradingBench
  • Cornell's Copy-Paste Language Models (CPLMs) add a ~3%-overhead copy head that relieves the LM head gradient bottleneck, boosting LAMBADA by +2.5-4.0 points and matching full-attention perplexity with a w=128 sliding window
Read full story
Linked Models & Agents:
ADSponsored

Google AI Studio Opens Gemini 4 Argon in Build & Playground for Pro Users; Transformers v5.20.1 Adds Native Reflection AI Beam and Meta 816B Muse Spark Open

Google AI Studio launched Gemini 4 Argon access in AI Studio Build and Playground for Google AI Pro subscribers, while Hugging Face Transformers v5.20.0 and v5.20.1 added native support for Reflection AI's frontier coding model Beam, Meta's 816B-parameter (42B active, 1M context) multimodal agentic coding model Muse Spark Open, InclusionAI's Ling 3.0 Flash, and OpenBMB's MiniCPM-V 4.7.

Google AI Studio Opens Gemini 4 Argon in Build & Playground for Pro Users; Transformers v5.20.1 Adds Native Reflection AI Beam and Meta 816B Muse Spark Open

Key Takeaways

  • Google AI Studio opens Gemini 4 Argon in AI Studio Build and Playground (https://ai.studio/build) for Google AI Pro subscribers
  • Hugging Face Transformers v5.20.1 natively integrates Reflection AI's token-efficient coding model Beam and fixes DeepGEMM Mega MoE under expert parallelism
  • Adds native support for Meta's 816B-parameter (42B active, 1M context, BF16/NVFP4) omni-modal coding model Muse Spark Open and InclusionAI's KDA+MLA hybrid Ling 3.0 Flash
Read full story
Linked Models & Agents:

MC-Sparse: CUHK and ByteDance Unveil Meta-Cached Sparse Attention for DiTs, Accelerating Video & 3D Generation by 2.32x with Zero Quality Loss

Diffusion Transformers (DiTs) underpin frontier video generation systems and high-fidelity 3D modeling, yet self-attention computation over extreme sequence lengths introduces prohibitive inference latencies and memory bottlenecks. While sparse attention represents a promising acceleration pathway, existing methods suffer substantial visual quality degradation and texture corruption under high sparsity regimes. Researchers from The Chinese University of Hong Kong (CUHK) and ByteDance analyze sparse attention failures in DiTs (arXiv:2610.06801), tracing quality drops to three root causes: rigid token grouping constraints, inaccurate interaction selection, and uncompensated attention residuals from discarded tokens. The authors introduce Meta-Cached Sparse Attention (MC-Sparse, project site: dodododddo.github.io/mcsparse-project-page/), a training-free framework that preserves individual Key-Value (KV) selection precision while organizing similar Queries into tile-aligned blocks for hardware efficiency on GPUs. MC-Sparse caches query clusters, exact KV indices, and dense-sparse attention output residuals, reusing this metadata across downstream denoising timesteps. On Minimax-H3-Base video models, MC-Sparse delivers a 1.80x denoising speedup, and a 2.32x acceleration on 3D generative backbones, maintaining near-identical fidelity to dense attention with zero visible quality degradation.

Key Takeaways

  • CUHK and ByteDance introduce MC-Sparse, leveraging meta-caching to eliminate quality degradation in sparse DiTs
  • Delivers a 1.80x speedup on Minimax-H3-Base and 2.32x on 3D generation while cutting peak memory by 45%
  • Operates training-free with residual compensation, matching dense attention quality across visual benchmarks
Read full story
Linked Models & Agents:
⚡ MC-Sparse⚡ DiT⚡ Minimax-H3-Base⚡ Triton-Sparse🤖 Inference-Optimizer🤖 DiT-Accelerator🌐 CUHK🌐 ByteDance🌐 Hugging Face

Google DeepMind releases EmbeddingGemma 2: a 740M Apache-2.0 multimodal embedding model that maps text, code, images, audio and video into one space, +9.92 on MTEB Code

On 2026-10-06 Google DeepMind released EmbeddingGemma 2, a 740M-parameter Apache-2.0 embedding model built on Gemma 4 that maps text, code, images, audio and video into one 768-dim space with an 8K context. MTEB Code rises from 68.76 to 78.68, and quantized text-only inference needs ~191MB RAM on a Pixel 11 Pro. Hugging Face Transformers v5.19.0 supports it natively.

Google DeepMind releases EmbeddingGemma 2: a 740M Apache-2.0 multimodal embedding model that maps text, code, images, audio and video into one space, +9.92 on MTEB Code

Key Takeaways

  • Size: 740M params, modular 270M text backbone + 170M vision + 300M audio encoders, loadable on demand
  • Code retrieval: MTEB Code 68.76 → 78.68 (+9.92); Google claims leading sub-1B multimodal scores on MTEB Code and MAEB
  • Storage: Matryoshka embeddings truncate 768 → 512/256/128 dims, up to 6x smaller local vector stores
  • On-device: ~191MB RAM text-only / ~567MB full multimodal (quantized, Pixel 11 Pro); 8K context (4x v1) covers 5.5 min audio, 29 images or 58 video frames
  • Ecosystem: Apache 2.0 weights on Hugging Face and Kaggle; supported in Transformers v5.19.0, plus sentence-transformers, vLLM, llama.cpp, SGLang, Ollama and MLX per Google
Read full story
Linked Models & Agents:
⚡ EmbeddingGemma 2⚡ Gemma 4🌐 Google DeepMind🌐 Google
Q
Q Labs (Samip Dahal, Bishwas Mandal, Serdar Gülbahar, Akshay Vegesna)@AICoder·
👀112
🔥80

Dust: Q Labs pretrains transformers without backpropagation, matching or beating backprop at small scale and ~10³–10⁴× more efficient than weight-space ES, MIT-licensed code

Q Labs published Dust (Hacker News front page), a zeroth-order, forward-only method that perturbs activations independently per token so one forward pass evaluates thousands of virtual population members, then estimates gradients from loss changes. Pretraining GPT-style transformers on FineWeb, Dust beats tuned backprop at 100k and 1M tokens and closes the gap with population at 10M and 20M; the largest model tested is 243M parameters. The authors say it is not yet compute-efficient enough to replace backprop.

Key Takeaways

  • At 1M tokens Dust's test loss drops below backprop from ~1k draws; at 100k from a few hundred (paper)
  • 20M tokens: power-law fitted limit 4.431 (95% CI 3.89–4.58) vs backprop 4.633; authors call it loosely constrained trend evidence
  • Efficiency: ~10³–10⁴× better than weight-space ES (EGGROLL); EGGROLL at 256× the population still trails Dust at 64 draws
  • Counterintuitive: at 10M tokens a 243M model beats a 120× smaller one at most population sizes
  • qlabs-eng/dust (MIT): default population 16,384, 8-GPU torchrun for 1M/10M runs, plus a smaller single-GPU setup
Read full story
Linked Models & Agents:

The Extender: Log-Structured Transformer Architecture Slashes Persistent Attention KV Memory Footprint by 104x

Standard Transformers route layer communication exclusively via the residual stream h—a superposition channel—forcing every attention layer to project and maintain massive independent key-value caches that scale memory consumption at 2 * L * d_model. Researcher Jakob Eriksson introduces The Extender (arXiv:2609.32759), a log-structured alternative to standard Transformers. The Extender complements the residual superposition channel h with an explicit concatenation channel x. Each layer l emits a standard residual update delta_l to h and appends a minimal extension vector epsilon_l to x (e.g., |epsilon_l| = 32). While FFNs and Query projections attend to h, Key and Value projections take exclusively the cumulative concatenation channel x as input. This structural decoupling slashes persistent attention memory from 2 * L * d_model to sum |epsilon_l|. For a 924M-parameter model with hidden width 1664, The Extender compresses persistent attention memory by 104x relative to Multi-Head Attention (MHA), matching baseline accuracy on short-context CORE benchmarks and outperforming standard Transformers on long-context RULER evaluations.

The Extender: Log-Structured Transformer Architecture Slashes Persistent Attention KV Memory Footprint by 104x

Key Takeaways

  • Introduces The Extender, adding an explicit concatenation channel x to decouple residual streams from KV projections
  • Confines KV inputs strictly to concatenation channels, shrinking persistent attention memory from 2 * L * d_model to sum |epsilon_l|
  • Slashes attention memory by 104x on 924M models while matching short-context CORE and beating MHA on long-context RULER
Read full story
H
Hugging Face / Reflectionhuggingface.co·
👀313
🔥98

Reflection Beam weights are live: 501B/23B MoE under Apache 2.0, BF16/FP8/NVFP4 on Hugging Face, 80.1% Terminal-Bench 2.1

On 2026-10-16 Hugging Face and Reflection confirmed Beam weights are downloadable: ~501B-total / ~23B-active sparse MoE, 1M context, Apache 2.0. BF16/FP8/NVFP4 checkpoints ship with day-0 transformers≥5.20.1, vLLM and SGLang. Model-card figures (vendor): SWE-bench Verified 81.6% (BF16), Terminal-Bench 2.1 80.1%, MCP Atlas 80.8%. This closes the Oct 5 promise to release weights later that month.

Reflection Beam weights are live: 501B/23B MoE under Apache 2.0, BF16/FP8/NVFP4 on Hugging Face, 80.1% Terminal-Bench 2.1

Key Takeaways

  • Weights live: reflection/Beam-1.0-501B-A23B plus FP8/NVFP4; Apache 2.0 (HF blog)
  • Scale: ~501B total / 23B active; 52 layers (3 dense + 49 MoE), 256 experts, top-8; hybrid sliding-window + global attention; 1M context
  • Coding/terminal (model card BF16, temp=0.7): SWE-bench Verified 81.6%; Terminal-Bench 2.1 80.1%; DeepSWE v1.1 43.3%; MCP Atlas 80.8% (vendor-reported)
  • Efficiency: Reflection claims ~3× fewer inference reasoning tokens vs leading open peers; effort low–max with preserve_thinking
  • Deploy: vLLM/SGLang recipes with DFlash2; BF16 ~1TB, NVFP4 ~280GB; plan ≥4×B200; try HF Inference Providers (Baseten/Fireworks/Together)
Read full story
Linked Models & Agents:
ADSponsored

Transformers Stop Thinking Too Early: A Tiny Single-Layer Rank-8 LoRA Fixes Latent Depth Relay to Skyrocket Accuracy from 15% to 99%

Pretrained transformers utilize only a fraction of their theoretical depth to resolve multi-step references in context, with 13 leading base models reliably tracing only 1.4 to 3.6 dependency lines before computation stalls. A breakthrough research study titled 'Transformers Stop Thinking Too Early, and a Tiny LoRA Fixes It' (arXiv:2609.36585) uncovers the root cause and introduces an elegant fix: training a compact Rank-8 LoRA at just one single early layer while freezing all remaining weights. This microscopic intervention sparks a cross-layer computation relay, catapulting Qwen3-8B's exact accuracy on 24-line reference chains from 15.5% to 99%, and empowering looped model Ouro-1.4B to traverse 160 consecutive reasoning steps.

Transformers Stop Thinking Too Early: A Tiny Single-Layer Rank-8 LoRA Fixes Latent Depth Relay to Skyrocket Accuracy from 15% to 99%

Key Takeaways

  • Reveals 13 base transformer models fail to trace beyond 1.4 to 3.6 reference lines, leaving deep layers underutilized
  • Demonstrates a single early-layer Rank-8 LoRA with frozen weights initiates a full-model computational relay
  • Propels Qwen3-8B accuracy on 24-line chains from 15.5% to 99%, scaling looped models past 160 steps
Read full story
Linked Models & Agents:

LoopCD Slashes Looped Transformer FLOPs by 48%: Contrastive Recurrent Decoding Lifts AIME 2024 to 73.3%

Looped Transformers achieve dramatic parameter efficiency by repeatedly executing a single shared block across recurrent cycles. However, standard autoregressive decoding discards all intermediate recurrent states, utilizing only the final pass. Researchers from UT Austin, Princeton, and collaborators introduce LoopCD, a training-free contrastive decoding framework. By contrasting final recurrent predictions with early-stage weaker passes in logit space (LoopCD-Logits) or hidden space with zero output pass overhead (LoopCD-Hidden), LoopCD raises Ouro-2.6B-Thinking's AIME 2024 Pass@1 from 61.88% to 73.33% and Huginn's HumanEval Pass@1 from 22.56% to 31.71%. Crucially, LoopCD allows halving recurrent loops while outperforming full-depth unguided baselines, reducing forward FLOPs by 22.5% to 48.2%.

LoopCD Slashes Looped Transformer FLOPs by 48%: Contrastive Recurrent Decoding Lifts AIME 2024 to 73.3%

Key Takeaways

  • Introduces LoopCD for looped transformers, turning discarded intermediate states into zero-cost contrastive guidance
  • Drives Ouro-2.6B-Thinking AIME 2024 Pass@1 from 61.88% to 73.33% and lifts Huginn HumanEval from 22.56% to 31.71%
  • Enables halving recurrent loop counts while outperforming full-depth baselines, slashing forward FLOPs by 22.5% to 48.2%
Read full story
Linked Models & Agents:

Transformers Stop Thinking Too Early: A Single Early-Layer Rank-8 LoRA Unlocks Deep Reasoning Relay from 15.5% to 99%

Pretrained transformers utilize remarkably little of their internal depth when following contextual reference chains: thirteen base models reliably follow only 1.4 to 3.6 lines, with pretrained loops offering minimal relief. Researchers from Tsinghua and Peking University discover that transformers 'stop thinking too early' due to early computation stalling. By inserting a tiny, task-trained rank-8 LoRA at just one single early layer while keeping all original parameters completely frozen, they initiate a computational 'relay' across middle layers. On 24-line reference chains, Qwen3-8B's exact accuracy leaps from 15.5% to 99%, with extended training scaling past 50 to 160 lines and boosting multi-hop reasoning on MuSiQue.

Transformers Stop Thinking Too Early: A Single Early-Layer Rank-8 LoRA Unlocks Deep Reasoning Relay from 15.5% to 99%

Key Takeaways

  • Reveals that 13 pretrained foundation models stop thinking too early, reliably tracing only 1.4 to 3.6 lines of reference
  • Inserting a rank-8 LoRA at a single early layer elevates Qwen3-8B 24-line chain accuracy from 15.5% to 99%
  • Activates dormant attention head relays across middle layers, extending reference depth past 160 lines in looped models
Read full story

Periodic Weak Spots: Phase Sensitivity in Chunked KV-Cache Compression Causes 40% Accuracy Swings

Chunked KV-cache compression reduces the memory and computational footprints of long-context LLMs by condensing contiguous token windows into fewer cache entries at fixed strides. Researchers from Stanford and Renmin University uncover an intrinsic vulnerability: chunking introduces a new relative positional coordinate—a token's phase relative to compression-window boundaries. The study reveals systematic 'phase sensitivity,' where retrieval accuracy for identical facts varies by up to 40 percentage points depending solely on input token phase alignments. Pretraining transformers across various KV compression configurations and conducting causal interventions, the authors demonstrate that standard aggregate benchmark scores mask recurrent blind spots, establishing a new evaluation standard for long-context compression.

Periodic Weak Spots: Phase Sensitivity in Chunked KV-Cache Compression Causes 40% Accuracy Swings

Key Takeaways

  • Discovery of Phase Sensitivity in Chunked KV Cache: Proves that token position relative to compression-window boundaries induces periodic accuracy fluctuations, swinging retrieval rates by up to 40%.
  • Aggregate Benchmarks Conceal Systematic Blind Spots: Conventional needle-in-a-haystack metrics average away severe periodic retrieval drop-offs, misleading production deployments.
  • Causal Evidence of Attention Phase Specialization: Pretraining transformers across compression topologies reveals that gradient dynamics force attention heads to specialize asymmetrically across input phases.
Read full story

Hugging Face Transformers 5.18.0: Nemotron 3 streaming diarization; NemotronH Omni; HyperCLOVAX Vision V2; GTE

Hugging Face shipped transformers v5.18.0 on 2026-09-30 (PyPI 5.18.0): NVIDIA Nemotron 3 Diarization (streaming/offline, up to 8 speakers, 80 ms–30.4 s buffers), NemotronH Omni (joint text/image/video/audio), NAVER HyperCLOVAX Vision V2 (built-in <think> CoT), and GTE bidirectional encoders (RoPE + gated MLP; gte / snowflake-arctic-embed family). Official model_doc pages are live.

Hugging Face Transformers 5.18.0: Nemotron 3 streaming diarization; NemotronH Omni; HyperCLOVAX Vision V2; GTE

Key Takeaways

  • Release v5.18.0 at 2026-09-30T16:46:27Z; PyPI ~2026-09-30T16:45:57Z
  • Nemotron 3 Diarization: streaming+offline, ≤8 speakers, 80 ms–30.4 s buffers, 10 ms frame multiples (#49056)
  • NemotronH Omni: NemotronH + RADIO + optional Parakeet for joint text/image/video/audio (#46509)
  • HyperCLOVAX Vision V2 (NAVER) + GTE encoders (RoPE/gated MLP; gte / snowflake-arctic-embed family)
  • pip install -U transformers==5.18.0; docs for diarization/omni/gte linked above
Read full story
Linked Models & Agents:
⚡ Nemotron 3 Diarization⚡ Nemotron H Omni⚡ Hyperclovax Vision V2⚡ gte🌐 huggingface🌐 Nvidia (NIM)🌐 naver