acceptodds
Under review as a conference paper at ICLR 2027

Toward Omni Multimodal Graph Foundation Model: A Topology-Driven Binding Approach

Abstract

Multimodal graph foundation models (MGFMs) seek to learn generalizable representations from large-scale graphs with heterogeneous node modalities. However, real-world Multimodal-Attributed Graphs (MAGs) often contain incomplete node attributes, limiting the scale and diversity of available pretraining corpora. Besides, existing MGFMs primarily incorporate graph topology as structural context, overlooking its role in guiding multimodal binding and shaping a unified representation space. To address these challenges, we propose , a topology-driven approach that uses graph topology to bind rich modality information into a unified shared space. GraphBind is motivated by the stability of graph topology, which provides structural references and complementary semantic information for multimodal binding. Concretely, GraphBind uses topology to organize self semantics and reliable neighborhood semantics into a global shared space that integrates structure and semantics, and adapts this space to discriminative and generative tasks through lightweight interfaces. Extensive experiments against 11 representative baselines demonstrate that GraphBind achieves leading performance on both discriminative and generative tasks, with relative improvements of up to 28.1% over the strongest baseline.

Primary area:
foundation or frontier models, including LLMs
Keywords:
Multimodal-Attributed Graph, Graph Foundation Model, Multimodal Representation Learning

Reviews

Among:
Shape:
1234this paper, Top 32%
Figure 1. Mean review rating of the reviewed papers at ICLR 2027. This paper averages 2.50 over 4 reviews, above 68% of the others.
Reviewer_GfZaOpenReview ↗
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
  1. The paper provides a clear motivation for incomplete modalities and highlights the importance of using graph topology to recover missing modality information.

  2. The evaluation covers both discriminative and generative tasks, incorporating datasets from various domains.

  3. The paper provides theoretical analysis of how reliable neighborhood information improves robustness and how the shared representation geometry is preserved.

Critical weaknesses
  1. 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.

  2. 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.

  3. 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
  1. 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?

  2. 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.

  3. 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

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.

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 gig_i, 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.

Reviewer_Xx16OpenReview ↗
Rating
3
Confidence
2
Informativeness
2
Presentation
3
Soundness
3
Read review
Paper summary

This paper proposes GraphBind, a topology-driven multimodal graph foundation model that aims to address missing modalities and unified representation learning in multimodal attributed graphs. It builds a shared representation space through reliable neighborhood semantic completion and topology-guided latent calibration, and uses lightweight adaptation modules for discriminative and generative tasks. Experimental results show that GraphBind achieves competitive performance on various downstream tasks and demonstrates good robustness to missing modalities.

Critical strengths

S1: The paper proposes a topology-driven multimodal binding framework that uses graph structure to combine node-level semantics with reliable neighborhood information. This provides a useful approach to handling multimodal graphs with missing modalities.

S2: The paper provides a fairly comprehensive evaluation across discriminative and generative tasks and achieves competitive results on several datasets, especially in few-shot node classification and graph-to-text generation.

Critical weaknesses

W1: The paper lacks clear cross-dataset or cross-domain transfer experiments. The current results mainly show downstream task performance on different datasets, which is not sufficient to support its claimed generalization ability as a multimodal graph foundation model.

W2: The ablation study replaces reliable neighborhood semantic completion and topology-guided latent calibration at the same time. It does not separately evaluate the contributions of reliability scoring, gating mechanisms, and individual loss functions, making it difficult to identify the sources of performance improvements.

W3: The missing-modality experiments mainly rely on artificial masking during inference, without directly evaluating pretraining on naturally incomplete graph data. In addition, the proposed property-dependent missingness mechanism is not sufficiently evaluated.

W4: Although GraphBind has fewer trainable parameters, its fine-tuning and inference costs are still higher than those of some baselines. Therefore, its advantage in parameter efficiency does not fully translate into better computational efficiency.

Questions for authors

Q1: Could the authors provide cross-dataset or cross-domain transfer experiments, such as pretraining on source datasets and transferring to unseen target datasets, to further validate the model's generalization ability and its positioning as a foundation model?

Q2: Could the authors provide more detailed ablation studies by separately removing neighbor reliability scoring, gating mechanisms, topology-guided latent calibration, and individual loss functions to measure the contribution of each component?

Q3: Could the authors evaluate pretraining on graph data with naturally missing modalities and compare the performance of pretraining with only complete nodes against pretraining that also includes incomplete nodes? Could they also provide robustness results under property-dependent missingness?

Q4: Could the authors further explain why the reduction in trainable parameters does not lead to lower fine-tuning and inference costs, and report the end-to-end computational costs of generative tasks to provide a more complete efficiency evaluation?

1 comment

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 and Q1: We acknowledge the need for cross-dataset experiments. To extend this evaluation, we introduce CDs for node classification and Arts for link prediction. The task protocols and data splits for node classification and link prediction follow those in Table 1 of the paper

MethodCDs AccCDs macro-F1Arts MRRArts Hits@3
LGMRec55.3857.5746.4153.48
GFT53.4855.3443.3952.54
PLANET54.5456.7038.6044.51
GraphBind58.1460.5846.8955.28

The downstream results above show that GraphBind also maintains strong performance on unseen graphs. We will add descriptions of the CDs and Arts datasets to Appendix A.4 in our revised manuscript

For W2 and Q2: Due to the rebuttal word limit, we add an Additional Results section in Appendix A.7, which presents the supplementary ablation settings, results, and analysis. Please refer to Table 6 there for the individual contributions of the pretraining components and objectives

For W3 and Q3: During pretraining, we combine three modality absence protocols to simulate natural modality absence in MAGs. Independent absence randomly hides modality inputs to simulate scattered acquisition failures. Neighborhood-correlated absence hides modality inputs among connected nodes to simulate acquisition failures affecting related groups of nodes. Property-dependent absence varies the missing probability with node properties to simulate uneven modality availability associated with factors such as node degree. This approach does not require naturally incomplete datasets, allowing GraphBind to learn under diverse modality absence patterns across a broader range of datasets

We additionally evaluate robustness under property-dependent absence on Grocery node classification, with absence probabilities increasing with node degree and shared absence masks across methods. Due to the limited rebuttal time, we report results at absence rates of 0.0, 0.4, and 0.8. Each entry reports Accuracy / Macro-F1 (%)

Method0.00.40.8
RiemannGFM81.03 / 72.0072.89 / 66.3435.04 / 37.88
MMGCN79.51 / 69.1766.98 / 58.3532.30 / 33.94
PLANET73.48 / 55.3347.37 / 35.0924.39 / 16.46
GraphBind81.97 / 74.7273.68 / 68.1836.68 / 38.93

Together with the independent and neighborhood-correlated absence results, these results demonstrate GraphBind's robustness across all three modality absence protocols

For W4 and Q4: Thank you for emphasizing the distinction between parameter efficiency and computational efficiency. The number of trainable parameters determines the size of the parameter update, while runtime also depends on the computations executed for each input. GraphBind still computes reliability scores over edges, aggregates neighborhood semantics, performs latent calibration, and processes topology prompts. Freezing parameters removes their updates but retains the forward computation needed to produce their outputs. These operations explain why fewer trainable parameters can coexist with higher adaptation or inference costs than simpler baselines

We compare the costs of UniGraph2, PLANET, and GraphBind within the end-to-end G2Text pipeline. Graph encoding measures representation extraction, and generation interface measures conversion to text prefixes; total forward is their sum. Model backward measures gradient computation through these modules, and peak GPU memory reports inference and training memory use

MethodGraph encoding (ms/batch)Generation interface (ms/batch)Model backward (ms/batch)Total forward (ms/batch)Peak GPU memory, inference / training (GiB)
UniGraph2153.30 ± 14.651.98 ± 1.79175.93 ± 16.05155.28 ± 15.362.29 / 6.44
PLANET244.73 ± 46.833.00 ± 1.60177.51 ± 27.80247.74 ± 47.251.19 / 2.05
GraphBind115.10 ± 10.7612.13 ± 7.476.46 ± 12.72127.23 ± 9.524.17 / 4.17
Reviewer_nxegOpenReview ↗
Rating
2
Confidence
3
Informativeness
2
Presentation
2
Soundness
1
Read review
Paper summary

This paper proposes GraphBind, a topology-driven multimodal graph foundation model for graphs with incomplete node attributes. The method incorporates modality absence into pretraining, combines node self-semantics with reliability-weighted neighborhood information, and uses topology-guided latent calibration to construct a shared representation space. The authors evaluate GraphBind on eight datasets from OpenMAG against representative multimodal graph models and graph foundation models. The paper reports discriminative and generative results, together with ablation and missing-modality analyses.

Critical strengths
  1. The proposed combination of modality masking and neighborhood-based semantic completion is well motivated.

  2. Treating graph topology as a source of complementary information, rather than merely as an input to downstream prediction, provides a coherent direction for multimodal representation learning.

  3. The evaluation spans four task types and includes strong multimodal graph foundation model baselines.

Critical weaknesses
  1. The title’s “Omni Multimodal” framing also appears broader than the demonstrated setting: the reported experiments use text and image features encoded by CLIP. The paper does not establish transfer to other modalities and should either narrow this terminology or provide additional evidence.

  2. The generalization claim is not equally supported across tasks. The appendix states that Toys, Grocery, Movies, and RedditS are included in pretraining, while these datasets are also used for node classification or few-shot node classification. This is a valid transductive setting if labels are withheld, but it should not be presented as evidence of transfer to unseen graphs.

  3. Missing cross-reference to Tables 1 & 2. The image-generation results also warrant a more nuanced interpretation: in Table 2, GraphBind achieves the best CLIP-S, but UniGraph2 has a higher DINO-S (49.22 versus 48.91). Thus, the evidence does not show that GraphBind leads on every generative metric. Table 3, "The second results are underlined," is missing.

  4. Figure 3 contains a lot of information but lacks a clear flow of symbols. Most of it is just abstract diagrams. The "Overall Pipeline" at the top of the picture does not clearly correspond to the lower part of the picture. And Figure 3 contains the typo “Structual Signals,” which should be corrected to “Structural Signals.”

Questions for authors
  1. The main results do not clearly establish how much of the improvement comes from the proposed topology-driven pretraining, as opposed to task-specific adaptation capacity. This is particularly important for graph-to-text generation: GraphBind uses the G2M-Adapter to construct graph prefixes, whereas the compared baselines use a shared prefix projection module.

  2. For link prediction, are validation and test edges removed from every topology-derived input, including neighborhood aggregation and diffusion-based quantities? A clear description of edge splitting and preprocessing would help rule out leakage.

  3. How much of the benefit comes from topology-driven binding rather than CLIP’s already aligned text–image space? Would performance persist under weaker or separately trained modality encoders, or after disrupting the graph topology?

  4. For node classification, what node attributes, edges, and labels are accessible during pretraining? Please explicitly distinguish the transductive evaluations on pretraining graphs from transfer to entirely unseen graphs.

1 comment

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: 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.

For W2 and Q4: We acknowledge that the original manuscript did not clearly distinguish evaluations on pretraining graphs from transfer to unseen graphs. During pretraining, GraphBind can access the observed text and image attributes, modality availability, and graph edges of Toys, Grocery, Movies, RedditS, Ele-fashion, and Sports. This includes the attributes and edges of nodes later assigned to the validation and test sets for node classification. Node labels are excluded from the pretraining objectives; the model learns through modality reconstruction, contrastive learning, and the shared latent objectives.

Evaluation datasetsAccessible during GraphBind pretrainingEvaluation setting
Toys, GroceryObserved node attributes and graph edges; no node labelsTransductive node classification
Movies, RedditSObserved node attributes and graph edges; no node labelsTransductive few-shot node classification
DY, Bili_DanceNo target graph attributes, edges, or labelsTransfer to unseen graphs for link prediction
Flickr30k, SemArtNo target graph attributes, edges, or generation targetsTransfer to unseen graphs for generation

For node classification, training labels are used during downstream adaptation, validation labels select the downstream checkpoint, and test labels are used for evaluation. The few-shot setting limits the labeled examples available for adaptation but still uses graphs seen during pretraining. For the four unseen datasets, the pretrained encoder is adapted using the corresponding downstream training data. We have added these clarifications to Appendix A.6 of the revised manuscript.

For W3: Thank you for pointing out these presentation issues in Section 5.2. We have made the following revisions:

  • Added references to Tables 1 and 2 in the corresponding result discussions.
  • Clarified the results for G2Image.
  • Added underlines for the second-best results in Table 3.

For W4: Thank you for your suggestions on improving Figure 3. We have made the following revisions:

  • Added RNSC and TGLC labels to the detailed modules and defined both abbreviations in the legend.
  • Added arrows between modules and numbered the three steps within RNSC to clarify the information flow.
  • Added a legend explaining the feature symbols, reliability scores, gates, and frozen/trainable modules.
  • Corrected “Structual Signals” to “Structural Signals.”

For Q1: We have conducted ablation experiments to evaluate whether the G2M-Adapter itself improves downstream task performance; please refer to our response to W2 and Q3 for Reviewer Sr9i.

For Q2: Validation and test edges are excluded from the graph supplied to GraphBind, including the inputs used for neighborhood aggregation, topology encoding, and diffusion weights. Due to the response character limit, we provide the detailed edge splitting and topology preprocessing protocol in Appendix A.6 of the revised manuscript.

For Q3: We added two experiments on Grocery node classification. The first experiment focuses on the encoder settings. We replaced the CLIP features across all six pretraining datasets with text and image features from separately pretrained BERT and ViT encoders, respectively, and pretrained GraphBind again. The second experiment focuses on sensitivity to graph topology. We randomly rewired approximately 50% of the original non-self-loop edges while preserving each node’s in-degree and out-degree, the total edge count, and self-loops. We recomputed all topology inputs and neighborhoods from the rewired graph before evaluation.

SettingGrocery AccGrocery macro-F1
CLIP + Original topology81.9774.72
BERT + ViT + Original topology77.2771.74
CLIP + Rewired topology81.9474.70

These results show that GraphBind remains effective even with separately pretrained modality encoders or disrupted topology. This is consistent with its design: reliable neighborhood completion supplements node semantics, while the learned gate balances self and neighborhood information to limit the influence of unreliable neighbors

Reviewer_Sr9iOpenReview ↗
Rating
3
Confidence
2
Informativeness
2
Presentation
3
Soundness
3
Read review
Paper summary

The paper introduces GraphBind, a framework for MGFMs to learn unified representations from multimodal graphs with incomplete node attributes. The framework simulates absence of modalities, selects reliable neighborhoods to complement missing node attributes, and uses topology to calibrate the projections in the shared latent space. The learned representations are then adapted for discriminative and generative tasks through lightweight tuning.

Critical strengths
  1. The paper is well organized; its proposed framework is closely related to the stated bottlenecks.

  2. The experiment demonstrates the efficiency of the proposed framework. The ablation and robustness experiments also provide meaningful evidence for their design choice.

Critical weaknesses
  1. Section 4.1 and Appendix A.2 introduce the three absence simulation protocols, and Appendix A.6 provides the hyperparameters. But the manuscript does not demonstrate how absence simulation protocols are incorporated into the pretraining.

  2. The paper does not clearly evaluate the significance of individual components of its framework. Please see point 2. and 3. below in the “Questions For Authors”.

Questions for authors
  1. How are the three absence simulation protocols incorporated into the pretraining stage? Are they implemented simultaneously or random selected?

  2. The framework uses both absence simulation and masked feature during the pretraining. What additional benefit does the absence simulation provide beyond the reconstruction mask?

  3. GraphBind use the different G2M-Adapter when compared with the baselines. What additional improvement does the task specific adapter provide?

3 comments

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 and Q1: We use the three absence protocols equally for each pretraining dataset. In each block of three updates, we apply independent, neighborhood-correlated, and property-dependent absence once each in random order. Each update uses one protocol for both text and image, with missing positions sampled separately for each modality. This rotation gives each dataset equal exposure to the three protocols while preserving the missingness pattern of each protocol within an update. By including all three settings in every block, we train GraphBind to identify reliable neighbors and balance their information against the node’s remaining modalities across these settings. We have added these details to Appendix A.2 of the revised manuscript.

For W2 and Q2: Both absence simulation and reconstruction masking hide modality features from the encoder. Reconstruction masking selects observed features as recovery targets, while modality absence simulation determines how missing inputs are distributed across the graph. For intuition, the information available for recovery depends on whether modality loss clusters within neighborhoods or varies with node degree. Together, they extend reconstruction training to structured patterns of modality absence.

To examine the contribution of modality absence simulation, we pretrained GraphBind again with reconstruction masking alone while retaining the other pretraining objectives. We then compared this model with GraphBind pretrained using modality absence simulation on Grocery node classification and DY link prediction, using the same downstream adaptation methods.

VariantGrocery AccGrocery macro-F1DY MRRDY Hits@3
w.o. Modality Absence Simulation81.3874.3073.7874.91
Modality Absence+Reconstruction Masking81.9774.7275.2376.00

Experiment results above show that pretraining with modality absence simulation achieves higher scores on both two tasks. This improvement suggests that combining modality absence simulation with reconstruction masking encourages the encoder to recover missing semantics from available modalities and neighborhood information, improving the shared representations learned during pretraining.

For W2 and Q3: We acknowledge the insufficient explanation of the G2M-Adapter’s contribution in our original manuscript. We conducted three sets of experiments to evaluate whether the G2M-Adapter improves generation performance: With G2M-Adapter uses the proposed adapter to transform graph representations into generation inputs; Baseline Interface uses a shared prefix projection for G2Text and a pooled graph projection for G2Image; No G2M-Adapter sets graph features to zero while retaining the token slots and text prompts.

GraphBind settingG2Text BLEU-4G2Text ROUGE-LG2Image CLIP-SG2Image DINO-S
With G2M-Adapter16.8443.5470.0148.91
Baseline Interface9.2733.4167.4145.72
No G2M-Adapter4.1822.8864.1844.22

The results of these experiments show that the G2M-Adapter outperforms both other settings, improving BLEU-4 and ROUGE-L from 9.27 and 33.41 to 16.84 and 43.54, respectively, and CLIP-S and DINO-S from 72.48 and 53.78 to 75.19 and 58.33 compared with the baseline interface. These results suggest that the G2M-Adapter helps translate graph semantics into representations that generative models can use, allowing node and neighborhood information to guide generation beyond the textual prompts alone.

I want to thank the authors for their response. I will maintain my score.

We sincerely thank you for your positive feedback and recognition of our work. We are glad to hear that our responses have fully addressed your concerns.

Comments on the paper

1 comment

Dear AC,

We would like to express our gratitude to the reviewers for their valuable feedback. We have carefully considered all suggestions and updated our submission accordingly.

However, we have not yet received responses from Reviewer nxeg, and Reviewer GfZa. As the discussion phase is approaching its end, we would like to kindly request your assistance in reaching out to these reviewers. It would be greatly appreciated if you could encourage them to review our rebuttal, as we are eager to know if we have adequately addressed their questions and concerns.

Thank you for your hard work and support.

From OpenReview, CC BY 4.0. Authors as signed there; shown unedited.

Related papers

Loading the map…

Discussion (0)

Sign in to comment.