Co-occurring keywords · papers mentioning both
Papers
S2FT: Parameter-Efficient Fine-Tuning in Sparse Spectrum Domain
CVPR 2026
Efficient Nearest Neighbor based Uncertainty Estimation for Natural Language Processing Tasks
NAACL 2025
Hubness Change Point Detection
AAAI 2025
Improving Tool Retrieval by Leveraging Large Language Models for Query Generation
COLING 2025
MultiClaimNet: A Massively Multilingual Dataset of Fact-Checked Claim Clusters
EMNLP 2025
NeighborRetr: Balancing Hub Centrality in Cross-Modal Retrieval
CVPR 2025
On Finding Hubs in High Dimensions with Sampling
AAAI 2025
Operational Advice for Dense and Sparse Retrievers: HNSW, Flat, or Inverted Indexes?
ACL 2025
Qinco2: Vector Compression and Search with Improved Implicit Neural Codebooks
ICLR 2025
Quality over Quantity in Attention Layers: When Adding More Heads Hurts
ICLR 2025
Risk Controlled Image Retrieval
AAAI 2025
A Multilabel Classification Framework for Approximate Nearest Neighbor Search
JMLR 2024
Collision-Affording Point Trees: SIMD-Amenable Nearest Neighbors for Fast Motion Planning with Pointclouds
RSS 2024
CSPG: Crossing Sparse Proximity Graphs for Approximate Nearest Neighbor Search
NeurIPS 2024
Efficient Centroid-Linkage Clustering
NeurIPS 2024
Enhancing Knowledge Retrieval with Topic Modeling for Knowledge-Grounded Dialogue
COLING 2024
Euclidean distance compression via deep random features
NeurIPS 2024
Fast Exact Retrieval for Nearest-neighbor Lookup (FERN)
NAACL 2024
In-Context Pretraining: Language Modeling Beyond Document Boundaries
ICLR 2024
mucAI at WojoodNER 2024: Arabic Named Entity Recognition with Nearest Neighbor Search
ACL 2024
Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits
NeurIPS 2024
On the Estimation of Image-matching Uncertainty in Visual Place Recognition
CVPR 2024
Residual Quantization with Implicit Neural Codebooks
ICML 2024
A Black-Box Attack on Code Models via Representation Nearest Neighbor Search
EMNLP 2023
A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree
ICML 2023