Nan Duan 0001

dblp:30/8160-1 · DBLP profile ↗
← Back
7ranked-venue papers in the field
0as first author
4since 2021 · last 2024
0000-0002-3387-4674ORCID · verified

Domains — venue-derived; a paper can count in several

Data Mining & Knowledge Discovery · 4Information Retrieval & Web Search · 2Database Systems & Data Management · 1
YearPublicationVenuePosition
2024 LEAD: Liberal Feature-based Distillation for Dense Retrieval
abstract
Knowledge distillation is often used to transfer knowledge from a strong teacher model to a relatively weak student model. Traditional methods include response-based methods and feature-based methods. Response-based methods are widely used but suffer from lower upper limits of performance due to their ignorance of intermediate signals, while feature-based methods have constraints on vocabularies, tokenizers and model architectures. In this paper, we propose a liberal feature-based distillation method (LEAD). LEAD aligns the distribution between the intermediate layers of teacher model and student model, which is effective, extendable, portable and has no requirements on vocabularies, tokenizers, or model architectures. Extensive experiments show the effectiveness of LEAD on widely-used benchmarks, including MS MARCO Passage Ranking, TREC 2019 DL Track, MS MARCO Document Ranking and TREC 2020 DL Track. Our code is available in https://github.com/microsoft/SimXNS/tree/main/LEAD.
Hao Sun 0015, Xiao Liu 0029, Yeyun Gong, Anlei Dong, Jingwen Lu, Yan Zhang 0117, Linjun Yang, Rangan Majumder, Nan Duan 0001
WSDM9
2023 MASTER: Multi-task Pre-trained Bottlenecked Masked Autoencoders Are Better Dense Retrievers
Kun Zhou 0002, Xiao Liu 0029, Yeyun Gong, Wayne Xin Zhao, Daxin Jiang, Nan Duan 0001, Ji-Rong Wen
ECML/PKDD (2)6
2023 PROD: Progressive Distillation for Dense Retrieval
abstract
Knowledge distillation is an effective way to transfer knowledge from a strong teacher to an efficient student model. Ideally, we expect the better the teacher is, the better the student performs. However, this expectation does not always come true. It is common that a strong teacher model results in a bad student via distillation due to the nonnegligible gap between teacher and student. To bridge the gap, we propose PROD, a PROgressive Distillation method, for dense retrieval. PROD consists of a teacher progressive distillation and a data progressive distillation to gradually improve the student. To alleviate catastrophic forgetting, we introduce a regularization term in each distillation process. We conduct extensive experiments on seven datasets including five widely-used publicly available benchmarks: MS MARCO Passage, TREC Passage 19, TREC Document 19, MS MARCO Document, and Natural Questions, as well as two industry datasets: Bing-Rel and Bing-Ads. PROD achieves the state-of-the-art in the distillation methods for dense retrieval. Our 6-layer student model even surpasses most of the existing 12-layer models on all five public benchmarks. The code and models are released in https://github.com/microsoft/SimXNS.
Zhenghao Lin, Yeyun Gong, Xiao Liu 0029, Hang Zhang 0029, Chen Lin 0001, Anlei Dong, Jian Jiao 0007, Jingwen Lu, Daxin Jiang, Rangan Majumder, Nan Duan 0001
WWW11
2021 Tree-Capsule: Tree-Structured Capsule Network for Improving Relation Extraction
Tianchi Yang, Linmei Hu, Luhao Zhang, Chuan Shi 0001, Cheng Yang 0002, Nan Duan 0001, Ming Zhou 0001
PAKDD (3)6
2020 Joint Learning of Question Answering and Question Generation
abstract
Question answering (QA) and question generation (QG) are closely related tasks that could improve each other; however, the connection of these two tasks is not well explored in the literature. In this paper, we present two training algorithms for learning better QA and QG models through leveraging one another. The first algorithm extends Generative Adversarial Network (GAN), which selectively incorporates artificially generated instances as additional QA training data. The second algorithm is an extension of dual learning, which incorporates the probabilistic correlation of QA and QG as additional regularization in training objectives. To test the scalability of our algorithms, we conduct experiments on both document based and table based question answering tasks. Results show that both algorithms improve a QA model in terms of accuracy and QG model in terms of BLEU score. Moreover, we find that the performance of a QG model could be easily improved by a QA model via policy gradient, however, directly applying GAN that regards all the generated questions as negative instances could not improve the accuracy of the QA model. Our algorithm that selectively assigns labels to generated questions would bring a performance boost.
Duyu Tang, Nan Duan 0001, Tao Qin 0001, Shujie Liu 0001, Ming Zhou 0001, Yuanhua Lv, Wenpeng Yin 0001, Bing Qin 0001, Ting Liu 0001
IEEE Trans. Knowl. Data Eng.3
2018 R-VQA: Learning Visual Relation Facts with Semantic Attention for Visual Question Answering
abstract
Recently, Visual Question Answering (VQA) has emerged as one of the most significant tasks in multimodal learning as it requires understanding both visual and textual modalities. Existing methods mainly rely on extracting image and question features to learn their joint feature embedding via multimodal fusion or attention mechanism. Some recent studies utilize external VQA-independent models to detect candidate entities or attributes in images, which serve as semantic knowledge complementary to the VQA task. However, these candidate entities or attributes might be unrelated to the VQA task and have limited semantic capacities. To better utilize semantic knowledge in images, we propose a novel framework to learn visual relation facts for VQA. Specifically, we build up a Relation-VQA (R-VQA) dataset based on the Visual Genome dataset via a semantic similarity module, in which each data consists of an image, a corresponding question, a correct answer and a supporting relation fact. A well-defined relation detector is then adopted to predict visual question-related relation facts. We further propose a multi-step attention model composed of visual attention and semantic attention sequentially to extract related visual knowledge and semantic knowledge. We conduct comprehensive experiments on the two benchmark datasets, demonstrating that our model achieves state-of-the-art performance and verifying the benefit of considering visual relation facts.
Pan Lu, Lei Ji 0001, Wei Zhang 0056, Nan Duan 0001, Ming Zhou 0001, Jianyong Wang 0001
KDD4
2015 Answering Questions with Complex Semantic Constraints on Open Knowledge Bases
abstract
A knowledge-based question-answering system (KB-QA) is one that answers natural language questions with information stored in a large-scale knowledge base (KB). Existing KB-QA systems are either powered by curated KBs in which factual knowledge is encoded in entities and relations with well-structured schemas, or by open KBs, which contain assertions represented in the form of triples (e.g., subject; relation phrase; argument). We show that both approaches fall short in answering questions with complex prepositional or adverbial constraints. We propose using n-tuple assertions, which are assertions with an arbitrary number of arguments, and n-tuple open KB (nOKB), which is an open knowledge base of n-tuple assertions. We present TAQA, a novel KB-QA system that is based on an nOKB and illustrate via experiments how TAQA can effectively answer complex questions with rich semantic constraints. Our work also results in a new open KB containing 120M n-tuple assertions and a collection of 300 labeled complex questions, which is made publicly available for further research.
Nan Duan 0001, Ben Kao, Junwei Bao 0001, Ming Zhou 0001
CIKM2