VLDB 2026 Research / reviewers in the wild / expert
Yutao Mou
dblp:320/5861
· DBLP profile ↗
11ranked-venue papers
6as first author
11since 2021 · last 2025
0000-0003-4109-1984ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 10 · 6 first-author · 10 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Can You Really Trust Code Copilot? Evaluating Large Language Models from a Code Security PerspectiveabstractCode security and usability are both essential for various coding assistant applications driven by large language models (LLMs). Current code security benchmarks focus solely on single evaluation task and paradigm, such as code completion and generation, lacking comprehensive assessment across dimensions like secure code generation, vulnerability repair and discrimination. In this paper, we first propose CoV-Eval, a multi-task benchmark covering various tasks such as code completion, vulnerability repair, vulnerability detection and classification, for comprehensive evaluation of LLM code security. Besides, we developed VC-Judge, an improved judgment model that aligns closely with human experts and can review LLM-generated programs for vulnerabilities in a more efficient and reliable way. We conduct a comprehensive evaluation of 20 proprietary and open-source LLMs. Overall, while most LLMs identify vulnerable codes well, they still tend to generate insecure codes and struggle with recognizing specific vulnerability types and performing repairs. Extensive experiments and qualitative analyses reveal key challenges and optimization directions, offering insights for future research in LLM code security. Yutao Mou, Shikun Zhang, Wei Ye 0004 |
ACL (1) | 1 |
| 2025 | Assessing and Post-Processing Black Box Large Language Models for Knowledge EditingabstractThe rapid evolution of the Web as a key platform for information dissemination has led to the growing integration of large language models (LLMs) in Web-based applications. However, the swift changes in web content present challenges in maintaining these models' relevance and accuracy. The task of Knowledge Editing (KE) is aimed at efficiently and precisely adjusting the behavior of large language models (LLMs) to update specific knowledge while minimizing any adverse effects on other knowledge. Current research predominantly concentrates on editing white-box LLMs, neglecting a significant scenario: editing black-box LLMs, where access is limited to interfaces and only textual output is provided. In this paper, we initially officially introduce KE on black-box LLMs, followed by presenting a thorough evaluation framework. This framework operates without requiring logits and considers pre- and post-edit consistency, addressing the limitations of current evaluations that are inadequate for black-box LLMs editing and lack comprehensiveness. To address privacy leaks of editing data and style over-editing in existing approaches, we propose a new postEdit framework. postEdit incorporates a retrieval mechanism for editing knowledge and a purpose-trained editing plugin called post-editor, ensuring privacy through downstream processing and maintaining textual style consistency via fine-grained editing. Experiments and analysis conducted on two benchmarks show that postEdit surpasses all baselines and exhibits robust generalization, notably enhancing style retention by an average of +20.82%. Our code is available on github https://github.com/songxiaoshuai/postEdit. Xiaoshuai Song, Keqing He 0001, Guanting Dong 0001, Yutao Mou, Jinxu Zhao, Weiran Xu |
WWW | 5 |
| 2024 | Beyond the Known: Investigating LLMs Performance on Out-of-Domain Intent DetectionabstractOut-of-domain (OOD) intent detection aims to examine whether the user’s query falls outside the predefined domain of the system, which is crucial for the proper functioning of task-oriented dialogue (TOD) systems. Previous methods address it by fine-tuning discriminative models. Recently, some studies have been exploring the application of large language models (LLMs) represented by ChatGPT to various downstream tasks, but it is still unclear for their ability on OOD detection task.This paper conducts a comprehensive evaluation of LLMs under various experimental settings, and then outline the strengths and weaknesses of LLMs. We find that LLMs exhibit strong zero-shot and few-shot capabilities, but is still at a disadvantage compared to models fine-tuned with full resource. More deeply, through a series of additional analysis experiments, we discuss and summarize the challenges faced by LLMs and provide guidance for future work including injecting domain knowledge, strengthening knowledge transfer from IND(In-domain) to OOD, and understanding long instructions. Keqing He 0001, Yejie Wang, Xiaoshuai Song, Yutao Mou, Jingang Wang, Yunsen Xian, Weiran Xu |
LREC/COLING | 5 |
| 2024 | SG-Bench: Evaluating LLM Safety Generalization Across Diverse Tasks and Prompt TypesabstractEnsuring the safety of large language model (LLM) applications is essential for developing trustworthy artificial intelligence. Current LLM safety benchmarks have two limitations. First, they focus solely on either discriminative or generative evaluation paradigms while ignoring their interconnection. Second, they rely on standardized inputs, overlooking the effects of widespread prompting techniques, such as system prompts, few-shot demonstrations, and chain-of-thought prompting. To overcome these issues, we developed SG-Bench, a novel benchmark to assess the generalization of LLM safety across various tasks and prompt types. This benchmark integrates both generative and discriminative evaluation tasks and includes extended data to examine the impact of prompt engineering and jailbreak on LLM safety. Our assessment of 3 advanced proprietary LLMs and 10 open-source LLMs with the benchmark reveals that most LLMs perform worse on discriminative tasks than generative ones, and are highly susceptible to prompts, indicating poor generalization in safety alignment. We also explain these findings quantitatively and qualitatively to provide insights for future research. Yutao Mou, Shikun Zhang, Wei Ye 0004 |
NeurIPS | 1 |
| 2023 | Decoupling Pseudo Label Disambiguation and Representation Learning for Generalized Intent DiscoveryabstractYutao Mou, Xiaoshuai Song, Keqing He, Chen Zeng, Pei Wang, Jingang Wang, Yunsen Xian, Weiran Xu. Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2023. Yutao Mou, Xiaoshuai Song, Keqing He 0001, Jingang Wang, Yunsen Xian, Weiran Xu |
ACL (1) | 1 |
| 2023 | Large Language Models Meet Open-World Intent Discovery and Recognition: An Evaluation of ChatGPTabstractXiaoshuai Song, Keqing He, Pei Wang, Guanting Dong, Yutao Mou, Jingang Wang, Yunsen Xian, Xunliang Cai, Weiran Xu. Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing. 2023. Xiaoshuai Song, Keqing He 0001, Guanting Dong 0001, Yutao Mou, Jingang Wang, Yunsen Xian, Weiran Xu |
EMNLP | 5 |
| 2022 | Generalized Intent Discovery: Learning from Open World Dialogue SystemabstractTraditional intent classification models are based on a pre-defined intent set and only recognize limited in-domain (IND) intent classes. But users may input out-of-domain (OOD) queries in a practical dialogue system. Such OOD queries can provide directions for future improvement. In this paper, we define a new task, Generalized Intent Discovery (GID), which aims to extend an IND intent classifier to an open-world intent set including IND and OOD intents. We hope to simultaneously classify a set of labeled IND intent classes while discovering and recognizing new unlabeled OOD types incrementally. We construct three public datasets for different application scenarios and propose two kinds of frameworks, pipeline-based and end-to-end for future work. Further, we conduct exhaustive experiments and qualitative analysis to comprehend key challenges and provide new guidance for future GID research. Yutao Mou, Keqing He 0001, Yanan Wu 0002, Jingang Wang, Wei Wu 0014, Yi Huang 0017, Junlan Feng, Weiran Xu |
COLING | 1 |
| 2022 | Distribution Calibration for Out-of-Domain Detection with Bayesian ApproximationabstractOut-of-Domain (OOD) detection is a key component in a task-oriented dialog system, which aims to identify whether a query falls outside the predefined supported intent set. Previous softmax-based detection algorithms are proved to be overconfident for OOD samples. In this paper, we analyze overconfident OOD comes from distribution uncertainty due to the mismatch between the training and test distributions, which makes the model can’t confidently make predictions thus probably causes abnormal softmax scores. We propose a Bayesian OOD detection framework to calibrate distribution uncertainty using Monte-Carlo Dropout. Our method is flexible and easily pluggable to existing softmax-based baselines and gains 33.33% OOD F1 improvements with increasing only 0.41% inference time compared to MSP. Further analyses show the effectiveness of Bayesian learning for OOD detection. Yanan Wu 0002, Zhiyuan Zeng 0002, Keqing He 0001, Yutao Mou, Weiran Xu |
COLING | 4 |
| 2022 | Exploiting domain-slot related keywords description for Few-Shot Cross-Domain Dialogue State TrackingabstractCollecting dialogue data with domain-slotvalue labels for dialogue state tracking (DST) could be a costly process.In this paper, we propose a novel framework based on domain-slot related description to tackle the challenge of few-shot cross-domain DST.Specifically, we design an extraction module to extract domainslot related verbs and nouns in the dialogue.Then, we integrates them into the description, which aims to prompt the model to identify the slot information.Furthermore, we introduce a random sampling strategy to improve the domain generalization ability of the model.We utilize a pre-trained model to encode contexts and description and generates answers with an auto-regressive manner.Experimental results show that our approaches substantially outperform the existing few-shot DST methods on MultiWOZ and gain strong improvements on the slot accuracy comparing to existing slot description methods. QiXiang Gao, Guanting Dong 0001, Yutao Mou, Liwen Wang 0007, Daichi Guo, Weiran Xu |
EMNLP | 3 |
| 2022 | Watch the Neighbors: A Unified K-Nearest Neighbor Contrastive Learning Framework for OOD Intent DiscoveryabstractDiscovering out-of-domain (OOD) intent is important for developing new skills in taskoriented dialogue systems.The key challenges lie in how to transfer prior in-domain (IND) knowledge to OOD clustering, as well as jointly learn OOD representations and cluster assignments.Previous methods suffer from indomain overfitting problem, and there is a natural gap between representation learning and clustering objectives.In this paper, we propose a unified K-nearest neighbor contrastive learning framework to discover OOD intents.Specifically, for IND pre-training stage, we propose a KCL objective to learn inter-class discriminative features, while maintaining intraclass diversity, which alleviates the in-domain overfitting problem.For OOD clustering stage, we propose a KCC method to form compact clusters by mining true hard negative samples, which bridges the gap between clustering and representation learning.Extensive experiments on three benchmark datasets show that our method achieves substantial improvements over the state-of-the-art methods. 1 Yutao Mou, Keqing He 0001, Yanan Wu 0002, Jingang Wang, Wei Wu 0014, Weiran Xu |
EMNLP | 1 |
| 2022 | UniNL: Aligning Representation Learning with Scoring Function for OOD Detection via Unified Neighborhood LearningabstractDetecting out-of-domain (OOD) intents from user queries is essential for avoiding wrong operations in task-oriented dialogue systems.The key challenge is how to distinguish indomain (IND) and OOD intents.Previous methods ignore the alignment between representation learning and scoring function, limiting the OOD detection performance.In this paper, we propose a unified neighborhood learning framework (UniNL) to detect OOD intents.Specifically, we design a K-nearest neighbor contrastive learning (KNCL) objective for representation learning and introduce a KNNbased scoring function for OOD detection.We aim to align representation learning with scoring function.Experiments and analysis on two benchmark datasets show the effectiveness of our method.1 Yutao Mou, Keqing He 0001, Yanan Wu 0002, Jingang Wang, Wei Wu 0014, Weiran Xu |
EMNLP | 1 |