Research map / Learning theory and algorithms / Matrix and tensor methods
On Binary Embedding using Circulant Matrices
Felix X. Yu, Aditya Bhaskara, Sanjiv Kumar, Yunchao Gong, Shih-Fu Chang
Read the paperCheck your idea against 137,217 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.
Closest papers by meaning
- On the Optimal Bit Complexity of Circulant Binary Embedding (AAAI 2018 · similarity 0.94)
- Faster Binary Embeddings for Preserving Euclidean Distances (ICLR 2021 · similarity 0.88)
- Optimization Can Learn Johnson Lindenstrauss Embeddings (NeurIPS 2024 · similarity 0.81)
- Fourier Sliced-Wasserstein Embedding for Multisets and Measures (ICLR 2025 · similarity 0.81)
- QBB: Quantization with Binary Bases for LLMs (NeurIPS 2024 · similarity 0.81)
- Weighted Embeddings for Low-Dimensional Graph Representation (AAAI 2025 · similarity 0.81)
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.
