Papers by Yajuan Lyu
Complex Evolutional Pattern Learning for Temporal Knowledge Graph Reasoning (2022.acl-short)
Copied to clipboard
Zixuan Li, Saiping Guan, Xiaolong Jin, Weihua Peng, Yajuan Lyu, Yong Zhu, Long Bai, Wei Li, Jiafeng Guo, Xueqi Cheng
| Challenge: | Existing models for TKG reasoning focus on modeling fact sequences of a fixed length, which cannot discover complex evolutional patterns that vary in length. |
| Approach: | They propose to use a length-aware Convolutional Neural Network to handle evolutional patterns of different lengths via an easy-to-difficult curriculum learning strategy. |
| Outcome: | The proposed model improves performance under both offline and online learning strategies. |
Learn and Review: Enhancing Continual Named Entity Recognition via Reviewing Synthetic Samples (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for named entity recognition classify mentions into fixed set of predefined entity types but in many real-world scenarios, new entity types are incrementally involved. |
| Approach: | They propose a two-stage framework Learn-and-Review for continual named entity recognition to alleviate inter-type confusion. |
| Outcome: | The proposed framework outperforms the state-of-the-art method on CoNLL-03 and OntoNotes-5.0. |
WeCheck: Strong Factual Consistency Checker via Weakly Supervised Learning (2023.acl-long)
Copied to clipboard
| Challenge: | Existing factual consistency metrics are often uncontrollably generating text that is factually inconsistent with inputs. |
| Approach: | They propose a weakly supervised framework that is directly trained on actual generated samples from language models with weakly annotated labels. |
| Outcome: | The proposed framework improves on the TRUE benchmark by 3.3% over existing methods with 435M parameters. |
Hierarchical Representation-based Dynamic Reasoning Network for Biomedical Question Answering (2022.coling-1)
Copied to clipboard
Jianguo Mao, Jiyuan Zhang, Zengfeng Zeng, Weihua Peng, Wenbin Jiang, Xiangdong Wang, Hong Liu, Yajuan Lyu
| Challenge: | Existing models of biomedical question answering are limited in their ability to predict answers . a new model improves the performance of existing models, but the code will be released after the paper is published. |
| Approach: | They propose a hierarchical representation-based dynamic reasoning network to solve biomedical problems. |
| Outcome: | The proposed model significantly improves on three mainstream biomedical datasets . the code will be released after the paper is published . |
HiSMatch: Historical Structure Matching based Temporal Knowledge Graph Reasoning (2022.findings-emnlp)
Copied to clipboard
Zixuan Li, Zhongni Hou, Saiping Guan, Xiaolong Jin, Weihua Peng, Long Bai, Yajuan Lyu, Wei Li, Jiafeng Guo, Xueqi Cheng
| Challenge: | Temporal Knowledge Graphs (TKGs) store facts as triples in the form of subject, relation, object, timestamps. |
| Approach: | They propose a Temporal Knowledge Graph (TKG) model that extends each triple with a timestamp to describe dynamic facts. |
| Outcome: | The proposed model improves on six benchmark datasets with up to 5.6% performance improvement compared to the state-of-the-art models. |
S2ynRE: Two-stage Self-training with Synthetic data for Low-resource Relation Extraction (2023.acl-long)
Copied to clipboard
| Challenge: | Existing methods for relation extraction suffer from the inadequacy of large-scale annotated data. |
| Approach: | They propose a framework for two-stage self-training with synthetic data for relation extraction . |
| Outcome: | The proposed framework is based on two-stage self-training with synthetic data . it is able to synthesize large quantities of training data and iteratively and alternately learn from synthetic and golden data together. |
Event Extraction as Multi-turn Question Answering (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Current approaches to event extraction fail to model rich interactions among event types and arguments of different roles. |
| Approach: | They propose a new paradigm that formulates event extraction as multi-turn question answering . they propose to use reading comprehension problems to extract triggers and arguments . |
| Outcome: | The proposed approach outperforms current state-of-the-art on argument extraction tasks . it makes full use of dependency among arguments and event types, and generalizes well . |
Precisely the Point: Adversarial Augmentations for Faithful and Informative Text Generation (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing models for text generation are weak enough to handle perturbations in inputs, leading to degeneration in faithfulness and informativeness. |
| Approach: | They propose a framework for improving faithfulness and informativeness of Seq2Seq models by perturbing word representations and word swapping. |
| Outcome: | The proposed framework improves faithfulness and informativeness of Seq2Seq models under automatic and human evaluation settings. |
Improving Neural Abstractive Document Summarization with Explicit Information Selection Modeling (D18-1)
Copied to clipboard
| Challenge: | Existing neural abstractive methods for document summarization are not effective for document summary. |
| Approach: | They propose to extend basic neural encoding-decoding framework with an information selection layer to explicitly model and optimize the information selection process in abstractive document summarization. |
| Outcome: | The proposed model outperforms state-of-the-art methods on document summarization tasks significantly. |
Answer-focused and Position-aware Neural Question Generation (D18-1)
Copied to clipboard
| Challenge: | Recent neural network-based approaches generate interrogative words that do not match the answer type. |
| Approach: | They propose an answer-focused and position-aware neural question generation model to address these issues. |
| Outcome: | The proposed model outperforms the baseline and outperformed the state-of-the-art system. |
EmRel: Joint Representation of Entities and Embedded Relations for Multi-triple Extraction (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing studies only explore entity representations, but propose a novel triple perspective for relation extraction. |
| Approach: | They propose to explicitly introduce relation representation and jointly represent it with entities to identify valid triples. |
| Outcome: | The proposed method is based on ablations and document-level relation extraction and joint entity and relation extraction. |
Chain-of-Thought Reasoning in Tabular Language Models (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches to extend chain-of-thought reasoning into large language models are not viable in the scenario of privatization deployment or limited resources. |
| Approach: | They propose a framework that extends chain-of-thought reasoning into tabular language models . framework coordinates two TaLMs responsible for CoT generation and answer inference . |
| Outcome: | The proposed framework outperforms the state-of-the-art ChatGPT on the TABMWP dataset by 9.55% (82.60%92.15% in accuracy) with less parameters (0.8B). |
Dynamic Multistep Reasoning based on Video Scene Graph for Video Question Answering (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing video QA models lack the capacity for deep video understanding and flexible multistep reasoning. |
| Approach: | They propose a video question answering model which performs dynamic multistep reasoning between questions and videos. |
| Outcome: | The proposed model improves on three widely used video QA datasets and displays better interpretability by backtracing along with the attention mechanisms to the video scene graphs. |
Joint Training of Candidate Extraction and Answer Selection for Reading Comprehension (P18-1)
Copied to clipboard
| Challenge: | Various advanced neural models have been proposed for reading comprehension, but most models ignore its relations with other answer candidates. |
| Approach: | They propose to model reading comprehension as an extract-then-select two-stage procedure . they first extract answer candidates from passages, then select the final answer by combining information from all candidates. |
| Outcome: | The proposed approach improves state-of-the-art performance on open-domain reading comprehension datasets. |
IM-TQA: A Chinese Table Question Answering Dataset with Implicit and Multi-type Table Structures (2023.acl-long)
Copied to clipboard
| Challenge: | Existing benchmarks only evaluate model performance on tables with explicit table structures, which means headers are explicitly annotated and treated as model input during inference. |
| Approach: | They propose a new Table Question Answering (TQA) dataset with implicit and multi-type table structures that requires the model to understand tables without directly available header annotations. |
| Outcome: | The proposed framework outperforms baselines on a dataset with implicit and multi-type table structures and can handle multi-table tables including previously neglected complex tables. |
Multi-Passage Machine Reading Comprehension with Cross-Passage Answer Verification (P18-1)
Copied to clipboard
| Challenge: | Recent years have seen rapid growth in the MRC community . MRC is believed to be a crucial step in building a general intelligent agent . |
| Approach: | They propose an end-to-end neural model that enables multiple passages to verify each other based on their content representations. |
| Outcome: | The proposed model outperforms the baseline on the English MS-MARCO dataset and the Chinese DuReader dataset, and achieves state-of-the-art performance on both datasets. |
Link Prediction on N-ary Relational Facts: A Graph-based Approach (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing work on knowledge graphs (KGs) focused on binary relations, but higher-arity relations are ubiquitous in real-world KGs. |
| Approach: | They propose a graph-based approach to link prediction on knowledge graphs using n-ary relational facts and edge-biased fully-connected attention. |
| Outcome: | The proposed approach performs substantially better than current state-of-the-art across a variety of n-ary relational benchmarks. |
Machine Reading Comprehension Using Structural Knowledge Graph-aware Network (D19-1)
Copied to clipboard
| Challenge: | Recent large-scale datasets specify that external knowledge is required to answer questions. |
| Approach: | They propose a model that leverages external knowledge to construct sub-graphs for entities in machine comprehension context. |
| Outcome: | The proposed model achieves state-of-the-art performance on the ReCoRD dataset. |
Improving Neural Abstractive Document Summarization with Structural Regularization (D18-1)
Copied to clipboard
| Challenge: | Recent advances in document summarization fail to capture long-term structure of documents and multi-sentence summaries, resulting in information loss and repetitions. |
| Approach: | They propose to leverage structural information of documents and multi-sentence summaries to improve document summarization performance. |
| Outcome: | The proposed model outperforms state-of-the-art models on document summarization tasks. |
Multi-view Classification Model for Knowledge Graph Completion (2020.aacl-main)
Copied to clipboard
| Challenge: | Existing knowledge graph completion models only evaluated candidate triples from content information. |
| Approach: | They propose a multi-view classification model where multiple views are performed based on both content and context information for candidate triple evaluation. |
| Outcome: | The proposed model improves on two representative datasets and improves performance. |
Explainable Question Answering based on Semantic Graph by Global Differentiable Learning and Dynamic Adaptive Reasoning (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing models for multi-hop Question Answering have improved the implicit reasoning ability, but the black box nature of pure neural networks has hindered the construction of explainable intelligent systems. |
| Approach: | They propose a global differentiation strategy to explore optimal reasoning paths from latent probability space and a Dynamic Adaptive Reasoner to enhance generalization of unseen questions. |
| Outcome: | The proposed method achieves 17% improvements in F1-score against BreakRC and shows better interpretability. |
A Transition-based Method for Complex Question Understanding (2022.coling-1)
Copied to clipboard
| Challenge: | Existing work on complex question understanding does not model intermediate states and does not provide step-wise information. |
| Approach: | They propose a transition-based method where a decider predicts a sequence of actions to build the graph node-by-node. |
| Outcome: | The proposed method parses complex questions to QDMR using atomic operators . it has transparent and human-readable intermediate results, showing improved interpretability . |
Knowledge-Enhanced Named Entity Disambiguation for Short Text (2020.aacl-main)
Copied to clipboard
| Challenge: | Existing methods for named entity disambiguation are weak for short text . performance of existing methods drops dramatically for short texts . |
| Approach: | They propose a knowledge-enhanced method for named entity disambiguation . they use factual knowledge graph and conceptual knowledge graph to provide additional knowledge . |
| Outcome: | The proposed method achieves significant improvement on a large manually annotated short-text dataset and the state-of-the-art on three standard datasets. |
Enhancing Pre-Trained Language Representations with Rich Knowledge for Machine Reading Comprehension (P19-1)
Copied to clipboard
| Challenge: | Recent results show pre-trained language models (LMs) can improve machine reading comprehension (MRC) Experimental results indicate that KT-NET offers significant and consistent improvements over BERT . |
| Approach: | They propose a method that leverages external knowledge bases to improve machine reading comprehension (MRC) KT-NET employs an attention mechanism to select desired knowledge from KBs and fuses selected knowledge with BERT to enable context- and knowledge-aware predictions. |
| Outcome: | The proposed model outperforms baseline models on ReCoRD and SQuAD1.1 benchmarks and ranks 1st on the ReCoDR and SQUAD1.1 leaderboards. |