Lune

ICML2020Top-tier venue

Accelerating Large-Scale Inference with Anisotropic Vector Quantization

Ruiqi Guo, Philip Sun, Erik Lindgren, Quan Geng, David Simcha, Felix Chern, Sanjiv Kumar

Abstract

Given a training set P ⊂ ℝ^d, the nearest-neighbor classifier assigns any query point q ∈ ℝ^d to the class of its closest point in P. To answer these classification queries, some training points are more relevant than others. We say a training point is relevant if its omission from the training set could induce the misclassification of some query point in ℝ^d. These relevant points are commonly known as border points, as they define the boundaries of the Voronoi diagram of P that separate points of different classes. Being able to compute this set of points efficiently is crucial to reduce the size of the training set without affecting the accuracy of the nearest-neighbor classifier. Improving over a decades-long result by Clarkson (FOCS'94), Eppstein (SOSA’22) recently proposed an output-sensitive algorithm to find the set of border points of P in 𝒪(n² + nk²) time, where k is the size of such set. In this paper, we improve this algorithm to have time complexity equal to 𝒪(nk²) by proving that the first phase of their algorithm, which requires 𝒪(n²) time, are unnecessary.

Ask Lune

Know this paper in minutes, not an afternoon.

Lune can read every page of it and the top-tier papers that cite it, and gives you its claims, its evidence and its limits, each one cited to the paper it comes from. No skimming, no AI slop.

187 top-tier papers have cited it since. Know what they found before your reviewers do.

Questions to start from

Lune can draw on

the full paper · the top-tier papers that cite it · related work

Get the answer

Free to start. No credit card required.

Lineage

  • Retrieval-Augmented Diffusion Models cites Improving Language Models by Retrieving from Trillions of Tokens
  • Retrieval-Augmented Diffusion Models cites Nearest Neighbor Machine Translation
  • Transformer Memory as a Differentiable Search Index cites Improving Language Models by Retrieving from Trillions of Tokens
Builds onCited byLeft to right by year; the more cited, the higher.

Cited by top-tier papers187

  1. Improving Language Models by Retrieving from Trillions of TokensSebastian Borgeaud, Arthur Mensch, Jordan Hoffmann, Trevor Cai et al.ICML 2022 · 1,629 citations
  2. Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text RetrievalLee Xiong, Chenyan Xiong, Ye Li, Kwok-Fung Tang et al.ICLR 2021 · 1,547 citations
  3. Transformer Memory as a Differentiable Search IndexYi Tay, Vinh Tran, Mostafa Dehghani, Jianmo Ni et al.NeurIPS 2022 · 506 citations
  4. Nearest Neighbor Machine TranslationUrvashi Khandelwal, Angela Fan, Dan Jurafsky, Luke Zettlemoyer et al.ICLR 2021 · 323 citations
  5. Retrieval-Augmented Diffusion ModelsAndreas Blattmann, Robin Rombach, Kaan Oktay, Jonas Müller et al.NeurIPS 2022 · 239 citations

Builds on1

  1. Unsupervised Neural Quantization for Compressed-Domain Similarity SearchStanislav Morozov, Artem BabenkoICCV 2019 · 31 citations

Related papers

  1. A Multilabel Classification Framework for Approximate Nearest Neighbor SearchVille Hyvönen, Elias Jääsaari, Teemu RoosNeurIPS 2022 · 4 citations
  2. Training-Time Attacks against K-nearest NeighborsAra Vartanian, Will Rosenbaum, Scott AlfeldAAAI 2023 · 1 citation
  3. Differentiable Approximations for Distance QueriesAhmed Abdelkader, David M. MountSODA 2025
  4. Margin-Independent Online Multiclass Learning via Convex GeometryGuru Guruganesh, Allen Liu, Jon Schneider, Joshua R. WangNeurIPS 2021
  5. A new near-linear time algorithm for k-nearest neighbor search using a compressed cover treeYury Elkin, Vitaliy KurlinICML 2023 · 18 citations
Dusk over the sea between two cliffs drawn in fine vertical lines