On binary embedding using circulant matrices

MaRDI QIDQ4558470zbMATH OpenFDO

Authors Felix Yu, Aditya Bhaskara, Sanjiv Kumar, Yunchao Gong, Shih-Fu Chang

Publication date 22 November 2018

Full work available at URL https://arxiv.org/abs/1511.06480, http://jmlr.csail.mit.edu/papers/v18/15-619.html

zbMATH Keywords

binary embeddingcirculant matrixdimensionality reductionFFTstructured matrix

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computational aspects of data analysis and big data (68T09)

Recommendations

• Fast binary embeddings with Gaussian circulant matrices: improved bounds
• Fast binary embeddings and quantized compressed sensing with structured matrices
• On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms
• Efficient binary embedding of categorical data using BinSketch
• Formation of similarity-reflecting binary vectors with random binary projections

Cites work

• A variant of the Johnson-Lindenstrauss lemma for circulant matrices
• Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
• Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
• Dense Fast Random Projections and Lean Walsh Transforms
• Extensions of Lipschitz mappings into a Hilbert space
• Hanson-Wright inequality and sub-Gaussian concentration
• scientific article; zbMATH DE number 1775450 (Why is no real title available?)
• Johnson-Lindenstrauss lemma for circulant matrices
• New bounds for circulant Johnson-Lindenstrauss embeddings
• On variants of the Johnson–Lindenstrauss lemma
• Similarity estimation techniques from rounding algorithms
• The Johnson-Lindenstrauss lemma and the sphericity of some graphs
• The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction
• Toeplitz and circulant matrices: a review.

Cited in

(6)

• Fast binary embeddings with Gaussian circulant matrices: improved bounds
• Efficient binary embedding of categorical data using BinSketch
• Binary vectors for fast distance and similarity estimation
• Simple classification using binary data
• Fast binary embeddings and quantized compressed sensing with structured matrices
• Fast Metric Embedding into the Hamming Cube

Describes a project that uses

Uses Software

• ImageNet

This page was built for publication: On binary embedding using circulant matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4558470)