{"list":"other","total":74,"rows":[{"id":"1512.03385","title":"Deep Residual Learning for Image Recognition","created":"2015-12-10","cited_by_count":52096},{"id":"2103.00020","title":"Learning Transferable Visual Models From Natural Language Supervision","created":"2021-02-26","cited_by_count":33744},{"id":"1405.0312","title":"Microsoft COCO: Common Objects in Context","created":"2014-05-01","cited_by_count":17608},{"id":"1907.11692","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","created":"2019-07-26","cited_by_count":13372},{"id":"2005.11401","title":"Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks","created":"2020-05-22","cited_by_count":9297},{"id":"1908.10084","title":"Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks","created":"2019-08-27","cited_by_count":9170},{"id":"2304.07193","title":"DINOv2: Learning Robust Visual Features without Supervision","created":"2023-04-14","cited_by_count":7974},{"id":"2104.14294","title":"Emerging Properties in Self-Supervised Vision Transformers","created":"2021-04-29","cited_by_count":6968},{"id":"1910.01108","title":"DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter","created":"2019-10-02","cited_by_count":4307},{"id":"2102.05918","title":"Scaling Up Visual and Vision-Language Representation Learning With Noisy Text Supervision","created":"2021-02-11","cited_by_count":3864},{"id":"2004.04906","title":"Dense Passage Retrieval for Open-Domain Question Answering","created":"2020-04-10","cited_by_count":3824},{"id":"1809.09600","title":"HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answering","created":"2018-09-25","cited_by_count":3754},{"id":"1411.7766","title":"Deep Learning Face Attributes in the Wild","created":"2014-11-28","cited_by_count":3693},{"id":"1702.08734","title":"Billion-scale similarity search with GPUs","created":"2017-02-28","cited_by_count":2497},{"id":"1910.03771","title":"HuggingFace's Transformers: State-of-the-art Natural Language Processing","created":"2019-10-09","cited_by_count":2218},{"id":"2002.08909","title":"REALM: Retrieval-Augmented Language Model Pre-Training","created":"2020-02-10","cited_by_count":2141},{"id":"1611.09268","title":"MS MARCO: A Human Generated MAchine Reading COmprehension Dataset","created":"2016-11-28","cited_by_count":1605},{"id":"2002.10957","title":"MiniLM: Deep Self-Attention Distillation for Task-Agnostic Compression of Pre-Trained Transformers","created":"2020-02-25","cited_by_count":1463},{"id":"2112.04426","title":"Improving language models by retrieving from trillions of tokens","created":"2021-12-08","cited_by_count":1293},{"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":"1603.09320","title":"Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs","created":"2016-03-30","cited_by_count":861},{"id":"2007.00808","title":"Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrieval","created":"2020-07-01","cited_by_count":849},{"id":"1909.09436","title":"CodeSearchNet Challenge: Evaluating the State of Semantic Code Search","created":"2019-09-20","cited_by_count":654},{"id":"2210.07316","title":"MTEB: Massive Text Embedding Benchmark","created":"2022-10-13","cited_by_count":640},{"id":"2112.01488","title":"ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interaction","created":"2021-12-02","cited_by_count":476},{"id":"2401.08281","title":"The Faiss library","created":"2024-01-16","cited_by_count":376},{"id":"2212.09741","title":"One Embedder, Any Task: Instruction-Finetuned Text Embeddings","created":"2022-12-19","cited_by_count":333},{"id":"2004.01804","title":"Google Landmarks Dataset v2 -- A Large-Scale Benchmark for Instance-Level Recognition and Retrieval","created":"2020-04-03","cited_by_count":309},{"id":"2402.01613","title":"Nomic Embed: Training a Reproducible Long Context Text Embedder","created":"2024-02-02","cited_by_count":265},{"id":"1902.00434","title":"Generalized Sliced Wasserstein Distances","created":"2019-02-01","cited_by_count":208},{"id":"2102.07033","title":"PAQ: 65 Million Probably-Asked Questions and What You Can Do With Them","created":"2021-02-13","cited_by_count":200},{"id":"2103.16483","title":"Benchmarking Representation Learning for Natural World Image Collections","created":"2021-03-30","cited_by_count":168},{"id":"2205.01397","title":"Data Determines Distributional Robustness in Contrastive Language Image Pre-training (CLIP)","created":"2022-05-03","cited_by_count":138},{"id":"1807.05614","title":"ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithms","created":"2018-07-15","cited_by_count":130},{"id":"2305.01625","title":"Unlimiformer: Long-Range Transformers with Unlimited Length Input","created":"2023-05-02","cited_by_count":128},{"id":"2409.10516","title":"RetrievalAttention: Accelerating Long-Context LLM Inference via Vector Retrieval","created":"2024-09-16","cited_by_count":116},{"id":"2410.16179","title":"MagicPIG: LSH Sampling for Efficient LLM Generation","created":"2024-10-21","cited_by_count":111},{"id":"2202.11233","title":"Retrieval Augmented Classification for Long-Tail Visual Recognition","created":"2022-02-22","cited_by_count":106},{"id":"1707.00143","title":"Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph","created":"2017-07-01","cited_by_count":104},{"id":"2310.19923","title":"Jina Embeddings 2: 8192-Token General-Purpose Text Embeddings for Long Documents","created":"2023-10-30","cited_by_count":104},{"id":"2205.09707","title":"PLAID: An Efficient Engine for Late Interaction Retrieval","created":"2022-05-19","cited_by_count":101},{"id":"2309.12871","title":"AnglE-optimized Text Embeddings","created":"2023-09-22","cited_by_count":99},{"id":"2101.12631","title":"A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search","created":"2021-01-29","cited_by_count":82},{"id":"1906.05807","title":"Real-Time Open-Domain Question Answering with Dense-Sparse Phrase Index","created":"2019-06-13","cited_by_count":64},{"id":"2302.02451","title":"KDEformer: Accelerating Transformers via Kernel Density Estimation","created":"2023-02-05","cited_by_count":58},{"id":"2104.08727","title":"GooAQ: Open Question Answering with Diverse Answer Types","created":"2021-04-18","cited_by_count":53},{"id":"2310.07713","title":"InstructRetro: Instruction Tuning post Retrieval-Augmented Pretraining","created":"2023-10-11","cited_by_count":53},{"id":"2405.12497","title":"RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search","created":"2024-05-21","cited_by_count":48},{"id":"2205.03763","title":"Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search","created":"2022-05-08","cited_by_count":45},{"id":"2405.19325","title":"Nearest Neighbor Speculative Decoding for LLM Generation and Attribution","created":"2024-05-29","cited_by_count":25},{"id":"2308.15136","title":"CAGRA: Highly Parallel Graph Construction and Approximate Nearest Neighbor Search for GPUs","created":"2023-08-29","cited_by_count":22},{"id":"2409.17424","title":"Results of the Big ANN: NeurIPS'23 competition","created":"2024-09-25","cited_by_count":22},{"id":"2304.04759","title":"Similarity search in the blink of an eye with compressed indices","created":"2023-04-07","cited_by_count":21},{"id":"2409.09913","title":"Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search","created":"2024-09-16","cited_by_count":21},{"id":"1810.07355","title":"Optimization of Indexing Based on k-Nearest Neighbor Graph for Proximity Search in High-dimensional Data","created":"2018-10-17","cited_by_count":20},{"id":"2406.18587","title":"Nomic Embed Vision: Expanding the Latent Space","created":"2024-06-06","cited_by_count":19},{"id":"2211.12850","title":"OOD-DiskANN: Efficient and Scalable Graph ANNS for Out-of-Distribution Queries","created":"2022-10-22","cited_by_count":15},{"id":"2408.08933","title":"RoarGraph: A Projected Bipartite Graph for Efficient Cross-Modal Approximate Nearest Neighbor Search","created":"2024-08-16","cited_by_count":12},{"id":"2402.02044","title":"Locally-Adaptive Quantization for Streaming Vector Search","created":"2024-02-03","cited_by_count":11},{"id":"2502.05575","title":"Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art","created":"2025-02-08","cited_by_count":11},{"id":"2502.08246","title":"Inference-time sparse attention with asymmetric indexing","created":"2025-02-12","cited_by_count":11},{"id":"1912.01059","title":"GGNN: Graph-based GPU Nearest Neighbor Search","created":"2019-12-02","cited_by_count":10},{"id":"1704.07355","title":"Accelerated Nearest Neighbor Search with Quick ADC","created":"2017-04-24","cited_by_count":9},{"id":"2206.01382","title":"Falconn++: A Locality-sensitive Filtering Approach for Approximate Nearest Neighbor Search","created":"2022-06-03","cited_by_count":6},{"id":"2411.12229","title":"SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search","created":"2024-11-19","cited_by_count":6},{"id":"1812.07484","title":"Efficient Autotuning of Hyperparameters in Approximate Nearest Neighbor Search","created":"2018-12-18","cited_by_count":5},{"id":"2312.16335","title":"LeanVec: Searching vectors faster by making them fit","created":"2023-12-26","cited_by_count":5},{"id":"1910.08322","title":"A Multilabel Classification Framework for Approximate Nearest Neighbor Search","created":"2019-10-18","cited_by_count":4},{"id":"2406.19651","title":"CANDY: A Benchmark for Continuous Approximate Nearest Neighbor Search with Dynamic Data Ingestion","created":"2024-06-28","cited_by_count":4},{"id":"2410.18926","title":"LoRANN: Low-Rank Matrix Factorization for Approximate Nearest Neighbor Search","created":"2024-10-24","cited_by_count":4},{"id":"1906.12211","title":"PUFFINN: Parameterless and Universally Fast FInding of Nearest Neighbors","created":"2019-06-28","cited_by_count":3},{"id":"2412.01940","title":"Down with the Hierarchy: The 'H' in HNSW Stands for \"Hubs\"","created":"2024-12-02","cited_by_count":3},{"id":"2505.07621","title":"Bang for the Buck: Vector Search on Cloud CPUs","created":"2025-05-12","cited_by_count":1}],"next_cursor":null}