Articles
Total Articles: 38870
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31033
AbstractGenerative models have recently started to outperform extractive models in Open Domain Question Answering, largely by leveraging their decoder to attend over multiple encoded passages and combining their information. However, generative models tend to be larger than extractive models due to the need for a decoder, run slower during inference …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31034
AbstractSemi-parametric models, which augment generation with retrieval, have led to impressive results in language modeling and machine translation, due to their ability to retrieve fine-grained information from a datastore of examples. One of the most prominent approaches, kNN-MT, exhibits strong domain adaptation capabilities by retrieving tokens from domain-specific datastores (Khandelwal …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31036
AbstractExisting methods on knowledge base question generation (KBQG) learn a one-size-fits-all model by training together all subgraphs without distinguishing the diverse semantics of subgraphs. In this work, we show that making use of the past experience on semantically similar subgraphs can reduce the learning difficulty and promote the performance of …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31037
AbstractVideo-grounded Dialogue (VGD) aims to decode an answer sentence to a question regarding a given video and dialogue context. Despite the recent success of multi-modal reasoning to generate answer sentences, existing dialogue systems still suffer from a text hallucination problem, which denotes indiscriminate text-copying from input texts without an understanding …...
The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Models
31038nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31038
AbstractIn this paper, we consider the problem of sparsifying BERT models, which are a key building block for natural language processing, in order to reduce their storage and computational cost. We introduce the Optimal BERT Surgeon (oBERT), an efficient and accurate pruning method based on approximate second-order information, which we …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31039
AbstractMixture-of-Experts (MoE) networks have been proposed as an efficient way to scale up model capacity and implement conditional computing. However, the study of MoE components mostly focused on the feedforward layer in Transformer architecture. This paper proposes the Mixture of Attention Heads (MoA), a new architecture that combines multi-head attention …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31041
AbstractSocratic questioning is an educational method that allows students to discover answers to complex problems by asking them a series of thoughtful questions. Generation of didactically sound questions is challenging, requiring understanding of the reasoning process involved in the problem. We hypothesize that such questioning strategy can not only enhance …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31042
AbstractWith the increase in availability of large pre-trained language models (LMs) in Natural Language Processing (NLP), it becomes critical to assess their fit for a specific target task a priori—as fine-tuning the entire space of available LMs is computationally prohibitive and unsustainable. However, encoder transferability estimation has received little to …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31043
AbstractRelational triple extraction is a critical task for natural language processing. Existing methods mainly focused on capturing semantic information, but suffered from ignoring the syntactic structure of the sentence, which is proved in the relation classification task to contain rich relational information. This is due to the absence of entity …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31044
AbstractDocument-level relation extraction (RE) aims to identify relations between entities across multiple sentences. Most previous methods focused on document-level RE under full supervision. However, in real-world scenario, it is expensive and difficult to completely label all relations in a document because the number of entity pairs in document-level RE grows …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31045
AbstractPractical dialog systems need to deal with various knowledge sources, noisy user expressions, and the shortage of annotated data. To better solve the above problems, we propose CGoDial, a new challenging and comprehensive Chinese benchmark for multi-domain Goal-oriented Dialog evaluation. It contains 96,763 dialog sessions, and 574,949 dialog turns totally, …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31046
AbstractDataset bias has attracted increasing attention recently for its detrimental effect on the generalization ability of fine-tuned models. The current mainstream solution is designing an additional shallow model to pre-identify biased instances. However, such two-stage methods scale up the computational complexity of training process and obstruct valid feature information while …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31047
AbstractVision Transformers (ViTs) have been widely used in large-scale Vision and Language Pre-training (VLP) models. Though previous VLP works have proved the effectiveness of ViTs, they still suffer from computational efficiency brought by the long visual sequence. To tackle this problem, in this paper, we propose an efficient vision-and-language pre-training …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31048
AbstractOpen Information Extraction (OpenIE) aims to extract relational tuples from open-domain sentences. Traditional rule-based or statistical models were developed based on syntactic structure of sentence, identified by syntactic parsers. However, previous neural OpenIE models under-explored the useful syntactic information. In this paper, we model both constituency and dependency trees into …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31049
AbstractCan machines know what twin prime is? From the composition of this phrase, machines may guess twin prime is a certain kind of prime, but it is still difficult to deduce exactly what twin stands for without additional knowledge. Here, twin prime is a jargon - a specialized term used …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31050
AbstractMost existing dialogue systems fail to respond properly to potentially unsafe user utterances by either ignoring or passively agreeing with them. To address this issue, we introduce ProsocialDialog, the first large-scale multi-turn dialogue dataset to teach conversational agents to respond to problematic content following social norms. Covering diverse unethical, problematic, …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31051
AbstractDocument images are a ubiquitous source of data where the text is organized in a complex hierarchical structure ranging from fine granularity (e.g., words), medium granularity (e.g., regions such as paragraphs or figures), to coarse granularity (e.g., the whole page). The spatial hierarchical relationships between content at different levels of …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31052
AbstractDomain adaptation is an effective solution to data scarcity in low-resource scenarios. However, when applied to token-level tasks such as bioNER, domain adaptation methods often suffer from the challenging linguistic characteristics that clinical narratives possess, which leads to unsatsifactory performance. In this paper, we present a simple yet effective hardness-guided …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31053
AbstractIn a citation graph, adjacent paper nodes share related scientific terms and topics. The graph thus conveys unique structure information of document-level relatedness that can be utilized in the paper summarization task, for exploring beyond the intra-document information. In this work, we focus on leveraging citation graphs to improve scientific …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31054
AbstractSince the meaning representations are detailed and accurate annotations which express fine-grained sequence-level semtantics, it is usually hard to train discriminative semantic parsers via Maximum Likelihood Estimation (MLE) in an autoregressive fashion. In this paper, we propose a semantic-aware contrastive learning algorithm, which can learn to distinguish fine-grained meaning representations …...