The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
New directions in nearest neighbor searching with applications to lattice sieving
Open accessAbstract
To solve the approximate nearest neighbor search problem (NNS) on the sphere, we propose a method using locality-sensitive filters (LSF), with the property that nearby vectors have a higher probability of surviving the same filter than vectors which are far apart. We instantiate the filters using spherical caps of height 1 – α, where a vector survives a filter if it is contained in the corresponding spherical cap, and where ideally each filter has an independent, uniformly random direction. For small α, these filters are very similar to the spherical locality-sensitive hash (LSH) family previously studied by Andoni et al. For larger α bounded away from 0, these filters potentially achieve a superior performance, provided we have access to an efficient oracle for finding relevant filters. Whereas existing LSH schemes are limited by a performance parameter of ρ ≥ 1/(2c2 – 1) to solve approximate NNS with approximation factor c, with spherical LSF we potentially achieve smaller asymptotic values of ρ, depending on the density of the data set. For sparse data sets where the dimension is super-logarithmic in the size of the data set, we asymptotically obtain ρ = 1/(2c2 – 1), while for a logarithmic dimensionality with density constant κ we obtain asymptotics of ρ ∼ 1/(4κc2). To instantiate the filters and prove the existence of an efficient decoding oracle, we replace the independent filters by filters taken from certain structured random product codes. We show that the additional structure in these concatenation codes allows us to decode efficiently using techniques similar to lattice enumeration, and we can find the relevant filters with low overhead, while at the same time not significantly changing the collision probabilities of the filters. We finally apply spherical LSF to sieving algorithms for solving the shortest vector problem (SVP) on lattices, and show that this leads to a heuristic time complexity for solving SVP in dimension n of (3/2)n/2+o(n) ≈ 20.292n+o(n). This asymptotically improves upon the previous best algorithms for solving SVP which use spherical LSH and cross-polytope LSH and run in time 20.298n+o(n). Experiments with the GaussSieve validate the claimed speedup and show that this method may be practical as well, as the polynomial overhead is small.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(2006) · Springer eBooks · Cited by 8,123
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276876 · Cited by 4,188
Extensions of Lipschitz mappings into a Hilbert space
Johnson, W. B., & Lindenstrauss, J. (1984) · Contemporary Mathematics · doi:10.1090/conm/026/737400 · Cited by 2,523
Similarity estimation techniques from rounding algorithms
Charikar, M. S. (2002) · Proceedings of the thiry-fourth annual ACM symposium on Theory of computing · doi:10.1145/509907.509965 · Cited by 2,220
Pattern Classification (2nd Edition)
Duda, R. O., Hart, P. E., & Stork, D. G. (2000) · Wiley-Interscience eBooks · Cited by 2,070
Adaptive estimation of a quadratic functional by model selection
Laurent, B., & Massart, P. (2000) · The Annals of Statistics · doi:10.1214/aos/1015957395 · Cited by 995
Better Key Sizes (and Attacks) for LWE-Based Encryption
Lindner, R., & Peikert, C. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19074-2_21 · Cited by 688
A sieve algorithm for the shortest lattice vector problem
Ajtai, M., Kumar, R., & Sivakumar, D. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380857 · Cited by 558
Improved algorithms for integer programming and related lattice problems
Kannan, R. (1983) · Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83 · doi:10.1145/800061.808749 · Cited by 441
Nearest-neighbor methods in learning and vision : theory and practice
Shakhnarovich, G., Indyk, P., & Darrell, T. (2005) · Cited by 399
Sieve algorithms for the shortest vector problem are practical
Nguyen, P. Q., & Vidick, T. (2008) · Journal of Mathematical Cryptology · doi:10.1515/jmc.2008.009 · Cited by 233
Practical and Optimal LSH for Angular Distance
Andoni, A., Indyk, P., Laarhoven, T., Razenshteyn, I., & Schmidt, L. (2015) · TU/e Research Portal · doi:10.48550/arxiv.1509.02897 · Cited by 201
Self-citationOn Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
May, A., & Ozerov, I. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46800-5_9 · Cited by 199
Optimal Data-Dependent Hashing for Approximate Near Neighbors
Andoni, A., & Razenshteyn, I. (2015) · Proceedings of the forty-seventh annual ACM symposium on Theory of Computing · doi:10.1145/2746539.2746553 · Cited by 185
Entropy based nearest neighbor search in high dimensions
Panigrahy, R. (2006) · doi:10.5555/1109557.1109688 · Cited by 181
Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
Laarhoven, T. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-47989-6_1 · Cited by 134
Self-citationOptimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny)
O’Donnell, R., Wu, Y., & Zhou, Y. (2014) · ACM Transactions on Computation Theory · doi:10.1145/2578221 · Cited by 110
Beyond Locality–Sensitive Hashing
Andoni, A., Indyk, P., Ên, H. L. N., & Razenshteyn, I. (2013) · Cited by 105
Solving the Shortest Lattice Vector Problem in Time 2 2.465n
Pujol, X., & Stehlé, D. (2009) · Cited by 69
A sieve algorithm based on overlattices
Becker, A., Gama, N., & Joux, A. (2014) · LMS Journal of Computation and Mathematics · doi:10.1112/s1461157014000229 · Cited by 44
Self-citationA Three-Level Sieve Algorithm for the Shortest Vector Problem
Zhang, F., Pan, Y., & Hu, G. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-43414-7_2 · Cited by 42
Estimating Key Sizes for High Dimensional Lattice-Based Systems
van de Pol, J., & Smart, N. P. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-45239-0_17 · Cited by 41
Randomized projective methods for the construction of binary sparse vector representations
Rachkovskij, D. A., Мисуно, И. С., & Slipchenko, S. O. (2012) · Cybernetics and Systems Analysis · doi:10.1007/s10559-012-9384-0 · Cited by 31
Becker, A., Gama, N., & Joux, A. (2015) · IACR Cryptology ePrint Archive · Cited by 24
Self-citationEfficient (Ideal) lattice sieving using cross-polytope LSH
Becker, A. A., & Laarhoven, T. (2015) · Cited by 5
Self-citation
Cited by
Bernstein, D. J., & Lange, T. (2017) · Nature · doi:10.1038/nature23461 · Cited by 1,242
CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme
Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schwabe, P., Seiler, G., & Stehlé, D. (2018) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2018.i1.238-268 · Cited by 713
Self-citationStatus report on the third round of the NIST Post-Quantum Cryptography Standardization process
Alagic, G., Apon, D., Cooper, D., Dang, Q., Dang, T., Kelsey, J., Lichtinger, J., Liu, Y.-K., Miller, C., Moody, D., et al. (2022) · doi:10.6028/nist.ir.8413 · Cited by 395
Frodo: Take off the Ring! Practical, Quantum-Secure Key Exchange from LWE
Bos, J., Costello, C., Ducas, L., Mironov, I., Naehrig, M., Nikolaenko, V., Raghunathan, A., & Stebila, D. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978425 · Cited by 320
Self-citationStatus report on the third round of the NIST Post-Quantum Cryptography Standardization process
Alagic, G., Apon, D., Cooper, D., Dang, Q., Dang, T., Kelsey, J., Lichtinger, J., Liu, Y.-K., Miller, C., Moody, D., et al. (2022) · doi:10.6028/nist.ir.8413-upd1 · Cited by 301
Metadata
- Authors
- Becker, A., Ducas, L., Gama, N., & Laarhoven, T.
- Venue
- Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms
- Published
- 2015-12-21
- Pages
- 10-24
- OpenAlex
- W2952033682
- Cited by
- 287
- References
- 25
- FWCI
- 9.01
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.