Kaiyu Zhou
Author directory2026
Beyond Max Tokens: Stealthy Resource Amplification via Tool Calling Chains in LLM Agents
Kaiyu Zhou | Yongsen Zheng | Yicheng He | Meng Xue | Xueluan Gong | Yuji Wang | Xuanye Zhang | Kwok-Yan Lam
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Kaiyu Zhou | Yongsen Zheng | Yicheng He | Meng Xue | Xueluan Gong | Yuji Wang | Xuanye Zhang | Kwok-Yan Lam
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
The agent–tool interaction loop is a critical attack surface for modern Large Language Model (LLM) agents. Existing denial-of-service (DoS) attacks typically function at the user-prompt or retrieval-augmented generation (RAG) context layer and are inherently single-turn in nature. This limitation restricts cost amplification and diminishes stealth in goal-oriented workflows. To address these issues, we propose a stealthy, multi-turn economic DoS attack at the tool layer under the Model Context Protocol (MCP). By editing only text-visible fields and implementing a stateful, completeness-gated return policy, our malicious server preserves tool identity and the terminal benign payload while steering agents into prolonged, verbose tool-calling chains. We optimize these text-only edits with Monte Carlo Tree Search (MCTS) to maximize cost under a task-success constraint. Across six LLMs on the ToolBench and BFCL benchmarks, our attack yields trajectories over 60K tokens, increases per-query cost by up to 658×, raises energy consumption by 100–560×, and pushes GPU key-value (KV) cache occupancy to 35–74%. Representative prompt filters and output- or trajectory-level monitors seldom detect these attacks, highlighting the need for defenses that safeguard agentic processes rather than focusing solely on final outcomes. We will release the code soon.
OrchDebate: Adaptive Orchestration for Multi-Agent Debate via Self-Evolving Skills
Kaiyu Zhou | Yongsen Zheng | Xuanye Zhang | Kwok-Yan Lam
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Kaiyu Zhou | Yongsen Zheng | Xuanye Zhang | Kwok-Yan Lam
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Multi-Agent Debate (MAD) has emerged as a promising paradigm for eliciting stronger inference-time reasoning, yet most existing systems still use fixed interaction protocols across instances. Such static designs can suffer from anchoring bias, overthinking on easy problems, and rigid coordination across tasks of varying difficulty. We present OrchDebate, a framework that recasts multi-agent debate as structured-state orchestration over reusable debate-control skills. Instead of following a pre-defined template, OrchDebate uses an orchestrator to examine the current debate state and select the next coordination action, such as introducing agents under different visibility settings or terminating deliberation with an adaptive readout rule. This skill-based view makes debate control modular and state-dependent. The orchestrator operates through a structured control interface rather than directly generating reasoning content, helping reduce reliance on early answers. OrchDebate further maintains a self-evolving skill bank whose reusable realizations are refined through outcome-guided updates on an evolution stream, without additional external training data. Across diverse benchmarks, OrchDebate delivers a better accuracy-cost trade-off than representative fixed and adaptive debate methods by allocating debate compute more selectively.