Research map / Learning theory and algorithms / Matrix and tensor methods
Faster Linear Algebra for Distance Matrices
Piotr Indyk, Sandeep Silwal
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 |
|---|---|---|---|
| use implicit l1 matrix-vector query algorithm instead of explicit distance matrix | l1 matvec query · Gaussian Mixture | avg query time: 43.3 s -> 0.09 s | Improved |
| use implicit l1 matrix-vector query algorithm instead of explicit distance matrix | l1 matvec query · Gaussian Mixture | preprocessing time: 453.7 s -> 0.55 s | Improved |
| use implicit l1 matrix-vector query algorithm instead of explicit distance matrix | l1 matvec query · MNIST | avg query time: 38.6 s -> 1.9 s | Improved |
| use implicit l1 matrix-vector query algorithm instead of explicit distance matrix | l1 matvec query · MNIST | preprocessing time: 2672.5 s -> 5.5 s | Improved |
| use implicit l1 matrix-vector query on large dataset where full matrix cannot be stored | l1 matvec query · Glove | avg query time: 2.6 days (estimated) -> 3.4 s | Improved |
| larger dataset size | l1 matvec query speedup · Gaussian/MNIST/Glove | relative gain | Improved |
Closest papers by meaning
- MetricEmbedding: Accelerate Metric Nearness by Tropical Inner Product (ICML 2025 · similarity 0.85)
- The Structural Complexity of Matrix-Vector Multiplication (NeurIPS 2025 · similarity 0.85)
- Metric Transforms and Low Rank Representations of Kernels for Fast Attention (NeurIPS 2024 · similarity 0.84)
- Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time (ICLR 2024 · similarity 0.83)
- Fast exact recovery of noisy matrix from few entries: the infinity norm approach (NeurIPS 2025 · similarity 0.83)
- Sample-Efficient Geometry Reconstruction from Euclidean Distances using Non-Convex Optimization (NeurIPS 2024 · similarity 0.83)
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.
