Papers by Daya Guo
LaPraDoR: Unsupervised Pretrained Dense Retriever for Zero-Shot Text Retrieval (2022.findings-acl)
Copied to clipboard
| Challenge: | Experimental results show that LaPraDoR is state-of-the-art compared with supervised dense retrieval models. |
| Approach: | They propose a pretrained dual-tower dense retriever that does not require supervised data for training. |
| Outcome: | The proposed method achieves state-of-the-art performance on 18 datasets of 9 zero-shot text retrieval tasks. |
Evidence-Aware Inferential Text Generation with Vector Quantised Variational AutoEncoder (2020.acl-main)
Copied to clipboard
| Challenge: | Existing approaches for inferential text generation ignore context that is not explicitly provided . Existing models ignore background knowledge that provides crucial evidence to generate inferences . |
| Approach: | They propose an approach that automatically finds evidence for an event from a large text corpus and leverages it to guide the generation of inferential texts. |
| Outcome: | The proposed model generates inferential texts from a large text corpus and uses evidence to guide it. |
Noisy Pair Corrector for Dense Retrieval (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing dense retrieval models assume that query-document pairs are exactly matched, resulting in mismatched-pair noise. |
| Approach: | They propose a novel approach to train an effective model with mismatched-pair noise. |
| Outcome: | The proposed model performs well on natural question and triviaQA, code-search benchmarks and SO-DS. |
Question Generation from SQL Queries Improves Neural Semantic Parsing (D18-1)
Copied to clipboard
| Challenge: | Using question generation, we learn a semantic parser with 30% of the supervised training data. |
| Approach: | They propose to use question generation to learn a semantic parser with less supervised training data. |
| Outcome: | The proposed method improves the state-of-the-art model with less training data. |
Baize: An Open-Source Chat Model with Parameter-Efficient Tuning on Self-Chat Data (2023.emnlp-main)
Copied to clipboard
| Challenge: | Despite the promising potential of chat models, they are only accessible through restricted APIs, creating barriers for new research and progress in the field. |
| Approach: | They propose a pipeline that can automatically generate a high-quality multi-turn chat corpus by leveraging ChatGPT to engage in a conversation with itself. |
| Outcome: | The proposed pipeline generates a high-quality multi-turn chat corpus by leveraging ChatGPT to engage in a conversation with itself, simulating both user and AI responses. |
ReACC: A Retrieval-Augmented Code Completion Framework (2022.acl-long)
Copied to clipboard
| Challenge: | Recent work has shown that statistical language modeling with transformers can greatly improve the performance in code completion tasks. |
| Approach: | They propose a retrieval-augmented code completion framework that combines a source code retriever and an auto-regressive language model for programming language. |
| Outcome: | The proposed framework achieves state-of-the-art on CodeXGLUE benchmark. |
ArkRepoBench: A Repository-Level Code Completion Benchmark for HarmonyOS Development (2026.findings-acl)
Copied to clipboard
Yanlin Wang, Bowen Zhang, Yanli Wang, Daya Guo, Terry Yue Zhuo, Jiachi Chen, Mingwei Liu, Xingong Zhang, Zibin Zheng
| Challenge: | Despite the maturity of LLM-based code assistance for mainstream languages, the capabilities of ArkTS are largely unexplored. |
| Approach: | They propose to benchmark repository-level code completion for ArkTS using 7,519 samples from 20 official HarmonyOS repositories. |
| Outcome: | The proposed benchmark covers multiple difficulty levels and categorizes completion instances into Single-File, Cross-Filled Independent, and Cross-Filed Dependent settings based on dependency analysis. |
UniXcoder: Unified Cross-Modal Pre-training for Code Representation (2022.acl-long)
Copied to clipboard
| Challenge: | Pre-trained models for programming languages have demonstrated great success on code intelligence . however, such pre-tried models are sub-optimal for auto-regressive tasks . |
| Approach: | They propose a unified cross-modal pre-trained model for programming language that leverages cross-module contents like AST and code comment to enhance code representation. |
| Outcome: | The proposed model achieves state-of-the-art on most code-related tasks and compares with existing models on zero-shot code-to-code search. |
Multi-Task Learning for Conversational Question Answering over a Large-Scale Knowledge Base (D19-1)
Copied to clipboard
| Challenge: | Recent approaches to handle large knowledge base decompose tasks into subtasks and solve them sequentially. |
| Approach: | They propose a multi-task learning framework that resolves coreference in conversations . they propose enabling shared supervisions and type-aware entity detection model . |
| Outcome: | The proposed framework improves overall F1 score from 67% to 79% on a large-scale conversational question answering dataset. |
CodeBERT: A Pre-Trained Model for Programming and Natural Languages (2020.findings-emnlp)
Copied to clipboard
Zhangyin Feng, Daya Guo, Duyu Tang, Nan Duan, Xiaocheng Feng, Ming Gong, Linjun Shou, Bing Qin, Ting Liu, Daxin Jiang, Ming Zhou
| Challenge: | Large pre-trained models have improved performance on a variety of natural language processing tasks. |
| Approach: | They develop a bimodal pre-trained model for programming language (PL) and natural language (NL) it incorporates a hybrid objective function that detects replaced tokens from generators. |
| Outcome: | The proposed model performs better on two NL-PL applications by fine-tuning model parameters. |
Syntax-Enhanced Pre-trained Model (2021.acl-long)
Copied to clipboard
Zenan Xu, Daya Guo, Duyu Tang, Qinliang Su, Linjun Shou, Ming Gong, Wanjun Zhong, Xiaojun Quan, Daxin Jiang, Nan Duan
| Challenge: | Existing methods that use syntax of text in pre-training and fine-tuning suffer from discrepancy between the two stages. |
| Approach: | They propose a model that utilizes the syntactic structure of text in pre-training and fine-tuning stages. |
| Outcome: | The proposed model achieves state-of-the-art on six public benchmark datasets. |
Coupling Retrieval and Meta-Learning for Context-Dependent Semantic Parsing (P19-1)
Copied to clipboard
| Challenge: | a context-aware retrieval model and a meta-learning paradigm are used for context-dependent semantic parsing . |
| Approach: | They propose a retrieval model and a meta-learner to incorporate retrieved datapoints as context-dependent semantic parsing evidence. |
| Outcome: | The proposed approach performs better than retrieve-and-edit baselines on CONCODE and CSQA datasets. |
Analytical Reasoning of Text (2022.findings-naacl)
Copied to clipboard
Wanjun Zhong, Siyuan Wang, Duyu Tang, Zenan Xu, Daya Guo, Yining Chen, Jiahai Wang, Jian Yin, Ming Zhou, Nan Duan
| Challenge: | Existing models with implicit reasoning ability struggle to solve analytical reasoning of text. |
| Approach: | They propose an approach to analyze text and use it to perform reasoning over it. |
| Outcome: | The proposed approach outperforms pre-trained models on an analysis of the Law School Admission Test dataset. |
From Logical to Computational Sparsity: Structure-Aware Block-Sparse Attention for Long-Code Completion (2026.acl-long)
Copied to clipboard
| Challenge: | Existing sparse attention methods for long-context generation pose high latency . general sparsity methods cause excessive accuracy degradation without considering code structure . |
| Approach: | They propose a training-free **S**tructure-**a**ware **b**lock-spa**r**s**e** attention mechanism that bridges the gap between logical and computational sparsity. |
| Outcome: | The proposed method reduces TTFT by 45-55% while maintaining accuracy within 3% of dense attention. |
Soft-Labeled Contrastive Pre-Training for Function-Level Code Representation (2022.findings-emnlp)
Copied to clipboard
Xiaonan Li, Daya Guo, Yeyun Gong, Yun Lin, Yelong Shen, Xipeng Qiu, Daxin Jiang, Weizhu Chen, Nan Duan
| Challenge: | Existing methods for contrastive pre-training ignore the relevance between codes in large code corpus. |
| Approach: | They propose a Soft-labeled contrastive pre-training framework with positive sample construction methods to learn functional-level code representation. |
| Outcome: | The proposed framework can obtain fine-grained soft-labels through an iterative adversarial manner and use them to learn better code representation. |