REVIEW 2 cited by
Bridging the Gap between Spatial and Spectral Domains: A Survey on Graph Neural Networks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Deep learning's success has been widely recognized in a variety of machine learning tasks, including image classification, audio recognition, and natural language processing. As an extension of deep learning beyond these domains, graph neural networks (GNNs) are designed to handle the non-Euclidean graph-structure which is intractable to previous deep learning techniques. Existing GNNs are presented using various techniques, making direct comparison and cross-reference more complex. Although existing studies categorize GNNs into spatial-based and spectral-based techniques, there hasn't been a thorough examination of their relationship. To close this gap, this study presents a single framework that systematically incorporates most GNNs. We organize existing GNNs into spatial and spectral domains, as well as expose the connections within each domain. A review of spectral graph theory and approximation theory builds a strong relationship across the spatial and spectral domains in further investigation.
Forward citations
Cited by 2 Pith papers
-
Same Graph Cross-Task Transfer in GNNs: Protocols and Predictors
Under a fixed leakage-free protocol, NC→LP transfer reliably helps on homophilic graphs while LP→NC helps mainly when LP is easy and NC is unsaturated; homophily and CoTask Score guide mechanism choice.
-
PolyModel for Hedge Funds' Portfolio Construction Using Machine Learning
A hedge fund portfolio study finds that XGBoost selection and comprehensive PolyModel filters raise cumulative returns, while equal-weighting outperforms AUM-weighting.
Discussion (0). Continue with ORCID to comment.