REVIEW 7 cited by
Learning on Large-scale Text-attributed Graphs via Variational Inference
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
read the original abstract
This paper studies learning on text-attributed graphs (TAGs), where each node is associated with a text description. An ideal solution for such a problem would be integrating both the text and graph structure information with large language models and graph neural networks (GNNs). However, the problem becomes very challenging when graphs are large due to the high computational complexity brought by training large language models and GNNs together. In this paper, we propose an efficient and effective solution to learning on large text-attributed graphs by fusing graph structure and language learning with a variational Expectation-Maximization (EM) framework, called GLEM. Instead of simultaneously training large language models and GNNs on big graphs, GLEM proposes to alternatively update the two modules in the E-step and M-step. Such a procedure allows training the two modules separately while simultaneously allowing the two modules to interact and mutually enhance each other. Extensive experiments on multiple data sets demonstrate the efficiency and effectiveness of the proposed approach.
Forward citations
Cited by 7 Pith papers
-
Same Graph Cross-Task Transfer in GNNs: Protocols and Predictors
Under a fixed leakage-free protocol, NC→LP transfer reliably helps on homophilic graphs while LP→NC helps mainly when LP is easy and NC is unsaturated; homophily and CoTask Score guide mechanism choice.
-
Both Topology and Text Matter: Revisiting LLM-guided Out-of-Distribution Detection on Text-attributed Graphs
LG-Plug mines pseudo-OOD exposures from clustered unlabeled nodes via iterative LLM prompting and regularizes topology-driven graph OOD detectors, cutting FPR95 by ≥7% across six TAG benchmarks.
-
Towards Text-free Graph Foundation Models: Rethinking Multi-Domain Graph Contrastive Learning
MDGCL pre-trains graph encoders on multiple domains using same-domain discrimination and a downstream domain-attention mechanism, outperforming existing text-free graph foundation models.
-
Efficient Text-Attributed Graph Learning through Selective Annotation and Graph Alignment
GAGA matches or exceeds state-of-the-art accuracy on several text-attributed graph benchmarks while requiring large language model annotations for only 1% of nodes or edges.
-
GSTBench: A Benchmark Study on the Transferability of Graph Self-Supervised Learning
GSTBench finds that masked feature reconstruction (GraphMAE) is the only one of five graph self-supervised pretraining objectives that consistently transfers across eight datasets, while contrastive methods often perf...
-
NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing
NOCL lets an LLM handle node, edge, and graph tasks on text and non-text graphs by compressing each node's description into one semantic embedding and turning the graph into a text prompt.
-
Fusing Knowledge and Language: A Comparative Study of Knowledge Graph-Based Question Answering with LLMs
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.
Discussion (0). Sign in to comment.