Tal Wagner

activity

20152026

most citedScalable Fair Clustering

58 citations · 82 across the 18 of their papers we have counts for

collaborators

Showing 2019Show all

4 papers · 1 filter

cs.DS2019

Scalable Nearest Neighbor Search for Optimal Transport

Arturs Backurs, Yihe Dong, Piotr Indyk +2

The Optimal Transport (a.k.a. Wasserstein) distance is an increasingly popular similarity measure for rich data domains, such as images or text documents. This raises the necessity…

cs.DS2019★ 11 cited

Sample-Optimal Low-Rank Approximation of Distance Matrices

Piotr Indyk, Ali Vakilian, Tal Wagner +1

A distance matrix $A \in R^{n \times m}$ represents all pairwise distances, $A_{ij} = d (x_{i}, y_{j})$ , between two point sets $x_{1}, ..., x_{n}$ and $y_{1}, ..., y_{m}$ in an arbit…

cs.DS2019★ 58 cited

Scalable Fair Clustering

Arturs Backurs, Piotr Indyk, Krzysztof Onak +3

We study the fair variant of the classic $k$ -median problem introduced by Chierichetti et al. [2017]. In the standard $k$ -median problem, given an input pointset $P$ , the goal is t…

cs.LG2019

Learning Space Partitions for Nearest Neighbor Search

Yihe Dong, Piotr Indyk, Ilya Razenshteyn +1

Space partitions of $R^{d}$ underlie a vast and important class of fast nearest neighbor search (NNS) algorithms. Inspired by recent theoretical work on NNS for general metr…