This article "Directional Graph Networks" https://t.co/o55mqX9JpV has a v. interesting idea: take gradients of the Laplacian eigenvectors to define a field over a graph, then use this 'directional' information for anisotropic aggregation, yielding a procedure stronger than 1 WL. pic.twitter.com/wl32nTqAPX
— Shubhendu Trivedi (@_onionesque) March 15, 2021
from Twitter https://twitter.com/_onionesque
March 14, 2021 at 08:01PM
via IFTTT
No comments:
Post a Comment