Pengzhou Cheng
Author directory2026
Context-Aware Cluster Decoding: Semantic Anchor-Driven Coherence in dMLLMs
Yikai Zhao | Qiyan Zhao | Jiaquan Zhang | Xiaofeng Zhang | Xiaosong Yuan | Pengzhou Cheng
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Yikai Zhao | Qiyan Zhao | Jiaquan Zhang | Xiaofeng Zhang | Xiaosong Yuan | Pengzhou Cheng
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Diffusion multimodal large language models (dMLLMs) frequently produce long-form outputs marred by semantic drift and repetition, with quality generally degrading as output length increases. We identify two structural deficiencies in existing decoding methods as primary drivers of these failures: confidence-based scoring ignores decoded-neighbor support, and block partitioning prevents access to high-readiness semantic anchors. Together, these deficiencies cause tokens to be committed before their local context is sufficiently established. We propose CACD (Context-Aware Cluster Decoding), a training-free decoding method that scores each masked position using a multiplicative combination of softmax confidence and neighbor proximity. This approach prioritizes contextually ready tokens over isolated candidates while suppressing low-confidence positional noise. CACD operates without block partitioning, keeping high-readiness anchors globally accessible. It further applies architecture-aware calibration to handle confidence heterogeneity induced by diverse visual integration strategies. Experiments on three dMLLMs across four benchmarks demonstrate consistent quality gains and hallucination reduction over the original decoding methods, with larger gains in several longer-generation settings. These results highlight the importance of neighbor support and visual integration strategies for the future design of dMLLM decoding methods. Our code is openly available at https://github.com/zhaoyk-sysu/CACD-dMLLM.
Do GUI Agents Know When Not to Act? Enabling Conflict-Aware Termination for Multimodal GUI Agents
Zhaoyuan Huang | Tianjie Ju | Pengzhou Cheng | Zheng Wu | Yansi Li | Chuanbiao Song | Jun Lan | Huijia Zhu | Weiqiang Wang | Zhuosheng Zhang
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Zhaoyuan Huang | Tianjie Ju | Pengzhou Cheng | Zheng Wu | Yansi Li | Chuanbiao Song | Jun Lan | Huijia Zhu | Weiqiang Wang | Zhuosheng Zhang
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Graphical user interface (GUI) agents are increasingly used to execute natural-language instructions on user interfaces, yet real users may issue infeasible instructions due to benign mistakes. A reliable agent should not only know how to act, but also when not to act. In this work, we introduce ConflictGUI, a benchmark covering instruction-internal conflicts and instruction-GUI context conflicts to study conflict-aware termination. Our evaluation reveals severe execution-biased over-compliance: agents that perform well on feasible tasks often continue to execute blindly under conflicting instructions. To mitigate this behavior, we propose ConflictGuard, an inference-time framework that aligns an agent’s feasibility awareness with its action generation. ConflictGuard contains two coupled components: a feasibility verification protocol that guides the agent to assess instruction logic and GUI-side evidence before acting, and a conditional action modulation mechanism that steers agent’s over-compliance into termination-oriented behavior. Experiments across five widely-used agents demonstrate that ConflictGuard improves average conflict task success rate significantly, while preserving normal GUI-task performance. These results validate that a lightweight inference-time intervention can substantially boost GUI Agent’s competence to identify inappropriate execution scenarios and refrain from unnecessary actions.
2025
SynGhost: Invisible and Universal Task-agnostic Backdoor Attack via Syntactic Transfer
Pengzhou Cheng | Wei Du | Zongru Wu | Fengwei Zhang | Libo Chen | Zhuosheng Zhang | Gongshen Liu
Findings of the Association for Computational Linguistics: NAACL 2025
Pengzhou Cheng | Wei Du | Zongru Wu | Fengwei Zhang | Libo Chen | Zhuosheng Zhang | Gongshen Liu
Findings of the Association for Computational Linguistics: NAACL 2025
Hidden Ghost Hand: Unveiling Backdoor Vulnerabilities in MLLM-Powered Mobile GUI Agents
Pengzhou Cheng | Haowen Hu | Zheng Wu | Zongru Wu | Tianjie Ju | Daizong Ding | Zhuosheng Zhang | Gongshen Liu
Findings of the Association for Computational Linguistics: EMNLP 2025
Pengzhou Cheng | Haowen Hu | Zheng Wu | Zongru Wu | Tianjie Ju | Daizong Ding | Zhuosheng Zhang | Gongshen Liu
Findings of the Association for Computational Linguistics: EMNLP 2025
Graphical user interface (GUI) agents powered by multimodal large language models (MLLMs) have shown greater promise for human-interaction. However, due to the high fine-tuning cost, users often rely on open-source GUI agents or APIs offered by AI providers, which introduces a critical but underexplored supply chain threat: backdoor attacks. In this work, we first unveil that MLLM-powered GUI agents naturally expose multiple interaction-level triggers, such as historical steps, environment states, and task progress. Based on this observation, we introduce AgentGhost, an effective and stealthy framework for red-teaming backdoor attacks. Specifically, we first construct composite triggers by combining goal and interaction levels, allowing GUI agents to unintentionally activate backdoors while ensuring task utility. Then, we formulate backdoor injection as a Min-Max optimization problem that uses supervised contrastive learning to maximize the feature difference across sample classes at the representation space, improving flexibility of the backdoor. Meanwhile, it adopts supervised fine-tuning to minimize the discrepancy between backdoor and clean behavior, enhancing effectiveness and utility. Extensive results show that AgentGhost is effective and generic, with attack accuracy that reaches 99.7% on three attack objectives, and shows stealthiness with only 1% utility degradation. Furthermore, we tailor a defense method against AgentGhost that reduces the attack accuracy to 22.1%.
OS-Kairos: Adaptive Interaction for MLLM-Powered GUI Agents
Pengzhou Cheng | Zheng Wu | Zongru Wu | Tianjie Ju | Aston Zhang | Zhuosheng Zhang | Gongshen Liu
Findings of the Association for Computational Linguistics: ACL 2025
Pengzhou Cheng | Zheng Wu | Zongru Wu | Tianjie Ju | Aston Zhang | Zhuosheng Zhang | Gongshen Liu
Findings of the Association for Computational Linguistics: ACL 2025
Autonomous graphical user interface (GUI) agents powered by multimodal large language models have shown great promise. However, a critical yet underexplored issue persists: over-execution, where the agent executes tasks in a fully autonomous way, without adequate assessment of its action confidence to compromise an adaptive human-agent collaboration. This poses substantial risks in complex scenarios, such as those involving ambiguous user instructions, unexpected interruptions, and environmental hijacks. To address the issue, we introduce OS-Kairos, an adaptive GUI agent capable of predicting confidence levels at each interaction step and efficiently deciding whether to act autonomously or seek human intervention. OS-Kairos is developed through two key mechanisms: (i) collaborative probing that annotates confidence scores at each interaction step; (ii) confidence-driven interaction that leverages these confidence scores to elicit the ability of adaptive interaction. Experimental results show that OS-Kairos substantially outperforms existing models on our curated dataset featuring complex scenarios, as well as on established benchmarks such as AITZ and Meta-GUI, with 24.59%~87.29% improvements in task success rate. OS-Kairos facilitates an adaptive human-agent collaboration, prioritizing effectiveness, generality, scalability, and efficiency for real-world GUI interaction. The dataset and codes are available at Anonymous.
Gracefully Filtering Backdoor Samples for Generative Large Language Models without Retraining
Zongru Wu | Pengzhou Cheng | Lingyong Fang | Zhuosheng Zhang | Gongshen Liu
Proceedings of the 31st International Conference on Computational Linguistics
Zongru Wu | Pengzhou Cheng | Lingyong Fang | Zhuosheng Zhang | Gongshen Liu
Proceedings of the 31st International Conference on Computational Linguistics
Backdoor attacks remain significant security threats to generative large language models (LLMs). Since generative LLMs output sequences of high-dimensional token logits instead of low-dimensional classification logits, most existing backdoor defense methods designed for discriminative models like BERT are ineffective for generative LLMs. Inspired by the observed differences in learning behavior between backdoor and clean mapping in the frequency space, we transform gradients of each training sample, directly influencing parameter updates, into the frequency space. Our findings reveal a distinct separation between the gradients of backdoor and clean samples in the frequency space. Based on this phenomenon, we propose Gradient Clustering in the Frequency Space for Backdoor Sample Filtering (GraCeFul), which leverages sample-wise gradients in the frequency space to effectively identify backdoor samples without requiring retraining LLMs. Experimental results show that GraCeFul outperforms baselines significantly. Notably, GraCeFul exhibits remarkable computational efficiency, achieving nearly 100% recall and F1 scores in identifying backdoor samples, reducing the average success rate of various backdoor attacks to 0% with negligible drops in clean accuracy across multiple free-style question answering datasets. Additionally, GraCeFul generalizes to Llama-2 and Vicuna. The codes are publicly available at https://github.com/ZrW00/GraceFul.
2024
Acquiring Clean Language Models from Backdoor Poisoned Datasets by Downscaling Frequency Space
Zongru Wu | Zhuosheng Zhang | Pengzhou Cheng | Gongshen Liu
Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Zongru Wu | Zhuosheng Zhang | Pengzhou Cheng | Gongshen Liu
Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Despite the notable success of language models (LMs) in various natural language processing (NLP) tasks, the reliability of LMs is susceptible to backdoor attacks. Prior research attempts to mitigate backdoor learning while training the LMs on the poisoned dataset, yet struggles against complex backdoor attacks in real-world scenarios. In this paper, we investigate the learning mechanisms of backdoor LMs in the frequency space by Fourier analysis. Our findings indicate that the backdoor mapping presented on the poisoned datasets exhibits a more discernible inclination towards lower frequency compared to clean mapping, resulting in the faster convergence of backdoor mapping. To alleviate this dilemma, we propose Multi-Scale Low-Rank Adaptation (MuScleLoRA), which deploys multiple radial scalings in the frequency space with low-rank adaptation to the target model and further aligns the gradients when updating parameters. Through downscaling in the frequency space, MuScleLoRA encourages the model to prioritize the learning of relatively high-frequency clean mapping, consequently mitigating backdoor learning. Experimental results demonstrate that MuScleLoRA outperforms baselines significantly. Notably, MuScleLoRA reduces the average success rate of diverse backdoor attacks to below 15% across multiple datasets and generalizes to various backbone LMs, including BERT, RoBERTa, and Llama2. The codes are publicly available at Anonymous.