Papers › Learning on Large-scale Text-attributed Graphs via Variational Inference

Learning on Large-scale Text-attributed Graphs via Variational Inference

26 Oct 2022arXiv:2210.14709archive 2025-07-28

Jianan Zhao, Meng Qu, Chaozhuo Li, Hao Yan, Qian Liu, Rui Li, Xing Xie, Jian Tang

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.

PaperPDFCodeCode Syntology ranMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 1 code sample harvested from 1 repository linked to this paper: 0 ran · 1 unverified.

By repository: official repository: 1 sample from 1 repository, 0 ran (0 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

andyjzhao/glem officialmentioned in papermentioned on GitHubpytorchSyntology: 1 sample, 0 ran · 1 unverified report
AndyJZhao/GLEM mentioned on GitHubpytorchSyntology: 1 sample, 0 ran · 1 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

1 sample harvested: 0 ran · 1 unverified. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1unverified

Licence: 1 of the 1 sample is pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from andyjzhao/glem. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

andyjzhao/glem official repository 1 sample, 0 ran · 1 unverified
GLEMTrainer src/models/GLEM/GLEM_trainer.py unverified no licence file found · pointer only · 005cfd689309ecee · report

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it.

1 assembly on this paper: 1 harvested, 0 generated.

harvested Assembly for GLEM (graph method: GLEM). 1 brick; individually on a fixture: 0 ran · 1 unverified. The assembly has not been run end-to-end.

  1. GLEMTrainer entry · level 0 · unverified · 005cfd689309ecee

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2210.14709") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Variational Inference

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Node Property Prediction ogbn-arxiv GLEM+RevGAT Ext. data Yes #7 of 86 Archive leaderboard report
Node Property Prediction ogbn-arxiv GLEM+RevGAT Number of params 140469624 #7 of 86 Archive leaderboard report
Node Property Prediction ogbn-arxiv GLEM+RevGAT Test Accuracy 0.7694 ± 0.0025 #7 of 86 Archive leaderboard report
Node Property Prediction ogbn-arxiv GLEM+RevGAT Validation Accuracy 0.7746 ± 0.0018 #7 of 86 Archive leaderboard report
Node Property Prediction ogbn-papers100M GLEM+GIANT+GAMLP Ext. data Yes #1 of 20 Archive leaderboard report
Node Property Prediction ogbn-papers100M GLEM+GIANT+GAMLP Number of params 154775375 #1 of 20 Archive leaderboard report
Node Property Prediction ogbn-papers100M GLEM+GIANT+GAMLP Test Accuracy 0.7037 ± 0.0002 #1 of 20 Archive leaderboard report
Node Property Prediction ogbn-papers100M GLEM+GIANT+GAMLP Validation Accuracy 0.7354 ± 0.0001 #1 of 20 Archive leaderboard report
Node Property Prediction ogbn-products GLEM+EnGCN Ext. data Yes #1 of 64 Archive leaderboard report
Node Property Prediction ogbn-products GLEM+EnGCN Number of params 139633805 #1 of 64 Archive leaderboard report
Node Property Prediction ogbn-products GLEM+EnGCN Test Accuracy 0.9014 ± 0.0012 #1 of 64 Archive leaderboard report
Node Property Prediction ogbn-products GLEM+EnGCN Validation Accuracy 0.9370 ± 0.0004 #1 of 64 Archive leaderboard report
Node Property Prediction ogbn-products GLEM+GIANT+SAGN+SCR Ext. data Yes #3 of 64 Archive leaderboard report
Node Property Prediction ogbn-products GLEM+GIANT+SAGN+SCR Number of params 139792525 #3 of 64 Archive leaderboard report
Node Property Prediction ogbn-products GLEM+GIANT+SAGN+SCR Test Accuracy 0.8737 ± 0.0006 #3 of 64 Archive leaderboard report
Node Property Prediction ogbn-products GLEM+GIANT+SAGN+SCR Validation Accuracy 0.9400 ± 0.0003 #3 of 64 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections