Papers › Revisiting Semi-Supervised Learning with Graph Embeddings
Revisiting Semi-Supervised Learning with Graph Embeddings
Zhilin Yang, William W. Cohen, Ruslan Salakhutdinov
We present a semi-supervised learning framework based on graph embeddings. Given a graph between instances, we train an embedding for each instance to jointly predict the class label and the neighborhood context in the graph. We develop both transductive and inductive variants of our method. In the transductive variant of our method, the class labels are determined by both the learned embeddings and input feature vectors, while in the inductive variant, the embeddings are defined as a parametric function of the feature vectors, so predictions can be made on instances not seen during training. On a large and diverse set of benchmark tasks, including text classification, distantly supervised entity extraction, and entity classification, we show improved performance over many of the existing models.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1603.08861")
Code
Syntology Ran 15 of 28 code samples harvested from 10 repositories linked to this paper; 13 have no recorded run. Of those that ran: 3 ran · honoured contract; 2 ran · violated contract; 1 ran · our draft was wrong; 1 ran · fixture could not drive it; 8 ran with no contract checked.
By repository: community (archive-listed): 28 samples from 10 repositories, 15 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
26 repositories listed; official and paper-mentioned ones first.
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
28 samples harvested; 15 ran; 3 honoured the contract we drafted; 13 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.
Licence: 4 of the 28 samples are 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 10 repositories linked to this paper, official or community; each sample names its own and says which. “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 “fixture could not drive it” are failures of Syntology's instrument, not of the code.
Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (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 from a repository marked official are listed first. 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 four 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; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). 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.
f224b63a7a7463d9 · report
ec355dcbf751cc7a · report
270166c76b26a9ee · report
ff277e8dd110b334 · report
bf9e124488a3ad49 · report
bcdba8daf230043b · report
79092f3060750964 · report
bc3a2072a2a9cca3 · report
b8337cff1a162df4 · report
b82968db452628fd · report
b89d4728d3c8578d · report
d103f29cc58337a2 · report
c1d6392f89c5e495 · report
b32fd748b4bbe3bf · report
b190ef9c60b2629a · report
c3f22105f96e8f5a · report
1aded806aefeb35f · report
0da98822521f5a66 · report
05d312950dfb243b · report
e6be015d5b6f544a · report
1b491f3f784b7cb0 · report
73af867b964476a6 · report
ae7971ec194c0050 · report
81be8a5f4732fe52 · report
2d1711104178d07b · report
7744934903a62303 · report
560fe1ad9ba4b948 · report
b0d1b78daecde7e9 · report
Tasks
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Document Classification | Cora | Planetoid* | Accuracy | 75.7% | #5 of 6 | Archive leaderboard | report |
| Node Classification | Citeseer | Planetoid* | Accuracy | 64.7% | #65 of 71 | Archive leaderboard | report |
| Node Classification | Cora | Planetoid* | Accuracy | 75.7% | #70 of 73 | Archive leaderboard | report |
| Node Classification | NELL | Planetoid* | Accuracy | 61.9% | #4 of 4 | Archive leaderboard | report |
| Node Classification | Pubmed | Planetoid* | Accuracy | 77.2% | #61 of 70 | Archive leaderboard | report |
| Node Classification | USA Air-Traffic | Planetoid* | Accuracy | 64.7 | #3 of 7 | 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