Pith. sign in

REVIEW 2 cited by

Pretraining Language Models with Text-Attributed Heterogeneous Graphs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2310.12580 v2 pith:KSCEWT2Y submitted 2023-10-19 cs.CL cs.AI

classification cs.CLcs.AI
keywords heterogeneouspretraininggraphnodestahgscontextentitiesgraphs
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In many real-world scenarios (e.g., academic networks, social platforms), different types of entities are not only associated with texts but also connected by various relationships, which can be abstracted as Text-Attributed Heterogeneous Graphs (TAHGs). Current pretraining tasks for Language Models (LMs) primarily focus on separately learning the textual information of each entity and overlook the crucial aspect of capturing topological connections among entities in TAHGs. In this paper, we present a new pretraining framework for LMs that explicitly considers the topological and heterogeneous information in TAHGs. Firstly, we define a context graph as neighborhoods of a target node within specific orders and propose a topology-aware pretraining task to predict nodes involved in the context graph by jointly optimizing an LM and an auxiliary heterogeneous graph neural network. Secondly, based on the observation that some nodes are text-rich while others have little text, we devise a text augmentation strategy to enrich textless nodes with their neighbors' texts for handling the imbalance issue. We conduct link prediction and node classification tasks on three datasets from various domains. Experimental results demonstrate the superiority of our approach over existing methods and the rationality of each design. Our code is available at https://github.com/Hope-Rita/THLM.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. HierPromptLM: A Pure PLM-based Framework for Representation Learning on Heterogeneous Text-rich Networks

    cs.LG 2025-01 conditional novelty 6.0 of 10

    HierPromptLM uses hierarchical text prompts and two language-model pretraining tasks to jointly encode node text and heterogeneous graph structure, outperforming prior text-plus-GNN baselines on DBLP and OAG.

  2. Fusing Knowledge and Language: A Comparative Study of Knowledge Graph-Based Question Answering with LLMs

    cs.AI 2025-09 reject novelty 4.0 of 10

    In a small comparative study, GraphRAG outscored spaCy and CoreNLP-based KG-QA pipelines on reasoning-heavy questions, but the evaluation design conflates method choice with pipeline architecture.

Pith tools