Neurodiversity Meets Colors: Does Position Awareness Destroy Generalization in Brain Graph Learning?

Matheo Angelo Pereira Dantas, Caterina Graziani, Leo Sampaio Ferraz Ribeiro, Andre Carlos Ponce de Leon Ferreira De Carvalho
Proceedings of GRaM: the Second Edition of the Workshop on Geometry-grounded Representation Learning and Generative Modeling, PMLR 326:109-134, 2026.

Abstract

Graph Neural Networks (GNNs) rely on permutation invariance to exploit symmetries in graph data using principles of Geometric Deep Learning. However, in machine learning models that process fMRI data using a brain atlas, each node corresponds to a region with its own position and neurological function. Thus, permutation invariance would make the model unaware of these aspects, causing a significant loss of biological interpretability and predictive information. For this reason, many GNN architectures opt for assigning each ROI ("Region Of Interest" in the brain) a unique node representation, either explicitly or implicitly through feature engineering, before using the graph as input for the GNN. In this theoretical study, we investigate the consequences of that choice. First, we prove that, if each ROI is explicitly identified with a unique color, it is possible to achieve perfect expressivity using a GNN with a single max-aggregation message-passing layer, which suffices to attain the maximal Rademacher complexity and very loose VC dimension’s bounds. Building on that, we derive generalization bounds based on concrete parameters of the model, such as ROI embedding dimension and atlas size, revealing ways in which this tradeoff could manifest in practice. These findings are particularly relevant in the context of fMRI graph learning, where, despite severe struggles with overfitting and data scarcity, generalization theory is still underexplored.

Cite this Paper


BibTeX
@InProceedings{pmlr-v326-angelo-pereira-dantas26a, title = {Neurodiversity Meets Colors: Does Position Awareness Destroy Generalization in Brain Graph Learning?}, author = {Angelo Pereira Dantas, Matheo and Graziani, Caterina and Sampaio Ferraz Ribeiro, Leo and Carvalho, Andre Carlos Ponce de Leon Ferreira De}, booktitle = {Proceedings of GRaM: the Second Edition of the Workshop on Geometry-grounded Representation Learning and Generative Modeling}, pages = {109--134}, year = {2026}, editor = {Pouplin, Alison and Vadgama, Sharvaree and Bekkers, Erik and Kaba, Sékou-Oumar and Lawrence, Hannah and Lecha, Manuel and Baker, Elizabeth and Suk, Julian and Walters, Robin and Tomczak, Jakub and Jegelka, Stefanie}, volume = {326}, series = {Proceedings of Machine Learning Research}, month = {26 Apr}, publisher = {PMLR}, pdf = {https://raw.githubusercontent.com/mlresearch/v326/main/assets/angelo-pereira-dantas26a/angelo-pereira-dantas26a.pdf}, url = {https://proceedings.mlr.press/v326/angelo-pereira-dantas26a.html}, abstract = {Graph Neural Networks (GNNs) rely on permutation invariance to exploit symmetries in graph data using principles of Geometric Deep Learning. However, in machine learning models that process fMRI data using a brain atlas, each node corresponds to a region with its own position and neurological function. Thus, permutation invariance would make the model unaware of these aspects, causing a significant loss of biological interpretability and predictive information. For this reason, many GNN architectures opt for assigning each ROI ("Region Of Interest" in the brain) a unique node representation, either explicitly or implicitly through feature engineering, before using the graph as input for the GNN. In this theoretical study, we investigate the consequences of that choice. First, we prove that, if each ROI is explicitly identified with a unique color, it is possible to achieve perfect expressivity using a GNN with a single max-aggregation message-passing layer, which suffices to attain the maximal Rademacher complexity and very loose VC dimension’s bounds. Building on that, we derive generalization bounds based on concrete parameters of the model, such as ROI embedding dimension and atlas size, revealing ways in which this tradeoff could manifest in practice. These findings are particularly relevant in the context of fMRI graph learning, where, despite severe struggles with overfitting and data scarcity, generalization theory is still underexplored.} }
Endnote
%0 Conference Paper %T Neurodiversity Meets Colors: Does Position Awareness Destroy Generalization in Brain Graph Learning? %A Matheo Angelo Pereira Dantas %A Caterina Graziani %A Leo Sampaio Ferraz Ribeiro %A Andre Carlos Ponce de Leon Ferreira De Carvalho %B Proceedings of GRaM: the Second Edition of the Workshop on Geometry-grounded Representation Learning and Generative Modeling %C Proceedings of Machine Learning Research %D 2026 %E Alison Pouplin %E Sharvaree Vadgama %E Erik Bekkers %E Sékou-Oumar Kaba %E Hannah Lawrence %E Manuel Lecha %E Elizabeth Baker %E Julian Suk %E Robin Walters %E Jakub Tomczak %E Stefanie Jegelka %F pmlr-v326-angelo-pereira-dantas26a %I PMLR %P 109--134 %U https://proceedings.mlr.press/v326/angelo-pereira-dantas26a.html %V 326 %X Graph Neural Networks (GNNs) rely on permutation invariance to exploit symmetries in graph data using principles of Geometric Deep Learning. However, in machine learning models that process fMRI data using a brain atlas, each node corresponds to a region with its own position and neurological function. Thus, permutation invariance would make the model unaware of these aspects, causing a significant loss of biological interpretability and predictive information. For this reason, many GNN architectures opt for assigning each ROI ("Region Of Interest" in the brain) a unique node representation, either explicitly or implicitly through feature engineering, before using the graph as input for the GNN. In this theoretical study, we investigate the consequences of that choice. First, we prove that, if each ROI is explicitly identified with a unique color, it is possible to achieve perfect expressivity using a GNN with a single max-aggregation message-passing layer, which suffices to attain the maximal Rademacher complexity and very loose VC dimension’s bounds. Building on that, we derive generalization bounds based on concrete parameters of the model, such as ROI embedding dimension and atlas size, revealing ways in which this tradeoff could manifest in practice. These findings are particularly relevant in the context of fMRI graph learning, where, despite severe struggles with overfitting and data scarcity, generalization theory is still underexplored.
APA
Angelo Pereira Dantas, M., Graziani, C., Sampaio Ferraz Ribeiro, L. & Carvalho, A.C.P.d.L.F.D.. (2026). Neurodiversity Meets Colors: Does Position Awareness Destroy Generalization in Brain Graph Learning?. Proceedings of GRaM: the Second Edition of the Workshop on Geometry-grounded Representation Learning and Generative Modeling, in Proceedings of Machine Learning Research 326:109-134 Available from https://proceedings.mlr.press/v326/angelo-pereira-dantas26a.html.

Related Material