General Graph Random Features

1 code implementation • 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

Repelling Random Walks

1 code implementation • 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.

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.