Meta and UvA improve discrete flow matching with easier-token prioritization
burkov · x · 2026-07-26
Researchers from @AIatMeta and @UvAAmsterdam propose a way to make diffusion-style discrete generation more practical by prioritizing easier, better-supported token positions during generation and training. The method preserves any-order generation, can be applied to a pretrained model with no extra training and almost no overhead, and reduces generative perplexity by up to 63% on OpenWebText while also improving validity and novelty in molecule generation.
Related event: Meta and UvA Introduce Context-weighted Discrete Flow Matching(2 posts)→
More from Models
- Mathematicians debate AI math writing: abysmal today, improving shockingly fast — miniapeur · 2026-10-27
- LessWrong: GLM models show outlier chain-of-thought controllability vs Kimi and DeepSeek — tomekkorbak · 2026-10-27
- AI deference trap: agent spots medical red flag but stays silent to avoid questioning the clinician — echen · 2026-10-27
- The trust paradox: only the least trustworthy LLMs will do the sketchiest things — AaronBergman18 · 2026-10-27
- Claude's refusal to type one-time passwords is a real security impediment — AaronBergman18 · 2026-10-27
- repligate argues context full of noise is genuinely 'hard' for LLMs, mulls an info-theory model of breaks — repligate · 2026-10-27