Hao Wang
Author directoryOther people with similar names: Hao Wang (Beijing Institute of Technology), Hao Wang, Hao Wang, Hao Wang (UESTC), Hao Wang, Hao Wang (Nanjing), Hao Wang, Hao Wang, Hao Wang, Hao Wang (University of Science and Technology of China), Hao Wang, Hao Wang (Stevens Institute of Technology), Hao Wang, Hao Wang, Hao Wang (HKUST), Hao Wang, Hao Wang, Hao Wang, Hao Wang, Hao Wang, Hao Wang, Hao Wang (Zhejiang), Hao Wang (Monash), Hao Wang, Hao Wang, Hao Wang, Hao Wang
Unverified author pages with similar names: Hao Wang
2026
MCTS-Debater: Monte Carlo Tree Search based Rebuttal Generation for Competitive Debate
Xiaoyong Huang | Yuting Huang | Guanlan Yue | Hao Wang | Heli Sun | Jiaruo Wu | Zejun Wang | Liang He
Findings of the Association for Computational Linguistics: EMNLP 2026
Xiaoyong Huang | Yuting Huang | Guanlan Yue | Hao Wang | Heli Sun | Jiaruo Wu | Zejun Wang | Liang He
Findings of the Association for Computational Linguistics: EMNLP 2026
Competitive debate is a multi-turn, zero-sum adversarial task with opposing stances that requires debaters to anticipate opponents’ counterarguments in real-time interactions and select strategies yielding long-term advantages. Existing large language model debate methods predominantly adopt a greedy generation paradigm that optimizes only the immediate effectiveness of the current rebuttal while lacking forward-looking planning for the overall debate trajectory. To address this limitation, we propose MCTS-Debater, a Monte Carlo Tree Search framework that models competitive debate as a Markov Decision Process. Rather than selecting a single locally optimal response, MCTS-Debater systematically simulates multi-step adversarial interactions under diverse rebuttal strategies, estimates their long-term expected win rates via tree search, and synthesizes the top-performing strategies into a coherent final rebuttal through multi-strategy fusion. Experimental results on the ORCHID and IQ2 datasets demonstrate that MCTS-Debater significantly outperforms existing baselines in logical validity, factual accuracy, and overall persuasiveness. Source code is provided in the supplementary material.
Remembering Facts, Updating Minds: Personal-Factual Adaptive Memory for Multi-Turn Emotional Support
Hao Wang | Qiuyun Zhang | Peilin LI | Ke Ma
Findings of the Association for Computational Linguistics: EMNLP 2026
Hao Wang | Qiuyun Zhang | Peilin LI | Ke Ma
Findings of the Association for Computational Linguistics: EMNLP 2026
Emotional Support Conversation (ESC) systems help seekers understand and cope with distress through multi-turn interaction. Existing ESC systems typically improve responses by adding auxiliary support knowledge or prompting LLMs to reason over dialogue context. However, they usually pass inferred seeker information to the generator as a single state, so factual circumstances and mental state inferences are stored, selected, and updated in the same way. This blurs the difference between persistent facts and transient personal states, making it difficult to retain stable grounding while adapting to psychological changes across turns. Therefore, in this paper, we propose MIA, a Personal-Factual Adaptive Memory framework for multi-turn emotional support conversation. MIA first infers Emotional Theory-of-Mind factors and separates them into factual and personal states. It then uses a Personal-Factual Discriminator to decide which state should guide the next response, and an Obsolescence Removal Mechanism to remove outdated memory before generation. This design enables the generator to preserve factual grounding, focus on the turn-relevant support orientation, and avoid stale psychological assumptions. Experiments on ESConv and CPsyCounD show that MIA better understands the seeker’s situation, provides more constructive guidance, and maintains more coherent support across turns. Our codes are available at: https://github.com/ Wh2018/MIA.
MDHB: A Multi-Dimensional Online Harm Detection Benchmark for Proactive Psychosocial Risk Forecasting
Yuting Huang | Xiaoyong Huang | Hao Wang | Heli Sun | Jiaruo Wu | Zejun Wang | Yunyun Shi | Guanlan Yue | Liang He
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Yuting Huang | Xiaoyong Huang | Hao Wang | Heli Sun | Jiaruo Wu | Zejun Wang | Yunyun Shi | Guanlan Yue | Liang He
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Online harm detection is crucial for safeguarding digital ecosystems. However, current research is largely confined to single-dimensional classification paradigms or generative safety alignment under simplified and explicit adversarial prompts. To capture complex and highly covert threats in the real world, we introduce the Multi-dimensional Online Harm Detection Benchmark (MDHB). MDHB focuses on four core dimensions critically demanded by social platforms: misinformation, toxicity, sarcasm, and logical fallacies. Notably, we incorporate non-offensive implicit sarcasm (e.g., self-deprecation and veiled complaints) to propel content governance toward proactive psychosocial risk forecasting. Evaluations reveal that mainstream Large Language Models (LLMs), including GPT-5, suffer from severe cross-dimensional interference under both direct inference and ReAct paradigms. To address this, we propose the Self-Refining Sentinel (SRS), an error-driven self-evolving agent architecture. Without requiring parameter fine-tuning, SRS dynamically constructs and updates an experience repository from failure cases through an iterative self-evolution mechanism. Experimental results demonstrate that SRS significantly outperforms state-of-the-art baselines in overall performance, effectively mitigating cross-dimensional interference in multi-dimensional online threat detection.