Pith. sign in

REVIEW

Revisiting Embeddings for 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

arxiv 2209.09338 v4 pith:IXF2YAUY submitted 2022-09-19 cs.LG

classification cs.LG
keywords embeddingsgraphgnnsdifferentembeddingnetworksneuralperformance
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Current graph representation learning techniques use Graph Neural Networks (GNNs) to extract features from dataset embeddings. In this work, we examine the quality of these embeddings and assess how changing them can affect the accuracy of GNNs. We explore different embedding extraction techniques for both images and texts; and find that the performance of different GNN architectures is dependent on the embedding style used. We see a prevalence of bag of words (BoW) embeddings and text classification tasks in available graph datasets. Given the impact embeddings has on GNN performance. this leads to a phenomenon that GNNs being optimised for BoW vectors.

Discussion (0). Continue with ORCID to comment.

Pith tools