Papers by Xuelong Wang
JanusMM: A Benchmark for Self-Deprecation Understanding in Real-World Multimodal Conversations (2026.acl-long)
Copied to clipboard
Xinyi Xu, Bingguang Hao, Yongyi Xiong, Zimo Chen, Xinchen Liu, Hongxin Guo, Xuelong Wang, Silin Zhou, Shihan Dou
| Challenge: | Multimodal large language models (MLLMs) are a common communicative strategy in human society, often using image-text interplay to express emotions and intentions. |
| Approach: | They propose to evaluate multimodal large language models (MLLMs)' understanding of self-deprecation in real-world conversations using 2,016 bilingual memes. |
| Outcome: | The proposed framework evaluates MLLMs' understanding of self-deprecation in real-world conversations. |
Towards Efficient LLM Grounding for Embodied Multi-Agent Collaboration (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for grounding large language models suffer from inefficient querying . Existing approaches that rely on physical verification or self-reflection suffer from excessive querying. |
| Approach: | They propose a framework that introduces Reinforced Advantage feedback for efficient self-refinement of plans. |
| Outcome: | The proposed framework surpasses baselines in success rate and significantly decreases interaction steps of agents and query rounds of LLMs. |
Logic-Regularized Verifier Elicits Reasoning from LLMs (2025.acl-long)
Copied to clipboard
| Challenge: | Typical verifiers require resource-intensive supervised dataset construction, which is costly and faces limitations in data diversity. |
| Approach: | They propose an unsupervised verifier regularized by logical rules that uses internal activations and logical constraints on multiple reasoning paths. |
| Outcome: | Experiments on 10 datasets show that the proposed verifier outperforms baselines and is comparable to the supervised verifier. |
Search to Pass Messages for Temporal Knowledge Graph Completion (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Recent studies on missing facts in temporal knowledge graphs are based on hand-designed architectures and fail to explore the diverse topological and temporal properties of TKGs. |
| Approach: | They propose to use neural architecture search to design a data-specific message passing architecture for TKG completion. |
| Outcome: | The proposed architectures achieve the state-of-the-art performance on three benchmark datasets. |