DisRFM:极坐标黎曼流匹配用于结构保持的图域适应
DisRFM: Polar Riemannian Flow Matching for Structure-Preserving Graph Domain Adaptation
AI总结:
本文提出DisRFM框架,通过黎曼流匹配解决图域适应中的结构退化和优化不稳定问题,利用极坐标表示和几何感知学习提升跨域分类性能。
摘要:
图域适应(GDA)旨在跨域转移图分类器,同时处理语义和拓扑变化。现有欧几里得对抗方法面临两个挑战:结构退化,即域混淆纠缠并抑制标签相关的拓扑;优化不稳定,即minimax训练在大结构变化下导致梯度震荡。本文提出DisRFM,一种几何感知的GDA框架,通过黎曼表示学习和流基于运输解决这些挑战。DisRFM将图表示嵌入常曲率流形并在测地极坐标中表示。极端点正则化通过单变量Wasserstein对齐校准拓扑敏感的径向尺度,并通过置信度过滤的角对齐保持尺度标准化的类别语义,径向幅度调节伪标签可靠性。DisRFM引入拓扑条件的极坐标流匹配,通过归一化极坐标运输成本耦合类别兼容的源和目标样本,并沿测地插值路径学习度量校正的向量场。理论分析刻画了无条件域混淆的结构风险,并将极坐标差异和流误差与目标风险相关联。在多种域变化下的广泛实验表明,DisRFM一致优于最先进方法。
英文摘要:
Graph Domain Adaptation (GDA) aims to transfer graph classifiers across domains with both semantic and topological shifts. Existing Euclidean adversarial methods face two challenges: Structural Degeneration, where domain confusion entangles and suppresses label-relevant topology, and Optimization Instability, where minimax training induces oscillatory gradients under large structural shifts. We propose DisRFM, a geometry-aware GDA framework that addresses these challenges with Riemannian representation learning and flow-based transport. DisRFM embeds graph representations on a constant-curvature manifold and expresses them in geodesic polar coordinates. Polar endpoint regularization calibrates topologysensitive radial scales via univariate Wasserstein alignment and preserves scalenormalized class semantics through confidence-filtered angular alignment, with radial magnitude modulating pseudo-label reliability. DisRFM introduces topologyconditioned polar flow matching, which couples class-compatible source and target samples by a normalized polar transport cost and learns a metric-corrected vector field along geodesic interpolants. Theoretical analysis characterizes the structural risk of unconditional domain confusion and relates polar discrepancies and flow error to target risk. Extensive experiments under diverse domain shifts demonstrate that DisRFM consistently outperforms state-of-the-art methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。