Measuring the Influence of Modality-Specific Node Representations on Graphs
cs.SI, cs.LG, cs.MM
Submitted: 2026-08-17
Updated: 2026-08-17
License: http://creativecommons.org/licenses/by-nc-sa/4.0/
The gist: Multimodal attributed graphs combine graph structure with node text and image representations in recommendation and multimedia analysis.
Abstract
Multimodal attributed graphs combine graph structure with node text and image representations in recommendation and multimedia analysis. Graph predictors propagate these representations across connected nodes, so one input can change predictions at its own and nearby nodes. Measuring this distributed response reveals which modality-specific inputs a trained model relies on and how predictor design changes that reliance. We study influence measurement for modality-specific node representations. Given an encoded graph, a trained predictor, a training split, and fixed candidate representations, the task outputs one influence score per candidate and separate text and image rankings. We score a candidate by replacing it with its modality's training-node mean and comparing the original and changed predictions. Existing feature attribution and data valuation generally target one output, training examples, whole nodes, or graph elements rather than prediction changes across graph nodes. Our empirical study shows that nearby-node responses contain information missed by source-only scores and simple proxies, while response magnitude alone does not identify which class changes support the task. Guided by these observations, we propose MoGI (Modality-specific Graph Influence). It propagates training labels to define task direction, reads the same replacement response for the favored class and full class distribution, and averages the resulting ranks. MoGI requires no predictor retraining or learned scoring parameters. Under a shared five-dataset, eight-predictor benchmark, it achieves the largest aggregate held-out loss increase against all five external methods at every tested ranking cutoff.
Related papers
- Linking Scalar-Intensity Language to Structural Polarization with Validated Signed-Network Measures
- Detection and Characterization of Coordinated Online Behavior: A Survey
- Omega-N: Interpretable Structural Node Descriptors and Their Applicability Domain
- Semantic Communities and Boundary-Spanning Lyrics in K-pop: A Graph-Based Unsupervised Analysis
- Simplify to Amplify: Achieving Information-Theoretic Bounds with Fewer Steps in Spectral Community Detection
- Transmission Neural Networks: Inhibitory and Excitatory Connections