Research map / Learning theory and algorithms / Combinatorial and search optimization
Fast Similarity Search via Optimal Sparse Lifting
Wenye Li, Jingwei Mao, Yin Zhang, Shuguang Cui
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 |
|---|---|---|---|
| learn optimal lifting operator instead of random sparse projection (fly algorithm) | sparse binary hashing · SIFT, GLOVE, MNIST similarity search | mean average precision | Improved |
| fly random sparse lifting instead of LSH dense random projection | hashing for similarity search · SIFT, GLOVE, MNIST similarity search | mean average precision | Improved |
| use optimal lifting instead of autoencoder at large hash length (k=16, 32) | hashing · SIFT, MNIST | mean average precision | No clear effect |
| use optimal lifting instead of autoencoder at small hash length (k=2,4,8) | hashing · SIFT, MNIST | mean average precision | Improved |
| use sparse binary lifted vectors instead of LSH/autoencoder vectors | query processing · WIKI query time | query time: 4 to 9 times faster | Improved |
| use optimal lifting with d'=2000 instead of autoencoder training | training · WIKI training time | training time | Mixed |
| use optimal lifting vs resized ground truth images on 20x20 | optimal lifting step · MNIST | relative deviation | No clear effect |
Closest papers by meaning
- Graph-Based Algorithms for Diverse Similarity Search (ICML 2025 · similarity 0.85)
- Bio-Inspired Hashing for Unsupervised Similarity Search (ICML 2020 · similarity 0.84)
- Link and Code: Fast Indexing With Graphs and Compact Regression Codes (CVPR 2018 · similarity 0.84)
- Similarity Learning via Kernel Preserving Embedding (AAAI 2019 · similarity 0.84)
- Fast Approximation of Similarity Graphs with Kernel Density Estimation (NeurIPS 2023 · similarity 0.83)
- Linear Time Approximation Algorithm for Column Subset Selection with Local Search (NeurIPS 2024 · similarity 0.82)
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.
