Pith. sign in

REVIEW 1 cited by

Graph Rationalization with Environment-based Augmentations

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 2206.02886 v2 pith:QZHI6QNV submitted 2022-06-06 cs.LG stat.ML

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

Rationale is defined as a subset of input features that best explains or supports the prediction by machine learning models. Rationale identification has improved the generalizability and interpretability of neural networks on vision and language data. In graph applications such as molecule and polymer property prediction, identifying representative subgraph structures named as graph rationales plays an essential role in the performance of graph neural networks. Existing graph pooling and/or distribution intervention methods suffer from lack of examples to learn to identify optimal graph rationales. In this work, we introduce a new augmentation operation called environment replacement that automatically creates virtual data examples to improve rationale identification. We propose an efficient framework that performs rationale-environment separation and representation learning on the real and augmented examples in latent spaces to avoid the high complexity of explicit graph decoding and encoding. Comparing against recent techniques, experiments on seven molecular and four polymer real datasets demonstrate the effectiveness and efficiency of the proposed augmentation-based graph rationalization framework.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Learning Causality for Modern Machine Learning

    cs.LG 2025-06 conditional novelty 2.0 of 10

    A thesis compiling six papers that use causal invariance to improve graph neural networks' out-of-distribution generalization, interpretability, and robustness.

Pith tools