Stanisław Purgał
International Joint Conference on Neural Networks (IJCNN), pp. 1 – 7, 2020.
pdf 
doi:10.1109/IJCNN48605.2020.9206591
Abstract
We propose a Graph Neural Network with greater expressive power than commonly used GNNs – not constrained to only differentiate between graphs that Weisfeiler-Lehman test recognizes to be non-isomorphic. We use a graph attention network with expanding attention window that aggregates information from nodes exponentially far away. We also use partially random initial embeddings, allowing differentiation between nodes that would otherwise look the same. This could cause problem with a traditional dropout mechanism, therefore we use a “head dropout”, randomly ignoring some attention heads rather than some dimensions of the embedding.
BibTex
@Article{Lang2020, author={Lang, Jan and Musil, V{\'{\i}}t and Ol{\v{s}}{\'a}k, Miroslav and Pick, Lubo{\v{s}}}, title={Maximal Non-compactness of Sobolev Embeddings}, journal={The Journal of Geometric Analysis}, year={2020}, month={Oct}, day={12}, issn={1559-002X}, doi={10.1007/s12220-020-00522-y}, url={https://doi.org/10.1007/s12220-020-00522-y}}