arXiv:2104.14624
The Logic of Graph Neural Networks
원문 초록
Graph neural networks (GNNs) are deep learning architectures for machine learning problems on graphs. It has recently been shown that the expressiveness of GNNs can be characterised precisely by the combinatorial Weisfeiler-Leman algorithms and by finite variable counting logics. The correspondence has even led to new, higher-order GNNs corresponding to the WL algorithm in higher dimensions. The purpose of this paper is to explain these descriptive characterisations of GNNs.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Describe Anything Model for Visual Question Answering on Text-rich Images
Assay2Mol: large language model-based drug design using BioAssay context
Beyond Accuracy: Metrics that Uncover What Makes a 'Good' Visual Descriptor
Dataset Distillation via Vision-Language Category Prototype
DRAMA-X: A Fine-grained Intent Prediction and Risk Reasoning Benchmark For Driving
InstructTTSEval: Benchmarking Complex Natural-Language Instruction Following in Text-to-Speech Systems
토론
이 논문과 연결된 포럼 글이 아직 없습니다.