A Partition Filter Network for Joint Entity and Relation Extraction

• URL: http://arxiv.org/abs/2108.12202v2
• Date: Mon, 30 Aug 2021 15:18:12 GMT
• Title: A Partition Filter Network for Joint Entity and Relation Extraction
• Authors: Zhiheng Yan, Chong Zhang, Jinlan Fu, Qi Zhang, Zhongyu Wei
• Abstract summary: We propose a partition filter network to model two-way interaction between tasks properly. In our encoder, we leverage two gates: entity and relation gate, to segment neurons into two task partitions and one shared partition. Experiment results on five public datasets show that our model performs significantly better than previous approaches.
• Score: 24.177745696948744
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In joint entity and relation extraction, existing work either sequentially encode task-specific features, leading to an imbalance in inter-task feature interaction where features extracted later have no direct contact with those that come first. Or they encode entity features and relation features in a parallel manner, meaning that feature representation learning for each task is largely independent of each other except for input sharing. We propose a partition filter network to model two-way interaction between tasks properly, where feature encoding is decomposed into two steps: partition and filter. In our encoder, we leverage two gates: entity and relation gate, to segment neurons into two task partitions and one shared partition. The shared partition represents inter-task information valuable to both tasks and is evenly shared across two tasks to ensure proper two-way interaction. The task partitions represent intra-task information and are formed through concerted efforts of both gates, making sure that encoding of task-specific features are dependent upon each other. Experiment results on five public datasets show that our model performs significantly better than previous approaches. The source code can be found in https://github.com/Coopercoppers/PFN.

Related papers

• RepVF: A Unified Vector Fields Representation for Multi-task 3D Perception [64.80760846124858]
  This paper proposes a novel unified representation, RepVF, which harmonizes the representation of various perception tasks. RepVF characterizes the structure of different targets in the scene through a vector field, enabling a single-head, multi-task learning model. Building upon RepVF, we introduce RFTR, a network designed to exploit the inherent connections between different tasks.
  arXiv  Detail & Related papers  (2024-07-15T16:25:07Z)
• A Decoupling and Aggregating Framework for Joint Extraction of Entities and Relations [7.911978021993282]
  We propose a novel model to jointly extract entities and relations. We propose to decouple the feature encoding process into three parts, namely encoding subjects, encoding objects, and encoding relations. Our model outperforms several previous state-of-the-art models.
  arXiv  Detail & Related papers  (2024-05-14T04:27:16Z)
• CARE: Co-Attention Network for Joint Entity and Relation Extraction [0.0]
  We propose a Co-Attention network for joint entity and relation extraction. Our approach includes adopting a parallel encoding strategy to learn separate representations for each subtask. At the core of our approach is the co-attention module that captures two-way interaction between the two subtasks.
  arXiv  Detail & Related papers  (2023-08-24T03:40:54Z)
• A Dynamic Feature Interaction Framework for Multi-task Visual Perception [100.98434079696268]
  We devise an efficient unified framework to solve multiple common perception tasks. These tasks include instance segmentation, semantic segmentation, monocular 3D detection, and depth estimation. Our proposed framework, termed D2BNet, demonstrates a unique approach to parameter-efficient predictions for multi-task perception.
  arXiv  Detail & Related papers  (2023-06-08T09:24:46Z)
• Multi-task Bias-Variance Trade-off Through Functional Constraints [102.64082402388192]
  Multi-task learning aims to acquire a set of functions that perform well for diverse tasks. In this paper we draw intuition from the two extreme learning scenarios -- a single function for all tasks, and a task-specific function that ignores the other tasks. We introduce a constrained learning formulation that enforces domain specific solutions to a central function.
  arXiv  Detail & Related papers  (2022-10-27T16:06:47Z)
• A Hierarchical Interactive Network for Joint Span-based Aspect-Sentiment Analysis [34.1489054082536]
  We propose a hierarchical interactive network (HI-ASA) to model two-way interactions between two tasks appropriately. We use cross-stitch mechanism to combine the different task-specific features selectively as the input to ensure proper two-way interactions. Experiments on three real-world datasets demonstrate HI-ASA's superiority over baselines.
  arXiv  Detail & Related papers  (2022-08-24T03:03:49Z)
• Multi-Task Learning with Multi-Query Transformer for Dense Prediction [38.476408482050815]
  We propose a simple pipeline named Multi-Query Transformer (MQTransformer) to facilitate the reasoning among multiple tasks. Instead of modeling the dense per-pixel context among different tasks, we seek a task-specific proxy to perform cross-task reasoning. Experiment results show that the proposed method is an effective approach and achieves state-of-the-art results.
  arXiv  Detail & Related papers  (2022-05-28T06:51:10Z)
• A Co-Interactive Transformer for Joint Slot Filling and Intent Detection [61.109486326954205]
  Intent detection and slot filling are two main tasks for building a spoken language understanding (SLU) system. Previous studies either model the two tasks separately or only consider the single information flow from intent to slot. We propose a Co-Interactive Transformer to consider the cross-impact between the two tasks simultaneously.
  arXiv  Detail & Related papers  (2020-10-08T10:16:52Z)
• Learning to Match Jobs with Resumes from Sparse Interaction Data using Multi-View Co-Teaching Network [83.64416937454801]
  Job-resume interaction data is sparse and noisy, which affects the performance of job-resume match algorithms. We propose a novel multi-view co-teaching network from sparse interaction data for job-resume matching. Our model is able to outperform state-of-the-art methods for job-resume matching.
  arXiv  Detail & Related papers  (2020-09-25T03:09:54Z)
• DCR-Net: A Deep Co-Interactive Relation Network for Joint Dialog Act Recognition and Sentiment Classification [77.59549450705384]
  In dialog system, dialog act recognition and sentiment classification are two correlative tasks. Most of the existing systems either treat them as separate tasks or just jointly model the two tasks. We propose a Deep Co-Interactive Relation Network (DCR-Net) to explicitly consider the cross-impact and model the interaction between the two tasks.
  arXiv  Detail & Related papers  (2020-08-16T14:13:32Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.