Papers by Yanan Wu
Watch the Neighbors: A Unified K-Nearest Neighbor Contrastive Learning Framework for OOD Intent Discovery (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for finding out-of-domain intents suffer from in-domain overfitting problem . previous methods fail to transfer prior knowledge to downstream clustering . |
| Approach: | They propose a unified K-nearest neighbor contrastive learning framework to discover OOD intents . they propose IND pre-training objective to learn discriminative features while maintaining intra-class diversity . |
| Outcome: | The proposed framework improves on three benchmark datasets. |
Novel Slot Detection: A Benchmark for Discovering Unknown Slot Types in the Task-Oriented Dialogue System (2021.acl-long)
Copied to clipboard
| Challenge: | Existing slot filling models can only recognize pre-defined in-domain slot types from a limited slot set. |
| Approach: | They introduce a task, Novel Slot Detection, in the task-oriented dialogue system. |
| Outcome: | The proposed task is based on two public NSD datasets and proposes strong baselines . it aims to identify a sequence of tokens and extract semantic constituents from user queries . |
RCL: Relation Contrastive Learning for Zero-Shot Relation Extraction (2022.findings-naacl)
Copied to clipboard
| Challenge: | Existing approaches to extract relations require large-scale labeled data. |
| Approach: | They propose a Relation Contrastive Learning framework to mitigate similar relations and similar entities problems by optimizing a contrastive instance loss with a relation classification loss on seen relations. |
| Outcome: | The proposed framework can learn subtle difference between instances and achieve better separation between different relation categories in the representation space simultaneously. |
Disentangled Knowledge Transfer for OOD Intent Discovery with Unified Contrastive Learning (2022.acl-short)
Copied to clipboard
| Challenge: | Existing methods to find out out-of-domain (OOD) intents do not take prior knowledge of in-domain data into account. |
| Approach: | They propose a disentangled knowledge transfer method to bridge the gap between IND pre-training and OOD clustering by using a unified multi-head contrastive learning framework. |
| Outcome: | The proposed method is able to group new unknown intents into different clusters, enabling future development of the system. |
Generalized Intent Discovery: Learning from Open World Dialogue System (2022.coling-1)
Copied to clipboard
| Challenge: | Existing intent classification models rely on a pre-defined intent set and supervised labels, which is limited in some practical scenarios. |
| Approach: | They propose to extend an IND intent classifier to an open-world intent set including IND and OOD intents. |
| Outcome: | The proposed task can classify IND and OOD intents while discovering new unlabeled OOD types incrementally. |
UniNL: Aligning Representation Learning with Scoring Function for OOD Detection via Unified Neighborhood Learning (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods to detect out-of-domain (OOD) intents ignore alignment between representation learning and scoring function, limiting performance. |
| Approach: | They propose a unified neighborhood learning framework to detect OOD intents . they propose to align representation learning with scoring function . |
| Outcome: | The proposed method is able to detect out-of-domain (OOD) intents from user queries. |
ShopSimulator: Evaluating and Exploring RL-Driven LLM Agent for Shopping Assistants (2026.acl-long)
Copied to clipboard
Pei Wang, Yanan Wu, Xiaoshuai Song, Weixun Wang, Gengru Chen, Zhongwen Li, Kezhong Yan, Qi Liu, Ken Deng, Shuaibing Zhao, Shaopan Xiong, Xuepeng Liu, Xuefeng Chen, Wanxi Deng, Wenbo Su, Bo Zheng
| Challenge: | Existing studies on large language model-based agents focus on evaluation benchmarks without training support. |
| Approach: | They propose a large-scale Chinese shopping simulation environment that uses large language models to train agents. |
| Outcome: | The proposed model performs poorly in a large-scale and challenging shopping environment in China. |
Modeling Discriminative Representations for Out-of-Domain Detection with Supervised Contrastive Learning (2021.acl-short)
Copied to clipboard
| Challenge: | Existing methods of OOD detection only focus on whether a sample is correctly classified . lack of real OOD examples leads to poor prior knowledge about these unknown intents . |
| Approach: | They propose a supervised contrastive learning objective to minimize intra-class variance . they employ an adversarial augmentation mechanism to obtain pseudo diverse views . |
| Outcome: | The proposed method minimizes intra-class variance by pulling together in-domain intents belonging to the same class and maximizes inter-class variation by pushing apart samples from different classes. |
Dynamically Disentangling Social Bias from Task-Oriented Representations with Adversarial Attack (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing methods to learn representations from text often reflect social biases . previous methods rely on pre-specified direction or suffer from unstable training . |
| Approach: | They propose an adversarial disentangled debiasing model to decouple social bias attributes from intermediate representations trained on the main task. |
| Outcome: | The proposed model decouples social bias attributes from intermediate representations trained on the main task. |
Learning Discriminative Representations for Open Relation Extraction with Instance Ranking and Label Calibration (2022.findings-naacl)
Copied to clipboard
| Challenge: | Existing methods to extract relational facts without pre-defined relation types cluster hard or semi-hard instances into the same relation type. |
| Approach: | They propose a method to learn discriminative representations for open relation extraction by using instance ranking and label calibration strategies. |
| Outcome: | The proposed method outperforms existing methods on two public datasets. |
Domain-Oriented Prefix-Tuning: Towards Efficient and Generalizable Fine-tuning for Zero-Shot Dialogue Summarization (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing methods for domain adaptation of abstractive dialogue summarization lack generalization ability on new domains. |
| Approach: | They propose a domain-oriented prefix-tuning model that uses a prefix module to alleviate domain entanglement and discrete prompts to guide the model to focus on key contents of dialogues. |
| Outcome: | The proposed model can be generalized to two multi-domain dialogue summarization datasets. |
APP: Adaptive Prototypical Pseudo-Labeling for Few-shot OOD Detection (2023.findings-emnlp)
Copied to clipboard
Pei Wang, Keqing He, Yutao Mou, Xiaoshuai Song, Yanan Wu, Jingang Wang, Yunsen Xian, Xunliang Cai, Weiran Xu
| Challenge: | Existing methods for detecting out-of-domain (OOD) intents are hard to label . previous studies use labeled in-domain data to learn intent representations . |
| Approach: | They propose a prototypical pseudo-labeling method for few-shot OOD detection . they propose 'protoOOD' framework and adaptive pseudo-labeled method . |
| Outcome: | The proposed method is able to detect out-of-domain (OOD) intents from user queries. |
Revisit Overconfidence for OOD Detection: Reassigned Contrastive Learning with Adaptive Class-dependent Threshold (2022.naacl-main)
Copied to clipboard
Yanan Wu, Keqing He, Yuanmeng Yan, QiXiang Gao, Zhiyuan Zeng, Fujia Zheng, Lulu Zhao, Huixing Jiang, Wei Wu, Weiran Xu
| Challenge: | Existing methods for OOD detection are based on labeled in-domain data . detecting out-of-domain (OOD) or unknown intents is challenging . |
| Approach: | They propose a novel reassigned contrastive learning method to discriminate IND intents for over-confident OOD and an adaptive class-dependent local threshold mechanism to separate similar IND and OOD intents. |
| Outcome: | The proposed method is effective for both aspects of overconfidence issues. |
DREAM: Disentangling Risks to Enhance Safety Alignment in Multimodal Large Language Models (2025.naacl-long)
Copied to clipboard
Jianyu Liu, Hangyu Guo, Ranjie Duan, Xingyuan Bu, Yancheng He, Shilong Li, Hui Huang, Jiaheng Liu, Yucheng Wang, Chenchen Jing, Xingwei Qu, Xiao Zhang, Pei Wang, Yanan Wu, Jihao Gu, Yangguang Li, Jianke Zhu
| Challenge: | Multimodal Large Language Models (MLLMs) pose unique safety challenges due to their integration of visual and textual data. |
| Approach: | They propose a method to disentangle risks through step-by-step reasoning within multimodal inputs. |
| Outcome: | The proposed approach improves safety alignment in MLLMs by fine-tuning and iterative Reinforcement Learning from AI feedback. |
CIA: Inferring the Communication Topology from LLM-based Multi-Agent Systems (2026.acl-long)
Copied to clipboard
| Challenge: | LLM-based multi-agent systems (MAS) have demonstrated remarkable capabilities in solving complex tasks. |
| Approach: | They propose a communication inference attack that constructs new adversarial queries to induce intermediate agents’ reasoning outputs and models their semantic correlations through the global bias disentanglement and LLM-guided weak supervision. |
| Outcome: | The proposed attack achieves an average AUC of 0.87 and a peak AUC up to 0.99, revealing the privacy risk in MAS. |
ConceptMath: A Bilingual Concept-wise Benchmark for Measuring Mathematical Reasoning of Large Language Models (2024.findings-acl)
Copied to clipboard
Yanan Wu, Jie Liu, Xingyuan Bu, Jiaheng Liu, Zhanhui Zhou, Yuanxing Zhang, Chenchen Zhang, ZhiqiBai ZhiqiBai, Haibin Chen, Tiezheng Ge, Wanli Ouyang, Wenbo Su, Bo Zheng
| Challenge: | ConceptMath evaluates concept-wise mathematical reasoning of Large Language Models (LLMs) Existing benchmarks that evaluate general mathematical reasoning with an average accuracy fail to probe the fine-grained failure modes of mathematical reasoning on specific datasets. |
| Approach: | They introduce a bilingual, fine-grained benchmark that evaluates concept-wise mathematical reasoning of Large Language Models. |
| Outcome: | The proposed benchmarks evaluate concept-wise mathematical reasoning of Large Language Models with concept-based accuracies. |
M2RC-EVAL: Massively Multilingual Repository-level Code Completion Evaluation (2025.acl-long)
Copied to clipboard
Jiaheng Liu, Ken Deng, Congnan Liu, Jian Yang, Shukai Liu, He Zhu, Peng Zhao, Linzheng Chai, Yanan Wu, JinKe JinKe, Ge Zhang, Zekun Moore Wang, Guoan Zhang, Yingshui Tan, Bangyu Xiang, Zhaoxiang Zhang, Wenbo Su, Bo Zheng
| Challenge: | Existing repository-level code completion benchmarks focus on a limited number of languages . existing benchmarks report overall average scores of different languages ignoring fine-grained abilities . |
| Approach: | They propose to use repository-level code completion benchmarks to evaluate general code intelligence abilities across languages for existing code Large Language Models. |
| Outcome: | The proposed benchmarks improve the code completion abilities of existing LLMs by using two types of annotations on the parsed syntax tree. |
Ref-Long: Benchmarking the Long-context Referencing Capability of Long-context Language Models (2025.acl-long)
Copied to clipboard
| Challenge: | Long-context language models have impressive capabilities in long-contrast understanding tasks, but long-text referencing remains underexplored. |
| Approach: | They propose a benchmark to assess long-context referencing capability of LCLMs . they use three subsets to test the model's ability to identify key indexes based on contextual relationships . |
| Outcome: | The proposed benchmark assesses the long-context referencing capability of LCLMs. |
Non-Autoregressive Chinese ASR Error Correction with Phonological Training (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing methods to correct ASR errors focus on fixed-length corrections, but rarely consider variable-length ones. |
| Approach: | They propose a non-autoregressive method to correct Chinese ASR errors . they use phonological tokens to extend the source sentence for variable-length correction . |
| Outcome: | The proposed method improves word error rate and speeds up inference by 6.2 times compared with the autoregressive model. |
Distribution Calibration for Out-of-Domain Detection with Bayesian Approximation (2022.coling-1)
Copied to clipboard
| Challenge: | Existing methods for OOD detection are overconfident for OD samples . lack of labeled OOD examples leads to poor prior knowledge about these unknown intents, making it challenging to detect OOD samples. |
| Approach: | They propose a Bayesian OOD detection framework to calibrate distribution uncertainty using Monte-Carlo Dropout. |
| Outcome: | The proposed framework gains 33.33% OOD F1 improvements with increasing only 0.41% inference time compared to previous methods. |
ProgCo: Program Helps Self-Correction of Large Language Models (2025.acl-short)
Copied to clipboard
| Challenge: | Existing LLMs fail to self-correct and generate correct feedback, leading to misleading refinement and failure of self-refinement. |
| Approach: | They propose a program-driven self-correction approach that uses program-based verification to self-refine initial responses without external feedback. |
| Outcome: | The proposed model achieves self-correction and can be further enhanced when combined with real program tools. |