
Optimal (Euclidean) Metric Compression
We study the problem of representing all distances between n points in ℝ...
read it

Learningbased Support Estimation in Sublinear Time
We consider the problem of estimating the number of distinct elements in...
read it

Faster Kernel Matrix Algebra via Density Estimation
We study fast algorithms for computing fundamental properties of a posit...
read it

Scalable Nearest Neighbor Search for Optimal Transport
The Optimal Transport (a.k.a. Wasserstein) distance is an increasingly p...
read it

SampleOptimal LowRank Approximation of Distance Matrices
A distance matrix A ∈ R^n × m represents all pairwise distances, A_ij=d(...
read it

Scalable Fair Clustering
We study the fair variant of the classic kmedian problem introduced by ...
read it

Learning SublinearTime Indexing for Nearest Neighbor Search
Most of the efficient sublineartime indexing algorithms for the highdi...
read it

Learning Space Partitions for Nearest Neighbor Search
Space partitions of R^d underlie a vast and important class of fast near...
read it

Multitasking Capacity: Hardness Results and Improved Constructions
We consider the problem of determining the maximal α∈ (0,1] such that ev...
read it

Approximate Nearest Neighbors in Limited Space
We consider the (1+ϵ)approximate nearest neighbor search problem: given...
read it

Practical DataDependent Metric Compression with Provable Guarantees
We introduce a new distancepreserving compact representation of multid...
read it
Tal Wagner
is this you? claim profile