Search Results for author: Eli Berger

Found 3 papers, 1 papers with code

Universal Graph Random Features

no code implementations • 7 Oct 2023 • Isaac Reid, Krzysztof Choromanski, Eli Berger, Adrian Weller

This includes many of the most popular examples of kernels defined on the nodes of a graph.

Node Clustering

Paper
Add Code

Repelling Random Walks

no code implementations • 7 Oct 2023 • Isaac Reid, Eli Berger, Krzysztof Choromanski, Adrian Weller

We present a novel quasi-Monte Carlo mechanism to improve graph-based sampling, coined repelling random walks.

Paper
Add Code

Efficient Graph Field Integrators Meet Point Clouds

1 code implementation • 2 Feb 2023 • Krzysztof Choromanski, Arijit Sehanobish, Han Lin, Yunfan Zhao, Eli Berger, Tetiana Parshakova, Alvin Pan, David Watkins, Tianyi Zhang, Valerii Likhosherstov, Somnath Basu Roy Chowdhury, Avinava Dubey, Deepali Jain, Tamas Sarlos, Snigdha Chaturvedi, Adrian Weller

We present two new classes of algorithms for efficient field integration on graphs encoding point clouds.

1

Paper
Code

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