Research map / Learning theory and algorithms / Sample complexity
On Adaptive Distance Estimation
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 changed | Where | Measured | Effect |
|---|---|---|---|
| Choose queries adaptively using prior answers to the vanilla JL sketch | Vanilla JL distance estimation · Three-point attack, d = 5000 and k = 250 | reported length accuracy | Hurt |
| Use the adaptive distance-estimation data structure instead of vanilla JL | Distance estimation under the described attack · Three-point attack, d = 5000 and k = 250 | reported length accuracy | Helped |
| Replace Gaussian sketches with CountSketch for p=2 (ablation) | Adaptive Euclidean ADE · Adaptive Euclidean ADE (p=2) | query time: from \tilde O(\varepsilon^{-2}(n + d)) to \tilde O(d + n/\varepsilon^2) | Helped |
Closest papers by meaning
- Clustering with Non-adaptive Subset Queries (NeurIPS 2024 · similarity 0.85)
- Statistical-Computational Trade-offs for Density Estimation (NeurIPS 2024 · similarity 0.84)
- Scalable Approximation Algorithms for $p$-Wasserstein Distance and Its Variants (ICML 2025 · similarity 0.84)
- Reconstruction and Secrecy under Approximate Distance Queries (NeurIPS 2025 · similarity 0.84)
- Sort Before You Prune: Improved Worst-Case Guarantees of the DiskANN Family of Graphs (ICML 2025 · similarity 0.84)
- Graph-Based Algorithms for Diverse Similarity Search (ICML 2025 · similarity 0.84)
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.