Pith. sign in

REVIEW

Size-Invariant Graph Representations for Graph Classification Extrapolations

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 2103.05045 v2 pith:AHID4EFI submitted 2021-03-08 cs.LG

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

In general, graph representation learning methods assume that the train and test data come from the same distribution. In this work we consider an underexplored area of an otherwise rapidly developing field of graph representation learning: The task of out-of-distribution (OOD) graph classification, where train and test data have different distributions, with test data unavailable during training. Our work shows it is possible to use a causal model to learn approximately invariant representations that better extrapolate between train and test data. Finally, we conclude with synthetic and real-world dataset experiments showcasing the benefits of representations that are invariant to train/test distribution shifts.

Discussion (0). Sign in to comment.

Pith tools