Faster Binary Embeddings for Preserving Euclidean Distances

Jinjie Zhang, Rayan Saab

Type: Preprint

Publication Date: 2020-01-01

Citations: 1

DOI: https://doi.org/10.48550/arxiv.2010.00712

View Publication

Locations

arXiv (Cornell University) - View - PDF
DataCite API - View

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Faster Binary Embeddings for Preserving Euclidean Distances	2020	Jinjie Zhang Rayan Saab
+	Small Width, Low Distortions: Quantized Random Embeddings of Low-complexity Sets	2015	Laurent Jacques
+	Small Width, Low Distortions: Quantized Random Embeddings of Low-complexity Sets	2015	Laurent Jacques
+	Binary Embedding: Fundamental Limits and Fast Algorithm	2015	Xinyang Yi Constantine Caramanis Eric Price
+	Fast binary embeddings, and quantized compressed sensing with structured matrices	2018	Thang Huynh Rayan Saab
+	Fast binary embeddings, and quantized compressed sensing with structured matrices	2018	Thang Huynh Rayan Saab
+	Binary Embedding: Fundamental Limits and Fast Algorithm	2015	Xinyang Yi Constantine Caramanis Eric Price
+	Time for dithering: fast and quantized random embeddings via the restricted isometry property	2016	Laurent Jacques Valerio Cambareri
+ PDF Chat	Fast Binary Embeddings and Quantized Compressed Sensing with Structured Matrices	2019	Thang Huynh Rayan Saab
+	Time for dithering: fast and quantized random embeddings via the restricted isometry property	2016	Laurent Jacques Valerio Cambareri
+	Johnson-Lindenstrauss embeddings for noisy vectors -- taking advantage of the noise	2022	Zhen Shao
+ PDF Chat	Time for dithering: fast and quantized random embeddings via the restricted isometry property	2017	Laurent Jacques Valerio Cambareri
+	Near-Optimal Bounds for Binary Embeddings of Arbitrary Sets	2015	Samet Oymak Ben Recht
+	Near-Optimal Sample Complexity Bounds for Circulant Binary Embedding	2016	Samet Oymak
+	Near-Optimal Sample Complexity Bounds for Circulant Binary Embedding	2016	Samet Oymak
+	Fast binary embeddings with Gaussian circulant matrices: improved bounds	2016	Sjoerd Dirksen Alexander Stollenwerk
+	Fast binary embeddings with Gaussian circulant matrices: improved bounds	2016	Sjoerd Dirksen Alexander Stollenwerk
+	The Fast Johnson-Lindenstrauss Transform is Even Faster	2022	Ora Nova Fandina Mikael Møller Høgsgaard Kasper Green Larsen
+	Fast Binary Embedding via Circulant Downsampled Matrix -- A Data-Independent Approach	2016	Sung-Hsien Hsieh Chun-Shien Lu Soo‐Chang Pei
+	Binarized Johnson-Lindenstrauss embeddings.	2020	Sjoerd Dirksen Alexander Stollenwerk

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (20)

Action	Title	Year	Authors
+ PDF Chat	An optimal family of exponentially accurate one‐bit Sigma‐Delta quantization schemes	2011	Percy Deift Felix Krahmer C. Sınan Güntürk
+ PDF Chat	Sparser Johnson-Lindenstrauss Transforms	2014	Daniel M. Kane Jelani Nelson
+	None	2008	Nikolaos Fountoulakis Daniela Kühn Deryk Osthus
+ PDF Chat	Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors	2013	Laurent Jacques Jason N. Laska Petros T. Boufounos Richard G. Baraniuk
+	A Derandomized Sparse Johnson-Lindenstrauss Transform	2010	Daniel M. Kane Jelani Nelson
+ PDF Chat	An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform	2013	Nir Ailon Edo Liberty
+	In Defense of MinHash Over SimHash	2014	Anshumali Shrivastava Ping Li
+ PDF Chat	Distributed Noise-Shaping Quantization: I. Beta Duals of Finite Frames and Near-Optimal Quantization of Random Measurements	2016	Evan Chou C. Sınan Güntürk
+ PDF Chat	Flickr30k Entities: Collecting Region-to-Phrase Correspondences for Richer Image-to-Sentence Models	2016	Bryan A. Plummer Liwei Wang Chris M. Cervantes Juan C. Caicedo Julia Hockenmaier Svetlana Lazebnik
+ PDF Chat	Low-Rank Approximation and Regression in Input Sparsity Time	2017	Kenneth L. Clarkson David P. Woodruff