Global exchange or readout capacity? A controlled decomposition of the virtual node in molecular graph neural networks

Abstract A virtual node is one artificial vertex joined to every atom of a molecular graph. It is normally justified as a channel for global information exchange, yet adding it also gives the prediction head a second graph-level vector, and the usual ablation changes both at once. The two were separated here with a factorial design whose control runs the virtual node and reads its state but never broadcasts it to the atoms, so that both arms see the same learned second channel. Six arms of an edge-aware graph isomorphism network were trained with 30 seeds on four binary problems: honey bee toxicity under a Max-Min and a temporal partition, a twelve-assay Tox21 panel and OGB MolHIV. The decision threshold was declared before training. On MolHIV, the problem with the largest evaluation set, the whole virtual node gain came from the second readout channel (+0.104 MCC without exchange, +0.068 with it), and exchange itself lowered MCC by 0.036; both effects held in an independent repeat of the run. On the three smaller problems neither factor survived correction, and mean pooling alone reproduced the gain of a sum-and-mean readout on ApisTox Max-Min. A conventional 0.5 threshold reversed the sign of 9 of 24 contrasts.

Authors

Institutions

Publication Details

Journal
Machine Learning Science and Technology
Published
2026-10-26
DOI
https://doi.org/10.1088/2632-2153/aeb9a5
Primary Topic
Computational Drug Discovery Methods
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Global exchange or readout capacity? A controlled decomposition of the virtual node in molecular graph neural networks

Sedat Golgiyaz
Machine Learning Science and Technology
Computational Drug Discovery Methods
article

Global exchange or readout capacity? A controlled decomposition of the virtual node in molecular graph neural networks

Sedat Golgiyaz
article en

Abstract

Abstract A virtual node is one artificial vertex joined to every atom of a molecular graph. It is normally justified as a channel for global information exchange, yet adding it also gives the prediction head a second graph-level vector, and the usual ablation changes both at once. The two were separated here with a factorial design whose control runs the virtual node and reads its state but never broadcasts it to the atoms, so that both arms see the same learned second channel. Six arms of an edge-aware graph isomorphism network were trained with 30 seeds on four binary problems: honey bee toxicity under a Max-Min and a temporal partition, a twelve-assay Tox21 panel and OGB MolHIV. The decision threshold was declared before training. On MolHIV, the problem with the largest evaluation set, the whole virtual node gain came from the second readout channel (+0.104 MCC without exchange, +0.068 with it), and exchange itself lowered MCC by 0.036; both effects held in an independent repeat of the run. On the three smaller problems neither factor survived correction, and mean pooling alone reproduced the gain of a sum-and-mean readout on ApisTox Max-Min. A conventional 0.5 threshold reversed the sign of 9 of 24 contrasts.

Machine Learning Science and Technology
Bingöl University (TR)
Openalex Percentile: Top 14%
Computational Drug Discovery Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon