Efficient One-Pass End-to-End Entity Linking for Questions
원문 초록
We present ELQ, a fast end-to-end entity linking model for questions, which uses a biencoder to jointly perform mention detection and linking in one pass. Evaluated on WebQSP and GraphQuestions with extended annotations that cover multiple entities per question, ELQ outperforms the previous state of the art by a large margin of +12.7% and +19.6% F1, respectively. With a very fast inference time (1.57 examples/s on a single CPU), ELQ can be useful for downstream question answering systems. In a proof-of-concept experiment, we demonstrate that using ELQ significantly improves the downstream QA performance of GraphRetriever (arXiv:1911.03868). Code and data available at https://github.com/facebookresearch/BLINK/tree/master/elq
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Improving QA Efficiency with DistilBERT: Fine-Tuning and Inference on mobile Intel CPUs
From Roots to Rewards: Dynamic Tree Reasoning with RL
Describe Anything Model for Visual Question Answering on Text-rich Images
Warehouse Spatial Question Answering with LLM Agent
MathOptAI.jl: Embed trained machine learning predictors into JuMP models
L0: Reinforcement Learning to Become General Agents
토론
이 논문과 연결된 포럼 글이 아직 없습니다.