Practical data-dependent metric compression with provable guarantees
We introduce a new distance-preserving compact representation of multidimensional point-sets. Given n points in a d-dimensional space where each coordinate is represented using B bits (i.e., dB bits per point), it produces a representation of size O(dlog(dB/e) + logn) bits per point from which one c...
Main Authors: | Indyk, Piotr, Razenshteyn, Ilya, Wagner, Tal |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | English |
Published: |
Neural Information Processing Systems Foundation, Inc.
2019
|
Online Access: | https://hdl.handle.net/1721.1/121556 |
Similar Items
-
Near-optimal (euclidean) metric compression
by: Indyk, Piotr, et al.
Published: (2018) -
Practical Methods for Scalable Bayesian and Causal Inference with Provable Quality Guarantees
by: Agrawal, Raj
Published: (2022) -
Scalable Nearest Neighbor Search for Optimal Transport
by: Backurs, Arturs, et al.
Published: (2022) -
On Model-Based RIP-1 Matrices
by: Indyk, Piotr, et al.
Published: (2014) -
Sampling-Based Approximation Algorithms for Reachability Analysis with Provable Guarantees
by: Liebenwein, Lucas, et al.
Published: (2018)