GS-Quant: Granular Semantic and Generative Structural Quantization for Knowledge Graph Completion

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Xie, Qizhuo, Liu, Yunhui, Xing, Yu, Hou, Qianzi, Jin, Xudong, Zheng, Tao, He, Tieke
Format: Preprint
Publié: 2026
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866917431200448512
author Xie, Qizhuo
Liu, Yunhui
Xing, Yu
Hou, Qianzi
Jin, Xudong
Zheng, Tao
He, Tieke
author_facet Xie, Qizhuo
Liu, Yunhui
Xing, Yu
Hou, Qianzi
Jin, Xudong
Zheng, Tao
He, Tieke
contents Large Language Models (LLMs) have shown immense potential in Knowledge Graph Completion (KGC), yet bridging the modality gap between continuous graph embeddings and discrete LLM tokens remains a critical challenge. While recent quantization-based approaches attempt to align these modalities, they typically treat quantization as flat numerical compression, resulting in semantically entangled codes that fail to mirror the hierarchical nature of human reasoning. In this paper, we propose GS-Quant, a novel framework that generates semantically coherent and structurally stratified discrete codes for KG entities. Unlike prior methods, GS-Quant is grounded in the insight that entity representations should follow a linguistic coarse-to-fine logic. We introduce a Granular Semantic Enhancement module that injects hierarchical knowledge into the codebook, ensuring that earlier codes capture global semantic categories while later codes refine specific attributes. Furthermore, a Generative Structural Reconstruction module imposes causal dependencies on the code sequence, transforming independent discrete units into structured semantic descriptors. By expanding the LLM vocabulary with these learned codes, we enable the model to reason over graph structures isomorphically to natural language generation. Experimental results demonstrate that GS-Quant significantly outperforms existing text-based and embedding-based baselines. Our code is publicly available at https://github.com/mikumifa/GS-Quant.
format Preprint
id arxiv_https___arxiv_org_abs_2604_21649
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle GS-Quant: Granular Semantic and Generative Structural Quantization for Knowledge Graph Completion
Xie, Qizhuo
Liu, Yunhui
Xing, Yu
Hou, Qianzi
Jin, Xudong
Zheng, Tao
He, Tieke
Artificial Intelligence
Computation and Language
Large Language Models (LLMs) have shown immense potential in Knowledge Graph Completion (KGC), yet bridging the modality gap between continuous graph embeddings and discrete LLM tokens remains a critical challenge. While recent quantization-based approaches attempt to align these modalities, they typically treat quantization as flat numerical compression, resulting in semantically entangled codes that fail to mirror the hierarchical nature of human reasoning. In this paper, we propose GS-Quant, a novel framework that generates semantically coherent and structurally stratified discrete codes for KG entities. Unlike prior methods, GS-Quant is grounded in the insight that entity representations should follow a linguistic coarse-to-fine logic. We introduce a Granular Semantic Enhancement module that injects hierarchical knowledge into the codebook, ensuring that earlier codes capture global semantic categories while later codes refine specific attributes. Furthermore, a Generative Structural Reconstruction module imposes causal dependencies on the code sequence, transforming independent discrete units into structured semantic descriptors. By expanding the LLM vocabulary with these learned codes, we enable the model to reason over graph structures isomorphically to natural language generation. Experimental results demonstrate that GS-Quant significantly outperforms existing text-based and embedding-based baselines. Our code is publicly available at https://github.com/mikumifa/GS-Quant.
title GS-Quant: Granular Semantic and Generative Structural Quantization for Knowledge Graph Completion
topic Artificial Intelligence
Computation and Language
url https://arxiv.org/abs/2604.21649