Yinghao Zhu
Author directory2026
CodeMEM: AST-Guided Adaptive Memory for Repository-Level Iterative Code Generation
Peiding Wang | Li Zhang | Fang Liu | Chongyang Tao | Yinghao Zhu
Findings of the Association for Computational Linguistics: ACL 2026
Peiding Wang | Li Zhang | Fang Liu | Chongyang Tao | Yinghao Zhu
Findings of the Association for Computational Linguistics: ACL 2026
Large language models (LLMs) substantially enhance developer productivity in repository-level code generation through interactive collaboration. However, as interactions progress, repository context must be continuously preserved and updated to integrate newly validated information. Meanwhile, the expanding session history increases cognitive burden, often leading to forgetting and the reintroduction of previously resolved errors. Existing memory management approaches show promise but remain limited by natural language-centric representations. To overcome these limitations, we propose CodeMEM, an AST-guided dynamic memory management system tailored for repository-level iterative code generation. Specifically, CodeMEM introduces the Code Context Memory component that dynamically maintains and updates repository context through AST-guided LLM operations, along with the Code Session Memory that constructs a code-centric representation of interaction history and explicitly detects and mitigates forgetting through AST-based analysis. Experimental results on the instruction-following benchmark CodeIF-Bench and the code generation benchmark CoderEval demonstrate that CodeMEM achieves state-of-the-art performance, improving instruction following by 12.2% for the current turn and 11.5% for the session level, and reducing interaction rounds by 2–3, while maintaining competitive inference latency and token efficiency.
Dental-TriageBench: Benchmarking Multimodal Reasoning for Hierarchical Dental Triage
Ziyi He | Yushi Feng | Shuangyu Yang | Yinghao Zhu | Xichen Zhang | Tai Pak Chuen Patrick | Lo Hei Yuet | Songying Wu | Weifa Yang | Lequan Yu
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Ziyi He | Yushi Feng | Shuangyu Yang | Yinghao Zhu | Xichen Zhang | Tai Pak Chuen Patrick | Lo Hei Yuet | Songying Wu | Weifa Yang | Lequan Yu
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Dental triage is a safety-critical clinical routing task that requires integrating multimodal clinical information (e.g., patient complaints and radiographic evidence) to determine complete referral plans. We present Dental-TriageBench, the first expert-annotated benchmark for reasoning-driven multimodal dental triage. Built from authentic outpatient workflows, it contains 246 de-identified cases annotated with expert-authored golden reasoning trajectories, together with hierarchical triage labels. We benchmark 19 proprietary, open-source, and medical-domain MLLMs against three junior dentists serving as the human baseline, and find a substantial human–model gap, on fine-grained treatment-level triage. Further analyses show that accurate triage requires both complaint and OPG information, and that model errors concentrate on cases with multiple referral domains, where MLLMs tend to produce overly narrow referral sets and omission-heavy errors. Dental-TriageBench provides a realistic testbed for developing multimodal clinical AI systems that are more clinically grounded, coverage-aware, and safer for downstream care.
SearchGym: Bootstrapping Real-World Search Agents via Cost-Effective and High-Fidelity Environment Simulation
Xichen Zhang | Ziyi He | Yinghao Zhu | Sitong Wu | Shaozuo Yu | Meng Chu | Wenhu Zhang | Haoru Tan | Jiaya Jia
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Xichen Zhang | Ziyi He | Yinghao Zhu | Sitong Wu | Shaozuo Yu | Meng Chu | Wenhu Zhang | Haoru Tan | Jiaya Jia
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Search agents have emerged as a pivotal paradigm for solving open-ended, knowledge-intensive reasoning tasks. However, training these agents via Reinforcement Learning (RL) faces a critical dilemma: interacting with live commercial Web APIs is prohibitively expensive, while relying on static data snapshots often introduces noise due to data misalignment. This misalignment generates corrupted reward signals that destabilize training by penalizing correct reasoning or rewarding hallucination. To address this, we propose SearchGym, a simulation environment designed to bootstrap robust search agents. SearchGym employs a rigorous generative pipeline to construct a verifiable knowledge graph and an aligned document corpus, ensuring that every reasoning task is factually grounded and strictly solvable. Building on this controllable environment, we introduce SearchGym-RL, a curriculum learning methodology that progressively optimizes agent policies through purified feedback, evolving from basic interactions to complex, long-horizon planning. Extensive experiments across the Llama and Qwen families demonstrate strong Sim-to-Real generalization. Notably, our Qwen2.5-7B-Base model trained within SearchGym surpasses the web-enhanced ASearcher baseline across nine diverse benchmarks by an average relative margin of 10.6%. Our results validate that high-fidelity simulation serves as a scalable and highly cost-effective methodology for developing capable search agents.
ProMed: Shapley Information Gain Guided Reinforcement Learning for Proactive Medical LLMs
Hongxin Ding | Baixiang Huang | Yue Fang | Weibin Liao | Xinke Jiang | Jinyang Zhang | Yinghao Zhu | Zheng Li | Liantao Ma | Junfeng Zhao | Yasha Wang
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Hongxin Ding | Baixiang Huang | Yue Fang | Weibin Liao | Xinke Jiang | Jinyang Zhang | Yinghao Zhu | Zheng Li | Liantao Ma | Junfeng Zhao | Yasha Wang
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Interactive medical questioning is essential in clinical consultations, where physicians must actively gather necessary patient information. Yet existing medical Large Language Models (LLMs) predominantly follow a reactive paradigm, risking diagnostic errors by answering before seeking sufficient details. To bridge this gap, we propose ProMed, a reinforcement learning framework that transitions LLMs toward a proactive paradigm, enabling them to ask clinically valuable questions before decision-making. Central to ProMed is the Shapley Information Gain (SIG) reward, which quantifies a question’s clinical utility as the amount of newly acquired information, while considering its contextual importance via Shapley values. We integrate SIG into a two-stage training pipeline: (1) SIG-Guided Model Initialization uses Monte Carlo Tree Search to construct high-reward interaction trajectories for supervision, and (2) SIG-Augmented Policy Optimization, with a novel SIG-guided Reward Distribution Mechanism that prioritizes informative questions for fine-grained optimization. Experiments on partial-information medical benchmarks show that ProMed significantly outperforms state-of-the-art methods by 6.29% on average and delivers a 54.45% gain over the reactive paradigm, and generalizes robustly to out-of-domain cases. Our codes are available at https://github.com/hxxding/ProMed.
Search
Fix author
Co-authors
- Ziyi He 2
- Xichen Zhang 2
- Meng Chu 1
- Hongxin Ding 1
- Yue Fang 1
- Yushi Feng 1
- Baixiang Huang 1
- Jiaya Jia 1
- Xinke Jiang 1
- Zheng Li 1
- Weibin Liao 1
- Fang Liu 1
- Liantao Ma 1
- Tai Pak Chuen Patrick 1
- Haoru Tan 1
- Chongyang Tao 1
- Peiding Wang 1
- Yasha Wang 1
- Sitong Wu 1
- Songying Wu 1
- Shuangyu Yang 1
- Weifa Yang 1
- Lequan Yu 1
- Shaozuo Yu 1
- Lo Hei Yuet 1
- Jinyang Zhang 1
- Li Zhang 1
- Wenhu Zhang 1
- Junfeng Zhao 1