Shapley-Value-Based Graph Sparsification for GNN Inference

2025-07-27

AI Summary

To address the low inference efficiency and poor interpretability of Graph Neural Networks (GNNs), this paper proposes a Shapley-value-based graph sparsification method. Unlike conventional non-negative edge importance measures, our approach introduces, for the first time, a signed Shapley edge contribution assessment that explicitly models both positive (facilitative) and negative (adversarial) edge effects—enabling precise identification and pruning of redundant or harmful edges. By combining subgraph sampling with efficient marginal contribution estimation, we achieve scalable, global edge importance ranking to guide structured graph pruning. Experiments across multiple benchmark datasets demonstrate that our method reduces edge counts by 30–50% on average while preserving GNN predictive accuracy (prediction error increase <1.2%), accelerating inference by 1.8–2.4×, and enhancing model interpretability. The framework is theoretically grounded in cooperative game theory and empirically validated for practical effectiveness.

Technology Category

• Machine Learning: Graph-based Machine Learning
• Data Mining & Knowledge Management: Graph Mining, Social Network Analysis & Community
• Reasoning under Uncertainty: Graphical Models

Application Category

• Graph Algorithms and Modeling for the Web: Graph neural networks and deep learning approaches for Web-related graphs
• Semantics and Knowledge: Methods to enhance, augment, integrate or synergize semantic models such as knowledge graphs and LLMs
• Search and Retrieval-Augmented AI: Web learning to rank, online learning, and counterfactual learning for ranking

Abstract

Graph sparsification is a key technique for improving inference efficiency in Graph Neural Networks by removing edges with minimal impact on predictions. GNN explainability methods generate local importance scores, which can be aggregated into global scores for graph sparsification. However, many explainability methods produce only non-negative scores, limiting their applicability for sparsification. In contrast, Shapley value based methods assign both positive and negative contributions to node predictions, offering a theoretically robust and fair allocation of importance by evaluating many subsets of graphs. Unlike gradient-based or perturbation-based explainers, Shapley values enable better pruning strategies that preserve influential edges while removing misleading or adversarial connections. Our approach shows that Shapley value-based graph sparsification maintains predictive performance while significantly reducing graph complexity, enhancing both interpretability and efficiency in GNN inference.

Problem

• Improving GNN inference efficiency via graph sparsification
• Overcoming non-negative score limitations in sparsification methods
• Enhancing pruning strategies using Shapley value-based importance

Innovation

• Uses Shapley values for graph sparsification
• Aggregates local importance into global scores
• Preserves influential edges, removes misleading ones