用离散代码表示图结构,让大模型更懂图数据
A Survey of Quantized Graph Representation Learning: Connecting Graph Structures with Large Language Models
- 用离散编码替代连续嵌入,提升参数效率与可解释性
- 首次系统梳理图结构量化方法与大模型融合路径
- 适合想用大模型理解图数据的研究者参考
近年来,图表示学习快速发展,连续嵌入成为主流范式。然而这类方法在参数效率、可解释性和鲁棒性方面存在不足。为此,图结构量化(QGR)学习逐渐兴起,通过离散代码表示图结构,兼具类似自然语言的表达形式,能无缝对接大语言模型(LLMs)。本文全面综述该新兴方向,涵盖量化策略、训练目标、设计特点、知识图谱量化及应用场景,并深入探讨代码依赖学习与与大模型集成方法。最后分析未来发展方向,旨在为研究者提供完整图景并激发创新。
原文摘要 · Abstract (English)
Recent years have witnessed rapid advances in graph representation learning, with the continuous embedding approach emerging as the dominant paradigm. However, such methods encounter issues regarding parameter efficiency, interpretability, and robustness. Thus, Quantized Graph Representation (QGR) learning has recently gained increasing interest, which represents the graph structure with discrete codes instead of conventional continuous embeddings. Given its analogous representation form to natural language, QGR also possesses the capability to seamlessly integrate graph structures with large language models (LLMs). As this emerging paradigm is still in its infancy yet holds significant promise, we undertake this thorough survey to promote its rapid future prosperity. We first present the background of the general quantization methods and their merits. Moreover, we provide an in-depth demonstration of current QGR studies from the perspectives of quantized strategies, training objectives, distinctive designs, knowledge graph quantization, and applications. We further explore the strategies for code dependence learning and integration with LLMs. At last, we give discussions and conclude future directions, aiming to provide a comprehensive picture of QGR and inspire future research.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。