Proxy-based Zero-Shot Entity Linking by Effective Candidate Retrieval
A recent advancement in the domain of biomedical Entity Linking is the development of powerful two-stage algorithms, an initial candidate retrieval stage that generates a shortlist of entities for each mention, followed by a candidate ranking stage. However, the effectiveness of both stages are inextricably dependent on computationally expensive components. Specifically, in candidate retrieval via dense representation retrieval it is important to have hard negative samples, which require repeated forward passes and nearest neighbour searches across the entire entity label set throughout training. In this work, we show that pairing a proxy-based metric learning loss with an adversarial regularizer provides an efficient alternative to hard negative sampling in the candidate retrieval stage. In particular, we show competitive performance on the recall@1 metric, thereby providing the option to leave out the expensive candidate ranking step. Finally, we demonstrate how the model can be used in a zero-shot setting to discover out of knowledge base biomedical entities.
Code (0)
등록된 구현이 없습니다.
Tasks
Entity LinkingMetric LearningRetrievalMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Improving Zero-Shot Entity Linking Candidate Generation with Ultra-Fine Entity Type Information
Entity linking, which aims at aligning ambiguous entity mentions to their referent entities in a knowledge base, plays a key role in multiple natural language processing tasks. Recently, zero-shot entity linking task has…
Entity LinkingEntity TypingVocal Bursts Type PredictionImproving Few-shot and Zero-shot Entity Linking with Coarse-to-Fine Lexicon-based Retriever
Few-shot and zero-shot entity linking focus on the tail and emerging entities, which are more challenging but closer to real-world scenarios. The mainstream method is the ''retrieve and rerank'' two-stage framework. In t…
Entity LinkingRetrievalScalable Zero-shot Entity Linking with Dense Entity Retrieval
This paper introduces a conceptually simple, scalable, and highly effective BERT-based entity linking model, along with an extensive evaluation of its accuracy-speed trade-off. We present a two-stage zero-shot linking al…
Entity EmbeddingsEntity LinkingEntity RetrievalKnowledge Distillation+1ReFinED: An Efficient Zero-shot-capable Approach to End-to-End Entity Linking
We introduce ReFinED, an efficient end-to-end entity linking model which uses fine-grained entity types and entity descriptions to perform linking. The model performs mention detection, fine-grained entity typing, and en…
Entity DisambiguationEntity LinkingEntity TypingZero-shot Neural Transfer for Cross-lingual Entity Linking
Cross-lingual entity linking maps an entity mention in a source language to its corresponding entry in a structured knowledge base that is in a different (target) language. While previous work relies heavily on bilingual…
Cross-Lingual Entity LinkingEntity Linking