Preprint

Graph test with a text teacher reports a 0.21-point difference

An arXiv preprint reports a small standard-accuracy difference between FUG+GLEM-ITT and FUG-only, while balanced accuracy is slightly lower for FUG+GLEM-ITT.

The central result was a near tie. On the main OpenAlex target probe of the Full GCN Z representation, FUG+GLEM-ITT recorded standard accuracy of 0.7480, compared with 0.7459 for FUG-only, an approximately 0.21-percentage-point difference. On balanced accuracy, the reported scores were 0.6001 for FUG+GLEM-ITT and 0.6016 for FUG-only, a slight edge for the baseline.

That comparison did not support the study’s proposed threshold: FUG+GLEM would reliably outperform FUG-only by at least 1%. The analysis reports no confidence intervals or formal significance test, so the size of the gap should be read as a result for the reported dataset, split, probe and model configuration rather than as a precise estimate of a general advantage.

A test across graph domains

The paper investigates why combining FUG and GLEM showed no clear improvement over FUG alone. It describes FUG+GLEM-ITT as an EM-like procedure rather than a strict variational EM method, using an external text anchor to guide a graph encoder.

The computational evaluation transferred from Amazon Digital Music review data as the source domain to the OpenAlex paper network as the target domain. That setup tests whether a representation learned in one graph setting carries over to another.

On the source side, the construction produced 130,434 matched Digital Music nodes, split by 128,764 unique metadata tuples. On the target side, the analysis scanned the first 20,000 OpenAlex records and retained 6,984 nodes in the 20 most frequent classes.

The OpenAlex evaluation used 4,190 nodes for training the linear probe, 1,397 for validation and 1,397 for testing. Target labels were used only for that probe.

The handoff from text to graph

The staged experiments moved from FUG-only to self-copy imitation, then to a raw text-hash anchor and a frozen MPNet teacher. The graph-encoder update budget was matched at 168 epochs: 60 warm-up epochs followed by six EM-like iterations with 18 training epochs each.

MPNet embeddings began at 768 dimensions and were projected to 1,024, while Raw Text Hash features began at 2,048 and were projected to the same 1,024-dimensional hidden space. The features influenced GCN Z through cosine alignment rather than direct input.

Where the transfer gap appears

The frozen-teacher experiment gave the clearest signal about that transfer path. Raw MPNet scored 0.7888, while Full GCN Z scored 0.7437. A GCN+MPNet ensemble reached 0.7845, nearly recovering the text-only result. The authors describe this pattern as an apparent transfer bottleneck: the text features were useful, but much of that advantage was not present in the final graph representation.

That gap was not accompanied by a failure to align the representations. In Exp4, mpnet_cos rose from 0.0095 after warm-up to 0.4341 at em6, while Full GCN Z performance stayed at 0.7437. The reported alignment measure therefore increased without a corresponding classification gain in Full GCN Z.

Representation-level comparisons pointed in the same direction. Under FUG-only, Raw Text Hash scored 0.7623, MLP-only 0.7480, Full GCN Z 0.7459 and the ensemble 0.7702. Under FUG+GLEM-ITT, Full GCN Z scored 0.7480, Raw Text Hash 0.7623 and the ensemble 0.7717. Raw-text and ensemble representations were generally ahead of the post-propagation GCN representation in these reported comparisons. There is a measurement caveat: table footnotes label the figures standard test accuracies, while one analysis section calls them balanced accuracies.

An unresolved trade-off

The authors interpret the findings as a strength-safety trade-off for external anchors. Their proposed explanation has several parts: weak anchors may have little effect, while strong anchors may damage graph representations; teacher and FUG objectives may favor different geometry; neighborhood propagation can mix each node’s text with neighbor information; and cosine alignment may improve similarity without preserving classification-relevant directions.

Model selection reflected the same tension. The chosen em6 checkpoint had source validation balanced accuracy of 0.4766, below the warm-up value of 0.4788. A checkpoint labeled SWA reached 0.4789 but was not selected because its composite score was lower, showing that the final choice was not based on source validation accuracy alone.

What the experiment does not establish

The result is narrow. It comes from one Amazon Digital Music-to-OpenAlex transfer setting, with a selected target sample and a 20-class label space, so it does not establish that the same behavior will appear in other graph domains, architectures or tasks.

Nor does the study show that text teachers or MPNet are intrinsically ineffective. In the frozen-teacher comparison, Raw MPNet alone was the strongest of the three reported options, while the ensemble came close; the unresolved issue is how much of that text signal is retained in GCN Z.

Most importantly, the before-and-after propagation pattern does not directly demonstrate that GCN propagation diluted textual information. The proposed mechanisms remain partly inferential, and the reported bottleneck would need replication across more source-target pairs before it could be treated as a general property of graph learning.

The work is an arXiv preprint, version v1 dated 26 August 2026. No funding statement is reported in the record.

Paper data and sources

Original title: Why Does Graph Learning Fail to Fully Benefit from a Text Teacher?
Authors: Fumiaki Kimino, Ryoma Sato
Journal/Repository: arXiv
Status: Preprint, not yet peer-reviewed
First online: 2026-08-26
DOI: Not available
Original paper · Full text

Versions and corrections

  1. Published automatically after legal-source, freshness, evidence, and independent-verification gates passed.