AI Paper Atlas

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

Sublinear Time Low-Rank Approximation of Distance Matrices

Ainesh Bakshi, David Woodruff

NeurIPS 2018 · Learning theory and algorithms › Matrix and tensor methods · approach: Randomized sketching for matrices · 11 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 recursive additive-error projection-cost preserving samplingLow-rank approximation of arbitrary metric distance matrices · Arbitrary metric distance matricesFrobenius squared-error guarantee: \| \mathbf{A} - \mathbf{M} \mathbf{N}^T \|^2_{F} \leq \| \mathbf{A} - \mathbf{A}_k\|^2_{F} + \epsilon \| \mathbf{A} \|^2Improved
Use coarse norm estimates and recursively sample rows and columnsLow-rank approximation of arbitrary metric distance matrices · Arbitrary metric distance matricesRunning time: \widetilde{O}((m^{1+\gamma} + n^{1+\gamma})\textrm{poly}(k \epsilon^{-1}))Improved
Allow output rank k+4 relative to target rank kRelative-error low-rank approximation of squared Euclidean distance matrices · Squared Euclidean distance matrices with \mathcal{P} = \mathcal{Q}Frobenius squared-error guarantee: \|\mathbf{A}-\mathbf{B}\|_F^2 \leq (1+\epsilon)\|\mathbf{A}-\mathbf{A}_k\|_F^2Improved
Use squared Euclidean distances with equal point sets and allow output rank k+4Relative-error low-rank approximation · Squared Euclidean distance matrices with \mathcal{P} = \mathcal{Q}Running time: n \cdot k \cdot \textrm{poly}(1/\epsilon)Improved

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