dorsal/arxiv
View SchemaDynamic Graph Structure Learning via Resistance Curvature Flow
| Authors | Chaoqun Fei, Huanjiang Liu, Tinglve Zhou, Yangyang Li, Tianyong Hao |
|---|---|
| Categories | |
| ArXiv ID | 2601.08149vv1 |
| URL | https://arxiv.org/abs/2601.08149 |
| License | http://creativecommons.org/licenses/by/4.0/ |
Abstract
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.
{
"annotation_id": "3c96e4cc-82b6-4783-a915-ff1d422dc8c2",
"date_created": "2026-02-17T05:53:15.102000Z",
"date_modified": "2026-02-17T05:53:15.102000Z",
"file_hash": "75eb30cb9c9b08edfeab08e76952c94dee1942b204a949a841665f2f1464a427",
"private": false,
"record": {
"abstract": "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\u0027s 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.",
"arxiv_id": "2601.08149",
"authors": [
"Chaoqun Fei",
"Huanjiang Liu",
"Tinglve Zhou",
"Yangyang Li",
"Tianyong Hao"
],
"categories": [
"cs.LG",
"cs.AI"
],
"license": "http://creativecommons.org/licenses/by/4.0/",
"title": "Dynamic Graph Structure Learning via Resistance Curvature Flow",
"url": "https://arxiv.org/abs/2601.08149",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "54965e5f-701e-4c4a-8212-1f6ed896c219",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}