- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper addresses open-world multimodal graph learning, where new classes appear after deployment. The authors propose MOVE, which detects unknown nodes by jointly modeling visual, textual, and graph signals. A multimodal LLM only proposes candidate classes, which are grounded in node evidence and admitted only if they generalize on held-out nodes without redundancy. On four benchmarks, MOVE improves unknown recognition, annotation, and downstream tasks, while greatly reducing LLM calls.
Critical strengths
- The paper doesn't just ask "which nodes are unknown?" It asks when the class space is actually insufficient and when a new class is worth adding. That's a useful way to look at it.
- Each of the three modules matches one of the failure modes found in the empirical study, so the story hangs together nicely.
- It's way faster than the baselines and uses only 3–25 LLM calls instead of hundreds or thousands.
Critical weaknesses
- Both the diagnostics and the main metrics (like G-to-U similarity) rely on CLIP embeddings, so the evaluation may be biased toward CLIP's view of semantics. Maybe authors can try latest multi-modal embedding models.
- The "best across the board" claim is a bit strong. On some datasets, such as Movies precision and Toys modality matching, MOVE isn't clearly ahead.
- The method consists of too much hyper-parameters for tuning. Maybe authors could make more exploration on the hyper-parameters.
- The theorems only hold under strong assumptions, like a fixed candidate and fixed weights, and say nothing about whether the new class is semantically correct.
- The overall presentation of the paper could be further improved.
Questions for authors
- When MOVE rejects a candidate, is it usually because the candidate is truly bad, or because the group is small or noisy? Could you show qualitative examples of accepted, rejected, and wrongly merged classes?
- Only Qwen3-VL-Flash is used. Do the results hold with weaker or stronger MLLMs, and does the verification step really fix hallucinations when the generator is poor?
4 comments
W5; Q1; Q2 — Part 2/2: Divided in parts due to space constraints
W5: Clarity and presentation
Thank you for this suggestion. We will further revise the manuscript to improve its clarity and presentation. Could you please point out the specific passages or explanations you found unclear? This would help us make more targeted revisions.
Q1: Qualitative examples of candidate acceptance, merging, splitting, and rejection
The newly added cases make MOVE's admission criterion concrete: a candidate description is evaluated together with its multimodal support and its effect on the active class space. Four examples trace acceptance, merging, split detection, and rejection after merging. Location: Sec. 6.7, Fig. 7; Appendix D.8.1.
| Case in Fig. 7 | Supporting observations | Decision and reason |
|---|---|---|
| (a) Accept | Six snack care-package nodes | Snack Food is accepted; compression and stability checks pass, ΔL ≈ +0.00194. |
| (b) Merge | Two groups of 105 and 142 nodes, including factory and city photographs | Consolidated into a 247-node group named urban landscape photography; both checks pass, ΔL ≈ +0.28671. |
| (c) Split flagged | Seven nodes mixing coral-reef and space-debris documentaries | Flagged for splitting; the next step is to form coherent subgroups and re-propose candidate categories for verification. |
| (d) Reject after merge | Two groups of 42 and 520 nodes, illustrated by coral and squirrel photographs | The merged Pet Supplies proposal is rejected for negative compression gain, ΔL ≈ −0.00292. |
MOVE accepts a coherent, evidence-supported candidate when it passes the compression and stability checks, as illustrated by the six-node Snack Food group. Compatible groups are consolidated when their merged candidate passes these checks, as with urban landscape photography. Mixed-topic groups are flagged for splitting and re-proposal, as with Nature Documentary. A semantically mismatched candidate is rejected when its compression gain is negative, as with Pet Supplies. These actions make class-space evolution an explicit evidence-based decision.
Q2: Generalization across MLLM generators and verification of incorrect candidates
In MOVE, the MLLM proposes candidates, while multimodal grounding and selective expansion determine admission. In a newly added generator experiment, we evaluated three alternative model families, retaining Qwen3-VL-Flash as the reference. All variants use identical frozen evidence, a four-word candidate limit, and the same verification and downstream training procedures. The table reports four-dataset averages. Location: Sec. 6.4; Appendix D.1–D.2, Fig. 12.
| Generator | G-to-U (%) | NC accuracy (%) |
|---|---|---|
| Qwen3-VL-Flash (reference) | 73.66 | 47.08 |
| Gemma 3 4B IT | 66.80 | 49.89 |
| Kimi K3.1 Pro | 70.23 | 50.79 |
| DeepSeek V4.1 Flash | 69.72 | 48.61 |
The smaller Gemma model achieves 49.89% average NC accuracy. The useful downstream performance across generator families supports MOVE's separation of candidate proposal from evidence-grounded admission.
We also added a wrong-candidate injection experiment with 56 semantically mismatched names and definitions. This exploratory test uses dataset-specific stability thresholds selected on the injected batch. Five-seed mean admission falls from 100% with the semantic and stability gates bypassed to 20%, 40%, 40%, and 20% with the full checks on Toys, Grocery, Movies, and Reddit-S, respectively. The reduction shows how verification filters semantically mismatched proposals before they enter the class space. Location: Sec. 6.4; Appendix D.8.3, Table 6.
Dear Reviewer,
We would like to thank you for your positive recognition of our work. Based on your concerns in rebuttal we have now incorporated your suggestions in the manuscript.
As the author-reviewer discussion phase is nearing its conclusion in a few hours, we would like to politely inquire if you have any outstanding concerns regarding our work. We’d be more than happy to elaborate on any aspect that might need further explanation.
Dear Reviewer, As we are nearing the end of the discussion period, we hope you have had a chance to look at our rebuttal and the revised manuscript. If they address your concerns, we would appreciate it if you could consider updating your rating; if not, please let us know what remains. Thank you for your time and feedback.
W1–W4 — Part 1/2: Divided in parts due to space constraints
We sincerely thank the reviewer for the careful and detailed assessment of our work.
W1: Dependence on CLIP and potential evaluation bias
We added cross-encoder experiments with SigLIP2, BLIP, ALIGN, and FLAVA to test whether the findings motivating MOVE persist beyond CLIP. Across the five encoders, the four-dataset mean support for highly plausible proposals ranges from 19.67% to 34.44%. Each encoder's average adapted-Generic gain decreases on independent validation evidence, supporting evidence-grounded verification across representation models. Location: Sec. 4; Appendix A.5, Figs. 8–10.
Four-dataset averages are reported below. Support uses the full rule; Generic gains use adaptation strength α=0.5 on proposal (P) and independent validation (V) evidence.
We also added backbone-replacement experiments for the complete MOVE pipeline, keeping detector and admission thresholds fixed. The four replacement encoders achieve four-dataset mean NC accuracies of 47.17–48.78%, compared with 47.08% for the default CLIP reference. Location: Sec. 6.4; Appendix D.2, Fig. 11.
Four-dataset averages are reported below. UCA is evaluated in each encoder's own embedding space.
Together, these results support the paper's central distinction between proposing a semantic class and verifying its value for expansion, with comparable downstream performance across encoders.
W2: Wording of the overall-performance claim
We have refined the contribution statement to “best overall performance” to describe MOVE's strong results across the evaluated tasks and datasets more precisely.
W3: Hyperparameter sensitivity and robustness
We added a 5 × 5 joint sensitivity experiment on Toys, varying the unknown-tail cutoff multiplier (0.25–2.0) and stability tolerance (0.025–0.4). For admitted concepts, mean G-to-U ranges from 59.58% to 64.60% and mean K-to-G from 50.65% to 53.84%, showing relatively stable semantic scores across the grid. Location: Sec. 6.4; Appendix D.5, Fig. 13(a)–(b).
We also added candidate-budget experiments on all four datasets, varying the budget from 1 to 24. Increasing the budget from 16 to 24 leaves MM scores unchanged on Grocery, Movies, and Reddit-S and improves Toys from 72.50% to 76.69%. Location: Sec. 6.4; Appendix D.5, Fig. 13(c)–(d).
Together with the existing λ, α, β, and η analyses, these results show that MOVE maintains strong, relatively stable performance across most tested hyperparameter settings, supporting its robustness to parameter choices. Location: Sec. 6.4, Fig. 4.
We also clarified how λ and α enter the operational admission score:
\mathcal A_{g,m}^{\mathrm{op}} &=G_{g,m}^{\mathrm{LCB}} -\lambda_{\Omega}R_{g,m}^{\mathrm{red}} -\lambda\omega_{g,m}^{\mathrm{sem}}(\alpha) -\lambda_{\Xi}\Xi_{g,m},\\\\ \omega_{g,m}^{\mathrm{sem}}(\alpha) &=\operatorname{clip}\\!\left( \frac{1+\alpha C_{g,m}^{\mathrm{sem}}}{1+\alpha}, \omega_{\min},\omega_{\max}\right). \end{aligned}$$ Here, $G^{\mathrm{LCB}}$ is the held-out gain lower bound, $R^{\mathrm{red}}$ measures redundancy, $\Xi$ measures interference with existing classes, and $C^{\mathrm{sem}}$ is the conditional semantic code length based on distance to active-class prototypes. $\lambda$ scales the complexity penalty, while $\alpha$ controls its dependence on semantic distance; $\alpha=0$ gives a unit multiplier. The default admission threshold is $\mathcal A_{g,m}^{\mathrm{op}}\geq0$. **Location: Appendix B.4.** ### W4: Assumptions and scope of the theoretical analysis Thank you for pointing this out. We have clarified the assumptions and conclusions of both theorems. Theorem 1 establishes **consistency of a sample-mean admission rule for a fixed candidate and codebook** under i.i.d. validation sampling, bounded gains, and a nonzero population margin. Theorem 2 establishes **coding-cost separation under fixed reliability weights and the stated incremental mismatch conditions**. We have scoped the theoretical claims to these properties of the coding and admission objectives. **Location: Appendix C.1–C.2.** Continued in the next part.