20 citations · 20 across the 1 of their papers we have counts for
4 papers
GRASP: Graph Alignment through Spectral Signatures
Judith Hermanns, Anton Tsitsulin, Marina Munkhoeva +3
What is the best way to match the nodes of two graphs? This graph alignment problem generalizes graph isomorphism and arises in applications from social network analysis to bioinfo…
Just SLaQ When You Approximate: Accurate Spectral Distances for Web-Scale Graphs
Anton Tsitsulin, Marina Munkhoeva, Bryan Perozzi
Graph comparison is a fundamental operation in data mining and information retrieval. Due to the combinatorial nature of graphs, it is hard to balance the expressiveness of the sim…
The Shape of Data: Intrinsic Distance for Data Distributions
Anton Tsitsulin, Marina Munkhoeva, Davide Mottin +4
The ability to represent and compare machine learning models is crucial in order to quantify subtle model changes, evaluate generative models, and gather insights on neural network…
Quadrature-based features for kernel approximation
Marina Munkhoeva, Yermek Kapushev, Evgeny Burnaev +1
We consider the problem of improving kernel approximation via randomized feature maps. These maps arise as Monte Carlo approximation to integral representations of kernel functions…