Zheng-Jun Zha
Author directory2026
Back on Track: Aligning Rewards and States for Reasoning in Diffusion Large Language Models
Yawen Shao | Jie Xiao | Kai Zhu | Yu Liu | Hongchen Luo | Xueyang Fu | Yang Cao | Wei Zhai | Zheng-Jun Zha
Findings of the Association for Computational Linguistics: EMNLP 2026
Yawen Shao | Jie Xiao | Kai Zhu | Yu Liu | Hongchen Luo | Xueyang Fu | Yang Cao | Wei Zhai | Zheng-Jun Zha
Findings of the Association for Computational Linguistics: EMNLP 2026
Reinforcement learning (RL) holds immense promise for enhancing the reasoning capabilities of diffusion large language models (dLLMs). However, progress is fundamentally constrained by a dual misalignment between authentic generation trajectory and the gradient update process: (i) Process-reward misalignment. Sparse, terminal rewards are indiscriminately assigned to all intermediate steps of the generation process, failing to provide discriminative credit assignment. (ii) State-trajectory misalignment. Policy updates are often diverted toward artificial, out-of-trajectory states, squandering gradients on less informative samples. To address these limitations, we introduce Process Aligned Policy Optimization (PAPO), a novel framework that holistically aligns the RL update with the dLLM’s generative trajectory via Step-Aware Process Rewards (SPR) that transform sparse terminal rewards into dense, step-wise credit, and Entropy-Guided Historical Re-enactment (EHR) that replays authentic trajectories at high-uncertainty steps. Extensive experiments on four benchmarks demonstrate that PAPO significantly outperforms baselines, achieving gains of 4.5% on GSM8K, 4.8% on MATH500, 42.2% on Countdown and 16.1% on Sudoku.
ArenaFlow: From Trajectory Ranking to Hierarchical Credit Propagation for Open-Ended Agent RL
Qiang Zhang | Ruixue Ding | Fanrui Zhang | Xi Chen | Boli Chen | Shihang Wang | Yinfeng Huang | Yi Zheng | Pengjun Xie | Kaipeng Zhang | Jiawei Liu | Zheng-Jun Zha
Findings of the Association for Computational Linguistics: EMNLP 2026
Qiang Zhang | Ruixue Ding | Fanrui Zhang | Xi Chen | Boli Chen | Shihang Wang | Yinfeng Huang | Yi Zheng | Pengjun Xie | Kaipeng Zhang | Jiawei Liu | Zheng-Jun Zha
Findings of the Association for Computational Linguistics: EMNLP 2026
Reinforcement learning has substantially improved large language model (LLM) agents in verifiable domains, but remains difficult to apply to open-ended agent tasks, where solutions are diverse and reliable scalar rewards are hard to obtain. Recent pairwise evaluation methods alleviate reward discrimination collapse by replacing pointwise scoring with relative preferences. However, they still compress rich comparative feedback into a single trajectory-level reward, obscuring decisive intermediate steps and preventing successful behaviors from being consolidated into reusable skills. We propose ArenaFlow, a hierarchical credit propagation framework for open-ended agent reinforcement learning. ArenaFlow leverages tournament-based relative ranking to derive trajectory-level reward signals. Each comparison is further equipped with structured reflective evaluation, which reveals three types of supervision: pivotal success steps, reusable strategy skills, and usage attribution of retrieved skills. At the step level, ArenaFlow propagates trajectory-level advantages to high-confidence pivotal steps according to tournament survival depth, enabling more targeted optimization of local reasoning behaviors. At the skill level, ArenaFlow estimates skill utility from group-level usage attribution and maintains a global skill memory through utility-aware updating, pruning, and retrieval. The resulting high-utility skills further serve as policy priors for future exploration. Extensive experiments validate ArenaFlow’s effectiveness on open-ended agent tasks.
2024
Context-aware Difference Distilling for Multi-change Captioning
Yunbin Tu | Liang Li | Li Su | Zheng-Jun Zha | Chenggang Yan | Qingming Huang
Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Yunbin Tu | Liang Li | Li Su | Zheng-Jun Zha | Chenggang Yan | Qingming Huang
Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Multi-change captioning aims to describe complex and coupled changes within an image pair in natural language. Compared with single-change captioning, this task requires the model to have higher-level cognition ability to reason an arbitrary number of changes. In this paper, we propose a novel context-aware difference distilling (CARD) network to capture all genuine changes for yielding sentences. Given an image pair, CARD first decouples context features that aggregate all similar/dissimilar semantics, termed common/difference context features. Then, the consistency and independence constraints are designed to guarantee the alignment/discrepancy of common/difference context features. Further, the common context features guide the model to mine locally unchanged features, which are subtracted from the pair to distill locally difference features. Next, the difference context features augment the locally difference features to ensure that all changes are distilled. In this way, we obtain an omni-representation of all changes, which is translated into linguistic sentences by a transformer decoder. Extensive experiments on three public datasets show CARD performs favourably against state-of-the-art methods. The code is available at https://github.com/tuyunbin/CARD.
2012
Answering Opinion Questions on Products by Exploiting Hierarchical Organization of Consumer Reviews
Jianxing Yu | Zheng-Jun Zha | Tat-Seng Chua
Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
Jianxing Yu | Zheng-Jun Zha | Tat-Seng Chua
Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning