TL;DR
Grain is a novel framework that enhances data efficiency in Graph Neural Networks by integrating social influence maximization principles with diversified influence strategies, leading to better data selection performance.
Contribution
This paper introduces Grain, a new approach connecting data selection in GNNs with influence maximization, featuring a diversified influence objective and a greedy algorithm with guarantees.
Findings
Significantly improves data selection performance for GNNs.
Enhances efficiency of active learning and core-set methods.
First to connect influence maximization with data selection in GNNs.
Abstract
Data selection methods, such as active learning and core-set selection, are useful tools for improving the data efficiency of deep learning models on large-scale datasets. However, recent deep learning models have moved forward from independent and identically distributed data to graph-structured data, such as social networks, e-commerce user-item graphs, and knowledge graphs. This evolution has led to the emergence of Graph Neural Networks (GNNs) that go beyond the models existing data selection methods are designed for. Therefore, we present Grain, an efficient framework that opens up a new perspective through connecting data selection in GNNs with social influence maximization. By exploiting the common patterns of GNNs, Grain introduces a novel feature propagation concept, a diversified influence maximization objective with novel influence and diversity functions, and a greedy…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
