mlsanityData to 14 Oct 2026

Distilling Closed-Source LLM's Knowledge for Locally Stable and Economic Biomedical Entity Linking

arXiv 2505.19722 ↗First posted 26 May 2025cs.CL cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Biomedical entity linking aims to map nonstandard entities to standard entities in a knowledge base. Traditional supervised methods perform well but require extensive annotated data to transfer, limiting their usage in low-resource scenarios. Large language models (LLMs), especially closed-source LLMs, can address these but risk stability issues and high economic costs: using these models is restricted by commercial companies and brings significant economic costs when dealing with large amounts of data. To address this, we propose ``RPDR'', a framework combining closed-source LLMs and open-source LLMs for re-ranking candidates retrieved by a retriever fine-tuned with a small amount of data. By prompting a closed-source LLM to generate training data from unannotated data and fine-tuning an open-source LLM for re-ranking, we effectively distill the knowledge to the open-source LLM that can be deployed locally, thus avoiding the stability issues and the problem of high economic costs. We evaluate RPDR on two datasets, including one real-world dataset and one publicly available dataset involving two languages: Chinese and English. RPDR achieves 0.019 Acc@1 improvement and 0.036 Acc@1 improvement on the Aier dataset and the Ask A Patient dataset when the amount of training data is not enough. The results demonstrate the superiority and generalizability of the proposed framework.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 26 of its 35 references that are in the map. First posted on arXiv 26 May 2025.

Builds on

26 of 35 references.

References · 26

  1. 2023GPT-4 Technical Reportcited by 18,396
  2. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
  3. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  4. 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,459
  5. 2023Tree of Thoughts: Deliberate Problem Solving with Large Language Modelscited by 3,211
  6. 2022Self-Instruct: Aligning Language Models with Self-Generated Instructionscited by 2,724
  7. 2020Knowledge Distillation: A Surveycited by 1,603
  8. 2023Efficient and Effective Text Encoding for Chinese LLaMA and Alpacacited by 305
  9. 2021Symbolic Knowledge Distillation: from General Language Models to Commonsense Modelscited by 270
  10. 2020Self-Alignment Pretraining for Biomedical Entity Representationscited by 237
  11. 2023HuaTuo: Tuning LLaMA Model with Chinese Medical Knowledgecited by 162
  12. 2020Biomedical Entity Representations with Synonym Marginalizationcited by 61
14 more
  1. 2023Zero-shot Temporal Relation Extraction with ChatGPTcited by 53
  2. 2019BERT-based Ranking for Biomedical Entity Normalizationcited by 30
  3. 2023Who Wrote it and Why? Prompting Large-Language Models for Authorship Verificationcited by 19
  4. 2022Graph Soft-Contrastive Learning via Neighborhood Rankingcited by 16
  5. 2021LightCAKE: A Lightweight Framework for Context-Aware Knowledge Graph Embeddingcited by 11
  6. 2023Resolving the Imbalance Issue in Hierarchical Disciplinary Topic Inference via LLM-based Data Augmentationcited by 11
  7. 2024scCDCG: Efficient Deep Structural Clustering for single-cell RNA-seq via Deep Cut-informed Graph Embeddingcited by 10
  8. 2023Adaptive Path-Memory Network for Temporal Knowledge Graph Reasoningcited by 9
  9. 2023Temporal Inductive Path Neural Network for Temporal Knowledge Graph Reasoningcited by 9
  10. 2024FedGCS: A Generative Framework for Efficient Client Selection in Federated Learning via Gradient-based Optimizationcited by 9
  11. 2022NEEDED: Introducing Hierarchical Transformer to Eye Diseases Diagnosiscited by 7
  12. 2025Deep Cut-informed Graph Embedding and Clusteringcited by 7
  13. 2020Context-Enhanced Entity and Relation Embedding for Knowledge Graph Completioncited by 6
  14. 2025Rethinking Graph Contrastive Learning through Relative Similarity Preservationcited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.