Guangtao Zhai
Author directory2026
KV Cache Quantization for Diffusion Language Models
Yan Tai | Yunan Ding | Guangzhao Li | Siqi Luo | Chaoyang Zhang | Guangtao Zhai | Guodong Guo | Xiaohong Liu
Findings of the Association for Computational Linguistics: EMNLP 2026
Yan Tai | Yunan Ding | Guangzhao Li | Siqi Luo | Chaoyang Zhang | Guangtao Zhai | Guodong Guo | Xiaohong Liu
Findings of the Association for Computational Linguistics: EMNLP 2026
KV cache quantization is well studied for autoregressive language models, where cached prefix states are exact under causal attention and quantization is mainly a cache reconstruction problem. Diffusion language models (dLLMs) break this assumption. Fast dLLM inference reuses KV states across denoising steps, but bidirectional token representations can change as masked tokens are revealed, so the reused cache may already differ from full recomputation before quantization is applied. We study KV cache quantization under this cache-reuse error. We adapt KIVI and KVQuant to Fast-dLLM-style prefix and dual cache reuse, and introduce TraceKV and KProtect. TraceKV reconstructs feasible dLLM reveal trajectories from prompt-answer pairs, providing calibration states that match iterative masked decoding. KProtect uses these trajectories to choose per-layer K-cache entries that remain in high precision according to output- and attention-level behavior metrics, while applying standard low-bit value quantization. Across LLaDA and Dream evaluations on GSM8K, HumanEval, MATH, and MBPP, KProtect achieves the highest average score among quantized methods across the reported 4-bit and 2-bit prefix/dual cache settings.
MMedAgentBench: A Multi-Stage Benchmark for Evaluating LLM-based Medical Agents
Lu Sun | Xiangyi Zhang | Xiangyang Zhu | Kaiyuan Ji | Zijian Chen | Qiang Hu | Zicheng Zhang | Yuan Tian | Guangtao Zhai
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Lu Sun | Xiangyi Zhang | Xiangyang Zhu | Kaiyuan Ji | Zijian Chen | Qiang Hu | Zicheng Zhang | Yuan Tian | Guangtao Zhai
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Large language models (LLMs) have demonstrated remarkable potential in medical AI through their natural language understanding and reasoning capabilities. However, real clinical practice involves multi-stage, dynamically evolving decision-making where physicians continuously adjust pathways based on updated examination results—far more complex than single-turn question answering. Existing medical benchmarks focus on static scenarios, failing to evaluate LLMs in realistic clinical environments. We present MMedAgentBench, a comprehensive benchmark for evaluating LLM-based medical agents in multi-stage clinical decision-making. Unlike previous benchmarks, MMedAgentBench captures the temporal complexity of clinical workflows by simulating authentic patient journeys across multiple diagnostic and treatment stages. The benchmark comprises a high-quality dataset of over 150 de-identified clinical cases from tertiary hospitals, encompassing 500+ clinical stages, with each case meticulously structured into sequential stages and annotated by board-certified physicians. Our evaluation framework simultaneously assesses diagnostic accuracy and resource efficiency, requiring agents to plan examinations and control costs while navigating progressive information disclosure. This enables systematic evaluation of medical agents across dynamic decision-making, cost control, and multi-stage reasoning dimensions, providing a realistic testbed for advancing medical AI toward clinical deployment.
LatentRevise: Learning from Zero-Hit Reasoning
YiQiu Guo | Xueting Han | Qi Jia | Guangtao Zhai | Jing Bai
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
YiQiu Guo | Xueting Han | Qi Jia | Guangtao Zhai | Jing Bai
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Reinforcement learning with verifiable rewards (RLVR) is bottlenecked by hard prompts on which correct trajectories have low probability, so sampling misses them within a practical budget and leaves the policy update with little useful signal. We frame such zero-hit prompts as RLVR’s sampling frontier, where new reasoning behavior is most valuable yet least likely to be sampled. Importantly, failed rollouts can be informative: they expose where the model’s reasoning went wrong. We introduce LatentRevise, a first-order latent revision method that recovers training signal for this zero-hit regime. Given a failed rollout and the gold answer as an anchor, LatentRevise optimizes the input embeddings of its reasoning prefix under two complementary gradients, moving the prefix away from the failed continuation and toward the gold answer. The optimization is constrained to the convex hull of the model’s vocabulary embeddings, so each update moves the latent toward a real token embedding rather than an arbitrary feature direction. We find that continuations from the revised prefix lengthen, exhibit self-reflection, and reach correct answers missed by the original rollouts. Used as training data, these trajectories improve SFT and RLVR on math benchmarks over standard baselines.
One Battle After Another: Probing LLMs’ Limits on Multi-Turn Instruction Following with a Benchmark Evolving Framework
Qi Jia | Ye Shen | Xiujie Song | Kaiwei Zhang | Shibo Wang | Dun Pei | Xiangyang Zhu | Guangtao Zhai
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Qi Jia | Ye Shen | Xiujie Song | Kaiwei Zhang | Shibo Wang | Dun Pei | Xiangyang Zhu | Guangtao Zhai
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Evaluating LLMs’ instruction-following ability in multi-topic dialogues is essential yet challenging. Existing benchmarks are limited to a fixed number of turns, susceptible to saturation and failing to account for users’ interactive experience. In this work, we propose a novel framework featuring a three-layer tracking mechanism and a query synthesis agent to mimic sequential user behaviors. Grounded in Flow Theory, we introduce process-centric metrics and terminate a conversational evaluation only upon exhausting user patience. Leveraging this framework, we present EvolIF, an evolving benchmark covering 12 constraint groups. Our analysis reveals deficiencies in failure recovery and fine-grained instruction following, with performance stratification becoming evident as conversational depth increases. GPT-5 demonstrates the most sustained resilience, maintaining a 66.40% stability score, outperforming Gemini-3-Pro by 5.59%, while other models lag behind.
Market-Bench: Benchmarking Large Language Models on Economic and Trade Competition
Yushuo Zheng | Huiyu Duan | Zicheng Zhang | Yucheng Zhu | Xiongkuo Min | Guangtao Zhai
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Yushuo Zheng | Huiyu Duan | Zicheng Zhang | Yucheng Zhu | Xiongkuo Min | Guangtao Zhai
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
The ability of large language models (LLMs) to manage and acquire economic resources remains unclear. In this paper, we introduce Market-Bench, a comprehensive benchmark that evaluates the capabilities of LLMs in economically-relevant tasks through economic and trade competition. Specifically, we construct a configurable multi-agent supply chain economic model where LLMs act as retailer agents responsible for procuring and retailing merchandise. In the procurement stage, LLMs bid for limited inventory in budget-constrained auctions. In the retail stage, LLMs set retail prices, generate marketing slogans, and provide them to buyers through a role-based attention mechanism for purchase. Market-Bench logs complete trajectories of bids, prices, slogans, sales, and balance-sheet states, enabling automatic evaluation with economic, operational, and semantic metrics. Benchmarking on 20 open- and closed-source LLM agents reveals significant performance disparities and winner-take-most phenomenon, i.e., only a small subset of LLM retailers can consistently achieve capital appreciation, while many hover around the break-even point despite similar semantic matching scores. Market-Bench provides a reproducible testbed for studying how LLMs interact in competitive markets.
2025
OmniAlign-V: Towards Enhanced Alignment of MLLMs with Human Preference
Xiangyu Zhao | Shengyuan Ding | Zicheng Zhang | Haian Huang | Maosong Cao | Weiyun Wang | Jiaqi Wang | Xinyu Fang | Wenhai Wang | Guangtao Zhai | Haodong Duan | Hua Yang | Kai Chen
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Xiangyu Zhao | Shengyuan Ding | Zicheng Zhang | Haian Huang | Maosong Cao | Weiyun Wang | Jiaqi Wang | Xinyu Fang | Wenhai Wang | Guangtao Zhai | Haodong Duan | Hua Yang | Kai Chen
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Recent advancements in open-source multi-modal large language models (MLLMs) have primarily focused on enhancing foundational capabilities, leaving a significant gap in human preference alignment. This paper introduces OmniAlign-V, a comprehensive dataset of 200K high-quality training samples featuring diverse images, complex questions, and varied response formats to improve MLLMs’ alignment with human preferences. We also present MM-AlignBench, a human-annotated benchmark specifically designed to evaluate MLLMs’ alignment with human values. Experimental results show that finetuning MLLMs with OmniAlign-V, using Supervised Fine-Tuning (SFT) or Direct Preference Optimization (DPO), significantly enhances human preference alignment while maintaining or enhancing performance on standard VQA benchmarks, preserving their fundamental capabilities.
Redundancy Principles for MLLMs Benchmarks
Zicheng Zhang | Xiangyu Zhao | Xinyu Fang | Chunyi Li | Xiaohong Liu | Xiongkuo Min | Haodong Duan | Kai Chen | Guangtao Zhai
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Zicheng Zhang | Xiangyu Zhao | Xinyu Fang | Chunyi Li | Xiaohong Liu | Xiongkuo Min | Haodong Duan | Kai Chen | Guangtao Zhai
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
With the rapid iteration of Multi-modality Large Language Models (MLLMs) and the evolving demands of the field, the number of benchmarks produced annually has surged into the hundreds. The rapid growth has inevitably led to significant redundancy among benchmarks. Therefore, it is crucial to take a step back and critically assess the current state of redundancy and propose targeted principles for constructing effective MLLM benchmarks. In this paper, we focus on redundancy from three key perspectives: 1) Redundancy of benchmark capability dimensions, 2) Redundancy in the number of test questions, and 3) Cross-benchmark redundancy within specific domains. Through the comprehensive analysis over hundreds of MLLMs’ performance across more than 20 benchmarks, we aim to quantitatively measure the level of redundancy lies in existing MLLM evaluations, provide valuable insights to guide the future development of MLLM benchmarks, and offer strategies to refine and address redundancy issues effectively.
Search
Fix author
Co-authors
- Zicheng Zhang 4
- Kai Chen 2
- Haodong Duan 2
- Xinyu Fang 2
- Qi Jia 2
- Xiaohong Liu 2
- Xiongkuo Min 2
- Xiangyu Zhao 2
- Xiangyang Zhu 2
- Jing Bai 1
- Maosong Cao 1
- Zijian Chen 1
- Shengyuan Ding 1
- Yunan Ding 1
- Huiyu Duan 1
- Guodong Guo 1
- YiQiu Guo 1
- Xueting Han 1
- Qiang Hu 1
- Haian Huang 1
- Kaiyuan Ji 1
- Chunyi Li 1
- Guangzhao Li 1
- Siqi Luo 1
- Dun Pei 1
- Ye Shen 1
- Xiujie Song 1
- Lu Sun 1
- Yan Tai 1
- Yuan Tian 1
- Jiaqi Wang 1
- Shibo Wang 1
- Weiyun Wang 1
- Wenhai Wang 1
- Hua Yang 1
- Chaoyang Zhang 1
- Kaiwei Zhang 1
- Xiangyi Zhang 1
- Yushuo Zheng 1
- Yucheng Zhu 1