Adaptive Convolution for Multi-Relational Learning (N19-1)

Copied to clipboard

Challenge: Existing convolutional neural networks fail to model full interactions between entities and relations, which limits the performance of link prediction.
Approach: They propose a convolutional network that maximizes entity-relation interactions in a convergent fashion.
Outcome: The proposed convolutional network performs better than baseline models on multiple datasets.

Similar Papers

Adaptive Convolution for Text Classification (N19-1)

Copied to clipboard

Challenge: Existing convolutional neural networks (CNNs) use sparse representations of text, such as bag-of-words.
Approach: They propose an adaptive convolution for text classification to give flexibility to convolutional neural networks (CNNs) they attach filter-generating networks to convevolution blocks in existing CNNs .
Outcome: The proposed convolution improves performance in seven benchmark datasets by 2.6 percentage points . the proposed conversions can be likened to players of the twenty questions .
Jointly Learning Entity and Relation Representations for Entity Alignment (D19-1)

Copied to clipboard

Challenge: Entity alignment is a viable method for integrating heterogeneous knowledge among different knowledge graphs (KGs).
Approach: They propose a Graph Convolutional Network-based framework for learning relation representations by embedding relation seeds into entities and incorporating relation approximation into entities to iteratively improve alignment.
Outcome: The proposed approach outperforms state-of-the-art methods on three real-world cross-lingual datasets.
Joint Type Inference on Entities and Relations via Graph Convolutional Networks (P19-1)

Copied to clipboard

Challenge: a novel graph convolutional network (GCN) is proposed for the task of joint entity relation extraction.
Approach: They propose a graph convolutional network running on an entity-relation bipartite graph . they propose combining two different methods to perform joint entity relation extraction .
Outcome: The proposed model outperforms existing joint models in entity performance and is competitive with the state-of-the-art in relation performance.
Recurrent Interaction Network for Jointly Extracting Entities and Classifying Relations (2020.emnlp-main)

Copied to clipboard

Challenge: Existing methods to solve the extraction problem learn interactions between the two tasks through a shared network .
Approach: They propose to use multi-task learning to address the joint extraction of entity and relation . they exploit correlation between ER and relation classification tasks to improve performance .
Outcome: Empirical results show that the proposed model improves on two real-world datasets.
Graph Convolution over Pruned Dependency Trees Improves Relation Extraction (D18-1)

Copied to clipboard

Challenge: Existing dependency-based models neglect crucial information (e.g., negation) by pruning the dependency trees too aggressively.
Approach: They propose an extension of graph convolutional networks that is tailored for relation extraction by pruning dependency trees too aggressively.
Outcome: The proposed model outperforms existing sequence and dependency-based models on the large-scale TACRED dataset and has complementary strengths to sequence models.
A Frustratingly Easy Approach for Entity and Relation Extraction (2021.naacl-main)

Copied to clipboard

Challenge: Existing work on end-to-end relation extraction models combine two tasks: named entity recognition and relation extraction.
Approach: They propose a pipelined approach for entity and relation extraction that uses two independent encoders to construct the relation model.
Outcome: The proposed approach achieves an 8.16 speedup with a slight reduction in accuracy on standard benchmarks.
Using active learning to expand training data for implicit discourse relation recognition (D18-1)

Copied to clipboard

Challenge: Existing methods to determine semantic relations between text spans are limited in the field of discourse-level relation recognition.
Approach: They propose to expand the training data set using the corpus of explicitly-related arguments by arbitrarily dropping the overtly presented discourse connectives.
Outcome: The proposed model expands the training data set using the corpus of explicitly-related arguments, by arbitrarily dropping the overtly presented discourse connectives.
Structured Minimally Supervised Learning for Neural Relation Extraction (N19-1)

Copied to clipboard

Challenge: Recent work shows that distant supervision can cause significant label noise when learning from large quantities of unlabeled text.
Approach: They propose a method that combines the benefits of learning representations and structured learning to predict sentence-level relation mentions given only proposition-level supervision from a KB.
Outcome: The proposed approach outperforms a number of baseline approaches while minimizing label noise.
Entity or Relation Embeddings? An Analysis of Encoding Strategies for Relation Extraction (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing approaches to relation extraction use concatenating embeddings of head and tail entities . however, such representations capture the types of the entities involved, leading to false positives and confusion between relations involving entities of the same type.
Approach: They propose a model which combines [MASK] embeddings with entity embedds to learn relation embeddations.
Outcome: The proposed model outperforms the state-of-the-art on several benchmarks . it uses a self-supervised pre-training strategy which further improves the results.
Transfer Learning for Entity Recognition of Novel Classes (C18-1)

Copied to clipboard

Challenge: Existing approaches to entity recognition are based on class labels in source and target domains, and many NER corpora only annotate a small number of categories.
Approach: They replicate and extend several past studies on transfer learning for entity recognition.
Outcome: The proposed methods perform better when there is more labeled target data.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations