LADER: Log-Augmented DEnse Retrieval for Biomedical Literature Search
Not on the map. Why?
Abstract (arXiv)
Queries with similar information needs tend to have similar document clicks, especially in biomedical literature search engines where queries are generally short and top documents account for most of the total clicks. Motivated by this, we present a novel architecture for biomedical literature search, namely Log-Augmented DEnse Retrieval (LADER), which is a simple plug-in module that augments a dense retriever with the click logs retrieved from similar training queries. Specifically, LADER finds both similar documents and queries to the given query by a dense retriever. Then, LADER scores relevant (clicked) documents of similar queries weighted by their similarity to the input query. The final document scores by LADER are the average of (1) the document similarity scores from the dense retriever and (2) the aggregated document scores from the click logs of similar queries. Despite its simplicity, LADER achieves new state-of-the-art (SOTA) performance on TripClick, a recently released benchmark for biomedical literature retrieval. On the frequent (HEAD) queries, LADER largely outperforms the best retrieval model by 39% relative NDCG@10 (0.338 v.s. 0.243). LADER also achieves better performance on the less frequent (TORSO) queries with 11% relative NDCG@10 improvement over the previous SOTA (0.303 v.s. 0.272). On the rare (TAIL) queries where similar queries are scarce, LADER still compares favorably to the previous SOTA method (NDCG@10: 0.310 v.s. 0.295). On all queries, LADER can improve the performance of a dense retriever by 24%-37% relative NDCG@10 while not requiring additional training, and further performance improvement is expected from more logs. Our regression analysis has shown that queries that are more frequent, have higher entropy of query similarity and lower entropy of document similarity, tend to benefit more from log augmentation.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 21 of its 42 references that are in the map. First posted on arXiv 10 Apr 2023.
Builds on
21 of 42 references.
References · 21
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
- 2015FaceNet: A Unified Embedding for Face Recognition and Clusteringcited by 2,833
- 2017Billion-scale similarity search with GPUscited by 2,477
- 2019SciBERT: A Pretrained Language Model for Scientific Textcited by 1,404
- 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,160
- 2020Domain-Specific Language Model Pretraining for Biomedical Natural Language Processingcited by 996
- 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 846
9 more
- 2019Generalization through Memorization: Nearest Neighbor Language Modelscited by 788
- 2017End-to-End Neural Ad-hoc Ranking with Kernel Poolingcited by 85
- 2016Text Matching as Image Recognitioncited by 59
- 2023RAMM: Retrieval-augmented Biomedical Visual Question Answering with Multi-modal Pre-trainingcited by 31
- 2017PACRR: A Position-Aware Neural IR Model for Relevance Matchingcited by 22
- 2020Local Self-Attention over Long Text for Efficient Document Retrievalcited by 18
- 2021TripClick: The Log Files of a Large Health Web Search Enginecited by 18
- 2022Establishing Strong Baselines for TripClick Health Retrievalcited by 4
- 2022Implicit Feedback for Dense Passage Retrieval: A Counterfactual Approachcited by 3
Built on by
Citing papers per year: 2024: 2.
2 papers.