Develops an exact verification method for GNNs supporting sum, max and mean aggregations via incremental constraint solving with bound tightening for adversarial robustness on node and graph classification tasks.
Thus zs2,s3 is upper bounded by 1 ns2,s3 X x∈X1 x + X 1≤i≤|X2|−s2 hi(X2, i) + X 1≤i≤s3 hi(X3, i)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Exact Verification of Graph Neural Networks with Incremental Constraint Solving
Develops an exact verification method for GNNs supporting sum, max and mean aggregations via incremental constraint solving with bound tightening for adversarial robustness on node and graph classification tasks.