Zhiheng Li
Author directory2026
Making MLLMs Blind: Adversarial Smuggling Attacks in MLLM Content Moderation
Zhiheng Li | Zongyang Ma | Yuntong Pan | Ziqi Zhang | Xiaolei Lv | Bo Li | Jun Gao | Jianing Zhang | Chunfeng Yuan | Bing Li | Weiming Hu
Findings of the Association for Computational Linguistics: ACL 2026
Zhiheng Li | Zongyang Ma | Yuntong Pan | Ziqi Zhang | Xiaolei Lv | Bo Li | Jun Gao | Jianing Zhang | Chunfeng Yuan | Bing Li | Weiming Hu
Findings of the Association for Computational Linguistics: ACL 2026
Multimodal Large Language Models (MLLMs) are increasingly being deployed as automated content moderators. Within this landscape, we uncover a critical threat: Adversarial Smuggling Attacks. Unlike adversarial perturbations (for misclassification) and adversarial jailbreaks (for harmful output generation), adversarial smuggling exploits the Human-AI capability gap. It encodes harmful content into human-readable visual formats that remain AI-unreadable, thereby evading automated detection and enabling the dissemination of harmful content. We classify smuggling attacks into two pathways: (1) Perceptual Blindness, disrupting text recognition; and (2) Reasoning Blockade, inhibiting semantic understanding despite successful text recognition. To evaluate this threat, we constructed SmuggleBench, the first comprehensive benchmark comprising 1,700 adversarial smuggling attack instances. Evaluations on SmuggleBench reveal that both proprietary (e.g., GPT-5) and open-source (e.g., Qwen3-VL) SOTA models are vulnerable to this threat, producing Attack Success Rates (ASR) exceeding 90%. By analyzing the vulnerability through the lenses of perception and reasoning, we identify three root causes: the limited capabilities of vision encoders, the robustness gap in OCR, and the scarcity of domain-specific adversarial examples. We conduct a preliminary exploration of mitigation strategies, investigating the potential of test-time scaling (via CoT) and adversarial training (via SFT) to mitigate this threat.
A Better Spur Should Start From Each Objective
Shanwen Mao | Hao Zhang | Guangtao Nie | Zhiheng Li | Huimu Wang | Sulong Xu | Gu Simiu
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Shanwen Mao | Hao Zhang | Guangtao Nie | Zhiheng Li | Huimu Wang | Sulong Xu | Gu Simiu
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Real-world Multi-Objective Reinforcement Learning (MORL) often suffers from **sparse rewards**, **reward conflicts**, and late-stage **reward tug-of-war**, causing traditional linear scalarization to experience severe metric oscillations. To address optimization conflicts among multiple objectives in real-world deployment scenarios, we propose Multi-Marginal Preference Optimization (MMPO), a fine-grained framework that intervenes at the data, gradient, and constraint levels rather than relying on coarse-grained global scalarization. Specifically, MMPO performs exposure debiasing to mitigate sparse and biased rewards, applies priority-aware orthogonal projection to decouple conflicting gradients, and introduces self-prompted gradient constraints to prevent dominant objectives from overwhelming weaker ones. Experiments on real-world e-commerce datasets show that MMPO improves training stability and consistently achieves better performance across conflicting metrics. Moreover, it generalizes robustly to broader tasks such as ToolRL and code generation, demonstrating its effectiveness as a practical paradigm for multi-objective alignment.