{"list":"other","total":53,"rows":[{"id":"1706.03762","title":"Attention Is All You Need","created":"2017-06-12","cited_by_count":60361},{"id":"1810.04805","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","created":"2018-10-11","cited_by_count":40399},{"id":"1908.10084","title":"Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks","created":"2019-08-27","cited_by_count":9170},{"id":"1607.06450","title":"Layer Normalization","created":"2016-07-21","cited_by_count":5669},{"id":"2004.04906","title":"Dense Passage Retrieval for Open-Domain Question Answering","created":"2020-04-10","cited_by_count":3824},{"id":"1611.09268","title":"MS MARCO: A Human Generated MAchine Reading COmprehension Dataset","created":"2016-11-28","cited_by_count":1605},{"id":"2104.08663","title":"BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Models","created":"2021-04-17","cited_by_count":1252},{"id":"2112.09118","title":"Unsupervised Dense Information Retrieval with Contrastive Learning","created":"2021-12-16","cited_by_count":1216},{"id":"2004.12832","title":"ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERT","created":"2020-04-27","cited_by_count":1178},{"id":"1708.05031","title":"Neural Collaborative Filtering","created":"2017-08-16","cited_by_count":1111},{"id":"1609.09106","title":"HyperNetworks","created":"2016-09-27","cited_by_count":1027},{"id":"2007.00808","title":"Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrieval","created":"2020-07-01","cited_by_count":849},{"id":"1807.05960","title":"Meta-Learning with Latent Embedding Optimization","created":"2018-07-16","cited_by_count":476},{"id":"2112.01488","title":"ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interaction","created":"2021-12-02","cited_by_count":476},{"id":"2010.08191","title":"RocketQA: An Optimized Training Approach to Dense Passage Retrieval for Open-Domain Question Answering","created":"2020-10-16","cited_by_count":413},{"id":"2003.07820","title":"Overview of the TREC 2019 deep learning track","created":"2020-03-17","cited_by_count":286},{"id":"2107.05720","title":"SPLADE: Sparse Lexical and Expansion Model for First Stage Ranking","created":"2021-07-12","cited_by_count":286},{"id":"1906.00695","title":"Continual learning with hypernetworks","created":"2019-06-03","cited_by_count":273},{"id":"2310.08319","title":"Fine-Tuning LLaMA for Multi-Stage Text Retrieval","created":"2023-10-12","cited_by_count":272},{"id":"2010.06467","title":"Pretrained Transformers for Text Ranking: BERT and Beyond","created":"2020-10-13","cited_by_count":267},{"id":"2104.06967","title":"Efficiently Teaching an Effective Dense Retriever with Balanced Topic Aware Sampling","created":"2021-04-14","cited_by_count":238},{"id":"2108.05540","title":"Unsupervised Corpus Aware Language Model Pre-training for Dense Passage Retrieval","created":"2021-08-12","cited_by_count":203},{"id":"1910.14424","title":"Multi-Stage Document Ranking with BERT","created":"2019-10-31","cited_by_count":201},{"id":"2102.07662","title":"Overview of the TREC 2020 deep learning track","created":"2021-02-15","cited_by_count":196},{"id":"1708.05027","title":"Neural Factorization Machines for Sparse Predictive Analytics","created":"2017-08-16","cited_by_count":183},{"id":"2104.08051","title":"Optimizing Dense Retrieval Model Training with Hard Negatives","created":"2021-04-16","cited_by_count":155},{"id":"2010.02666","title":"Improving Efficient Neural Ranking Models with Cross-Architecture Knowledge Distillation","created":"2020-10-06","cited_by_count":145},{"id":"1810.05749","title":"Graph HyperNetworks for Neural Architecture Search","created":"2018-10-12","cited_by_count":132},{"id":"2205.12035","title":"RetroMAE: Pre-Training Retrieval-oriented Language Models Via Masked Auto-Encoder","created":"2022-05-24","cited_by_count":118},{"id":"2302.07452","title":"How to Train Your DRAGON: Diverse Augmentation Towards Generalizable Dense Retrieval","created":"2023-02-15","cited_by_count":118},{"id":"2104.07186","title":"COIL: Revisit Exact Lexical Match in Information Retrieval with Contextualized Inverted List","created":"2021-04-15","cited_by_count":113},{"id":"2205.04733","title":"From Distillation to Hard Negative Sampling: Making Sparse Neural IR Models More Effective","created":"2022-05-10","cited_by_count":98},{"id":"2207.02578","title":"SimLM: Pre-training with Representation Bottleneck for Dense Passage Retrieval","created":"2022-07-06","cited_by_count":90},{"id":"1706.06613","title":"End-to-End Neural Ad-hoc Ranking with Kernel Pooling","created":"2017-06-20","cited_by_count":85},{"id":"1903.06902","title":"A Deep Look into Neural Ranking Models for Information Retrieval","created":"2019-03-16","cited_by_count":79},{"id":"2403.15246","title":"FollowIR: Evaluating and Teaching Information Retrieval Models to Follow Instructions","created":"2024-03-22","cited_by_count":69},{"id":"1610.08136","title":"Learning to Match Using Local and Distributed Representations of Text for Web Search","created":"2016-10-26","cited_by_count":68},{"id":"1704.08803","title":"Neural Ranking Models with Weak Supervision","created":"2017-04-28","cited_by_count":61},{"id":"1602.06359","title":"Text Matching as Image Recognition","created":"2016-02-20","cited_by_count":59},{"id":"2010.11386","title":"Distilling Dense Representations for Ranking using Tightly-Coupled Teachers","created":"2020-10-22","cited_by_count":52},{"id":"2004.14255","title":"Efficient Document Re-Ranking for Transformers by Precomputing Term Representations","created":"2020-04-29","cited_by_count":44},{"id":"2409.11136","title":"Promptriever: Instruction-Trained Retrievers Can Be Prompted Like Language Models","created":"2024-09-17","cited_by_count":40},{"id":"2204.13679","title":"Curriculum Learning for Dense Retrieval Distillation","created":"2022-04-28","cited_by_count":38},{"id":"2104.09791","title":"B-PROP: Bootstrapped Pre-training with Representative Words Prediction for Ad-hoc Retrieval","created":"2021-04-20","cited_by_count":25},{"id":"2203.11378","title":"HyperShot: Few-Shot Learning by Kernel HyperNetworks","created":"2022-03-21","cited_by_count":24},{"id":"2209.13335","title":"PROD: Progressive Distillation for Dense Retrieval","created":"2022-09-27","cited_by_count":21},{"id":"2104.09632","title":"Searching for Scientific Evidence in a Pandemic: An Overview of TREC-COVID","created":"2021-04-19","cited_by_count":19},{"id":"2211.10411","title":"CITADEL: Conditional Token Interaction via Dynamic Lexical Routing for Efficient and Effective Multi-Vector Retrieval","created":"2022-11-18","cited_by_count":19},{"id":"2105.07975","title":"How Deep is your Learning: the DL-HARD Annotated Deep Learning Dataset","created":"2021-05-17","cited_by_count":18},{"id":"1903.07666","title":"An Updated Duet Model for Passage Re-ranking","created":"2019-03-18","cited_by_count":12},{"id":"2304.13654","title":"A Personalized Dense Retrieval Framework for Unified Information Access","created":"2023-04-26","cited_by_count":7},{"id":"2406.17968","title":"Efficient Document Ranking with Learnable Late Interactions","created":"2024-06-25","cited_by_count":6},{"id":"2312.16828","title":"GUITAR: Gradient Pruning toward Fast Neural Ranking","created":"2023-12-28","cited_by_count":1}],"next_cursor":null}