- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
DMGraph proposes a framework for multimodal graph learning that integrates textual, visual, and structural information to improve graph-based generation and classification tasks. Its main idea is to dynamically adjust the importance of neighboring nodes based on their content, allowing the model to prioritize relevant connections and reduce the influence of noisy or unrelated neighbors. It also introduces a hierarchical contrastive alignment strategy that aligns representations at the node, subgraph, and batch-global levels, using debiased negative sampling to mitigate false negatives during training.
Critical strengths
- DMGraph outperforms the reported variants across several datasets and tasks
-The appendices further include comparisons with alternative methods, ablation studies, hyperparameter sensitivity, expanded-neighborhood experiments, and robustness to injected edges.
Critical weaknesses
-
Appendix B provides several theoretical results, including bounds on approximation error and Lipschitz continuity. However, it is not entirely clear what these results add beyond established properties of bilinear attention and contrastive learning. Could the authors better explain what is theoretically new here and how these results improve our understanding of DMGraph?
-
Although the larger-neighborhood experiments demonstrate actual pruning, it remains unclear how much of the improvement comes from sparse edge selection versus continuous reweighting. Can the authors disentangle these two effects more clearly?
Questions for authors
-
Equation 17 uses only H^t,out as the key/value input to cross-attention.Is this intended, or should other representations also be included?
-
Some variables used in the equations are not clearly defined, making parts of the method difficult to follow.
-
Figure 1 is difficult to follow in its current form. The different components and the flow of information between them are not sufficiently clear, making it hard to understand. The authors could improve the figure by adding clearer labels, indicating the direction of information flow, and making the connections between the main components more explicit.
3 comments
Response to Reviewer 6mKA (2/2)
3. Equation (17): key/value source and the role of
The submitted Eq. (17) uses as both key and value:
Q^{(\ell)}=\operatorname{FFN}\!\left(\operatorname{CrossAttn}(\bar Q^{(\ell)},H^{v,out},H^{v,out})\right).$$ In the submitted formulation, $H^{v,out}$ supplies key/value. The query stream consists of learnable query tokens conditioned on textual embeddings, while visual graph representations supply the cross-attention memory; textual content also enters the PLM input through $\operatorname{Embed}(X^t)$ in Eq. (18). The preceding sentence introduces $H^{t,out}$ and $H^{v,out}$ without distinguishing these roles, which makes the interface appear inconsistent. We have revised Section 3.5 and replaced Figure 1 to separate the query-side text route, the visual key/value route, and the final textual PLM input. ### 4. Undefined variables and Figure 1 We have synchronized the equations, Appendix A's notation table, and Figure 1 around one dataflow specification. The revision defines the modality-specific candidate support $\mathcal{C}^m$, the valid row count $r_i$, the gate and diffusion budgets $K_s/K_d$, the subgraph readouts $s^t/s^v$, the batch contexts $c^t/c^v$, the context-conditioned representations $g^t/g^v$, and the Q/K/V roles in Eq. (17). The revised figure labels the contrastive objectives as training-only, replaces “global” with “batch context,” and distinguishes the text-conditioned query stream from the visual key/value route. ### Summary The theory is now presented as a scoped characterization of DMGraph rather than as new generic attention theory. The expanded-neighborhood results explicitly separate dense weighting, hard sparsity, and the differentiable gate. Equation (17), the notation table, and Figure 1 are now synchronized around the clarified computation. Thank you for identifying where the paper's current compression obscured both the scientific claim and the computation.A Kindly Reminder
Dear Reviewer 6mKA,
Thank you again for recognizing the consistent empirical improvements of DMGraph and the breadth of the analyses provided in the appendix. Your comments were particularly helpful in identifying where the theoretical role and computational pipeline required clearer presentation.
In response, we reframed the theoretical analysis as a model-specific characterization of the operator optimized by DMGraph, including its bilinear expressivity, the exact boundary between reweighting and pruning, and Top-K support stability. We also foregrounded the controlled Dynamic Dense, Hard Top-K, and DMGraph comparisons under matched candidate sets and edge budgets. In addition, we clarified the text-conditioned query route and visual key/value route in Eq. (17), synchronized the notation, and replaced Figure 1 with a clearer dataflow that distinguishes training-only alignment objectives from the foundation-model inference path.
We understand that this is a demanding stage of the review process. As the discussion period is coming to an end, we would appreciate knowing whether these revisions have resolved your concerns. If so, we would be grateful for your continued support for the paper’s acceptance. We remain available for any further discussion or clarification before the period closes.
Thank you again for your careful and constructive feedback.
Response to Reviewer 6mKA (1/2)
Thank you for recognizing the consistent empirical improvements and the breadth of the appendices. Your comments identify two places where the paper over-compresses its argument: the role of the theoretical analysis and the separation between sparsity and weighting. Your questions about Eq. (17), notation, and Figure 1 expose the same presentation problem at the implementation level. We address each point below.
1. What the theoretical results add
Direct answer. The theoretical contribution is a unified characterization of the operator actually optimized by DMGraph. Appendix B connects its scorer, gate, and alignment objectives to three design-relevant properties: the bilinear adjacency class realizable on a fixed candidate set, the exact boundary between reweighting and pruning, and support stability under a score margin. SVD factorization, sigmoid Lipschitzness, and the standard InfoNCE reference are established tools used to derive these model-specific consequences and to delimit the valid claims in each regime.
The analysis supplies three model-specific consequences:
Appendix B.4 also limits the contrastive interpretation: standard population InfoNCE assumptions do not directly apply to the anchor-dependent hardness tilt or to representations coupled through the same minibatch context. We therefore treat these losses as training objectives and rely on ablation/diagnostics for their empirical role.
We will rewrite the theory section around these design consequences and remove any wording that suggests new generic attention or contrastive-learning theory.
2. Sparse selection versus continuous reweighting
Tables 6-7 already contain a three-way controlled comparison in expanded neighborhoods:
At cap 64 on WikiWeb2M, the dense-to-hard difference is +0.0097 ROUGE-L, the hard-to-DMGraph difference is +0.0150, and the dense-to-DMGraph difference is +0.0247. On Goodreads-LP the corresponding differences are +0.0074, +0.0213, and +0.0287 R-L. These are observed variant contrasts, not a complete causal decomposition: Hard Top-K and DMGraph differ in their forward/backward rules as well as in how scores influence selected edges. We will state this limitation and place the variant definitions next to the table.
The conservative conclusion is that (i) restricting propagation helps relative to using all candidates in expanded neighborhoods, and (ii) at the same retained cardinality, DMGraph's learned differentiable gate outperforms hard selection. We will make this evidence prominent in the main text.