Qiang Zhu
Author directory2026
The Illusion of What If: Evaluating the Breakdown of Counterfactual Reasoning in LLMs
Yucheng Wang | Yuetian Du | Zhengyi Liu | Rongyu Zhang | Bing Zhao | Boyu Yang | Ming Kong | Lin Qu | hu Wei | Jie Liu | Qiang Zhu
Findings of the Association for Computational Linguistics: EMNLP 2026
Yucheng Wang | Yuetian Du | Zhengyi Liu | Rongyu Zhang | Bing Zhao | Boyu Yang | Ming Kong | Lin Qu | hu Wei | Jie Liu | Qiang Zhu
Findings of the Association for Computational Linguistics: EMNLP 2026
Counterfactual reasoning requires models to reason beyond the observed world and explain how altered conditions propagate through downstream consequences. Existing benchmarks largely target bounded settings with fixed variables or single gold outcomes, overlooking open-domain scenarios requiring causal-process evaluation. To this end, we present WhatIfBench, a diagnostic benchmark for open-domain, open-form, long-horizon counterfactual causal reasoning, containing 220 what-if questions across STEM, HSS, and Hybrid scenarios. To evaluate free-form responses, we further propose PRISM, which first converts each natural-language explanation into a Response-Derived Semantic Causal Graph of events, states, and mechanisms. On top of this graph, PRISM then jointly applies a Process Metric assessing graph-level causal validity and a Rubric Metric assessing answer-level explanatory adequacy. Evaluating six frontier LLMs with this framework, we find that WhatIfBench remains far from saturated: even the strongest model reaches only a 64.62% final score. Further analysis reveals persistent causal gaps, premise drift, and topology fragmentation, suggesting that fluent counterfactual narratives often mask fragile causal processes. The benchmark, code, and evaluation scripts are available at https://github.com/zju-gt/WhatIfBench.
CARL: Constraint-Aware Reinforcement Learning for Planning with LLMs
Qiuyi Qi | Jinjian Zhang | Mutian Bao | Tian Liang | Guocong Li | Dongnan Liu | Wei Zhou | Jie Liu | Ming Kong | Linjian Mo | Feng Zhang | Qiang Zhu
Findings of the Association for Computational Linguistics: ACL 2026
Qiuyi Qi | Jinjian Zhang | Mutian Bao | Tian Liang | Guocong Li | Dongnan Liu | Wei Zhou | Jie Liu | Ming Kong | Linjian Mo | Feng Zhang | Qiang Zhu
Findings of the Association for Computational Linguistics: ACL 2026
Despite their strong reasoning capabilities and extensive world knowledge, Large Language Models (LLMs) frequently generate plans that violate task constraints, undermining their reliability in real-world applications. This deficiency arises from a lack of systematic mechanisms to incorporate constraint information during the generation process. While existing approaches attempt to mitigate this by relying on external tools or task decomposition, they fail to enhance the model’s intrinsic constraint awareness. To address this, we propose Constraint-Aware Reinforcement Learning (CARL), a novel RL framework designed to strengthen LLMs’ intrinsic focus on constraints. CARL introduces a constraint-aware reward by comparing the model’s output distributions under constrained and unconstrained inputs, encouraging constraint focus and penalizing neglect.Compatible with various RL frameworks and requiring no external solvers or top models, CARL enables scalable, end-to-end constraint-aware planning. Extensive experiments on BlocksWorld, TravelPlanner, and T-Eval demonstrate that CARL significantly outperforms standard Reinforcement Fine-Tuning (RFT) baselines and state-of-the-art reasoning models, exhibiting a markedly increased focus on constraints.
MetaRAG: Belief-Action Aligned Policy Optimization for Agentic RAG
Qiuyi Qi | Tian Liang | Jiamu Wang | Jinjian Zhang | Wei Zhou | Pengcheng Zhu | Linjian Mo | Ming Kong | Jie Liu | Qiang Zhu
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Qiuyi Qi | Tian Liang | Jiamu Wang | Jinjian Zhang | Wei Zhou | Pengcheng Zhu | Linjian Mo | Ming Kong | Jie Liu | Qiang Zhu
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Agentic retrieval-augmented generation (RAG) requires language models to decide when to continue searching and when to answer. Existing RL-based methods rely on external supervision and overlook the agent’s internal belief about whether the current evidence is sufficient. To address this problem, we reformulate the search decision quality as belief-action alignment and propose MetaRAG, a belief-action aligned policy optimization framework for agentic RAG. MetaRAG uses Verify-first Action Generation to elicit an explicit verification process before each actual action, and Internal Belief Probing to estimate the policy model’s own answerability belief from the same question-history context. Based on these, MetaRAG derives a consistency reward that is further gated by answer correctness, avoiding reinforcement of internally consistent but incorrect trajectories. The belief probe is used only during training and introduces no inference-time overhead. Experiments on seven public QA benchmarks show that MetaRAG consistently improves the accuracy-efficiency trade-off over strong RL-based agentic RAG baselines, with gains that transfer to deep research settings, different optimizers, and multiple model backbones.
Don’t Guess, Ask Wisely: Benchmarking and Training Proactive Elicitation in Open-Domain LLM Conversations
Rongyu Zhang | Mutian Bao | Jinjian Zhang | Yuetian Du | He Xu | Wei Zhou | Xiaojun Zhu | Ming Kong | Jie Liu | Linjian Mo | Qiang Zhu
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Rongyu Zhang | Mutian Bao | Jinjian Zhang | Yuetian Du | He Xu | Wei Zhou | Xiaojun Zhu | Ming Kong | Jie Liu | Linjian Mo | Qiang Zhu
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
When user queries are incomplete, large language models should ask targeted questions before committing to an answer, a capability we call proactive elicitation, yet evaluation on real user-assistant queries across seven LLMs (8B to frontier) shows that fewer than 11% of underspecified queries trigger a follow-up question. To benchmark and train this capability, we introduce VagueBench, where each seed query is annotated with structured intent and detail units then degraded into intent-vague and fully-vague variants via controlled removal of linguistic cues, yielding known hidden information sets for evaluating both when and what to ask. We propose DialogGRPO, an offline reinforcement learning method that organizes multi-turn elicitation as a dialogue-state directed acyclic graph, where candidate questions at each node receive dense turn-level rewards combining immediate information gain with lookahead value through group-relative comparison, enabling fine-grained credit assignment without runtime simulation. DialogGRPO elicits missing information on over 88% of vague queries with substantial gains in both recovery efficiency and answer coverage, without over-asking on complete queries, outperforms prompting and test-time-scaling baselines, and generalizes zero-shot to MultiWOZ 2.4 and AmbigQA.
UrbanGeoEval: A City-Scale Benchmark for Evaluating Large Language Models in Geospatial Reasoning
Mutian Bao | Qiuyi Qi | Tian Liang | Jinjian Zhang | Wei Zhou | Ming Kong | Linjian Mo | Qiang Zhu
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Mutian Bao | Qiuyi Qi | Tian Liang | Jinjian Zhang | Wei Zhou | Ming Kong | Linjian Mo | Qiang Zhu
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Current evaluations of geospatial reasoning in LLMs are frequently impeded by the entanglement of factual recall and spatial logic, which often obscures the models’ true capabilities in complex city-scale environments. To address this, we introduce UrbanGeoEval, a comprehensive benchmark featuring a dual-module framework designed to disentangle these competencies. The Knowledge Module assesses urban memory via scalable map-based queries, while the Reasoning Module isolates pure logical inference across 3,148 realistic tasks by providing necessary geospatial context. Unlike prior benchmarks that hand the model pre-computed spatial text, UrbanGeoEval provides raw geometry and forces the model to act as a spatial computing engine. Our evaluation methodology introduces a reliable hybrid pipeline that merges deterministic programmatic checks with an LLM-as-a-Judge, achieving expert-level evaluation accuracy. Extensive experiments on 18 widely used LLMs uncover critical insights: (1) models exhibit severe geographic biases and resolution gaps; (2) failures in complex multi-hop tasks often stem from brittle foundational spatial skills rather than high-level logic deficits. UrbanGeoEval provides a precise diagnostic tool for advancing urban geospatial intelligence in LLMs.
STAPO: Selective Trajectory-Aware Policy Optimization for LLM Agent Training
Qiuyi Qi | Tian Liang | Mutian Bao | Jinjian Zhang | Dongnan Liu | Wei Zhou | Linjian Mo | Ming Kong | Jie Liu | Feng Zhang | Qiang Zhu
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Qiuyi Qi | Tian Liang | Mutian Bao | Jinjian Zhang | Dongnan Liu | Wei Zhou | Linjian Mo | Ming Kong | Jie Liu | Feng Zhang | Qiang Zhu
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Reinforcement Learning (RL) is the dominant paradigm for training Large Language Model (LLM) agents on long-horizon tasks. However, sparse and delayed rewards often lead to trajectory neglect, in which agents lose focus on the task goal and interaction history at intermediate steps. Prior work has explored step-level supervision using Shannon-entropy–based uncertainty signals, which conflate inherent state complexity with agent confidence and therefore provide unreliable estimates of decision reliability. To address this issue, we propose normalized entropy, which measures confidence deviations relative to an agent’s average behavior under a given state, thereby strengthening the association between low-quality actions and trajectory neglect. Building on this insight, we introduce Selective Trajectory-Aware Policy Optimization (STAPO), a hierarchical group-based RL framework. STAPO leverages normalized entropy to locate outlier steps associated with trajectory neglect and optimizes them via a joint mechanism of trajectory-aware reward and trajectory-independent penalty, enhancing trajectory awareness while preserving training stability. Extensive experiments on ALFWorld, WebShop, and Search-Augmented QA demonstrate that STAPO achieves state-of-the-art performance while substantially alleviating trajectory neglect, validating its effectiveness and robustness for agentic tasks.