Xue Lin
Author directory2026
RCR-Router:Role-Conditioned Context Routing for Resource-Efficient Multi-Agent LLM Systems
Jun Liu | Pu Zhao | Zhenglun Kong | Wenbin Zhang | Fan Yang | Peiyan Dong | Changdi Yang | Wuzhe Fan | Tianqin Li | Hao Tang | Geng Yuan | Wei Niu | Joannah Nanjekye | Xue Lin | Dong Huang | Yanzhi Wang
Findings of the Association for Computational Linguistics: EMNLP 2026
Jun Liu | Pu Zhao | Zhenglun Kong | Wenbin Zhang | Fan Yang | Peiyan Dong | Changdi Yang | Wuzhe Fan | Tianqin Li | Hao Tang | Geng Yuan | Wei Niu | Joannah Nanjekye | Xue Lin | Dong Huang | Yanzhi Wang
Findings of the Association for Computational Linguistics: EMNLP 2026
Large language model (LLM) agents are increasingly organized into multi-agent systems for complex reasoning and decision-making tasks. However, scaling such systems can substantially increase inference cost, especially when multiple agents repeatedly process overlapping or role-irrelevant context. Many existing multi-agent frameworks focus on orchestration and role specialization, but still rely on full-context sharing or static context routing, leading to redundant token consumption, increased runtime, and inefficient memory utilization. We present Role-Conditioned Context Routing (RCR), an execution-time layer that allocates role-relevant shared-memory items to agents under token budgets. Given a structured shared memory and a set of role-specialized agents, RCR selectively routes task-relevant memory items to each agent according to its role, optional task-stage metadata, and token budget. RCR integrates role-conditioned relevance scoring, token-budgeted memory selection, and iterative memory updates to reduce redundant context exposure during multi-agent execution. Experiments on multi-hop QA, embodied reasoning (ALFWorld), and web-based decision-making (WebShop) show that RCR reduces token usage by 35% on average and runtime by 38% on average relative to Full-Context, while maintaining or improving task performance.
MRMAD: A Multi-Round Multi-Audio Benchmark for Evaluating Acoustic Degradation Perception in Large Audio-Language Models
Yize Li | Ningyuan Yang | Sile Yin | Sindhuja Thogarrati | Sung-En Chang | Andrew C. Singer | Xue Lin | Chuan-Che Huang | Shuo Zhang
Findings of the Association for Computational Linguistics: EMNLP 2026
Yize Li | Ningyuan Yang | Sile Yin | Sindhuja Thogarrati | Sung-En Chang | Andrew C. Singer | Xue Lin | Chuan-Che Huang | Shuo Zhang
Findings of the Association for Computational Linguistics: EMNLP 2026
Large audio-language models (LALMs) have shown promising progress in understanding speech, music, and general sound events, yet their ability to reason about how audio signals are degraded remains underexplored. Existing benchmarks primarily evaluate semantic understanding, event recognition, or high-level audio reasoning, leaving a basic question unanswered: Do LALMs understand the differences in audio quality? We introduce MRMAD, a Multi-Round Multi-Audio Degradation benchmark for evaluating audio degradation perception and understanding in LALMs. MRMAD spans speech, music, and sound, and frames evaluation as multi-turn dialogues across multiple audio inputs, requiring models to identify types of degradation, compare severity, and perceive corruption changes across turns. Unlike current single-turn audio-language benchmarks, MRMAD evaluates whether LALMs can maintain consistent degradation hypotheses with new evidence and comprehend low-level acoustic phenomena over multi-turn dialogues. Through a systematic evaluation of 18 representative LALMs from non-thinking to reasoning and Omni models, we find that current models often recognize coarse content while failing to diagnose, compare, or reason about degradations reliably. Human evaluations further reveal a significant perception gap between LALMs and human listeners. MRMAD thus exposes a critical yet overlooked aspect of audio-language understanding and provides a diagnostic foundation for building future LALMs that are robust to real-world acoustic conditions.
2024
Pruning Foundation Models for High Accuracy without Retraining
Pu Zhao | Fei Sun | Xuan Shen | Pinrui Yu | Zhenglun Kong | Yanzhi Wang | Xue Lin
Findings of the Association for Computational Linguistics: EMNLP 2024
Pu Zhao | Fei Sun | Xuan Shen | Pinrui Yu | Zhenglun Kong | Yanzhi Wang | Xue Lin
Findings of the Association for Computational Linguistics: EMNLP 2024
Despite the superior performance, it is challenging to deploy large language models (LLMs) due to their massive parameters and computations. While pruning is a promising technique to reduce model size and accelerate the inference, the traditional pruning techniques can hardly be applied for LLMs as they need to finetune the model on the full dataset with multiple epochs consuming massive data and hardware resources. To deal with this problem, post-training pruning methods are proposed to prune LLMs in one-shot without retraining. However, their accuracy after pruning may suffer from certain performance degradation due to the lack of retraining with massive data. To address this issue, in this paper, we first formulate the post-training problem for layer-wise LLM compression to simultaneously prune multiple weights in LLMs. Next, we provide an optimal solution for this problem and design our post-training pruning algorithm for both unstructured and semi-structured sparsity. Our extensive experiments demonstrate the superior performance of the proposed methods in comparison to SOTA baselines across various LLM families including transformer-based LLMs and Mamba-based LLMs.
Rethinking Token Reduction for State Space Models
Zheng Zhan | Yushu Wu | Zhenglun Kong | Changdi Yang | Yifan Gong | Xuan Shen | Xue Lin | Pu Zhao | Yanzhi Wang
Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing
Zheng Zhan | Yushu Wu | Zhenglun Kong | Changdi Yang | Yifan Gong | Xuan Shen | Xue Lin | Pu Zhao | Yanzhi Wang
Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing
Recent advancements in State Space Models (SSMs) have attracted significant interest, particularly in models optimized for parallel training and handling long-range dependencies. Architectures like Mamba have scaled to billions of parameters with selective SSM. To facilitate broader applications using Mamba, exploring its efficiency is crucial. While token reduction techniques offer a straightforward post-training strategy, we find that applying existing methods directly to SSMs leads to substantial performance drops. Through insightful analysis, we identify the reasons for this failure and the limitations of current techniques. In response, we propose a tailored, unified post-training token reduction method for SSMs. Our approach integrates token importance and similarity, thus taking advantage of both pruning and merging, to devise a fine-grained intra-layer token reduction strategy. Extensive experiments show that our method improves the average accuracy by 5.7% to 13.1% on six benchmarks with Mamba-2 compared to existing methods, while significantly reducing computational demands and memory requirements.
Search
Fix author
Co-authors
- Zhenglun Kong 3
- Yanzhi Wang 3
- Pu Zhao 3
- Xuan Shen 2
- Changdi Yang 2
- Sung-En Chang 1
- Peiyan Dong 1
- Wuzhe Fan 1
- Yifan Gong 1
- Chuan-Che Huang 1
- Dong Huang 1
- Tianqin Li 1
- Yize Li 1
- Jun Liu 1
- Joannah Nanjekye 1
- Wei Niu 1
- Andrew C. Singer 1
- Fei Sun 1
- Hao Tang 1
- Sindhuja Thogarrati 1
- Yushu Wu 1
- Fan Yang 1
- Ningyuan Yang 1
- Sile Yin 1
- Pinrui Yu 1
- Geng Yuan 1
- Zheng Zhan 1
- Shuo Zhang 1
- Wenbin Zhang 1