Zihe Yan
Author directory2026
EVA: Evolving Semantic Adversaries for Red-Teaming GUI Agents Against Environmental Injection Attacks
Yijie Lu | Manman Zhao | Tianjie Ju | Zihe Yan | Xinbei Ma | Yuan Guo | Daizong Ding | Gongshen Liu | Zhuosheng Zhang
Findings of the Association for Computational Linguistics: ACL 2026
Yijie Lu | Manman Zhao | Tianjie Ju | Zihe Yan | Xinbei Ma | Yuan Guo | Daizong Ding | Gongshen Liu | Zhuosheng Zhang
Findings of the Association for Computational Linguistics: ACL 2026
Autonomous GUI agents are inherently vulnerable to Environmental Injection Attacks (EIAs). However, existing red-teaming methods face a trade-off between requiring target-specific knowledge and incurring prohibitive computational costs. More fundamentally, a key question remains: what factors determine attack success? To answer this, we first analyze two dimensions: visual appearance (e.g., position, size, color) and semantic content. We find that semantic content dominates, while visual variations have negligible impact. Leveraging this insight, we introduce EVA, a framework that evolves payloads exclusively on the semantic dimension via a discovery-deployment pipeline. Experiments demonstrate that EVA significantly outperforms baselines, achieving 59% to 85% average Attack Success Rate (ASR) while evolving benign seeds into successful attacks within 1.18 to 1.71 iterations. This rapid convergence suggests a dense semantic attack space within the model’s latent space. Whenever an input falls into this space, the agent becomes inherently vulnerable, exposing a fundamental alignment flaw in current multimodal representations.
RASER: Recoverability-Aware Selective Escalation Router for Multi-Hop Question Answering
Yuyang Li | Zihe Yan | Tobias Käfer
Findings of the Association for Computational Linguistics: IJCNLP-AACL 2026
Yuyang Li | Zihe Yan | Tobias Käfer
Findings of the Association for Computational Linguistics: IJCNLP-AACL 2026
Multi-hop question-answering systems often use expensive retrieval on every question. They may decompose the question, run several retrieval rounds, or search through bridge entities before answering. All of these strategies rely on repeated LLM calls to rewrite or decompose the question, which increases extra token cost, and it is not fitting when the LLM budget is tight. However, our analysis shows that lots of multi-hop questions are already answered correctly by a single one-shot RAG, so running an extra retrieval on every question wastes the budget. We introduce RASER (Recoverability-Aware Selective Escalation Router), a family of cheap routers built on one-shot RAG and six features from it. RASER-2 decides whether to stop or escalate to the extra-retrieval action PRUNE. RASER-3 chooses among one-shot RAG, PRUNE, and iterative retrieval IRCoT, using the same features but adding an explicit cost-accuracy trade-off. Neither router makes an extra LLM call to decide. Across six LLMs and three multi-hop QA benchmarks, both routers stay competitive with the other state-of-the-art (SOTA) baselines in F1 while spending only 41–49% of always-prune’s tokens and also less than the iterative and decomposition retrieval baselines.
Search