Diffusion large language models (dLLMs) generate text by repeatedly unmasking a partially noised sequence in parallel, promising lower latency than autoregressive decoding.However, most discrete dLLMs still rely on fixed denoising schedules, which are non-adaptive to input difficulty and cannot learn efficient unmasking orders.This paper introduces a reinforcement learning (RL) framework that transforms dLLM decoding into a trajectory-aware, learnable policy.We propose a confidence-gated denoising strategy that dynamically decides which tokens to unmask and how many to unmask per step, enabling adaptive exploration of denoising trajectories.Building on Group Relative Policy Optimization, we reformulate it into a trajectory-aware variant, TA-GRPO-d, which combines a trajectory-level signal-captured as the z-score of the AUC over intermediate rewards-with a token-level unmasking-time weight.This design allows the model to learn not only the final output quality but also the efficiency of the decoding path itself.Experiments on MATH-500, Countdown, Sudoku, and code benchmarks (HumanEval, MBPP) show that TA-GRPO-d maintains or improves accuracy while reducing average denoising steps by up to half, achieving both faster inference and lower computational cost.Our approach provides an RL framework for optimizing dLLM decoding policies toward adaptive, efficient reasoning.

Reinforcement learning with verifiable rewards (RLVR) typically evaluates only final outcomes, providing limited learning signal about whether the generated reasoning is consistent with the correct answer.As a result, even when groundtruth answers are available during training, onpolicy rollouts can repeatedly produce reasoning that is inconsistent with the answer.We propose Answer-Guided Group Relative Policy Optimization (AG-GRPO) for masked diffusion language models (dLLMs), which generate text through iterative masked-token restoration.AG-GRPO combines standard answerfree (AF) rollouts, sampled without access to the ground-truth answer, with answer-guided (AG) rollouts.In AG rollouts, the model generates reasoning conditioned on an anchored ground-truth answer suffix, and then re-predicts the answer from the generated reasoning for reward computation.We compute group-relative advantages over the combined AF/AG rollout set, allowing answer-guided training signals to improve the answer-free policy used at test time.Across mathematics, puzzle-solving, and code-generation benchmarks, AG-GRPO consistently improves over the pretrained dLLM and prior RL method for masked dLLMs.We further analyze optimization dynamics to study how shared group-relative advantages support signal transfer and affect convergence.Our code is available at https://github.com/ JuHyng/ag_grpo.

In 2015, the Korean government launched a major software education initiative. The urgency to rally the nation around the 4th Industrial Revolution is the driving force. It consists of two major components. One is to enhance software (computer science) education in universities, and another is to make coding education mandatory in elementary and middle schools.

Speech act classification is an essential part of a dialogue system because it is very important to catch user's intention. The previous approaches on speech act classification were focused on obtaining high performances in a single-domain, but they did not deal with a feature interference problem that frequently rises in a multi-domain. In this paper, we propose a two-step system for speech act classification in a multi-domain. In a first step, the proposed system detects a dialogue domain associated with user's utterance. In the second step, the proposed system determines the speech act of his/her utterance based on the statistical information of the detected domain. Owing to this architecture, the proposed system show ed higher precision of 5.5% than the baseline system based on the mixed statistical information.