NVIDIA’s Parallel Decoding Distillation predicts several denoising steps per forward pass, letting diffusion and flow‑matching models generate video with just 4‑8 function evaluations. The method works with any pre‑trained model and delivers state‑of‑the‑art quality while boosting video diversity.
RLPF shows how to teach code models to chase speed, not just pass tests. By staging rewards, first for compilation then for runtime gains, the method lifts Qwen3‑32B from 11% to 55% runnable solutions and raises average efficiency by about 30 points.
The paper shows that standard benchmark scores stay flat after 4‑bit post‑training quantization, yet error rates in multi‑turn, tool‑calling agents jump up to 2.5×, masking damage behind the error‑budget. Reducing the error budget or using per‑channel error diagnostics exposes the degradation, urging new reporting practices.
The paper uncovers a systematic "Reasoning Backroom" in skill-augmented language agents, where agents claim to use reusable skills but often bypass them, leading to performative rather than substantive skill use. This gap threatens AI provenance, as observable traces may not reflect true causal influence, complicating verification and trust in AI systems.
The paper builds AI scanners that automatically flag four validity flaws, ground‑truth leakage, tool failure, guessing, and answer‑format ambiguity, in agentic benchmark transcripts. It demonstrates the scanners catch real quality issues across five popular benchmarks, exposing hidden weaknesses that manual audits miss.
The authors model capability emergence in transformers as a driven nucleation event: a circuit must align perfectly in a single stochastic attempt, otherwise nothing accrues. Their rate law accurately predicts emergence timing, irreversible plasticity loss, and shows that re‑initializing query‑key slices can revive stalled capabilities. This provides concrete levers for controlling training dynamics.
The new SE(3)-MeanFlow model extends MeanFlow to the Lie group geometry of protein frames, enabling backbone generation with only a handful of inference steps instead of hundreds. By deriving closed‑form average‑velocity formulas and a warm‑up SE(3) alpha‑Flow loss, it matches or outperforms diffusion baselines while slashing compute, speeding high‑throughput protein design.
Divergence Decoding lets a specialist LLM hand off to a generalist whenever their token distributions diverge, using Jensen‑Shannon divergence as a safety signal. This training‑free routing injects strong reasoning into domain‑specific answers and outperforms both pure specialist and pure generalist models on scientific benchmarks like GPQA and ChemBench.