We study efficient mechanisms for differentially private kernel density
...
An ε-approximate quantile sketch over a stream of n inputs
approximates ...
Recent work shows that the expressive power of Graph Neural Networks (GN...
Optimal Transport (OT) is a fundamental tool for comparing probability
d...
Histograms, i.e., piece-wise constant approximations, are a popular tool...
Data-driven algorithms can adapt their internal structure or parameters ...
We propose a synthetic task, LEGO (Learning Equality and Group Operation...
We propose data-driven one-pass streaming algorithms for estimating the
...
We study the problem of representing all distances between n points in
ℝ...
We consider the problem of estimating the number of distinct elements in...
We study fast algorithms for computing fundamental properties of a posit...
The Optimal Transport (a.k.a. Wasserstein) distance is an increasingly
p...
A distance matrix A ∈ R^n × m represents all pairwise
distances, A_ij=d(...
We study the fair variant of the classic k-median problem introduced by
...
Most of the efficient sublinear-time indexing algorithms for the
high-di...
Space partitions of R^d underlie a vast and important class of
fast near...
We consider the problem of determining the maximal α∈ (0,1] such
that ev...
We consider the (1+ϵ)-approximate nearest neighbor search problem:
given...
We introduce a new distance-preserving compact representation of
multi-d...