- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes GraphBind, a topology-driven multimodal graph foundation model that learns unified representations from graphs with incomplete node modalities. The method uses graph topology to guide reliable neighborhood semantic completion and latent calibration, while simulating different missing-modality patterns during pretraining. The learned representations are adapted to both discriminative and generative tasks, including node classification, link prediction, graph-to-text, and graph-to-image generation. Experiments on eight downstream datasets show improvements over existing baselines and robustness to missing modalities.
Critical strengths
-
The paper provides a clear motivation for incomplete modalities and highlights the importance of using graph topology to recover missing modality information.
-
The evaluation covers both discriminative and generative tasks, incorporating datasets from various domains.
-
The paper provides theoretical analysis of how reliable neighborhood information improves robustness and how the shared representation geometry is preserved.
Critical weaknesses
-
Not enough ablation studies showing the effectiveness of each component. There are several key designs, including modality absence simulation (Section 4.1), reliable neighborhood semantic completion, and topology-guided shared latent calibration (Section 4.2). However, the current ablations mainly replace multiple components simultaneously rather than isolating their individual effects. More fine-grained ablations would help establish which components are essential to the reported improvements.
-
The modality-missing setting is not clear. It remains unclear how the model performs under specific scenarios, such as text-only missing, image-only missing, and both modalities missing. Evaluating these cases separately, together with naturally incomplete graphs, would provide stronger evidence for the effectiveness of the proposed semantic completion mechanism.
-
The evaluation is not sufficient. The model is trained on 6 datasets (including Ele-fashion and Sports) as mentioned in Appendix A.6, but the evaluation does not include these two datasets, and their necessity to the pretraining should be further discussed. Also, the model's transferability remains unclear without out-of-domain evaluation, as fine-tuning and testing are still conducted on the same datasets. Including at least one unseen dataset for downstream evaluation would strengthen the foundation model claim. Besides, the explanation for excluding Mario simply because it is LLM-based is not sufficiently convincing, especially given the overlap in downstream tasks.
Questions for authors
-
Is there any analysis of the learned values of (g_i) and how they balance self and neighborhood semantics, especially under different missing-modality settings?
-
What exactly distinguishes the proposed topology-driven binding from existing multimodal graph alignment and fusion methods? It is unclear what makes the proposed unified representation fundamentally different from existing multimodal graph models.
-
The paper only considers two modalities, text and image. How does the proposed method generalize to more modalities, and how does the current evaluation support the "omni" claim? When one modality is missing, the self-semantic initialization in Eq. (2) simply uses the remaining modality without multimodal fusion. It is unclear whether the proposed binding mechanism can effectively handle more modalities and complex missing-modality combinations.
2 comments
Thank you for the detailed responses and additional experiments, but my original concerns have not been fully addressed. Regarding out-of-domain generalization, the additional evaluations on CDs and Arts remain within the E-Commerce domain, which is already well represented in pretraining (Table 5). Additionally, the learned gate , an important component of semantic completion, is only explained qualitatively without empirical analysis of its behavior under different missing-modality settings. Therefore, I will maintain my original score.
We sincerely thank you for your highly constructive feedback. We have carefully addressed your points below. All additions in the revised manuscript are marked in bold blue.
For W1: For more detailed ablation results, please refer to our response to W2 and Q2 for Reviewer Xx16. For the contribution of modality absence simulation, please also refer to our response to W2 and Q2 for Reviewer Sr9i, which compares pretraining with reconstruction masking alone against pretraining with both absence simulation and reconstruction masking.
For W2: Thank you for highlighting the unclear presentation. Our Empirical Investigation section separately evaluates text missing, image missing, and both modalities missing at the center node, while retaining available neighbor attributes. On Grocery, adding neighborhood information improves GraphBind's recovery cosine similarity from 0.7072 to 0.7327 when text is missing and from 0.7867 to 0.7907 when images are missing, compared with using only the remaining node modality. On RedditS, when both modalities are missing, neighborhood-based recovery achieves 0.6546 for text and 0.8025 for images, exceeding the training-feature mean references of 0.5617 and 0.6880. These results show that neighborhood semantics complement the remaining node modality and support recovery even when neither node modality is available.
For W3: We include Ele-fashion and Sports to extend pretraining to larger graphs. They also enrich the corpus with cross-category product relations and sports-domain semantics, respectively. Both datasets serve as additional pretraining sources, while downstream evaluation uses datasets selected for the four task types considered in our experiments.
For unseen datasets for downstream evaluation, we added downstream evaluations on CDs for node classification and Arts for link prediction, with neither dataset included in GraphBind pretraining. These experiments evaluate transfer of the pretrained encoder through adaptation on the unseen target graphs. Please refer to our response to Weakness 1 and Question 1 for Reviewer Xx16 for the results and details.
For the comparison with Mario, we add its task results to Table 1 and introduce the method in Appendix A.5. GraphBind achieves a slight lead over Mario on supervised tasks and a substantial advantage in few-shot learning.
For Q1: g_i is a learned gate for each feature dimension: larger values retain more self semantics, while smaller values give more weight to neighborhood semantics. Under independent absence, g_i can decrease in dimensions where reliable neighbors complement missing self information, while retaining dimensions supported by the node's remaining modalities. Under neighborhood-correlated absence, neighbors may also lack useful information; the gate can then increase self retention where the node still has informative attributes, while using reliable neighbors for other dimensions. Under property-dependent absence, g_i uses the node's available semantics, topology encoding, and mean neighbor reliability to adjust this balance individually: nodes with limited self information can draw more from reliable neighbors, whereas nodes with weak neighborhood support can retain more self semantics. Reconstruction and contrastive objectives jointly teach these choices during mixed pretraining.
For Q2: Conventional multimodal fusion combines available modality features, while alignment encourages agreement between their representations. These operations primarily exploit relations among modalities observed at the same node, leaving complementary semantics distributed across connected nodes less fully explored. When node modalities are missing, local fusion has fewer informative inputs and alignment has fewer available modality pairs. GraphBind extends multimodal binding across connected nodes, using reliable neighborhood context and structural relations to maintain the unified representation space across different modality availability patterns.
Regarding the unified representation, existing MAG models typically construct unified representations through modality alignment within graph context, with limited explicit control over how the shared projection changes semantic relations between nodes. GraphBind uses graph topology as a structural reference throughout shared representation construction. It explicitly constrains semantic differences across reliable graph connections to remain consistent after projection, allowing the shared space to retain the semantic geometry established through the graph.
For Q3: Thank you for pointing out the imprecise expression in our title. Our experiments on the selected MAG datasets use only text and visual modalities and do not cover audio or other modalities. We will replace “Omni” with “Unified” in the title to better reflect our focus.