Zhengqing Yuan
Author directory2026
Interpretable Graph-Language Modeling for Detecting Youth Illicit Drug Use
Yiyang Li | Zehong Wang | Zhengqing Yuan | Zheyuan Zhang | Keerthiram Murugesan | Chuxu Zhang | Yanfang Ye
Findings of the Association for Computational Linguistics: EACL 2026
Yiyang Li | Zehong Wang | Zhengqing Yuan | Zheyuan Zhang | Keerthiram Murugesan | Chuxu Zhang | Yanfang Ye
Findings of the Association for Computational Linguistics: EACL 2026
Illicit drug use among teenagers and young adults (TYAs) remains a pressing public health concern, with rising prevalence and long-term impacts on health and well-being. To detect illicit drug use among TYAs, researchers analyze large-scale surveys such as the Youth Risk Behavior Survey (YRBS) and the National Survey on Drug Use and Health (NSDUH), which preserve rich demographic, psychological, and environmental factors related to substance use. However, existing modeling methods treat survey variables independently, overlooking latent and interconnected structures among them. To address this limitation, we propose LAMI (LAtent relation Mining with bi-modal Interpretability), a novel joint graph-language modeling framework for detecting illicit drug use and interpreting behavioral risk factors among TYAs. LAMI represents individual responses as relational graphs, learns latent connections through a specialized graph structure learning layer, and integrates a large language model to generate natural language explanations grounded in both graph structures and survey semantics. Experiments on the YRBS and NSDUH datasets show that LAMI outperforms competitive baselines in predictive accuracy. Interpretability analyses further demonstrate that LAMI reveals meaningful behavioral substructures and psychosocial pathways, such as family dynamics, peer influence, and school-related distress, that align with established risk factors for substance use. Our codebase is available here.
PolicyLLM: Towards Excellent Comprehension of Public Policy for Large Language Models
Han Bao | Penghao Zhang | Yue Huang | Zhengqing Yuan | Yanchi Ru | SU Rui | Yujun Zhou | Xiangqi Wang | Kehan Guo | Nitesh V Chawla | Yanfang Ye | Xiangliang Zhang
Findings of the Association for Computational Linguistics: ACL 2026
Han Bao | Penghao Zhang | Yue Huang | Zhengqing Yuan | Yanchi Ru | SU Rui | Yujun Zhou | Xiangqi Wang | Kehan Guo | Nitesh V Chawla | Yanfang Ye | Xiangliang Zhang
Findings of the Association for Computational Linguistics: ACL 2026
Large Language Models (LLMs) are increasingly integrated into real-world decision-making, including in the domain of public policy. Yet, their ability to comprehend and reason about policy-related content remains underexplored. To fill this gap, we present PolicyBench, the first large-scale bilingual benchmark evaluating policy comprehension, comprising 21K cases across a broad spectrum of policy areas, capturing the diversity and complexity of real-world governance. Following Bloom’s taxonomy, the benchmark assesses three core capabilities: (1) Memorization: factual recall of policy knowledge, (2) Understanding: conceptual and contextual reasoning, and (3) Application: problem-solving in real-life policy scenarios. Building on this benchmark, we further propose PolicyMoE, a domain-specialized Mixture-of-Experts (MoE) model with expert modules aligned to each cognitive level. The proposed models demonstrate stronger performance on application-oriented policy tasks than on memorization or conceptual understanding, and yields the highest accuracy on structured reasoning tasks. Our results reveal key limitations of current LLMs in policy understanding and suggest paths toward more reliable, policy-focused models
SpecAlign: Efficient Specification-Grounded Alignment of Large Language Models via Synthetic Data
Wenjie Wang | Yue Huang | Zhengqing Yuan | Han Bao | Shiyi Du | Yuchen Ma | Yue Zhao | Yanfang Ye | Xiangliang Zhang
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Wenjie Wang | Yue Huang | Zhengqing Yuan | Han Bao | Shiyi Du | Yuchen Ma | Yue Zhao | Yanfang Ye | Xiangliang Zhang
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
As large language models (LLMs) are increasingly deployed in real-world applications, alignment is no longer governed by a single universal notion of safety or helpfulness, but instead by provider- or application-specific model specifications. These specifications are typically long, structured, and frequently updated, yet existing alignment pipelines lack a systematic mechanism to operationalize them as training signals. In this paper, we propose specification-grounded alignment, a new alignment paradigm that treats provider-authored model specifications as the primary alignment target rather than abstract principles or static benchmarks. To instantiate this paradigm, we introduce SpecAlign, a framework that synthesizes alignment data directly from specification documents. SpecAlign combines structured rule annotation, controllable specification instantiation, and multi-agent adversarial data synthesis to generate fine-grained, boundary-aware preference pairs that capture both compliant behaviors and meaningful specification violations. Experiments across multiple model specifications and backbone models demonstrate that training with SpecAlign consistently improves rule compliance while preserving general capabilities and avoiding over-conservative behavior. These results suggest that grounding alignment in explicit model specifications enables rapid, precise, and scalable adaptation of LLM behavior to evolving policy requirements.
Dr. Claw: An AI Scientist Workspace for Vibe Research
Dingjie Song | Hanrong Zhang | Dawei Liu | Yixin Liu | Zongxia Li | Zhengqing Yuan | Siqi Zhang | Henry Peng Zou | Zhiling Yan | Yuxuan Zhang | Yanfang Ye | Philip S. Yu | Lichao Sun
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing: System Demonstrations
Dingjie Song | Hanrong Zhang | Dawei Liu | Yixin Liu | Zongxia Li | Zhengqing Yuan | Siqi Zhang | Henry Peng Zou | Zhiling Yan | Yuxuan Zhang | Yanfang Ye | Philip S. Yu | Lichao Sun
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing: System Demonstrations
Command-line coding agents (e.g., Claude Code, Gemini CLI) can already read and write files and sustain long sessions, yet end-to-end research still fragments across chat tools, IDEs, terminals, and writing environments, and the decisions that make it auditable are rarely preserved. We present **Dr. Claw**, an open-source workspace that wraps existing coding-agent executors in a *controllable* and *auditable* human-in-the-loop workflow rather than introducing another autonomous agent. Persistent state objects, a reusable skill library, and multi-executor coordination link human decisions to AI execution, turning planning, execution, and writing into one traceable, recoverable loop. We demonstrate Dr. Claw through an interactive three-view scenario and a failure-recovery walkthrough, and evaluate it against a bare command-line agent sharing the same backend executor, so the comparison contrasts the whole orchestration layer (task graph, state objects, and skill library) with the agent it wraps. Holding the executor fixed, Dr. Claw scores higher on research completeness while persisting an auditable, recoverable process trail. Demo access: repository https://github.com/OpenLAIR/dr-claw, released under AGPL-3.0 with GPL-3.0 upstream components.
NG-Router: Graph-Supervised Multi-Agent Collaboration for Nutrition Question Answering
Kaiwen Shi | Zheyuan Zhang | Zhengqing Yuan | Keerthiram Murugesan | Vincent Galassi | Chuxu Zhang | Yanfang Ye
Proceedings of the 19th Conference of the European Chapter of the Association for Computational Linguistics (Volume 1: Long Papers)
Kaiwen Shi | Zheyuan Zhang | Zhengqing Yuan | Keerthiram Murugesan | Vincent Galassi | Chuxu Zhang | Yanfang Ye
Proceedings of the 19th Conference of the European Chapter of the Association for Computational Linguistics (Volume 1: Long Papers)
Diet plays a central role in human health, and Nutrition Question Answering (QA) offers a promising path toward personalized dietary guidance and the prevention of diet-related chronic diseases. However, existing methods face two fundamental challenges: the limited reasoning capacity of single-agent systems and the complexity of designing effective multi-agent architectures, as well as contextual overload that hinders accurate decision-making. We introduce Nutritional-Graph Router (NG-Router), a novel framework that formulates nutritional QA as a supervised, knowledge-graph–guided multi-agent collaboration problem. NG-Router integrates agent nodes into heterogeneous knowledge graphs and employs a graph neural network to learn task-aware routing distributions over agents, leveraging soft supervision derived from empirical agent performance. To further address contextual overload, we propose a gradient-based subgraph retrieval mechanism that identifies salient evidence during training, thereby enhancing multi-hop and relational reasoning. Extensive experiments across multiple benchmarks and backbone models demonstrate that NG-Router consistently outperforms both single-agent and ensemble baselines, offering a principled approach to domain-aware multi-agent reasoning for complex nutritional health tasks.
AgentRouter: A Knowledge-Graph-Guided LLM Router for Collaborative Multi-Agent Question Answering
Zheyuan Zhang | Kaiwen Shi | Zhengqing Yuan | Zehong Wang | Tianyi Ma | Keerthiram Murugesan | Vincent Galassi | Chuxu Zhang | Yanfang Ye
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Zheyuan Zhang | Kaiwen Shi | Zhengqing Yuan | Zehong Wang | Tianyi Ma | Keerthiram Murugesan | Vincent Galassi | Chuxu Zhang | Yanfang Ye
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Large language models (LLMs) and agent-based frameworks have advanced rapidly, enabling diverse applications. Yet, with the proliferation of models and agentic strategies, practitioners face substantial uncertainty in selecting the best configuration for a downstream task. Prior studies show that different agents and backbones exhibit complementary strengths, and that larger models are not always superior, underscoring the need for adaptive routing mechanisms. Existing approaches to agent routing, however, often emphasize cost efficiency while overlooking the fine-grained contextual and relational structure inherent in QA tasks. In this paper, we propose AgentRouter, a framework that formulates multi-agent QA as a knowledge-graph–guided routing problem supervised by empirical performance signals. Specifically, we convert QA instance into a heterogeneous knowledge graph that jointly encodes queries, contextual entities, and agents, and then train a heterogeneous graph neural network (GNN) to propagate information across node types and produce task-aware routing distributions over agents. By leveraging soft supervision and weighted aggregation of agent outputs, AgentRouter learns principled collaboration schemes that capture the complementary strengths of diverse agents. Extensive experiments demonstrate that our framework consistently outperforms single-agent and ensemble baselines, while generalizing across benchmarks and LLM backbones. These results highlight the effectiveness and robustness of graph-supervised multi-agent routing for question answering. Our code repo is available at https://anonymous.4open.science/r/AgentRouter.
Search
Fix author
Co-authors
- Yanfang Ye 6
- Keerthiram Murugesan 3
- Chuxu Zhang 3
- Zheyuan Zhang 3
- Han Bao 2
- Vincent Galassi 2
- Yue Huang 2
- Kaiwen Shi 2
- Zehong Wang 2
- Xiangliang Zhang 2
- Nitesh V Chawla 1
- Shiyi Du 1
- Kehan Guo 1
- Yiyang Li 1
- Zongxia Li 1
- Dawei Liu 1
- Yixin Liu 1
- Tianyi Ma 1
- Yuchen Ma 1
- Yanchi Ru 1
- SU Rui 1
- Dingjie Song 1
- Lichao Sun 1
- Wenjie Wang 1
- Xiangqi Wang 1
- Zhiling Yan 1
- Philip S. Yu 1
- Hanrong Zhang 1
- Penghao Zhang 1
- Siqi Zhang 1
- Yuxuan Zhang 1
- Yue Zhao 1
- Yujun Zhou 1
- Henry Peng Zou 1