Search Results for author: Anna Gilbert

Found 3 papers, 2 papers with code

Wasserstein Wormhole: Scalable Optimal Transport Distance with Transformers

no code implementations15 Apr 2024 Doron Haviv, Russell Zhang Kunes, Thomas Dougherty, Cassandra Burdziak, Tal Nawy, Anna Gilbert, Dana Pe'er

Along with an encoder that maps distributions to embeddings, Wasserstein Wormhole includes a decoder that maps embeddings back to distributions, allowing for operations in the embedding space to generalize to OT spaces, such as Wasserstein barycenter estimation and OT interpolation.


On the Approximation Properties of Random ReLU Features

1 code implementation10 Oct 2018 Yitong Sun, Anna Gilbert, Ambuj Tewari

We study the approximation properties of random ReLU features through their reproducing kernel Hilbert space (RKHS).

But How Does It Work in Theory? Linear SVM with Random Features

1 code implementation NeurIPS 2018 Yitong Sun, Anna Gilbert, Ambuj Tewari

We prove that, under low noise assumptions, the support vector machine with $N\ll m$ random features (RFSVM) can achieve the learning rate faster than $O(1/\sqrt{m})$ on a training set with $m$ samples when an optimized feature map is used.

feature selection

Cannot find the paper you are looking for? You can Submit a new open access paper.