Haran Raajesh, Kulin Shah, Adam Klivans +1 more
Reinforcement learning has become a standard way to sharpen a language model's reasoning, but it doesn't port easily to diffusion language models, which write text by revealing masked positions bit by bit rather than left to right. The snag is that the quantity RL relies on, the probability of a given output, is hard to compute here, so earlier attempts approximated it by looking only at which tokens got placed.
The authors note that generation really involves two choices at every step: what token to drop into a slot, and which slots to reveal or re-hide next. Picture filling a crossword where you pick both the letter and which square to open, while prior methods graded only the letters. By writing the objective to account for both choices, they improve results on math and coding, reporting 87.1% on GSM8K and 53.4% on MBPP.
These numbers come from the abstract, so consult the paper for the derivation and setup.
Reinforcement learning has proven effective for improving reasoning in large language models, but extending it to Masked Diffusion Language Models (MDLMs) remains challenging due to the intractability of the log-likelihood estimation. Existing approaches approximate this log-likelihood by modeling only the token predictions, ignoring the order in which positions are unmasked during generation. We observe that MDLM generation involves two decisions at each step: what tokens…
Learning in Infinitesimal Non-Compositional Sketches
arXiv (cs.AI) · July 16, 2026Long-Context Fine-Tuning with Limited VRAM
arXiv (cs.CV) · July 16, 2026QuReC: All-in-One Image Restoration with Query-Specific Guidance and Local-Global Response Calibration
arXiv (cs.AI) · July 16, 2026Digital Pantheon: Simulating and Auditing Coalition Formation with LLM Agents