Apple Machine Learning Research published DACA-GRPO (Denoising-Aware Credit Assignment for GRPO), a paper on reinforcement-learning post-training for diffusion language models. The work, with co-authors from Apple and The Ohio State University, argues that existing GRPO adaptations for discrete diffusion treat every denoising step as equal and rely on biased mean-field likelihood estimates—then proposes a lightweight, plug-and-play fix.

The Apple research page posts the abstract; the full methods, tables, and ablations are in the companion preprint arXiv:2605.16342. The authors evaluate on LLaDA-8B-Instruct atop three GRPO-style bases—Diffu-GRPO (d1), wd1, and GDPO—across seven benchmarks.

Confirmed

  • Problem (authors): diffusion LLMs generate by iterative unmasking; current RL methods assign uniform credit across the trajectory and estimate completion likelihood with all tokens masked (mean-field), which the paper calls high-bias and high-variance for policy gradients.
  • DACA-GRPO has two parts: Denoising Progress Scores (DPS) — per-token importance weights from intermediate predictions already computed during generation, with no extra forward cost; and Stratified Masking Likelihood (SML) — partition output positions into strata so each token is scored with most of the sequence as context.
  • Base model / trainers: LLaDA-8B-Instruct; DACA applied on Diffu-GRPO, wd1, and GDPO.
  • Benchmarks: MATH-500, GSM8K (math); MBPP, HumanEval (code); Countdown, Sudoku (constraint satisfaction); JSON schema adherence (constrained generation). Reported at generation lengths 128 / 256 / 512.
  • Headline gains (paper abstract / results): up to 5.6pp on math reasoning, 7.4pp on code generation, 36.3pp on constraint satisfaction, and 5.9pp on JSON schema adherence, depending on base method and length.
  • Complementarity: authors say DPS helps most on short / tightly structured outputs; SML helps most on longer math and code. Full DACA (DPS+SML) is used on math, code, and JSON; constraint tasks use DPS only (SML excluded for short constrained outputs).
  • Sudoku (table 2, DPS only): wd1 per-cell accuracy at length 512 rises from 34.6% to 70.9% with DPS; other bases also improve, with some length-specific noise on GDPO Countdown.
  • JSON: strongest reported schema-adherence lift includes wd1 + DACA reaching about 78.5% (+5.9pp) on the paper’s github-medium setup; authors note the task stays hard even after RL.

Unknown

  • Independent replication: all primary numbers are from the authors’ LLaDA-8B setup. No third-party reproduction is in the Apple page or the preprint.
  • Product path: the materials do not say DACA-GRPO ships in Apple Intelligence, Apple Foundation Models APIs, or any consumer product. Treat this as research publication, not a product launch.
  • Other diffusion stacks: results are on LLaDA-8B-Instruct; transfer to other dLLM families or larger scales is not established here.
  • SML limits: the paper itself flags that SML can hurt short, tightly constrained tasks (distributional mismatch vs fully masked generation); a length-universal likelihood regularizer remains open.
  • Code / checkpoints: the Apple abstract page and preprint do not, in the text used for this draft, commit to a public training release schedule.

Our take

The useful idea is narrow and concrete: diffusion RL was throwing away trajectory signal that the forward pass already paid for. If DPS really is near-zero cost and transfers across ratio-based and ratio-free GRPO variants, that is more interesting than any single Sudoku jump. Still, the leaderboard deltas are author-measured on one 8B diffusion model—use them as directional evidence that credit assignment was a shared bottleneck, not as a promise that every diffusion trainer will see +30pp on structured tasks.

Sources