| Challenge: | Existing work on structured gradient tree boosting for collective entity disambiguation is limited to regular classification or regression problems. |
| Approach: | They propose a structured learning model that uses gradient tree boosting to disambiguate named entities in a document. |
| Outcome: | The proposed model outperforms the previous state-of-the-art neural system by near 1% absolute accuracy on the popular AIDA-CoNLL dataset. |
Similar Papers
Towards Consistent Document-level Entity Linking: Joint Models for Entity Linking and Coreference Resolution (2022.acl-short)
Copied to clipboard
| Challenge: | Existing approaches to solve entity linking (EL) jointly with coreference resolution (coref) a coreferenced cluster can only be linked to a single entity or NIL (i.e., a nonlinkable entity) |
| Approach: | They propose to join entity linking and coreference resolution in a single structured prediction task over directed trees and use a globally normalized model to solve it. |
| Outcome: | The proposed model improves on two datasets with a +5% boost in accuracy compared to standalone models . the proposed model is based on current models that predict a single antecedent for each span to resolve . |
Contextual Augmentation for Entity Linking using Large Language Models (2025.coling-main)
Copied to clipboard
| Challenge: | Entity Linking involves detecting and linking entity mentions in natural language texts to a knowledge graph. |
| Approach: | They propose a fine-tuned model that integrates entity recognition and disambiguation in a unified framework. |
| Outcome: | The proposed model achieves state-of-the-art on out-of domain datasets and compares with baselines. |
Exploiting Structure in Representation of Named Entities using Active Learning (C18-1)
Copied to clipboard
| Challenge: | Named entities are atomic objects of reference and reasoning in many knowledge-centric applications. |
| Approach: | They propose an active-learning based framework that drastically reduces the labeled data required to learn entities' structures. |
| Outcome: | The proposed framework outperforms handwritten programs and supervised learning models in relation extraction and entity resolution tasks. |
Unsupervised Named Entity Disambiguation for Low Resource Domains (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to Named Entity Disambiguation (NED) are inefficient for domain specific tasks such as searching, question answering and information extraction. |
| Approach: | They propose a unsupervised approach leveraging the concept of Group Steiner Trees which can identify the most relevant candidate for entity disambiguation using contextual similarities across candidate entities for all the mentions present in a document. |
| Outcome: | The proposed approach outperforms the state-of-the-art methods by more than 40% in terms of Precision@1 and Hit@5 across various domain-specific datasets. |
Learning Dynamic Context Augmentation for Global Entity Linking (D19-1)
Copied to clipboard
Xiyuan Yang, Xiaotao Gu, Sheng Lin, Siliang Tang, Yueting Zhuang, Fei Wu, Zhigang Chen, Guoping Hu, Xiang Ren
| Challenge: | Existing collective entity linking methods are expensive and often lack local context information. |
| Approach: | They propose a dynamic context-augmented inference model that can be used to make collective inference. |
| Outcome: | The proposed model can cope with different local EL models with different learning settings, base models, decision orders and attention mechanisms. |
Sentence-Level Resampling for Named Entity Recognition (2022.naacl-main)
Copied to clipboard
| Challenge: | named entity recognition (NER) tasks are often dominated by the majority of non-entity tokens in text . a data imbalance problem is causing the NER models to ignore named entities . |
| Approach: | They propose a set of sentence-level resampling methods to reduce data imbalance . they use a training sentence to compute the importance of each training sentence based on its tokens and entities . |
| Outcome: | The proposed methods outperform sub-sentence-level resampling, data augmentation, and loss functions on multiple corpora. |
Joint Neural Entity Disambiguation with Output Space Search (C18-1)
Copied to clipboard
| Challenge: | Existing models for entity disambiguation combine local contextual information and global evidences. |
| Approach: | They propose a limited discrepancy search model that combines local contextual information and global evidences to improve a local solution from a global view point. |
| Outcome: | The proposed model improves local and global solutions on CoNLL 2003 and TAC 2010 benchmarks. |
Entity Disambiguation on a Tight Labeling Budget (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches to training entity disambiguation models require a small labeling budget . a defense research analyst might need to map military equipment to a knowledge base describing emergent defense technologies. |
| Approach: | They propose a method that combines feature diversity with low rank correction . they use bilinear tensor models to train a model that uses a rich representation of context . |
| Outcome: | The proposed approach reduces the amount of labeled data necessary to achieve a given performance. |
TAG: Gradient Attack on Transformer-based Language Models (2021.findings-emnlp)
Copied to clipboard
Jieren Deng, Yijue Wang, Ji Li, Chenghong Wang, Chao Shang, Hang Liu, Sanguthevar Rajasekaran, Caiwen Ding
| Challenge: | Recent studies show that publicly shared gradients in the training process can reveal the private training data to a third-party. |
| Approach: | They propose a gradient attack algorithm to reconstruct the local training data using GLUE benchmarks. |
| Outcome: | The proposed algorithm achieves 1.5x recover rate and 2.5x ROUGE-2 over previous methods without the need of ground truth label. |
Beyond Similarity: A Gradient-based Graph Method for Instruction Tuning Data Selection (2025.acl-long)
Copied to clipboard
Yang Zhao, Li Du, Xiao Ding, Yangou Ouyang, Hepeng Wang, Kai Xiong, Jinglong Gao, Zhouhao Sun, Dongliang Xu, Qing Yang, Dongchen Li, Bing Qin, Ting Liu
| Challenge: | Existing methods for selecting training data from general datasets fail to account for the joint distribution of instructions, resulting in inefficient learning and suboptimal knowledge transfer. |
| Approach: | They propose a method that constructs a mixed gradient-based instruction graph to capture the joint distribution and interdependencies among instructions. |
| Outcome: | The proposed method outperforms existing methods on domain adaptation tasks and in complex, data-scarce scenarios. |