arXiv:2510.19384cs.LG2025-10被引 2

动态调整图文对齐策略,让模型在噪声中仍能高效学习图文本关系。

Learning Noise-Resilient and Transferable Graph-Text Alignment via Dynamic Quality Assessment

  • 根据数据质量动态切换多对多与一对一匹配模式
  • 在9个数据集上实现零样本分类等任务的最优表现
  • 适合需要抗噪和快速预训练的工业级图文本应用

在文本属性图(TAGs)上预训练图基础模型(GFMs)是搜索、推荐和知识发现等网络规模应用的核心。然而,现有类似CLIP的图-文对齐方法存在两大局限:一是假设节点与文本间存在严格的一一对应关系,忽略了真实图中普遍存在的多对多关系;二是依赖静态对齐目标,无法适应不同数据质量,导致在噪声监督下表现脆弱。这引发一个核心矛盾:采用灵活的多对多对齐会放大噪声,回归严格的一一对应又损失语义多样性且无法处理本就不匹配的对。为此,我们提出ADAligner,一种动态、质量感知的图-文对齐框架,根据监督质量实时调整从表达性强的多对多到保守的一对一对齐策略。该框架实时估计批次级别的对齐可靠性,并相应调整优化过程:当监督清晰时促进软性的子图级多对多对齐;在噪声环境下则通过动态过滤低置信度对强调可靠的一对一对齐。理论上,我们证明该动态机制形成稳定的负反馈过程,保障收敛与鲁棒性。在九个多样化的TAG数据集上的全面实验表明,ADAligner在零样本/少样本节点分类、链接预测和跨模态检索任务上均持续优于现有图-文对齐方法,具备强噪声鲁棒性,并比多模态基线加速约2至3倍,为真实网络环境中的图-文表征学习建立可扩展、可靠的范式。

原文摘要 · Abstract (English)

Pre-training Graph Foundation Models (GFMs) on text-attributed graphs (TAGs) is central to web-scale applications such as search, recommendation, and knowledge discovery. However, existing CLIP-style graph-text aligners face two key limitations: they assume strict one-to-one correspondences between nodes and texts, overlooking the inherent many-to-many relations in real-world graphs; and they rely on static alignment objectives that cannot adapt to varying data quality, making them brittle under noisy supervision. Together, these limitations expose a core dilemma: embracing expressive many-to-many alignment amplifies noise, while reverting to strict one-to-one strategies sacrifices semantic diversity and fails to handle inherently mismatched pairs. To address these challenges, we propose ADAligner, a dynamic, quality-aware graph-text alignment framework that dynamically adjusts between expressive many-to-many and conservative one-to-one objectives according to supervision quality. ADAligner estimates batch-level alignment reliability in real time and adapts its optimization accordingly, promoting soft, subgraph-level many-to-many alignment when supervision is clean, while emphasizing reliable one-to-one alignment by dynamically filtering low-confidence pairs under noise. Theoretically, we prove that this dynamic mechanism forms a stable negative feedback process, ensuring convergence and robustness. Comprehensive experiments on nine diverse TAG datasets demonstrate that ADAligner consistently outperforms prior graph-text aligners on zero-/few-shot node classification, link prediction and cross-modal retrieval tasks. It maintains strong robustness under noisy supervision and accelerates pre-training by approximately 2 to 3 times compared to multimodal baselines, establishing a scalable and reliable foundation for graph-text representation learning in real-world web environments.

图神经网络图文对齐噪声鲁棒预训练

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