针对网络数据依赖性,提出基于图卷积的迁移学习框架,提升小样本预测效果。
Transfer Learning Under High-Dimensional Network Convolutional Regression Model
- 用网络卷积回归建模节点与邻居特征依赖关系
- 在真实微博数据上,标签少时预测准确率显著提升
- 可自动识别有用源域,适合网络结构数据迁移任务
迁移学习通过利用相关领域的知识提升模型性能,尤其在标签数据稀缺时优势明显。现有研究多关注独立数据下的分布偏移问题,但对网络化数据中的依赖关系处理仍具挑战。为此,我们提出一种基于网络卷积回归(NCR)的高维迁移学习框架,受图卷积网络(GCNs)启发。NCR模型通过允许每个节点响应依赖于自身特征及其邻居聚合特征,有效捕捉局部依赖。方法包含两步迁移算法,用于处理源域与目标域间的网络分布偏移,并设计源域检测机制以识别信息丰富的源。理论分析基于Erdos-Renyi随机图模型,证明当存在信息源时,迁移学习可加快Lasso估计器的收敛速度。实证评估包括模拟实验与基于Sina Weibo的真实数据应用,结果表明在目标域标签数据有限时,预测精度有显著提升。
原文摘要 · Abstract (English)
Transfer learning enhances model performance by utilizing knowledge from related domains, particularly when labeled data is scarce. While existing research addresses transfer learning under various distribution shifts in independent settings, handling dependencies in networked data remains challenging. To address this challenge, we propose a high-dimensional transfer learning framework based on network convolutional regression (NCR), inspired by the success of graph convolutional networks (GCNs). The NCR model incorporates random network structure by allowing each node's response to depend on its features and the aggregated features of its neighbors, capturing local dependencies effectively. Our methodology includes a two-step transfer learning algorithm that addresses domain shift between source and target networks, along with a source detection mechanism to identify informative domains. Theoretically, we analyze the lasso estimator in the context of a random graph based on the Erdos-Renyi model assumption, demonstrating that transfer learning improves convergence rates when informative sources are present. Empirical evaluations, including simulations and a real-world application using Sina Weibo data, demonstrate substantial improvements in prediction accuracy, particularly when labeled data in the target domain is limited.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。