Papers by Yanxi Li
MemeReaCon: Probing Contextual Meme Understanding in Large Vision-Language Models (2025.emnlp-main)
Copied to clipboard
Zhengyi Zhao, Shubo Zhang, Yuxi Zhang, Yanxi Zhao, Yifan Zhang, Zezhong Wang, Huimin Wang, Yutian Zhao, Bin Liang, Yefeng Zheng, Binyang Li, Kam-Fai Wong, Xian Wu
| Challenge: | Current approaches focus on isolated meme analysis, either for harmful content detection or standalone interpretation, overlooking a fundamental challenge: the same meme can express different intents depending on its conversational context. |
| Approach: | They propose a benchmark to evaluate how large vision language models understand memes in their original context. |
| Outcome: | The proposed benchmark evaluates how large vision language models understand meme intent in their original context. |
Knowledgeable Preference Alignment for LLMs in Domain-specific Question Answering (2024.findings-acl)
Copied to clipboard
| Challenge: | Domain-specific question answering (QA) requires a comprehensive understanding of a specific domain to answer specialized questions. |
| Approach: | They propose a new alignment objective to align the LLM preference with different human preferences uniformly to optimize LLM performance in real-world, domain-specific QA settings. |
| Outcome: | The proposed pipeline is superior for real-scenario domain-specific question answering with LLMs. |
AHA: Aligning Large Audio-Language Models for Reasoning Hallucinations via Counterfactual Hard Negatives (2026.findings-acl)
Copied to clipboard
Yanxi Chen, Wenhui Zhu, Xiwen Chen, Zhipeng Wang, Xin Li, Peijie Qiu, Hao Wang, Xuanzhao Dong, Yujian Xiong, Anderson Schneider, Yuriy Nevmyvaka, Yalin Wang
| Challenge: | Large Audio-Language Models suffer from hallucinations, e.g., generating text not grounded in the audio input. |
| Approach: | They propose a framework to address hallucination problems in large audio-language models . they use a preference dataset to test the model's accuracy . |
| Outcome: | The proposed model outperforms the latest SOTA methods in terms of performance and generalization. |
BrowseComp-Plus: A Fair and Disentangled Evaluation Benchmark for Deep Search Agents (2026.acl-long)
Copied to clipboard
Zijian Chen, Xueguang Ma, Shengyao Zhuang, Ping Nie, Kai Zou, Sahel Sharifymoghaddam, Andrew Liu, Joshua Green, Kshama Patel, Ruoxi Meng, Mingyi Su, Yanxi Li, Haoran Hong, Xinyu Shi, Xuye Liu, Hosna Oyarhoseini, Nandan Thakur, Crystina Zhang, Luyu Gao, Wenhu Chen, Jimmy Lin
| Challenge: | Existing benchmarks for deep search agents rely on blackbox web search APIs . dynamic and opaque web APIs hinder reproducibility and fair comparisons - authors . |
| Approach: | They propose a benchmark that employs a fixed corpus for controlled retrieval for deep search agents. |
| Outcome: | The new benchmark shows that agents that combine large language models with retrieval tools excel at complex, reasoning-intensive queries. |