Pith. sign in

REVIEW

Pruning Graph Convolutional Networks to select meaningful graph frequencies for fMRI decoding

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2203.04455 v1 pith:NWKAWM5L submitted 2022-03-09 cs.LG eess.SP

classification cs.LGeess.SP
keywords graphfmrifrequenciesdecodingbrainpruningsignalswork
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Graph Signal Processing is a promising framework to manipulate brain signals as it allows to encompass the spatial dependencies between the activity in regions of interest in the brain. In this work, we are interested in better understanding what are the graph frequencies that are the most useful to decode fMRI signals. To this end, we introduce a deep learning architecture and adapt a pruning methodology to automatically identify such frequencies. We experiment with various datasets, architectures and graphs, and show that low graph frequencies are consistently identified as the most important for fMRI decoding, with a stronger contribution for the functional graph over the structural one. We believe that this work provides novel insights on how graph-based methods can be deployed to increase fMRI decoding accuracy and interpretability.

Discussion (0). Sign in to comment.

Pith tools