Distribution Matching for Graph Quantification Under Structural Covariate Shift
Clemens Damke, Eyke H\"ullermeier

TL;DR
This paper introduces a novel graph quantification method that effectively addresses structural covariate shifts by extending importance sampling techniques, outperforming existing approaches in estimating label distributions across different graph regions.
Contribution
The paper extends importance sampling to the KDEy quantification approach, enabling better adaptation to structural shifts in graph data.
Findings
Proposed method outperforms standard quantification approaches.
Effectively adapts to structural covariate shifts.
Improves label distribution estimation in graphs.
Abstract
Graphs are commonly used in machine learning to model relationships between instances. Consider the task of predicting the political preferences of users in a social network; to solve this task one should consider, both, the features of each individual user and the relationships between them. However, oftentimes one is not interested in the label of a single instance but rather in the distribution of labels over a set of instances; e.g., when predicting the political preferences of users, the overall prevalence of a given opinion might be of higher interest than the opinion of a specific person. This label prevalence estimation task is commonly referred to as quantification learning (QL). Current QL methods for tabular data are typically based on the so-called prior probability shift (PPS) assumption which states that the label-conditional instance distributions should remain equal…
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 · Sentiment Analysis and Opinion Mining · Bayesian Modeling and Causal Inference
