On the Unreasonable Effectiveness of Feature propagation in Learning on Graphs with Missing Node Features

Understand

While Graph Neural Networks (GNNs) have recently become the de facto standard for modeling relational data, they impose a strong assumption on the availability of the node or edge features of the graph.

• In many real-world applications, however, features are only partially available; for example, in social networks, age and gender are available only for a small subset of users.
• We present a general approach for handling missing features in graph machine learning applications that is based on minimization of the Dirichlet energy and leads to a diffusion-type differential equation on the graph.
• The discretization of this equation produces a simple, fast and scalable algorithm which we call Feature Propagation.