ADAGIO: Fast Data-aware Near-Isometric Linear Embeddings

09/17/2016
by   Jarosław Błasiok, et al.
0

Many important applications, including signal reconstruction, parameter estimation, and signal processing in a compressed domain, rely on a low-dimensional representation of the dataset that preserves all pairwise distances between the data points and leverages the inherent geometric structure that is typically present. Recently Hedge, Sankaranarayanan, Yin and Baraniuk hedge2015 proposed the first data-aware near-isometric linear embedding which achieves the best of both worlds. However, their method NuMax does not scale to large-scale datasets. Our main contribution is a simple, data-aware, near-isometric linear dimensionality reduction method which significantly outperforms a state-of-the-art method hedge2015 with respect to scalability while achieving high quality near-isometries. Furthermore, our method comes with strong worst-case theoretical guarantees that allow us to guarantee the quality of the obtained near-isometry. We verify experimentally the efficiency of our method on numerous real-world datasets, where we find that our method (<10 secs) is more than 3 000× faster than the state-of-the-art method hedge2015 (>9 hours) on medium scale datasets with 60 000 data points in 784 dimensions. Finally, we use our method as a preprocessing step to increase the computational efficiency of a classification application and for speeding up approximate nearest neighbor queries.

READ FULL TEXT

page 5

page 8

page 14

research
02/25/2016

Auto-JacoBin: Auto-encoder Jacobian Binary Hashing

Binary codes can be used to speed up nearest neighbor search tasks in la...
research
06/30/2018

Approximate Nearest Neighbors in Limited Space

We consider the (1+ϵ)-approximate nearest neighbor search problem: given...
research
11/13/2021

Efficient Binary Embedding of Categorical Data using BinSketch

In this work, we present a dimensionality reduction algorithm, aka. sket...
research
03/24/2022

Hierarchical Nearest Neighbor Graph Embedding for Efficient Dimensionality Reduction

Dimensionality reduction is crucial both for visualization and preproces...
research
07/12/2016

Incomplete Pivoted QR-based Dimensionality Reduction

High-dimensional big data appears in many research fields such as image ...
research
02/23/2019

Near neighbor preserving dimension reduction for doubling subsets of ℓ_1

Randomized dimensionality reduction has been recognized as one of the fu...
research
12/15/2019

Characterizing Generalized Rate-Distortion Performance of Video Coding: An Eigen Analysis Approach

Rate-distortion (RD) theory is at the heart of lossy data compression. H...

Please sign up or login with your details

Forgot password? Click here to reset