Search Results for author:
Found 2 papers, 1 papers with code
Distinguished In Uniform: Self Attention Vs. Virtual Nodes
We first clarify that this form of universality is not unique to GTs: Using the same positional encodings, also pure MPGNNs and even 2-layer MLPs are non-uniform universal approximators.
One Model, Any CSP: Graph Neural Networks as Fast Global Search Heuristics for Constraint Satisfaction
We propose a universal Graph Neural Network architecture which can be trained as an end-2-end search heuristic for any Constraint Satisfaction Problem (CSP).
Cannot find the paper you are looking for? You can
Submit a new open access paper.
