Disentangled Structural and Featural Representation for Task-Agnostic Graph Valuation
Ali Falahati, Mohammad Mohammadi Amiri

TL;DR
This paper introduces a task-agnostic framework for evaluating graph data by disentangling structural and featural components, using graph matching and Wasserstein distance to quantify disparities without relying on task-specific metrics.
Contribution
It proposes a novel blind message passing framework that aligns graphs via shared node permutation and measures structural and featural differences for data valuation.
Findings
Effective in capturing relevance and diversity of graph datasets
Accurately quantifies structural disparities using graph Wasserstein distance
Demonstrates practical applicability on real-world datasets
Abstract
With the emergence of data marketplaces, the demand for methods to assess the value of data has increased significantly. While numerous techniques have been proposed for this purpose, none have specifically addressed graphs as the main data modality. Graphs are widely used across various fields, ranging from chemical molecules to social networks. In this study, we break down graphs into two main components: structural and featural, and we focus on evaluating data without relying on specific task-related metrics, making it applicable in practical scenarios where validation requirements may be lacking. We introduce a novel framework called blind message passing, which aligns the seller's and buyer's graphs using a shared node permutation based on graph matching. This allows us to utilize the graph Wasserstein distance to quantify the differences in the structural distribution of graph…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Graph Theory and Algorithms
MethodsFocus
