Advances in Graph Neural Networks and Related Challenges

The recent advancements in graph neural networks (GNNs) and related areas have shown significant progress in addressing various challenges such as oversmoothing, generalization, and robustness to noise. A notable trend is the integration of dynamical systems theory to tackle oversmoothing, leading to more stable and expressive deep GNNs. Additionally, there is a growing focus on developing adaptive and scalable solutions for feature selection in the presence of systematic missing data, which is crucial for real-world applications. Influence maximization in dynamic social networks has also seen innovative approaches, particularly in handling non-progressive influence propagation. Furthermore, the exploration of positional and structural encodings for enhancing GNNs' generalization capabilities is paving the way for potential graph foundation models. Other areas of innovation include adaptive graph mixup techniques for semi-supervised node classification and novel contrastive learning methods that reduce reliance on cross-view contrasts. Notably, some papers stand out for their contributions: 'A Dynamical Systems-Inspired Pruning Strategy for Addressing Oversmoothing in Graph Neural Networks' introduces a practical solution to oversmoothing using dynamical systems theory, and 'Towards Graph Foundation Models: A Study on the Generalization of Positional and Structural Encodings' investigates the potential of these encodings as foundational representations for graphs.

Sources

MISFEAT: Feature Selection for Subgroups with Systematic Missing Data

Covered Forest: Fine-grained generalization analysis of graph neural networks

A Dynamical Systems-Inspired Pruning Strategy for Addressing Oversmoothing in Graph Neural Networks

Non-Progressive Influence Maximization in Dynamic Social Networks

Towards Graph Foundation Models: A Study on the Generalization of Positional and Structural Encodings

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?

AGMixup: Adaptive Graph Mixup for Semi-supervised Node Classification

Mixture of Experts Meets Decoupled Message Passing: Towards General and Adaptive Node Classification

Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing

Robustness of Graph Classification: failure modes, causes, and noise-resistant loss in Graph Neural Networks

Single-View Graph Contrastive Learning with Soft Neighborhood Awareness

Opinion de-polarization of social networks with GNNs

Built with on top of