55 citations · 92 across the 9 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.LG2022★ 4 cited
Can Hybrid Geometric Scattering Networks Help Solve the Maximum Clique Problem?
Yimeng Min, Frederik Wenkel, Michael Perlmutter +1
We propose a geometric scattering-based graph neural network (GNN) for approximating solutions of the NP-hard maximum clique (MC) problem. We construct a loss function with two ter…
stat.ML2022★ 8 cited
Overcoming Oversmoothness in Graph Convolutional Networks via Hybrid Scattering Networks
Frederik Wenkel, Yimeng Min, Matthew Hirn +2
Geometric deep learning has made great strides towards generalizing the design of structure-aware neural networks from traditional domains to non-Euclidean ones, giving rise to gra…