arXiv:2601.08149cs.LGcs.AI2026-01

用电路有效电阻加速图结构优化,100倍提速还保持高精度。

Dynamic Graph Structure Learning via Resistance Curvature Flow

  • 基于电路有效电阻重构图边权重,替代昂贵的最优传输计算。
  • 在多个数据集上实现超过100倍速度提升,性能媲美传统方法。
  • 适合大规模数据的动态图学习与深度模型集成场景。

几何表示学习旨在通过离散图结构近似高维数据的非欧几里得拓扑,遵循流形假设。然而,依赖欧氏距离的静态图构建方法难以捕捉数据流形的内在曲率特征。尽管奥利维耶-里奇曲率流(OCF)已被证明是动态拓扑优化的强大工具,但其核心依赖最优传输(沃尔瑟斯坦距离)导致计算复杂度极高,严重限制了其在大规模数据集和深度学习框架中的应用。为此,本文提出一种新型几何演化框架:电阻曲率流(RCF)。利用电路物理中的有效电阻概念,RCF将昂贵的曲率优化转化为高效的矩阵运算,实现了超过100倍的计算加速,同时保持与OCF相当的几何优化能力。我们深入探讨了RCF的理论基础与动态机制,阐明其如何通过曲率梯度引导边权重重分配,消除拓扑噪声并强化局部聚类结构。此外,我们揭示了RCF在流形增强与噪声抑制中的机理,并验证其与深度学习模型的兼容性。基于该框架,设计了图优化算法DGSL-RCF。在深度度量学习、流形学习与图结构学习任务上的实验表明,DGSL-RCF显著提升了表示质量与下游任务性能。

原文摘要 · Abstract (English)

Geometric Representation Learning (GRL) aims to approximate the non-Euclidean topology of high-dimensional data through discrete graph structures, grounded in the manifold hypothesis. However, traditional static graph construction methods based on Euclidean distance often fail to capture the intrinsic curvature characteristics of the data manifold. Although Ollivier-Ricci Curvature Flow (OCF) has proven to be a powerful tool for dynamic topological optimization, its core reliance on Optimal Transport (Wasserstein distance) leads to prohibitive computational complexity, severely limiting its application in large-scale datasets and deep learning frameworks. To break this bottleneck, this paper proposes a novel geometric evolution framework: Resistance Curvature Flow (RCF). Leveraging the concept of effective resistance from circuit physics, RCF transforms expensive curvature optimization into efficient matrix operations. This approach achieves over 100x computational acceleration while maintaining geometric optimization capabilities comparable to OCF. We provide an in-depth exploration of the theoretical foundations and dynamical principles of RCF, elucidating how it guides the redistribution of edge weights via curvature gradients to eliminate topological noise and strengthen local cluster structures. Furthermore, we provide a mechanistic explanation of RCF's role in manifold enhancement and noise suppression, as well as its compatibility with deep learning models. We design a graph optimization algorithm, DGSL-RCF, based on this framework. Experimental results across deep metric learning, manifold learning, and graph structure learning demonstrate that DGSL-RCF significantly improves representation quality and downstream task performance.

图神经网络几何学习动态图加速计算

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。