arXiv:2502.15189cs.CLcs.AI2025-02ICLR被引 3

用真实图结构的无标度特性提升文本嵌入与图生成效果

Scale-Free Graph-Language Models

  • 利用无标度特性作为图结构先验,用KNN近似真实边分布
  • 在多个数据集上实现优于传统方法的半监督学习性能
  • 适合关注图神经网络与语言模型融合的研究者

图-语言模型(GLM)在基于图的半监督学习中展现出巨大潜力。典型GLM包含图生成与文本嵌入两个阶段,分别依赖于潜在图推断和语言模型微调。然而,前者常依赖人工假设的边分布,后者需大量标注数据。本文提出一种新GLM框架,将图生成与文本嵌入统一建模。针对图生成,我们利用真实边分布的无标度特性作为结构先验,意外发现简单k近邻(KNN)图可有效近似该性质。针对文本嵌入,我们设计一种基于无标度图的伪标签器,为语言模型微调提供互补监督。在代表性数据集上的大量实验验证了KNN图对无标度结构的近似能力,并证明了引入真实结构先验的联合建模有效性。代码已公开于https://github.com/Jianglin954/SFGL。

原文摘要 · Abstract (English)

Graph-language models (GLMs) have demonstrated great potential in graph-based semi-supervised learning. A typical GLM consists of two key stages: graph generation and text embedding, which are usually implemented by inferring a latent graph and finetuning a language model (LM), respectively. However, the former often relies on artificial assumptions about the underlying edge distribution, while the latter requires extensive data annotations. To tackle these challenges, this paper introduces a novel GLM that integrates graph generation and text embedding within a unified framework. Specifically, for graph generation, we leverage an inherent characteristic of real edge distribution--the scale-free property--as a structural prior. We unexpectedly find that this natural property can be effectively approximated by a simple k-nearest neighbor (KNN) graph. For text embedding, we develop a graph-based pseudo-labeler that utilizes scale-free graphs to provide complementary supervision for improved LM finetuning. Extensive experiments on representative datasets validate our findings on the scale-free structural approximation of KNN graphs and demonstrate the effectiveness of integrating graph generation and text embedding with a real structural prior. Our code is available at https://github.com/Jianglin954/SFGL.

图神经网络语言模型半监督学习

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