{"list":"other","total":52,"rows":[{"id":"1810.04805","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","created":"2018-10-11","cited_by_count":40399},{"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":"1909.00512","title":"How Contextual are Contextualized Word Representations? Comparing the Geometry of BERT, ELMo, and GPT-2 Embeddings","created":"2019-09-02","cited_by_count":784},{"id":"2308.03281","title":"Towards General Text Embeddings with Multi-stage Contrastive Learning","created":"2023-08-07","cited_by_count":723},{"id":"2112.01488","title":"ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interaction","created":"2021-12-02","cited_by_count":476},{"id":"1805.10965","title":"Lipschitz regularity of deep neural networks: analysis and efficient estimation","created":"2018-05-28","cited_by_count":415},{"id":"2107.05720","title":"SPLADE: Sparse Lexical and Expansion Model for First Stage Ranking","created":"2021-07-12","cited_by_count":286},{"id":"2310.08319","title":"Fine-Tuning LLaMA for Multi-Stage Text Retrieval","created":"2023-10-12","cited_by_count":272},{"id":"1907.12009","title":"Representation Degeneration Problem in Training Natural Language Generation Models","created":"2019-07-28","cited_by_count":255},{"id":"2104.06967","title":"Efficiently Teaching an Effective Dense Retriever with Balanced Topic Aware Sampling","created":"2021-04-14","cited_by_count":238},{"id":"2508.06600","title":"BrowseComp-Plus: A More Fair and Transparent Evaluation Benchmark of Deep-Research Agent","created":"2025-08-08","cited_by_count":200},{"id":"1705.08475","title":"Formal Guarantees on the Robustness of a Classifier against Adversarial Manipulation","created":"2017-05-23","cited_by_count":185},{"id":"2310.19156","title":"Poisoning Retrieval Corpora by Injecting Adversarial Passages","created":"2023-10-29","cited_by_count":159},{"id":"2407.12883","title":"BRIGHT: A Realistic and Challenging Benchmark for Reasoning-Intensive Retrieval","created":"2024-07-16","cited_by_count":158},{"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":"2508.21038","title":"On the Theoretical Limitations of Embedding-Based Retrieval","created":"2025-08-28","cited_by_count":104},{"id":"2003.01219","title":"Exactly Computing the Local Lipschitz Constant of ReLU Networks","created":"2020-03-02","cited_by_count":102},{"id":"2205.09707","title":"PLAID: An Efficient Engine for Late Interaction Retrieval","created":"2022-05-19","cited_by_count":101},{"id":"2407.15831","title":"NV-Retriever: Improving text embedding models with effective hard-negative mining","created":"2024-07-22","cited_by_count":84},{"id":"2312.15503","title":"Llama2Vec: Unsupervised Adaptation of Large Language Models for Dense Retrieval","created":"2023-12-24","cited_by_count":78},{"id":"2504.20595","title":"ReasonIR: Training Retrievers for Reasoning Tasks","created":"2025-04-29","cited_by_count":77},{"id":"2401.12143","title":"Anisotropy Is Inherent to Self-Attention in Transformers","created":"2024-01-22","cited_by_count":63},{"id":"2110.06918","title":"Salient Phrase Aware Dense Retrieval: Can a Dense Retriever Imitate a Sparse One?","created":"2021-10-13","cited_by_count":60},{"id":"2108.07344","title":"IsoScore: Measuring the Uniformity of Embedding Space Utilization","created":"2021-08-16","cited_by_count":53},{"id":"2210.07394","title":"Efficiently Computing Local Lipschitz Constants of Neural Networks via Bound Propagation","created":"2022-10-13","cited_by_count":45},{"id":"2204.01321","title":"PRADA: Practical Black-Box Adversarial Attacks against Neural Ranking Models","created":"2022-04-04","cited_by_count":44},{"id":"2209.06506","title":"Order-Disorder: Imitation Adversarial Attacks for Black-box Neural Ranking Models","created":"2022-09-14","cited_by_count":37},{"id":"2111.13057","title":"Evaluating the Robustness of Retrieval Pipelines with Query Variation Generators","created":"2021-11-25","cited_by_count":34},{"id":"2308.09861","title":"Black-box Adversarial Attacks against Dense Retrieval Models: A Multi-view Contrastive Learning Method","created":"2023-08-19","cited_by_count":29},{"id":"2108.12139","title":"Dealing with Typos for BERT-based Passage Retrieval and Ranking","created":"2021-08-27","cited_by_count":23},{"id":"2205.02303","title":"Analysing the Robustness of Dual Encoders for Dense Retrieval Against Misspellings","created":"2022-05-04","cited_by_count":23},{"id":"2204.00716","title":"CharacterBERT and Self-Teaching for Improving the Robustness of Dense Retrievers on Queries with Typos","created":"2022-04-01","cited_by_count":22},{"id":"2406.05087","title":"Corpus Poisoning via Approximate Greedy Gradient Descent","created":"2024-06-07","cited_by_count":21},{"id":"2412.20953","title":"GASLITEing the Retrieval: Exploring Vulnerabilities in Dense Embedding-based Search","created":"2024-12-30","cited_by_count":20},{"id":"2304.14867","title":"Topic-oriented Adversarial Attacks against Black-box Neural Ranking Models","created":"2023-04-28","cited_by_count":18},{"id":"2510.08252","title":"ReasonEmbed: Enhanced Text Embeddings for Reasoning-Intensive Document Retrieval","created":"2025-10-09","cited_by_count":16},{"id":"2212.09170","title":"On Isotropy, Contextualization and Learning Dynamics of Contrastive-based Sentence Representation Learning","created":"2022-12-18","cited_by_count":15},{"id":"2407.06992","title":"Robust Neural Information Retrieval: An Adversarial and Out-of-distribution Perspective","created":"2024-07-09","cited_by_count":15},{"id":"2404.01574","title":"Multi-granular Adversarial Attacks against Black-box Neural Ranking Models","created":"2024-04-02","cited_by_count":14},{"id":"2504.17884","title":"Unsupervised Corpus Poisoning Attacks in Continuous Space for Dense Retrieval","created":"2025-04-24","cited_by_count":11},{"id":"2602.11151","title":"Diffusion-Pretrained Dense and Contextual Embeddings","created":"2026-02-11","cited_by_count":9},{"id":"2209.00218","title":"Isotropic Representation Can Improve Dense Retrieval","created":"2022-09-01","cited_by_count":8},{"id":"2501.04802","title":"Reproducing HotFlip for Corpus Poisoning Attacks in Dense Retrieval","created":"2025-01-08","cited_by_count":7},{"id":"2306.10348","title":"Typo-Robust Representation Learning for Dense Retrieval","created":"2023-06-17","cited_by_count":6},{"id":"2503.08644","title":"Exploiting Instruction-Following Retrievers for Malicious Information Retrieval","created":"2025-03-11","cited_by_count":4},{"id":"2403.10939","title":"Improving the Robustness of Dense Retrievers Against Typos via Multi-Positive Contrastive Learning","created":"2024-03-16","cited_by_count":3},{"id":"2505.24279","title":"On the Scaling of Robustness and Effectiveness in Dense Retrieval","created":"2025-05-30","cited_by_count":2}],"next_cursor":null}