Haoqin Tu
Author directory2026
Your Agent, Their Asset: A Real-World Safety Analysis of OpenClaw
Zijun Wang | Haoqin Tu | Letian Zhang | Hardy Chen | Juncheng Wu | Xiangyan Liu | Zhenlong Yuan | Tianyu Pang | Qizhe Xie | Fengze Liu | Zeyu Zheng | Huaxiu Yao | Yuyin Zhou | Cihang Xie
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Zijun Wang | Haoqin Tu | Letian Zhang | Hardy Chen | Juncheng Wu | Xiangyan Liu | Zhenlong Yuan | Tianyu Pang | Qizhe Xie | Fengze Liu | Zeyu Zheng | Huaxiu Yao | Yuyin Zhou | Cihang Xie
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
OpenClaw, the most widely deployed personal AI agent in early 2026, operates with full local system access and integrates with sensitive services such as Gmail, Stripe, and the filesystem. While these broad privileges enable high levels of automation and powerful personalization, they also expose a substantial attack surface that existing sandboxed evaluations fail to capture. To address this gap, we present the first real-world safety evaluation of OpenClaw and introduce the CIK taxonomy, which unifies an agent’s persistent state into three dimensions, i.e., Capability, Identity, and Knowledge, for safety analysis. Our evaluations cover 12 attack scenarios on a live OpenClaw instance across four backbone models (Claude Sonnet 4.5, Opus 4.6, Gemini 3.1 Pro, and GPT-5.4). The results show that poisoning any single CIK dimension increases the average attack success rate from 24.6% to 64-74%, with even the most robust model exhibiting more than a threefold increase over its baseline vulnerability. We further assess three CIK-aligned defense strategies alongside a file-protection mechanism; however, the strongest defense still yields a 63.8% success rate under Capability-targeted attacks, while file protection blocks 97% of malicious injections but also prevents legitimate updates. Taken together, these findings show that the vulnerabilities are inherent to the agent architecture, necessitating more systematic safeguards to secure personal AI agents. Our project page is https://ucsc-vlaa.github.io/CIK-Bench.
You Only Align Once: Propagating Cooperative Behaviors in Multi-Agent Systems through Seed Agents
Nicole Summer Hsing | Asuka Yuxi Zheng | Yi Zhao | Haoqin Tu | Jen-tse Huang
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Nicole Summer Hsing | Asuka Yuxi Zheng | Yi Zhao | Haoqin Tu | Jen-tse Huang
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Ensuring aligned agent behaviors in distributed open multi-agent systems remains challenging, especially as populations grow and unaligned agents may exist. We show that a single aligned agent can propagate cooperative behaviors to unmodified agents purely through natural-language interaction, a phenomenon we term Alignment Propagation. We study this in the Red-Black Game, a team-based iterated Prisoner’s Dilemma in which teammates deliberate and vote to determine their team’s collective action. By distilling the cooperative reasoning and persuasive dialogues of a teacher model into Qwen3-14B, we obtain a seed agent that, when placed among four unmodified teammates, more than doubles the cooperation rate from 24.8% to 62.2%, outperforming the teacher model and a vanilla Gemini-3.1-Pro. Remarkably, a seed trained exclusively on the Red-Black Game transfers zero-shot to Sugarscape, a spatially grounded survival simulation with pairwise trading, achieving a 91.5% trade success rate versus a 21.6% baseline. Our results reframe multi-agent alignment from an exhaustive per-agent training problem to a scalable social capability that can be engineered through strategic seed placement.
2025
Libra-Leaderboard: Towards Responsible AI through a Balanced Leaderboard of Safety and Capability
Haonan Li | Xudong Han | Zenan Zhai | Honglin Mu | Hao Wang | Zhenxuan Zhang | Yilin Geng | Shom Lin | Renxi Wang | Artem Shelmanov | Xiangyu Qi | Yuxia Wang | Donghai Hong | Youliang Yuan | Meng Chen | Haoqin Tu | Fajri Koto | Cong Zeng | Tatsuki Kuribayashi | Rishabh Bhardwaj | Bingchen Zhao | Yawen Duan | Yi Liu | Emad A. Alghamdi | Yaodong Yang | Yinpeng Dong | Soujanya Poria | Pengfei Liu | Zhengzhong Liu | Hector Xuguang Ren | Eduard Hovy | Iryna Gurevych | Preslav Nakov | Monojit Choudhury | Timothy Baldwin
Proceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Language Technologies (System Demonstrations)
Haonan Li | Xudong Han | Zenan Zhai | Honglin Mu | Hao Wang | Zhenxuan Zhang | Yilin Geng | Shom Lin | Renxi Wang | Artem Shelmanov | Xiangyu Qi | Yuxia Wang | Donghai Hong | Youliang Yuan | Meng Chen | Haoqin Tu | Fajri Koto | Cong Zeng | Tatsuki Kuribayashi | Rishabh Bhardwaj | Bingchen Zhao | Yawen Duan | Yi Liu | Emad A. Alghamdi | Yaodong Yang | Yinpeng Dong | Soujanya Poria | Pengfei Liu | Zhengzhong Liu | Hector Xuguang Ren | Eduard Hovy | Iryna Gurevych | Preslav Nakov | Monojit Choudhury | Timothy Baldwin
Proceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Language Technologies (System Demonstrations)
As large language models (LLMs) continue to evolve, leaderboards play a significant role in steering their development. Existing leaderboards often prioritize model capabilities while overlooking safety concerns, leaving a significant gap in responsible AI development. To address this gap, we introduce Libra-Leaderboard, a comprehensive framework designed to rank LLMs through a balanced evaluation of performance and safety. Combining a dynamic leaderboard with an interactive LLM arena, Libra-Leaderboard encourages the joint optimization of capability and safety. Unlike traditional approaches that average performance and safety metrics, Libra-Leaderboard uses a distance-to-optimal-score method to calculate the overall rankings. This approach incentivizes models to achieve a balance rather than excelling in one dimension at the expense of some other ones. In the first release, Libra-Leaderboard evaluates 26 mainstream LLMs from 14 leading organizations, identifying critical safety challenges even in state-of-the-art models.
ViLBench: A Suite for Vision-Language Process Reward Modeling
Haoqin Tu | Weitao Feng | Hardy Chen | Hui Liu | Xianfeng Tang | Cihang Xie
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Haoqin Tu | Weitao Feng | Hardy Chen | Hui Liu | Xianfeng Tang | Cihang Xie
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Process-supervised reward models serve as a fine-grained function that provides detailed step-wise feedback to model responses, facilitating effective selection of reasoning trajectories for complex tasks. Despite its advantages, evaluation on PRMs remains less explored, especially in the multimodal domain. To address this gap, this paper first benchmarks current vision large language models (VLLMs) as two types of reward models: output reward models (ORMs) and process reward models (PRMs) on multiple vision-language benchmarks, which reveal that neither ORM nor PRM consistently outperforms across all tasks, and superior VLLMs do not necessarily yield better rewarding performance. To further advance evaluation, we introduce ViLBench, a vision-language benchmark designed to require intensive process reward signals. Notably, OpenAI’s GPT-4o with Chain-of-Thought (CoT) achieves only 27.3% accuracy, challenging current VLLMs. Lastly, we preliminarily showcase a promising pathway towards bridging the gap between general VLLMs and reward models—by collecting 73.6K vision-language process reward data using an enhanced tree-search algorithm, our 3B model is able to achieve an average improvement of 3.3% over standard CoT and up to 2.5% compared to its untrained counterpart on ViLBench by selecting OpenAI o1’s generations. We will release our code, model, and data at https://ucsc-vlaa.github.io/ViLBench.
2023
ReSee: Responding through Seeing Fine-grained Visual Knowledge in Open-domain Dialogue
Haoqin Tu | Yitong Li | Fei Mi | Zhongliang Yang
Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing
Haoqin Tu | Yitong Li | Fei Mi | Zhongliang Yang
Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing
Incorporating visual knowledge into text-only dialogue systems has become a potential direction to imitate the way humans think, imagine, and communicate. However, existing multimodal dialogue systems are either confined by the scale and quality of available datasets or the coarse concept of visual knowledge. To address these issues, we provide a new paradigm of constructing multimodal dialogues as well as two datasets extended from text-only dialogues under such paradigm (ReSee-WoW, ReSee-DD). We propose to explicitly split the visual knowledge into finer granularity (“turn-level” and “entity-level”). To further boost the accuracy and diversity of augmented visual information, we retrieve them from the Internet or a large image dataset. To demonstrate the superiority and universality of the provided visual knowledge, we propose a simple but effective framework ReSee to add visual representation into vanilla dialogue models by modality concatenations. We also conduct extensive experiments and ablations w.r.t. different model configurations and visual knowledge settings. Empirical, encouraging results not only demonstrate the effectiveness of introducing visual knowledge at both entity and turn level but also verify the proposed model ReSee outperforms several state-of-the-art methods on automatic and human evaluations. By leveraging text and vision knowledge, ReSee can produce informative responses with real-world visual concepts. Our code is available at https://github.com/ImKeTT/ReSee.
Search
Fix author
Co-authors
- Hardy Chen 2
- Cihang Xie 2
- Emad A. Alghamdi 1
- Timothy Baldwin 1
- Rishabh Bhardwaj 1
- Meng Chen 1
- Monojit Choudhury 1
- Yinpeng Dong 1
- Yawen Duan 1
- Weitao Feng 1
- Yilin Geng 1
- Iryna Gurevych 1
- Xudong Han 1
- Donghai Hong 1
- Eduard Hovy 1
- Nicole Summer Hsing 1
- Jen-tse Huang 1
- Fajri Koto 1
- Tatsuki Kuribayashi 1
- Haonan Li 1
- Yitong Li 1
- Shom Lin 1
- Fengze Liu 1
- Hui Liu 1
- Pengfei Liu 1
- Xiangyan Liu 1
- Yi Liu 1
- Zhengzhong Liu 1
- Fei Mi 1
- Honglin Mu 1
- Preslav Nakov 1
- Tianyu Pang 1
- Soujanya Poria 1
- Xiangyu Qi 1
- Hector Xuguang Ren 1
- Artem Shelmanov 1
- Xianfeng Tang 1
- Hao Wang 1
- Renxi Wang 1
- Yuxia Wang 1
- Zijun Wang 1
- Juncheng Wu 1
- Qizhe Xie 1
- Yaodong Yang (杨耀东) 1
- Zhongliang Yang 1
- Huaxiu Yao 1
- Youliang Yuan 1
- Zhenlong Yuan 1
- Cong Zeng 1
- Zenan Zhai 1
- Letian Zhang 1
- Zhenxuan Zhang 1
- Bingchen Zhao 1
- Yi Zhao 1
- Asuka Yuxi Zheng 1
- Zeyu Zheng 1
- Yuyin Zhou 1