Pith. sign in

REVIEW 1 cited by

DynDepNet: Learning Time-Varying Dependency Structures from fMRI Data via Dynamic Graph Structure Learning

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 2209.13513 v3 pith:RC6F5FES submitted 2022-09-27 cs.LG stat.APstat.ML

classification cs.LGstat.APstat.ML
keywords brainfmrigraphsdatalearningdyndepnetgraphstructure
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Graph neural networks (GNNs) have demonstrated success in learning representations of brain graphs derived from functional magnetic resonance imaging (fMRI) data. However, existing GNN methods assume brain graphs are static over time and the graph adjacency matrix is known prior to model training. These assumptions contradict evidence that brain graphs are time-varying with a connectivity structure that depends on the choice of functional connectivity measure. Incorrectly representing fMRI data with noisy brain graphs can adversely affect GNN performance. To address this, we propose DynDepNet, a novel method for learning the optimal time-varying dependency structure of fMRI data induced by downstream prediction tasks. Experiments on real-world fMRI datasets, for the task of sex classification, demonstrate that DynDepNet achieves state-of-the-art results, outperforming the best baseline in terms of accuracy by approximately 8 and 6 percentage points, respectively. Furthermore, analysis of the learned dynamic graphs reveals prediction-related brain regions consistent with existing neuroscience literature.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. When GNNs Fail: Quantifying and Overcoming Temporal Correlation Volatility in Time Series

    cs.LG 2026-08 reject novelty 5.0 of 10

    This paper introduces a temporal correlation volatility metric, shows that graph and transformer forecasters fail when it is high, and proposes a GNN layer with path-based and static/dynamic separated propagation that...

Pith tools