arXiv Machine Learning By Yash Arya, Sang Hoon Lee

Effects of relational graph modularity and depth on the learning performance of neural networks

Read the original on arXiv Machine Learning →

arXiv:2507. 10005v2 Announce Type: replace Abstract: In recent years, graph-based machine learning techniques, such as reinforcement learning and graph neural networks, have garnered significant attention.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Aug 5

Learning and Clustering on Temporal Graphs: Principles, Primitives, and Pooling

arXiv:2608. 03696v1 Announce Type: new Abstract: This work focuses on the problem of learning on temporal graphs, with particular emphasis on the task of clustering: obtaining coarse-grained representations by aggregating information from nodes, edges, and temporal dynamics - a task related to pooling in machine learning on graphs, or community detection in network science.

By Nelson Aloysio Reis de Almeida Passos, Emanuele Carlini, Salvatore Trani
arXiv Machine Learning
Sep 10

Not Just Oversmoothing: Detecting the Echo Chamber Effect in Graph Neural Networks

The paper introduces the Echo Chamber Effect, a failure mode in Graph Neural Networks where intra-community representations collapse while inter-community separation remains, differing from traditional oversmoothing. It proposes the Echo Chamber Index (ECI) to detect this effect by stratifying pairwise distances by community membership. Building on this analysis, the authors present Community-Aware Split Propagation (CASP), a lightweight plugin that decouples intra- and inter-community aggregation and learns their balance from label structure, improving performance across various GNN backbones in both homophilic and heterophilic settings.

By Asela Hevapathige, Ahad N. Zehmakan, Asiri Wijesinghe, Saman Halgamuge
arXiv Machine Learning
Sep 11

SynCo: Synthetic Community-Aware Attributed Graph Generator for Graph Neural Network Benchmarking

SynCo is a synthetic graph generator that lets users control node degree distributions and sub‑community structures, addressing limitations of existing generators that rely on power‑law distributions and lack flexibility. It is evaluated on graph mimicking, hyperparameter tuning, and node clustering, outperforming state‑of‑the‑art methods while preserving original data distributions. SynCo can generate large graphs with up to 2.1 million nodes.

By Guilherme Henrique Messias, Mariana Caravanti de Souza, Sylvia Iasulaitis, Alan Dem\'etrius Baria Valejo