Discrete Beckmann Transport Models: One-Step Discrete Generators Without a Teacher
rishabh16_ · x · 2026-09-16
A new Harvard collaboration introduces Discrete Beckmann Transport Models, a family of discrete generative models that provably carries any latent point to a fixed point on the simplex vertices in a single step, without a teacher model.
- Achieves the diversity-coherence Pareto frontier on unconditional language modeling.
- SOTA few-step reasoning: 84.6% on Sudoku-Hard with 4 NFEs, 16.8% on TinyGSM/GSM8K with 32 NFEs.
More from Research
- Radial gate objective cuts diffusion transformer FID from 16.24 to 11.83 — Junha Park · 2026-11-02
- REA: async brain-cerebellum runtime for robots where policies never wait on the LLM — Pengfei Zhou · 2026-11-02
- Microsoft's MemSteer turns unlabeled user histories into agent memory supervision — MicrosoftResearch · 2026-11-02
- SciGame benchmark uses counterfactual worlds to expose LLM agents' priors vs evidence — Yusheng Zhao · 2026-11-02
- On Terence Tao's blog, Frank Calegari calls on mathematicians to adapt after OpenAI's 700-paper release — Hesamation · 2026-11-02
- Tsinghua & Microsoft's HarnessMM cuts agent token use by up to 87.93% while raising success rate — rohanpaul_ai · 2026-11-02