Imposing Label-Relational Inductive Bias for Extremely Fine-Grained Entity Typing (N19-1)
Copied to clipboard
| Challenge: | Existing entity typing systems exploit type hierarchy provided by KB schema to model label correlations. |
| Approach: | They propose a graph layer that encodes global label co-occurrence statistics and word-level similarities. |
| Outcome: | The proposed model achieves a 15.3% relative F1 improvement on a large dataset with over 10,000 free-form types. |
Similar Papers
Fine-grained Entity Typing via Label Reasoning (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to fine-grained entity typing are based on independent classification paradigms, which make them difficult to recognize inter-dependent, long-tailed and fine-granular entities. |
| Approach: | They propose a label reasoning network that exploits label dependencies knowledge entailed in the data. |
| Outcome: | The proposed network can model, learn and reason complex labels in a sequence-to-set, end-to end manner. |
Improving Distantly-supervised Entity Typing with Compact Latent Space Clustering (N19-1)
Copied to clipboard
| Challenge: | Existing studies have addressed this problem with partial-label loss, but they suffer from confirmation bias, which means the classifier fit a pseudo data distribution given by itself. |
| Approach: | They propose to regularize distantly supervised models with Compact Latent Space Clustering to bypass this problem and effectively utilize noisy data yet. |
| Outcome: | The proposed model outperforms state-of-the-art models on standard benchmarks on fine-grained entity typing (FET) by a significant margin. |
Neural Fine-Grained Entity Type Classification with Hierarchy-Aware Loss (N18-1)
Copied to clipboard
| Challenge: | Existing methods for fine-grained type classification rely on distant supervision and are susceptible to noisy labels that can be out-of-context or overly-specific. |
| Approach: | They propose a neural network model that uses cross-entropy loss function to handle out-of-context labels and hierarchical loss normalization to cope with overly-specific ones. |
| Outcome: | The proposed model outperforms the state-of-the-art on established benchmarks for the task. |
Fine-Grained Entity Typing via Hierarchical Multi Graph Convolutional Networks (D19-1)
Copied to clipboard
| Challenge: | Existing methods for inferring the fine-grained type of an entity from knowledge base are incomplete and lack type information. |
| Approach: | They propose a novel Deep Learning architecture to infer the fine-grained type of an entity from a knowledge base. |
| Outcome: | The proposed method significantly outperforms four state-of-the-art methods on two large-scale datasets. |
GLiM: Integrating Graph Transformer and LLM for Document-Level Biomedical Relation Extraction with Incomplete Labeling (2025.findings-acl)
Copied to clipboard
Hao Fang, Yuejie Zhang, Rui Feng, Yingwen Wang, Qing Wang, Wen He, Xiaobo Zhang, Tao Zhang, Shang Gao
| Challenge: | Document-level relation extraction (DocRE) solves problems of document quality . number of entities and entity-pair relations increases, causing incomplete annotations . |
| Approach: | a framework that reduces the problem space using a graph-enhanced Transformer-based model is proposed . GLiM leverages large language models for reasoning to reduce the problem-space . |
| Outcome: | GLiM boosts average recall and F1 scores on biomedical datasets . compared with existing models, GLim outperforms existing models on biomedicine benchmarks compared to existing models . |
Multi-view Contrastive Learning for Entity Typing over Knowledge Graphs (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to knowledge graph entity typing ignore the way types can be clustered together. |
| Approach: | They propose a method that effectively encodes coarse-grained knowledge from clusters into entity and type embeddings. |
| Outcome: | The proposed method encodes coarse-grained knowledge from clusters into entity and type embeddings. |
Divide and Denoise: Learning from Noisy Labels in Fine-Grained Entity Typing with Cluster-Wise Loss Correction (2022.acl-long)
Copied to clipboard
| Challenge: | Existing FET noise learning methods rely on prediction distributions in instance-independent manner, which causes confirmation bias. |
| Approach: | They propose a clustering-based loss correction framework to address confirmation bias in FET . they first train a coarse backbone model as a feature extractor and noise estimator . |
| Outcome: | The proposed framework achieves the best performance over existing systems on three public datasets and is stable to hyperparameters. |
Context-aware Entity Typing in Knowledge Graphs (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for knowledge graph entity typing are embedding-based and graph convolutional networks (GCNs) . Existing approaches for knowledge Graph Entity Typing (KGET) are incomplete and require multiple inference mechanisms. |
| Approach: | They propose a method that uses entities’ contextual information to infer missing types in knowledge graphs by using two inference mechanisms: N2T and Agg2T. |
| Outcome: | The proposed method can infer entities' missing types by completing two real-world KGs. |
Learning from Sibling Mentions with Scalable Graph Inference in Fine-Grained Entity Typing (2022.acl-long)
Copied to clipboard
| Challenge: | Existing models struggle to handle hard mentions due to insufficient contexts, limiting their overall typing performance. |
| Approach: | They propose to exploit sibling mentions to enhance the mention representations by adding unseen test mentions as new nodes for inference. |
| Outcome: | The proposed model outperforms ten strong baseline models and outperformed strong baselines. |
Recall, Expand, and Multi-Candidate Cross-Encode: Fast and Accurate Ultra-Fine Entity Typing (2023.acl-long)
Copied to clipboard
| Challenge: | State-of-the-art (SOTA) methods use the cross-encoder architecture to concatenate a mention (and its context) with each type and feed it into a pretrained language model (PLM) to score their relevance. |
| Approach: | They propose to perform entity typing in a recall-expand-filter manner and use a novel model to encode and score all these K candidates in one forward pass. |
| Outcome: | The proposed method is thousands of times faster than the CE-based architecture and is very efficient in fine-grained (130 types) and coarse-grain (9 types) entity typing. |