Table of Contents
Fetching ...

TouchUp-G: Improving Feature Representation through Graph-Centric Finetuning

Jing Zhu, Xiang Song, Vassilis N. Ioannidis, Danai Koutra, Christos Faloutsos

TL;DR

This work tackles the problem that features from pretrained models are often graph-structure agnostic, limiting GNN performance on downstream tasks. It introduces TouchUp-G, a Detect & Correct framework that first quantifies feature-structure alignment with a novel feature homophily score $h_f$ and then refines PM features via graph-centric finetuning with a negative-sampling loss $L_{struct}$. The approach is general and multimodal, achieving state-of-the-art or competitive results on four real-world datasets spanning text and image modalities, while significantly increasing $h_f$ (by over 2x) and demonstrating robust improvements in both link prediction and node classification. By explicitly aligning node representations with graph topology, TouchUp-G enhances the usefulness of PM features for GNNs, enabling better performance without task-specific domain adaptations.

Abstract

How can we enhance the node features acquired from Pretrained Models (PMs) to better suit downstream graph learning tasks? Graph Neural Networks (GNNs) have become the state-of-the-art approach for many high-impact, real-world graph applications. For feature-rich graphs, a prevalent practice involves utilizing a PM directly to generate features, without incorporating any domain adaptation techniques. Nevertheless, this practice is suboptimal because the node features extracted from PM are graph-agnostic and prevent GNNs from fully utilizing the potential correlations between the graph structure and node features, leading to a decline in GNNs performance. In this work, we seek to improve the node features obtained from a PM for downstream graph tasks and introduce TOUCHUP-G, which has several advantages. It is (a) General: applicable to any downstream graph task, including link prediction which is often employed in recommender systems; (b) Multi-modal: able to improve raw features of any modality (e.g. images, texts, audio); (c) Principled: it is closely related to a novel metric, feature homophily, which we propose to quantify the potential correlations between the graph structure and node features and we show that TOUCHUP-G can effectively shrink the discrepancy between the graph structure and node features; (d) Effective: achieving state-of-the-art results on four real-world datasets spanning different tasks and modalities.

TouchUp-G: Improving Feature Representation through Graph-Centric Finetuning

TL;DR

This work tackles the problem that features from pretrained models are often graph-structure agnostic, limiting GNN performance on downstream tasks. It introduces TouchUp-G, a Detect & Correct framework that first quantifies feature-structure alignment with a novel feature homophily score and then refines PM features via graph-centric finetuning with a negative-sampling loss . The approach is general and multimodal, achieving state-of-the-art or competitive results on four real-world datasets spanning text and image modalities, while significantly increasing (by over 2x) and demonstrating robust improvements in both link prediction and node classification. By explicitly aligning node representations with graph topology, TouchUp-G enhances the usefulness of PM features for GNNs, enabling better performance without task-specific domain adaptations.

Abstract

How can we enhance the node features acquired from Pretrained Models (PMs) to better suit downstream graph learning tasks? Graph Neural Networks (GNNs) have become the state-of-the-art approach for many high-impact, real-world graph applications. For feature-rich graphs, a prevalent practice involves utilizing a PM directly to generate features, without incorporating any domain adaptation techniques. Nevertheless, this practice is suboptimal because the node features extracted from PM are graph-agnostic and prevent GNNs from fully utilizing the potential correlations between the graph structure and node features, leading to a decline in GNNs performance. In this work, we seek to improve the node features obtained from a PM for downstream graph tasks and introduce TOUCHUP-G, which has several advantages. It is (a) General: applicable to any downstream graph task, including link prediction which is often employed in recommender systems; (b) Multi-modal: able to improve raw features of any modality (e.g. images, texts, audio); (c) Principled: it is closely related to a novel metric, feature homophily, which we propose to quantify the potential correlations between the graph structure and node features and we show that TOUCHUP-G can effectively shrink the discrepancy between the graph structure and node features; (d) Effective: achieving state-of-the-art results on four real-world datasets spanning different tasks and modalities.
Paper Structure (11 sections, 2 equations, 5 figures, 4 tables)

This paper contains 11 sections, 2 equations, 5 figures, 4 tables.

Figures (5)

  • Figure 1: TouchUp-G wins: (a) Compared with features obtained directly from PMs (BERT devlin2018bert or ViT dosovitskiy2020image), TouchUp-G improves the quantitative performance by more than 25$\%$ across datasets and modalities. (b) Examples from the Amazon co-purchasing graph (Amazon-CP) show that TouchUp-G correctly predicts the ground truth while ViT+ fails.
  • Figure 2: Why pretrained features may fail: We show a subgraph of Amazon Co-purchasing graph (Amazon-CP). Products possessing disparate visual features are often bought together.
  • Figure 3: Example graphs that exhibit (a) strong positive and (b) strong negative correlation between features and structure. (a): All linked nodes have the same features; (b): All linked nodes have complementary features.
  • Figure 4: Overview of TouchUp-G. [Top, ] A PM devlin2018bertdosovitskiy2020image is used to extract features from raw text or images, and then GNNs are trained upon the extracted features. [Bottom, ] We propose graph-centric finetuning on PMs to correct the discrepancy between features and the structure.
  • Figure 5: TouchUp-G is General: Node classification Results. TouchUp-G does not use any node label information during training. However, we obtain comparable performance compared with baselines explicitly finetuned on node labels zhao2022learning.

Theorems & Definitions (1)

  • Definition 1: Feature homophily