Hardness of approximate nearest neighbor search
Aviad Rubinstein
- pp 1260-1268
Reads0
Chats0
TLDR
This work proves conditional near-quadratic running time lower bounds for approximate Bichromatic Closest Pair with Euclidean, Manhattan, Hamming, or edit distance, and construction is the first to yield new hardness results.Abstract:
We prove conditional near-quadratic running time lower bounds for approximate Bichromatic Closest Pair with Euclidean, Manhattan, Hamming, or edit distance. Specifically, unless the Strong Exponential Time Hypothesis (SETH) is false, for every δ>0 there exists a constant e>0 such that computing a (1+e)-approximation to the Bichromatic Closest Pair requires Ω(n2−δ) time. In particular, this implies a near-linear query time for Approximate Nearest Neighbor search with polynomial preprocessing time. Our reduction uses the recently introduced Distributed PCP framework, but obtains improved efficiency using Algebraic Geometry (AG) codes. Efficient PCPs from AG codes have been constructed in other settings before, but our construction is the first to yield new hardness results.read more
Citations
More filters
Proceedings ArticleDOI
Dynamic set cover: improved algorithms and lower bounds
TL;DR: These are the first algorithms that obtain an approximation factor linear in f for dynamic set cover, thereby almost matching the best bounds known in the offline setting and improving upon the previous best approximation of O(f2) in the dynamic setting.
Proceedings ArticleDOI
On the parameterized complexity of approximating dominating set
TL;DR: To prove hardness of approximation of a certain parameterized variant of the label cover problem, it suffices to devise a specific protocol for a communication problem that depends on which hypothesis the authors rely on, generalizing the ideas from a recent breakthrough work of Abboud et al.
Journal ArticleDOI
On the Parameterized Complexity of Approximating Dominating Set
TL;DR: The non-existence of an F(k)-FPT-approximation algorithm for any function F was shown under Gap-ETH and to prove hardness of approximation of a certain parameterized variant of the label cover problem, it suffices to devise a specific protocol for a communication problem that depends on which hypothesis the authors rely on.
Proceedings ArticleDOI
Inapproximability of Clustering in Lp Metrics
Vincent Cohen-Addad,C S Karthik +1 more
TL;DR: It is shown that it is hard to approximate the k-means objective in O(log n) dimensional space and an embedding technique is introduced which combines the transcripts of certain communication protocols with the geometric realization of certain graphs that proves standard NP-hardness for the above problems but for smaller approximation factors.
Proceedings ArticleDOI
Efficient Density Evaluation for Smooth Kernels
TL;DR: This paper presents a collection of algorithms for efficient KDF evaluation under the assumptions that the kernel k is "smooth", i.e. the value changes at most polynomially with the distance, and presents a general reduction from density estimation to approximate near neighbor in the underlying space.
References
More filters
Proceedings ArticleDOI
Approximate nearest neighbors: towards removing the curse of dimensionality
Piotr Indyk,Rajeev Motwani +1 more
TL;DR: In this paper, the authors present two algorithms for the approximate nearest neighbor problem in high-dimensional spaces, for data sets of size n living in R d, which require space that is only polynomial in n and d.
Journal ArticleDOI
Proof verification and the hardness of approximation problems
TL;DR: It is proved that no MAX SNP-hard problem has a polynomial time approximation scheme, unless NP = P, and there exists a positive ε such that approximating the maximum clique size in an N-vertex graph to within a factor of Nε is NP-hard.
Proceedings ArticleDOI
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
Alexandr Andoni,Piotr Indyk +1 more
TL;DR: An algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O and space O almost matches the lower bound for hashing-based algorithm recently obtained in [27].
Journal ArticleDOI
Probabilistic checking of proofs: a new characterization of NP
Sanjeev Arora,Shmuel Safra +1 more
TL;DR: It is shown that approximating Clique and Independent Set, even in a very weak sense, is NP-hard, and the class NP contains exactly those languages for which membership proofs can be verified probabilistically in polynomial time.
Journal ArticleDOI
Improved decoding of Reed-Solomon and algebraic-geometry codes
Venkatesan Guruswami,Madhu Sudan +1 more
TL;DR: An improved list decoding algorithm for decoding Reed-Solomon codes and alternant codes and algebraic-geometry codes is presented and a solution to a weighted curve-fitting problem is presented, which may be of use in soft-decision decoding algorithms for Reed- Solomon codes.