Transfer Learning on Edge Connecting Probability Estimation Under Graphon Model

Yuyao Wang, Yu-Hung Cheng, Debarghya Mukherjee, Huimin Cheng

Keywords: Graphon Estimation, Transfer Learning, Gromov-Wasserstein Transport, Neighborhood Smoothing, Adaptive Debiasing

TL;DR: We propose GTrans, a transfer learning framework that enhances graphon estimation for small graphs via neighborhood smoothing, Gromov-Wasserstein transport, and adaptive debiasing, boosting link prediction and graph classification.

Abstract: Graphon models provide a flexible nonparametric framework for estimating latent connectivity probabilities in networks, enabling a range of downstream applications such as link prediction and data augmentation. However, accurate graphon estimation typically requires a large graph, whereas in practice, one often only observes a small-sized network. One approach to addressing this issue is to adopt a transfer learning framework, which aims to improve estimation in a small target graph by leveraging structural information from a larger, related source graph. In this paper, we propose a novel method, namely GTRANS, a transfer learning framework that integrates neighborhood smoothing and Gromov-Wasserstein optimal transport to align and transfer structural patterns between graphs. To prevent negative transfer, GTRANS includes an adaptive debiasing mechanism that identifies and corrects for target-specific deviations via residual smoothing. We provide theoretical guarantees on the stability of the estimated alignment matrix and demonstrate the effectiveness of GTRANS in improving the accuracy of target graph estimation through extensive synthetic and real data experiments. These improvements translate directly to enhanced performance in downstream applications, such as the graph classification task and the link prediction task.

Primary Area: General machine learning (supervised, unsupervised, online, active, etc.)

Submission Number: 23637