提出自适应对比学习方法,高效学习脑连接网络的边表示。
Contrastive Network Representation Learning
- 基于增强网络对的对比学习与自适应随机掩码机制
- 理论证明达到最优收敛率,真实数据上优于传统方法
- 适合高维稀疏脑网络分析,可提升分类与社区检测效果
网络表示学习旨在将网络嵌入低维空间以保留其结构与语义特性,从而支持分类、特征预测、边识别和社区检测等下游任务。针对脑连接数据中存在个体特异性、高维稀疏且缺乏节点或边协变量的挑战,本文提出一种基于对比学习的统计方法——自适应对比边表示学习(ACERL)。该方法结合了增强网络对的对比学习与数据驱动的自适应随机掩码机制。我们建立了非渐近误差界,证明所提方法在边表示学习中达到极小极大最优收敛速率。进一步在多个下游任务中验证了所学表示的有效性,包括网络分类、重要边检测和社区检测,并给出相应理论保证。通过合成数据与真实脑连接研究验证,本方法性能优于稀疏主成分分析基线方法。
原文摘要 · Abstract (English)
Network representation learning seeks to embed networks into a low-dimensional space while preserving the structural and semantic properties, thereby facilitating downstream tasks such as classification, trait prediction, edge identification, and community detection. Motivated by challenges in brain connectivity data analysis that is characterized by subject-specific, high-dimensional, and sparse networks that lack node or edge covariates, we propose a novel contrastive learning-based statistical approach for network edge embedding, which we name as Adaptive Contrastive Edge Representation Learning (ACERL). It builds on two key components: contrastive learning of augmented network pairs, and a data-driven adaptive random masking mechanism. We establish the non-asymptotic error bounds, and show that our method achieves the minimax optimal convergence rate for edge representation learning. We further demonstrate the applicability of the learned representation in multiple downstream tasks, including network classification, important edge detection, and community detection, and establish the corresponding theoretical guarantees. We validate our method through both synthetic data and real brain connectivities studies, and show its competitive performance compared to the baseline method of sparse principal components analysis.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。