Yue Zhang 0086

dblp:47/722-86 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
4since 2021 · last 2023
0000-0001-7185-4933ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 4 · 3 first-author · 4 since 2021
YearPublicationVenuePosition
2023 Power Norm Based Lifelong Learning for Paraphrase Generations
abstract
Lifelong seq2seq language generation models are trained with multiple domains in a lifelong learning manner, with data from each domain being observed in an online fashion. It is a well-known problem that lifelong learning suffers from the catastrophic forgetting (CF). To handle this challenge, existing works have leveraged experience replay or dynamic architecture to consolidate the past knowledge, which however result in incremental memory space or high computational cost. In this work, we propose a novel framework name "power norm based lifelong learning" (PNLLL), which aims to remedy the catastrophic forgetting issues with a power normalization on NLP transformer models. Specifically, PNLLL leverages power norm to achieve a better balance between past experience rehearsal and new knowledge acquisition. These designs enable the knowledge adaptation onto new tasks while memorizing the experience of past tasks. Our experiments on paraphrase generation tasks show that PNLLL not only outperforms SOTA models by a considerable margin and but also largely alleviates forgetting.
Dingcheng Li, Peng Yang 0013, Yue Zhang 0086, Ping Li 0001
SIGIR3
2022 Explainable Concept Graph Completion by Bridging Open-Domain Relations and Concepts
abstract
Entity relations and concepts are the most critical information in knowledge-based systems. In traditional closed-domain knowledge bases (KBs), the entity relations and concepts are tightly bound together in the human-designed schema. The relations of entities (relations in the KB) are correlated with its concepts (entity types in the KB). However, the relations and concepts described by the closed-domain KBs are limited. When we extend the investigation to the open domain, we find that the relations of entities (from Open Information Extraction data sets) and the concepts of entities (from large-scale concept graphs) reside in the different data sources, and there is no connection between them. In this paper, we proposed a matching network-based concept graph completion model, which leverages open-domain relations to represent the query entity to predict the entity's concept, where relations are extracted from the open-domain corpus (e.g., Wikipedia). By comparing with other neural baselines, which leverage the whole sentences, we show that our model gets superior performance. Furthermore, we use the open-domain relations as the explanation basis and build an explanation model to answer the question “why an entity belongs to a concept”. The model gives clear and informative explanations with high relevance to human understanding.
Yue Zhang 0086, Mingming Sun 0001, Ping Li 0001
SDM1
2022 End-to-end Distantly Supervised Information Extraction with Retrieval Augmentation
abstract
Distant supervision (DS) has been a prevalent approach to generating labeled data for information extraction (IE) tasks. However, DS often suffers from noisy label problems, where the labels are extracted from the knowledge base (KB), regardless of the input context. Many efforts have been devoted to designing denoising mechanisms. However, most strategies are only designed for one specific task and cannot be directly adapted to other tasks. We propose a general paradigm (Dasiera) to resolve issues in KB-based DS. Labels from KB can be viewed as universal labels of a target entity or an entity pair. While the given context for an IE task may only contain partial/zero information about the target entities, or the entailed information may be vague. Hence the mismatch between the given context and KB labels, i.e., the given context has insufficient information to infer DS labels, can happen in IE training datasets. To solve the problem, during training, Dasiera leverages a retrieval-augmentation mechanism to complete missing information of the given context, where we seamlessly integrate a neural retriever and a general predictor in an end-to-end framework. During inference, we can keep/remove the retrieval component based on whether we want to predict solely on the given context. We have evaluated Dasiera on two IE tasks under the DS setting: named entity typing and relation extraction. Experimental results show Dasiera's superiority to other baselines in both tasks.
Yue Zhang 0086, Hongliang Fei, Ping Li 0001
SIGIR1
2021 ReadsRE: Retrieval-Augmented Distantly Supervised Relation Extraction
abstract
Distant supervision (DS) has been widely used to automatically construct (noisy) labeled data for relation extraction (RE). To address the noisy label problem, most models have adopted the multi-instance learning paradigm by representing entity pairs as a bag of sentences. However, this strategy depends on multiple assumptions (e.g., all sentences in a bag share the same relation), which may be invalid in real-world applications. Besides, it cannot work well on long-tail entity pairs which have few supporting sentences in the dataset. In this work, we propose a new paradigm named retrieval-augmented distantly supervised relation extraction (ReadsRE), which can incorporate large-scale open-domain knowledge (e.g., Wikipedia) into the retrieval step. ReadsRE seamlessly integrates a neural retriever and a relation predictor in an end-to-end framework. We demonstrate the effectiveness of ReadsRE on the well-known NYT10 dataset. The experimental results verify that ReadsRE can effectively retrieve meaningful sentences (i.e., denoise), and relieve the problem of long-tail entity pairs in the original dataset through incorporating external open-domain corpus. Through comparisons, we show ReadsRE outperforms other baselines for this task.
Yue Zhang 0086, Hongliang Fei, Ping Li 0001
SIGIR1