Research map / Learning theory and algorithms / Matrix and tensor methods
On the Optimal Bit Complexity of Circulant Binary Embedding
Saehoon Kim, Jungtaek Kim, Seungjin Choi
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 changed | Where | Measured | Effect |
|---|---|---|---|
| Replace Gaussian random sequence with Rademacher sequence in circulant projection (ablation) | CBE · MNIST, CIFAR-10 angle preservation | relative error of angle approximation | Improved |
| Use circulant projection instead of unstructured projection for binary embedding | Binary embedding · MNIST, CIFAR-10 angle preservation | relative error of angle approximation | No clear effect |
| Use circulant projection instead of unstructured projection for binary embedding | Binary embedding · Hamming ranking, 100 nearest neighbors | precision-recall | No clear effect |
Closest papers by meaning
- On Binary Embedding using Circulant Matrices (JMLR 2018 · similarity 0.94)
- Faster Binary Embeddings for Preserving Euclidean Distances (ICLR 2021 · similarity 0.89)
- Fried Binary Embedding for High-Dimensional Visual Features (CVPR 2017 · similarity 0.86)
- MetricEmbedding: Accelerate Metric Nearness by Tropical Inner Product (ICML 2025 · similarity 0.82)
- Optimization Can Learn Johnson Lindenstrauss Embeddings (NeurIPS 2024 · similarity 0.81)
- Binary Quadratic Quantization: Beyond First-Order Quantization for Real-Valued Matrix Compression (NeurIPS 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.
