Xingrui Yu
Author directory2026
SkillDAG: Self-Evolving Typed Skill Graphs for LLM Skill Selection at Scale
Tong Bai | Zhenglin Wan | Pengfei Zhou | Xingrui Yu | Yang You | Ivor Tsang
Findings of the Association for Computational Linguistics: EMNLP 2026
Tong Bai | Zhenglin Wan | Pengfei Zhou | Xingrui Yu | Yang You | Ivor Tsang
Findings of the Association for Computational Linguistics: EMNLP 2026
Large skill libraries are now standard equipment for LLM agents, and which subset reaches the prompt decides what the agent can do. Enumeration and top-K embedding retrieval both treat skills as independent documents, assuming relevance is a property of one skill at a time. It is not: skills depend on, conflict with, specialize, and duplicate one another, so the closest match to a task can name it while omitting a prerequisite it needs. Graph retrieval encodes these relations but spends them in a fixed pipeline, handing the agent an opaque bundle. We present SkillDAG, which exposes a typed skill graph to the LLM as an agent-callable interface rather than consuming it for the agent: search returns vector matches, typed-edge neighbors, and conflict signals, and a propose-then-commit protocol lets it register execution-backed edges as it works. Across two benchmarks and three model families, SkillDAG outperforms full-library prompting, vector retrieval, and Graph-of-Skills, gaining +14.3 points of ALFWorld success and tying only at ceiling; its ranking holds flat across a 10× pool expansion that degrades the fixed pipeline. Inter-skill structure, these results suggest, is worth more to an agent that can query and revise it than to a retriever that consumes it.
Safety Sidecar: Reflection-Driven Runtime Control for Safer Agents
Wang Bin | Quan Jiazheng | Xingrui Yu | Hu Hansen | Yu Hao | Anjun Gao | Zhenglin Wan | Hui LI | Ivor Tsang
Findings of the Association for Computational Linguistics: ACL 2026
Wang Bin | Quan Jiazheng | Xingrui Yu | Hu Hansen | Yu Hao | Anjun Gao | Zhenglin Wan | Hui LI | Ivor Tsang
Findings of the Association for Computational Linguistics: ACL 2026
Autonomous LLM agents are increasingly deployed in complex environments as tool-using systems. However, their safety remains fragile, as minor reasoning or retrieval errors can be amplified into hazardous actions within the agentic workflow. Existing defenses, often limited to static prompts or post-hoc guardrails, fail to provide runtime intervention or cross-architecture portability. In this paper, we propose Safety Sidecar, a model-agnostic, plug-and-play module designed to provide standardized runtime safety control and auditability for arbitrary agent workflows. Safety Sidecar operationalizes reflection as a closed-loop controller: it dynamically monitors decision traces, retrieves evidence-based repair exemplars from a reflective memory, and enforces risk-mitigating revisions before execution. Crucially, it employs external verifiers to gate both action release and memory updates, producing a transparent, auditable trail of retrieved evidence and applied constraints.We instantiate and systematically evaluate Safety Sidecar in secure code generation—a high-stakes domain with objective vulnerability signals. Experimental results across eight CWE scenarios and four representative LLMs demonstrate that Safety Sidecar consistently improves the secure-solution rate by 2.9–11.2 percentage points while maintaining competitive functional correctness. Efficiency analysis shows the framework is practical for deployment, with reflection adding only 3.2s to end-to-end latency and a negligible average cost of 5.37 × 10-4 per scenario. Our findings position Safety Sidecar as a portable and efficient control layer for enhancing the safety, compliance, and auditability of LLM-based agents.
Forgetting Across Modalities: Unlearning in Multimodal Large Language Models
Yan Li | Xingrui Yu | Zhiqiang Wang | Zhenyi Wang | Ivor Tsang
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Yan Li | Xingrui Yu | Zhiqiang Wang | Zhenyi Wang | Ivor Tsang
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Gradient conflict between forgetting and retaining objectives is a well-known obstacle in machine unlearning, where opposing gradients on shared parameters cause destructive interference. In Multimodal Large Language Models (MLLMs), cross-modal coupling entangles visual and textual representations within the same parameters, making this conflict considerably more severe. We propose EASE (Efficient Alignment-aware Selective Erasing), which explicitly balances the conflicting gradient directions. EASE first dynamically locates the conflicting parameters at each step by detecting opposite-sign gradients, then performs a manifold-constrained optimization within the two-dimensional subspace spanned by the task gradients to find the linear combination that maximally aligns them, yielding a valid descent direction for both objectives without any manually tuned trade-off coefficient. Nonconflicting parameters keep their standard updates, keeping the method lightweight. Experiments across multiple MLLM architectures and unlearning benchmarks show that EASE achieves superior unlearning efficiency and faster convergence while matching or surpassing existing methods in multimodal quality.
From Language to Driving: A Dual-Loop SLM-Enhanced Framework for Multi-Planner Scheduling via a Domain-Specific Language
Jiawei Liu | Xun Gong | Muli Yang | Xingrui Yu | Fen Fang | Xulei Yang | Ivor Tsang | Yunfeng hu | Hong Chen | Qing Guo
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Jiawei Liu | Xun Gong | Muli Yang | Xingrui Yu | Fen Fang | Xulei Yang | Ivor Tsang | Yunfeng hu | Hong Chen | Qing Guo
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Advancing from usable to collaborative autonomy requires driving systems to execute passenger instructions safely and reliably. This work formulates instruction realization as scheduling across multiple motion planners and presents a dual-loop framework that provides a transparent decision chain from natural language to vehicle control. The outer loop uses a small language model (SLM) for high-level, low-frequency semantic reasoning and schedule generation, while the inner loop performs low-level, high-frequency schedule execution and vehicle control. To compensate for the SLM’s limited capacity, the framework integrates receding-horizon scheduling to segment long-horizon instruction tasks, a domain-specific language (DSL) that restricts SLM outputs to a scheduling-oriented subspace, and reinforcement learning in high-fidelity urban traffic to refine the SLM’s DSL proficiency and scheduling performance. Experiments show that the framework improves instruction-completion rates while maintaining high safety and compliance relative to multiple baselines.