Inferensys

Glossary

Faithfulness Metric

A quantitative evaluation score measuring how accurately an explanation subgraph reflects a Graph Neural Network's true reasoning process, assessed by the drop in prediction performance when the explanation is removed.
AI evaluator reviewing output quality on laptop, comparison metrics visible, casual evaluation session.
EXPLANATION FIDELITY

What is Faithfulness Metric?

A quantitative evaluation score that measures how accurately an explanation subgraph reflects the true reasoning process of a Graph Neural Network.

The faithfulness metric is a quantitative evaluation score that measures how accurately an explanation subgraph reflects the true reasoning process of a Graph Neural Network (GNN). It quantifies the degree to which an identified explanatory structure—such as a set of critical nodes or edges—genuinely represents the internal decision logic rather than presenting a plausible but misleading correlation.

Operationally, faithfulness is typically assessed by the drop in prediction performance when the explanation is removed or perturbed from the original graph. A high-fidelity explanation will cause a sharp decline in the model's confidence or accuracy upon deletion, confirming that the identified subgraph was causally relevant to the GNN's output rather than an epiphenomenon.

FIDELITY ASSESSMENT

Key Characteristics of Faithfulness Metrics

Faithfulness metrics quantify how accurately an explanation subgraph reflects the GNN's true reasoning process, not just a correlation. These characteristics define rigorous evaluation.

01

Fidelity as Core Principle

Fidelity measures how well an explanation mimics the original model's behavior. A faithful explanation must preserve the GNN's prediction when only the explanatory subgraph is retained. The Fidelity+ score calculates the accuracy of the original model on the extracted subgraph, while Fidelity- measures the drop in performance when the explanation is removed. High fidelity indicates the explanation captures the true decision boundary.

Fidelity+
Primary Metric
Fidelity-
Complementary Metric
02

Perturbation-Based Evaluation

The gold standard for faithfulness assessment involves perturbation analysis. This systematically removes or masks the top-k most important nodes and edges identified by an explainer and measures the resulting change in prediction probability. A faithful explanation causes a sharp drop in confidence when removed. Key variants include:

  • Node Removal: Deleting critical nodes and observing prediction flip
  • Edge Masking: Zeroing out important adjacency matrix entries
  • Feature Perturbation: Adding noise to salient node features
03

Contrastivity and Sufficiency

A faithful explanation must be both contrastive and sufficient. Sufficiency means the extracted subgraph alone is adequate to produce the original prediction—no additional context is needed. Contrastivity ensures the explanation distinguishes the predicted class from alternative outcomes. A subgraph that is sufficient but not contrastive may simply be a universal salient structure, failing to explain why a specific class was chosen over another.

04

Sparsity as a Regularizer

Sparsity acts as a critical inductive bias for faithfulness. A compact explanation subgraph is more likely to isolate the causal structure rather than capture spurious correlations. Methods like the Graph Information Bottleneck explicitly optimize for minimal subgraphs that retain maximal mutual information with the label. Sparsity is measured as the fraction of original edges retained; lower values indicate more concise explanations, but only if fidelity remains high.

05

Causal Grounding vs. Correlation

True faithfulness requires causal grounding, not mere correlation. An explanation may achieve high fidelity by capturing shortcut features that correlate with the label in training data but fail under distribution shift. Structural Causal Models and invariant risk minimization principles are increasingly used to evaluate whether an explanation captures the true generative mechanism. A causally faithful explanation remains valid under interventions on the graph structure.

06

Stability Under Input Variation

A faithful explanation must exhibit stability—small, imperceptible perturbations to the input graph that do not change the prediction should not significantly alter the explanation. This is distinct from adversarial robustness. Stability is evaluated by adding controlled noise to non-salient regions and measuring the Jaccard similarity between the original and perturbed explanations. Unstable explanations indicate the explainer is fitting to brittle, non-robust features of the GNN.

FAITHFULNESS METRIC

Frequently Asked Questions

A quantitative evaluation score that measures how accurately an explanation subgraph reflects the true reasoning process of the GNN, typically assessed by the drop in performance when the explanation is removed.

The Faithfulness Metric is a quantitative evaluation score that measures how accurately an explanation subgraph reflects the true reasoning process of a Graph Neural Network (GNN). It quantifies the degree to which the identified important nodes, edges, or features genuinely drive the model's prediction rather than being spurious correlations. The core principle is that removing or perturbing the explanation should cause a significant, predictable change in the model's output. If removing the top-k most important edges identified by an explainer causes a dramatic drop in prediction probability, the explanation is considered faithful. Conversely, if the model's prediction remains unchanged after removing the 'explanation,' the explainer has failed to capture the true decision boundary. This metric is critical for auditing GNNs in high-stakes domains like drug discovery and fraud detection, where understanding the structural reasoning is mandatory for regulatory compliance and scientific validity.

Prasad Kumkar

About the author

Prasad Kumkar

CEO & MD, Inference Systems

Prasad Kumkar is the CEO & MD of Inference Systems and writes about AI systems architecture, LLM infrastructure, model serving, evaluation, and production deployment. Over 5+ years, he has worked across computer vision models, L5 autonomous vehicle systems, and LLM research, with a focus on taking complex AI ideas into real-world engineering systems.

His work and writing cover AI systems, large language models, AI agents, multimodal systems, autonomous systems, inference optimization, RAG, evaluation, and production AI engineering.