Skip to content

Commit fdfaf87

Browse files
authored
Update page.mdx
1 parent 4f231aa commit fdfaf87

File tree

1 file changed

+51
-0
lines changed

1 file changed

+51
-0
lines changed

app/projects/dtgb/page.mdx

Lines changed: 51 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1 +1,52 @@
11

2+
import { Authors, Badges } from '@/components/utils'
3+
4+
# DTGB: A Comprehensive Benchmark for Dynamic Text-Attributed Graphs
5+
6+
<Authors
7+
authors="Weikang Qiu, Yale University; Huangrui Chu, Yale University; Selena Wang, Yale University; Haolan Zuo, Yale University; Xiaoxiao Li, University of British Columbia; Rex Ying, Yale University"
8+
/>
9+
10+
<Badges
11+
venue="ICML 2024"
12+
github="https://github.com/Graph-and-Geometric-Learning/HyBRiD"
13+
arxiv="https://arxiv.org/abs/2312.02203"
14+
pdf="https://arxiv.org/pdf/2312.02203"
15+
/>
16+
17+
18+
## Introduction
19+
Discovering reliable and informative relationships among brain regions from functional magnetic resonance imaging (fMRI) signals is essential in phenotypic predictions. Most of the current methods fail to accurately characterize those interactions because they only focus on pairwise connections and overlook the high-order relationships of brain regions. We propose that these high-order relationships should be maximally informative and minimally redundant (MIMR). However, identifying such high-order relationships is challenging and under-explored due to the exponential search space and the absence of a tractable objective. In response to this gap, we propose a novel method named **HyBRiD** which aims to extract MIMR high-order relationships from fMRI data. **HyBRiD** employs a **CONSTRUCTOR** to identify hyperedge structures, and a **WEIGHTER** to compute a weight for each hyperedge, which avoids searching in exponential space. **HyBRiD** achieves the MIMR objective through an innovative information bottleneck framework named multi-head drop-bottleneck with theoretical guarantees. Our comprehensive experiments demonstrate the effectiveness of our model. Our model outperforms the state-of-the-art predictive model by an average of $11.2\%$, regarding the quality of hyperedges measured by CPM, a standard protocol for studying brain connections.
20+
21+
22+
## Method
23+
We propose to use information bottleneck to learn the high-order relationships.
24+
$$
25+
\arg \max I(H ; Y)-\beta I(H ; X)
26+
$$
27+
where $H$ is the high-order relationships, $X$ is the input fMRI data, and $Y$ is the phenotypic outcome (e.g. IQ score). The first term ensures that the learned high-order relationships are informative towards the outcome, while the second term ensures that the learned structure is succinct and non-redundant.
28+
29+
However, existing tractable approximations of information bottleneck do not apply to high-order relationships. In response of this, we propose *multi-head drop-bottleneck*, which takes the following form:
30+
31+
$$
32+
\mathbb{H}[Y]+\mathbb{E}_{p(Y, H)}\left[\log q_\phi(Y \mid H)\right] - \sum_{k=1}^K \sum_{i=1}^N \mathbb{H}\left[X_i\right]\left(1-p_{\theta, i}^k\right)
33+
$$
34+
35+
36+
To instantiate the theoretical framework, we propose the following architecture
37+
38+
![The architecture overview of HyBRiD.|scale=0.5](./assets/arch.png)
39+
40+
The model consists of two main components: the **CONSTRUCTOR** and the **WEIGHTER** when the number of nodes $N = 6$ and the number of hyperedges $K = 3$. At a high level, the **CONSTRUCTOR** learns the hyperedge structure by masking nodes. The **WEIGHTER** computes the weight of each hyperedge based on the hyperedge's member nodes and their features.
41+
42+
## Experiments
43+
### Predictive Performance of Learned High-Order Relationships
44+
We evaluate the predictive performance of learned high-order relationships on two datasets: Autism Brain Imaging Data Exchange (ABIDE) and Adolescent Brain Cognitive Development (ABCD). We use the $r$ value from the CPM protocol as the evaluation metric.
45+
![Predictive perfomance on ABIDE.|scale=0.5](./assets/abide.png)
46+
![Predictive performance on ABCD.](./assets/abcd.png)
47+
48+
### Further Analysis
49+
![Analysis of learned high-order relationships.](./assets/plot.png)
50+
- (a) We find there are two distinct clusters in the figure. The first cluster is hyperedges with degree ≤ 5. 1-degree and 2-degree hyperedges are special cases of our method: 1-degree hyperedges are individual nodes, which imply the contribution of individual regions to the cognition. 2-degree hyperedges reveal the importance of traditional pairwise connectivity. The other cluster concentrates around degree 25, which implies the importance of relationships of multiple regions.
51+
- (b) We find a strong positive correlation between a hyperedge's degree and its significance, which indicates that interactions of multiple brain regions play more important roles in cognition than pairwise or individual ones. It is also worth mentioning that there is a turning point around degree 5, which corresponds to the valley around 5 in (a).
52+
- (c) We find out that the learned hyperedges are much more significant than traditional pairwise ones.

0 commit comments

Comments
 (0)