AI Paper Atlas

Research map / Learning theory and algorithms / Matrix and tensor methods

Faster Linear Algebra for Distance Matrices

Piotr Indyk, Sandeep Silwal

NeurIPS 2022 · Learning theory and algorithms › Matrix and tensor methods · approach: Randomized sketching for matrices · 1 citations (OpenAlex)

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 changedWhereMeasuredEffect
use implicit l1 matrix-vector query algorithm instead of explicit distance matrixl1 matvec query · Gaussian Mixtureavg query time: 43.3 s -> 0.09 sImproved
use implicit l1 matrix-vector query algorithm instead of explicit distance matrixl1 matvec query · Gaussian Mixturepreprocessing time: 453.7 s -> 0.55 sImproved
use implicit l1 matrix-vector query algorithm instead of explicit distance matrixl1 matvec query · MNISTavg query time: 38.6 s -> 1.9 sImproved
use implicit l1 matrix-vector query algorithm instead of explicit distance matrixl1 matvec query · MNISTpreprocessing time: 2672.5 s -> 5.5 sImproved
use implicit l1 matrix-vector query on large dataset where full matrix cannot be storedl1 matvec query · Gloveavg query time: 2.6 days (estimated) -> 3.4 sImproved
larger dataset sizel1 matvec query speedup · Gaussian/MNIST/Gloverelative gainImproved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy