We introduce efficient (1+ε)-approximation algorithms for the
binary mat...
Graph transformers have emerged as a promising architecture for a variet...
Graph Neural Networks (GNNs) have emerged as a powerful technique for
le...
We give the first polynomial time and sample (ϵ,
δ)-differentially priva...
We consider the approximability of constraint satisfaction problems in t...
Random binning features, introduced in the seminal paper of Rahimi and R...
The shuffled (aka anonymous) model has recently generated significant
in...
Consider the setup where n parties are each given a number x_i ∈F_q and ...
Kernel methods are fundamental tools in machine learning that allow dete...
An exciting new development in differential privacy is the shuffled mode...
Federated learning promises to make machine learning feasible on distrib...
The Discrete Fourier Transform (DFT) is a fundamental computational
prim...
Reconstructing continuous signals from a small number of discrete sample...
Random Fourier features is one of the most popular techniques for scalin...