CORE
πΊπ¦Β
Β make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Faster Linear Algebra for Distance Matrices
Authors
Piotr Indyk
Sandeep Silwal
Publication date
26 October 2022
Publisher
View
on
arXiv
Abstract
The distance matrix of a dataset
X
X
X
of
n
n
n
points with respect to a distance function
f
f
f
represents all pairwise distances between points in
X
X
X
induced by
f
f
f
. Due to their wide applicability, distance matrices and related families of matrices have been the focus of many recent algorithmic works. We continue this line of research and take a broad view of algorithm design for distance matrices with the goal of designing fast algorithms, which are specifically tailored for distance matrices, for fundamental linear algebraic primitives. Our results include efficient algorithms for computing matrix-vector products for a wide class of distance matrices, such as the
β
1
\ell_1
β
1
β
metric for which we get a linear runtime, as well as an
Ξ©
(
n
2
)
\Omega(n^2)
Ξ©
(
n
2
)
lower bound for any algorithm which computes a matrix-vector product for the
β
β
\ell_{\infty}
β
β
β
case, showing a separation between the
β
1
\ell_1
β
1
β
and the
β
β
\ell_{\infty}
β
β
β
metrics. Our upper bound results, in conjunction with recent works on the matrix-vector query model, have many further downstream applications, including the fastest algorithm for computing a relative error low-rank approximation for the distance matrix induced by
β
1
\ell_1
β
1
β
and
β
2
2
\ell_2^2
β
2
2
β
functions and the fastest algorithm for computing an additive error low-rank approximation for the
β
2
\ell_2
β
2
β
metric, in addition to applications for fast matrix multiplication among others. We also give algorithms for constructing distance matrices and show that one can construct an approximate
β
2
\ell_2
β
2
β
distance matrix in time faster than the bound implied by the Johnson-Lindenstrauss lemma.Comment: Selected as Oral for NeurIPS 202
Similar works
Full text
Available Versions
arXiv.org e-Print Archive
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:arXiv.org:2210.15114
Last time updated on 06/12/2022