atlas

Research map / Learning theory and algorithms / Matrix and tensor methods

Faster Binary Embeddings for Preserving Euclidean Distances

ICLR 2021 · Learning theory and algorithms › Matrix and tensor methods · approach: Randomized sketching for matrices · 1 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use second-order instead of first-order ΣΔ quantization (ablation)Method 2 (sparse JL + ΣΔ) · Yelp, ImageNet, Flickr30k, CIFAR-10MAPE: around 0.08 -> around 0.07Helped
Use higher-order stable ΣΔ quantization (r>1) instead of first-order greedy quantization (ablation)Binary distance embedding · Yelpmean squared relative errorHelped
Increase embedding dimension m while keeping p=64 (ablation)Binary distance embedding · Yelpmean squared relative error: m=256,512,1024,2048,4096Helped
Use r=3 with empirically optimized p(m) (ablation)Binary distance embedding · Yelpdistance reconstruction errorHelped
Use sparse JL projections instead of FJLT projections (ablation)ΣΔ binary distance embedding · YelpMAPENo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy