acceptodds
Under review as a conference paper at ICLR 2027

MOVE: Multimodal Open-world Verification and Expansion for Graph Learning

Abstract

Multimodal graph learning faces a fundamental challenge: new classes may emerge after deployment, while models are trained with a fixed label space. Existing approaches typically detect unknown nodes and use LLMs to generate candidate class descriptions, but they do not determine whether existing classes are insufficient to cover these nodes or whether a generated class is reliable enough to expand the class space. Our empirical study reveals three challenges: multimodal information beyond individual modalities is required for unknown-node identification, LLM-generated class descriptions may not fully capture multimodal class characteristics, and directly adding candidate classes can introduce redundant categories. Based on these observations, we propose MOVE, a multimodal open-world class verification and expansion framework. MOVE identifies nodes that cannot be assigned to existing classes by jointly considering visual tokens, textual attributes, and graph context, leverages a multimodal LLM to generate candidate classes, and selectively expands the class space only when candidates are consistently supported by multimodal evidence without introducing unnecessary categories. Experiments demonstrate that MOVE achieves an average improvement of 2.73% across unknown recognition, open-domain annotation, and downstream graph learning tasks.

Primary area:
transfer learning, meta learning, and lifelong learning
Keywords:
Open-World Graph Learning, Multimodal Graph Learning

Reviews

Among:
Shape:
1234this paper, Top 15%
Figure 1. Mean review rating of the reviewed papers at ICLR 2027. This paper averages 3.00 over 3 reviews, above 85% of the others.
Reviewer_RxTGOpenReview ↗
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
AuthorsOpenReview ↗

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\alpha=0.5 on proposal (P) and independent validation (V) evidence.

EncoderHigh-plausibility support (%)Generic gain P (%)Generic gain V (%)
CLIP (reference)26.112.541.30
SigLIP234.440.350.18
BLIP32.993.601.70
ALIGN33.121.640.62
FLAVA19.676.283.45

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.

EncoderG-to-U (%)K-to-G (%)NC accuracy (%)
CLIP (reference)73.6665.4847.08
SigLIP290.7285.7148.73
BLIP82.4070.8147.17
ALIGN89.0083.5747.32
FLAVA72.4456.7148.78

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 λ\lambda and α\alpha 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.
AuthorsOpenReview ↗

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. 7Supporting observationsDecision and reason
(a) AcceptSix snack care-package nodesSnack Food is accepted; compression and stability checks pass, ΔL ≈ +0.00194.
(b) MergeTwo groups of 105 and 142 nodes, including factory and city photographsConsolidated into a 247-node group named urban landscape photography; both checks pass, ΔL ≈ +0.28671.
(c) Split flaggedSeven nodes mixing coral-reef and space-debris documentariesFlagged for splitting; the next step is to form coherent subgroups and re-propose candidate categories for verification.
(d) Reject after mergeTwo groups of 42 and 520 nodes, illustrated by coral and squirrel photographsThe 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.

GeneratorG-to-U (%)NC accuracy (%)
Qwen3-VL-Flash (reference)73.6647.08
Gemma 3 4B IT66.8049.89
Kimi K3.1 Pro70.2350.79
DeepSeek V4.1 Flash69.7248.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.

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

This paper studies open-world learning on multimodal graphs, where new classes may appear after training. It proposes MOVE, which uses images, text, and graph structure to identify unknown nodes. A multimodal LLM suggests new class descriptions, and MOVE checks whether the data supports them before adding new classes. Experiments on four datasets show improvements in class annotation and downstream node classification.

Critical strengths

The paper addresses a useful problem: deciding when to add a new class. Checking candidates on separate validation nodes and controlling overlap with existing classes make the approach well motivated.

The experiments cover four datasets and several tasks. MOVE achieves the best node classification results on all four datasets, showing that the discovered classes can help downstream learning.

Critical weaknesses

The main experiments simulate new classes by hiding half of the existing classes. This provides limited evidence about performance when new classes arrive over many stages in a real system.

The quality of generated class names is mainly measured using CLIP similarity. This metric does not fully show whether all unknown classes are discovered or whether the names are useful to people.

Questions for authors

See weakness

6 comments
AuthorsOpenReview ↗

W1 — Part 1/3: Divided in parts due to space constraints

We sincerely thank the reviewer for the careful and detailed assessment of our work.

W1: Multi-stage class expansion

MOVE's class space is designed to accumulate verified concepts over time. The one-stage protocol evaluates recognition, annotation, and expansion under a controlled known/unknown split. To additionally examine repeated arrivals, we added 2-, 3-, and 5-stage experiments that apply the same detection, induction, and admission process after each batch of novel classes.

Previously admitted classes and their representations remain active at subsequent stages. New candidates are checked against the accumulated class space, including in the redundancy assessment. The experiments therefore exercise a central feature of MOVE: each verified addition changes the knowledge against which later observations and proposals are evaluated.

Fig. 16 presents selected trajectories on Toys, Grocery, and Reddit-S. Its horizontal axis is the cumulative fraction of novel classes that has arrived, and the one-stage final results appear as horizontal references. The table summarizes the final-stage Grocery results. Location: Sec. 6.6; Appendix D.7, Fig. 16.

Arrival stagesKnown accuracy (%)UCR coverage (%)G-to-U (%)NC accuracy (%)
1 (reference)90.1263.9865.7837.60
290.4577.6469.1838.27
390.2764.1972.1439.56
590.1759.6876.6637.80

Two observations directly address the concern. First, known-class accuracy stays around 90% under all three multi-stage schedules, close to the 90.12% one-stage reference. Second, final NC accuracy is 38.27%, 39.56%, and 37.80%, compared with 37.60% for the reference; final G-to-U similarity is also higher in each schedule.

These results further validate progressive class expansion while preserving initial known-class recognition and maintaining downstream utility. They make the role of persistent verified knowledge explicit: accepted classes participate in later assignment and candidate assessment, so expansion is integrated with subsequent recognition and learning.

UCR coverage is evaluated on the classes arriving at each stage, while G-to-U uses accumulated accepted concepts. Alongside known-class and downstream accuracy, these metrics characterize the repeated updates requested by the reviewer.

Continued in the next part.

AuthorsOpenReview ↗

W2-part1 — Part 2/3: Divided in parts due to space constraints

W2: Evaluating generated categories beyond CLIP similarity

MOVE assesses generated categories through multimodal grounding, selective admission, and their use in downstream learning. CLIP supplies the default representation for this workflow. To address the question of category quality beyond that representation, we added encoder-replacement experiments together with evidence-linked qualitative cases.

We replaced CLIP with SigLIP2, BLIP, ALIGN, and FLAVA throughout visual and textual encoding, candidate and prototype representation, and UCA evaluation. Graph construction, admission rules, and detector and admission thresholds remain fixed across encoders. This evaluates the same verification-and-expansion framework under alternative multimodal representations.

The table reports four-dataset averages, with UCA computed in each encoder's normalized image-text space. Location: Sec. 6.4; Appendix D.2, Fig. 11.

EncoderG-to-U (%)K-to-G (%)NC accuracy (%)
CLIP (reference)73.6665.4847.08
SigLIP290.7285.7148.73
BLIP82.4070.8147.17
ALIGN89.0083.5747.32
FLAVA72.4456.7148.78

The four replacements obtain mean NC accuracies of 47.17–48.78%, compared with 47.08% for CLIP. The comparable downstream performance shows that MOVE's workflow transfers across all five encoder settings. Its ability to generate and use category annotations is retained when the underlying semantic representation changes.

Downstream classification provides an outcome beyond embedding similarity.

The cases in the next part address the practical meaning of the labels by showing which recurring observations they describe and how they guide category decisions. Together, the quantitative and qualitative additions directly connect the representation study to the reviewer's concern about useful generated categories.

Continued in the next part.

AuthorsOpenReview ↗

W2-part2 — Part 3/3: Divided in parts due to space constraints

W2 (continued)

Generated category names link unresolved observations to an evolving class space. Their practical value is to make a group's recurring content and the supported action understandable. Our newly added cases link readable descriptions to observations and category decisions.

Each description is grounded in its observations and evaluated for admission. The resulting category organizes unresolved nodes and supports later recognition and learning. Location: Sec. 6.7, Fig. 7; Appendix D.8.1.

Case in Fig. 7Supporting observationsDecision and reason
(a) AcceptSix snack care-package nodesSnack Food is accepted; compression and stability checks pass, ΔL ≈ +0.00194.
(b) MergeTwo groups of 105 and 142 nodes, including factory and city photographsConsolidated into a 247-node group named urban landscape photography; both checks pass, ΔL ≈ +0.28671.
(c) Split flaggedSeven nodes mixing coral-reef and space-debris documentariesFlagged for splitting; the next step is to form coherent subgroups and re-propose candidate categories for verification.
(d) Reject after mergeTwo groups of 42 and 520 nodes, illustrated by coral and squirrel photographsThe merged Pet Supplies proposal is rejected for negative compression gain, ΔL ≈ −0.00292.

The accepted names give the groups an inspectable semantic description, while the verification outcomes establish how they enter the class space.

Nature Documentary mixes two topics and is flagged for splitting and re-proposal. Pet Supplies does not describe the common content of the coral and squirrel observations, and its negative compression gain leads to rejection.

The cases show how names guide consolidation, regrouping, and admission through multimodal evidence. They make the semantic basis of these decisions inspectable and complement the encoder study's quantitative evidence of portability.

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

This article proposes MOVE, a multimodal open world graph learning framework aimed at addressing three key challenges: unknown node recognition, reliable semantic category induction, and selective category extension. Specifically, MOVE identifies unknown nodes by introducing multi-modal category encoding with uncertainty awareness, and generates candidate categories based on multi-modal evidence using a multi-modal big language model. Finally, a selective extension mechanism is adopted, which comprehensively considers the relationships between multiple modalities to avoid unnecessary category addition. Experiments on four multimodal graph benchmarks have shown that this method improves on unknown category recognition, semantic annotation, and downstream graph learning tasks, while reducing computational costs and LLM API calls.

Critical strengths
  1. This article accurately considers several limitations in existing multimodal open world graph learning methods. Specifically, existing methods may not fully capture the joint evidence from visual, textual, and graph structural modalities when identifying unknown nodes. In addition, semantic category induction often relies on descriptions generated by LLM, without fully verifying its consistency with multimodal evidence. The manuscript further introduces a more principled category extension mechanism that takes into account the interference of multimodal evidence from existing categories. Overall, I believe that this work presents a systematic and relatively comprehensive framework that goes beyond simple incremental improvements of existing methods.
  2. The motivation behind the main methods proposed in the manuscript has been well explained or validated.
Critical weaknesses

One of the main contributions of this manuscript is the proposed selective category extension mechanism, which aims to introduce reliable new categories and avoid redundant or unnecessary categories. However, experimental evaluations mainly focus on unknown node recognition, semantic label similarity, and downstream task performance, rather than directly evaluating the reliability of category extension decisions. Although the K-to-G similarity index and ablation studies provide some indirect evidence, it seems insufficient to demonstrate whether the proposed mechanism can effectively distinguish effective new categories from redundant or erroneous candidate categories.

Questions for authors
  1. Can the author provide a more detailed evaluation of the selective category extension mechanism? For example, reporting which candidate categories MOVE correctly accepted or incorrectly rejected, including examples of valid new categories, redundant categories, and incorrectly generated candidate categories. Such results will provide more direct evidence to demonstrate the reliability of the proposed category extension mechanism, surpassing existing UCR and UCA metrics.
  2. MOVE relies on category specific reference distributions to distinguish between known and unknown nodes. Therefore, how is the corresponding calibration distribution constructed or updated when a new category is included in the category space?
5 comments
AuthorsOpenReview ↗

W1 and Q1-part1 — Part 1/3: Divided in parts due to space constraints

We sincerely thank the reviewer for the careful and detailed assessment of our work.

W1 and Q1: Direct evaluation and qualitative examples of category-expansion decisions

MOVE evaluates whether a proposed category is supported by multimodal observations and adds useful knowledge to the active class space. In this open-vocabulary task, the benchmark labels do not define a unique admission target for every generated category. A valid proposal may use a synonym, describe a supported difference in granularity, or overlap an already active category. Its admission therefore depends on semantic meaning and context as well as label matching.

A binary admission metric consequently requires a candidate-level semantic reference beyond the dataset's fixed labels. We added a category-usability evaluation using GPT-6 Astra to establish this reference. It assesses whether the supplied name and definition describe a coherent group, have multimodal support, and provide a useful distinction from active categories.

The expert uses a fixed prompt and evidence package, with system decisions, scores, and hidden class labels withheld. The resulting reference supports quantitative evaluation of both additions and non-additions across 91 cases:

DatasetTotalAgree add (TP)Agree non-add (TN)Extra add (FP)Missed add (FN)Uncertain
ALL913250630
Toys351814120
Grocery18312210
Movies1265100
Reddit-S26519200

The evaluation records agreement on 32 additions and 50 non-additions, with 6 extra and 3 missed additions. The resulting add precision and recall are 84.2% and 91.4%, respectively. These results provide direct evidence that MOVE selects useful categories while controlling unnecessary additions.

This decision-level evaluation complements UCR, UCA, and downstream performance, which examine recognition, annotation, and learning. The additional quantitative evaluation and the cases in the next part address the requested analysis of admission reliability. Location: Sec. 6.7; Appendix D.8.2, Table 7.

Continued in the next part.

AuthorsOpenReview ↗

W1 and Q1-part2 — Part 2/3: Divided in parts due to space constraints

W1 and Q1 (continued)

The newly added qualitative analysis makes selective expansion explicit. The four cases connect candidate names, multimodal observations, and the compression and stability checks, showing the evidence behind acceptance, merging, split detection, and rejection.

MOVE links unknown-node detection, candidate induction, and class expansion through shared multimodal evidence. Generation supplies candidate meanings; verification decides which action their support and relation to the active class space justify. Location: Sec. 6.7, Fig. 7; Appendix D.8.1.

Case in Fig. 7Supporting observationsDecision and reason
(a) AcceptSix snack care-package nodesSnack Food is accepted; compression and stability checks pass, ΔL ≈ +0.00194.
(b) MergeTwo groups of 105 and 142 nodes, including factory and city photographsConsolidated into a 247-node group named urban landscape photography; both checks pass, ΔL ≈ +0.28671.
(c) Split flaggedSeven nodes mixing coral-reef and space-debris documentariesFlagged for splitting; the next step is to form coherent subgroups and re-propose candidate categories for verification.
(d) Reject after mergeTwo groups of 42 and 520 nodes, illustrated by coral and squirrel photographsThe merged Pet Supplies proposal is rejected for negative compression gain, ΔL ≈ −0.00292.

Consolidation organizes related discoveries into a coherent category and controls unnecessary fragmentation of the class space.

Nature Documentary groups coral-reef and space-debris observations and is flagged for splitting and re-proposal. Pet Supplies does not capture the common meaning of its pooled coral and squirrel observations, and the negative compression gain leads to rejection.

These decision traces address the requested valid, overlapping, and unsupported proposals. They show how MOVE converts semantic proposals into evidence-based class-space actions.

Continued in the next part.

AuthorsOpenReview ↗

Q2 — Part 3/3: Divided in parts due to space constraints

Q2: Updating calibration references after admitting new classes

We added an explanation of the reference-update procedure. An admitted class enters the active class space immediately, and calibration references refresh between arrival stages. MOVE retains the original held-out known-class references and reserves a separate 20% of the unlabeled training pool for reference updates. A visible reserved node qualifies as a pseudo-reference when its nearest active prototype is an admitted class and its distance falls within the 90th percentile of that class's support-node distances. Before the next stage, MOVE recomputes coding costs and rebuilds the class-specific reference distributions under the expanded class space, keeping both probability cutoffs fixed.

Reserved nodes are excluded from candidate generation and incremental classifier training. Screening uses visible nodes' distances to active prototypes and the support of admitted classes. Selected nodes augment the retained known-class references.

Let Vref\mathcal V_{\mathrm{ref}} denote the original known references together with screened pseudo-references. Under the expanded class space Ct+1\mathcal C_{t+1}, the reference reconstruction can be written as

\mathcal D_K(c)= \left\\{\mathcal R_j(\mathcal C_{t+1})\mid j\in\mathcal V_{\mathrm{ref}},\\ \hat c_j=c\right\\}.$$ Both the assignments $a_{jk}$ and coding costs are recomputed under $\mathcal C_{t+1}$. The tail-score rule in Eq. (8) then uses these rebuilt reference distributions, with $\alpha_U$ and $\alpha_K$ unchanged. **Location: Sec. 5.2; Appendix B.4.** Reference nodes are regrouped by their updated predictions, with coding costs evaluated in the same expanded class space as subsequent arrivals. Fixed cutoffs preserve the known/pending/unknown rule while the reference evidence evolves. An admitted concept therefore has a persistent role in future recognition.

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

Related papers

Loading the map…

Discussion (0)

Sign in to comment.