Pith. sign in

REVIEW 2 cited by

UniGLM: Training One Unified Language Model for Text-Attributed Graph Embedding

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 2406.12052 v2 pith:HA5K5HPT submitted 2024-06-17 cs.CL cs.AIcs.IRcs.LG

classification cs.CLcs.AIcs.IRcs.LG
keywords tagsuniglmgraphembeddinglanguagelearningmodeltextual
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Representation learning on text-attributed graphs (TAGs), where nodes are represented by textual descriptions, is crucial for textual and relational knowledge systems and recommendation systems. Currently, state-of-the-art embedding methods for TAGs primarily focus on fine-tuning language models (e.g., BERT) using structure-aware training signals. While effective, these methods are tailored for individual TAG and cannot generalize across various graph scenarios. Given the shared textual space, leveraging multiple TAGs for joint fine-tuning, aligning text and graph structure from different aspects, would be more beneficial. Motivated by this, we introduce a novel Unified Graph Language Model (UniGLM) framework, the first graph embedding model that generalizes well to both in-domain and cross-domain TAGs. Specifically, UniGLM is trained over multiple TAGs with different domains and scales using self-supervised contrastive learning. UniGLM includes an adaptive positive sample selection technique for identifying structurally similar nodes and a lazy contrastive module that is devised to accelerate training by minimizing repetitive encoding calculations. Extensive empirical results across 9 benchmark TAGs demonstrate UniGLM's efficacy against leading embedding baselines in terms of generalization (various downstream tasks and backbones) and transfer learning (in and out of domain scenarios). The code is available at https://github.com/NYUSHCS/UniGLM.

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. MLaGA: Multimodal Large Language and Graph Assistant

    cs.AI 2025-06 conditional novelty 6.0 of 10

    MLaGA extends LLM-based graph reasoning from text-only graphs to multimodal graphs with image and text node attributes via a structure-aware aligner and multimodal instruction tuning.

  2. GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design

    cs.LG 2025-01 reject novelty 5.0 of 10

    A 55-template prompt benchmark showing general LLMs can beat specialized graph LLMs and GNNs on node classification and link prediction, though the reported margins are inflated by test-set prompt selection.

Pith tools