- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
This paper investigates class-incremental learning for vision-language models under uneven task complexity, where the number and diversity of newly introduced classes may vary across increments. The authors identify a limitation of conventional fixed top- sparse Mixture-of-Experts (MoE) routing, which constrains the number of executed experts regardless of the complexity of the incoming task. To address this issue, they propose MoCE, a Mixture of Communitified Experts framework that decouples the set of experts participating in routing from the subset ultimately selected for execution. Specifically, MoCE models adapter experts as nodes in an input-conditioned graph, performs lightweight message passing among neighboring experts, and uses the resulting graph-enhanced representations to select sparse community anchors. The framework further presents an Adaptive Anchor Budget, allowing increments with larger numbers of classes to activate more anchor experts while maintaining sparse computation. Experiments on CIFAR100 and TinyImageNet-100 under both balanced and uneven class-incremental schedules demonstrate consistent improvements over standard MoE adapters and several continual-learning baselines.
Critical strengths
-
The paper is well written, clearly organized, and easy to follow.
-
The proposed method is conceptually simple while achieving substantial and consistent performance improvements across both balanced and uneven class-incremental learning settings.
-
The distinction between executed experts and experts involved in the routing process is a novel and well-motivated design choice. This formulation allows inter-expert communication to influence routing decisions without requiring dense expert execution, thereby providing greater routing flexibility while preserving sparse computation.
Critical weaknesses
-
The formulation of the input-conditioned adjacency matrix is not sufficiently motivated. In particular, all pairwise expert relationships are predicted directly from the input representation , without explicitly conditioning on the identities or representations of the two experts whose relationship is being estimated. As a result, it is unclear whether the learned adjacency matrix captures meaningful inter-expert relationships.
-
The motivation for MoCE is less compelling once the number of newly introduced classes is explicitly available as prior information through the Adaptive Anchor Budget. If is already used to increase the number of executed experts for more complex increments, a natural and considerably simpler baseline would be a standard MoE with an adaptive top- routing budget. The current experiments do not clearly establish whether graph-based community routing provides benefits beyond this simpler form of adaptive expert allocation.
-
Despite the substantial performance gains obtained by modifying the routing mechanism, the paper provides limited mechanistic analysis of why the proposed routing strategy is effective. More quantitative and qualitative analyses of expert specialization, routing diversity, community structure, expert co-activation, or the relationship between routing patterns and task complexity would substantially strengthen the claim that the observed improvements arise from meaningful community-based expert coordination.
-
Relatedly, it is difficult to disentangle the contribution of graph-based routing from the effect of simply involving or executing a larger number of experts through the Adaptive Anchor Budget. A key ablation comparing at least (1) standard MoE with fixed top-, (2) standard MoE with adaptive top-, (3) MoCE with fixed , and (4) MoCE with adaptive is missing. Without such a comparison, the incremental benefit of the proposed community-based routing mechanism remains unclear.
-
The proposed MoCE formulation appears fairly general and is not inherently specific to class-incremental learning. The core idea, performing graph-based inter-expert communication before sparse expert selection, could seemingly be applied to standard MoE architectures in non-continual settings as well. Apart from the Adaptive Anchor Budget, the paper does not clearly identify which aspects of the method are specifically motivated by the challenges of class-incremental learning or why those challenges particularly require the proposed community-based routing mechanism.
Questions for authors
N/A
2 comments
Follow-Up on Our Response to Your Comments
We would like to kindly follow up on our response to your comments. We have addressed the questions and concerns raised in your review and hope that our clarifications have been helpful.
If you have any remaining concerns or questions, please let us know. We would be happy to provide further clarification or address them promptly.
Thank you again for your time and thoughtful feedback.
Comment 1 response: We appreciate the reviewer's observation that the adjacency matrix is predicted directly from the input representation without explicitly conditioning each edge on expert-specific embeddings. Our formulation is motivated by the assumption that different inputs may require different organizations of expert information. A fixed expert topology may not capture such input-dependent variations. In the current implementation, the adjacency prediction module maps the 768-dimensional input representation through a hidden layer of size 512 to N2 adjacency logits. Thus, the adjacency predictor generates an input-conditioned matrix in which different output coordinates correspond to different expert pairs.
We acknowledge that explicitly incorporating the representations of experts i and j into adjacency prediction is a reasonable alternative. Such a formulation could potentially capture complementary aspects of expert relationships. Our current approach instead prioritizes direct, input-conditioned prediction of expert connectivity, allowing the graph organization to respond to different samples without requiring a fixed topology. We will clarify this design motivation and explicitly distinguish the current input-conditioned adjacency predictor from an expert-embedding-conditioned alternative. We clarified the motivation and formulation of input-conditioned expert relationships in Section 3.3, including how we construct expert nodes and pairwise adjacency logits. Additional architecture and adjacency-selection details are provided in Appendix A.2.
Comment 2 response: We agree that standard MoE with an adaptive top-k budget is an essential baseline for determining whether graph-based routing contributes improvements beyond adaptive expert allocation. To address this concern, we implemented an additional standard MoE baseline (Section 4.5, Table 4). The corresponding adaptive-budget policy is described in Appendix A.2.
Comment 3 response: We thank the reviewer for suggesting further investigation into the routing mechanism. We analyzed expert selection, class-conditioned utilization, routing diversity, graph adjacency, and their relationships with incremental task size. (1) Expert selection and routing diversity. Using the N=16 MoCE adaptive-routing statistics, we examined how different inputs were assigned to anchor experts. This reveals an important distinction between the nominal top-k budget and the number of experts receiving substantial weight. (2) Expert specialization and input-level relationships. We also conducted a separate input-level analysis with a completed N=8 MoCE model. See Section 4.6 (Figure 2), this example illustrates the coexistence of shared and input-specific expert selections. Additional class-conditioned routing analysis (Appendix A.6.2) showed substantial variation in expert preferences across classes. (3) Graph connectivity. We also examined the stage-level adjacency statistics (Appendix A.6.1). The results confirm that the graph incorporates off-diagonal expert relationships. We included these observations and explicitly distinguish descriptive routing evidence from causal claims about why graph message passing improves accuracy.
Comment 4 response: We agree that this ablation is necessary. We conducted the requested four-way experiment and mentioned the findings in comment 2.
Comment 5 response: We appreciate the reviewer raising this concern. We agree, and we might apply it to more general learning tasks, such as multi-task and cross-domain learning, and even reinforcement learning in future work. However, our work is motivated by a particular challenge in continual learning: successive class increments can introduce substantially different demands on the organization and use of expert knowledge. Conventional class-incremental learning experiments often divide classes into equally sized increments. In practical settings, however, the number and composition of incoming classes may vary between stages. Our design therefore considers two complementary mechanisms. First, input-conditioned graph construction allows the organization of expert relationships to vary with the incoming samples. Second, the adaptive anchor budget permits the number of selected experts to depend on the size of the corresponding class increment. We also evaluated MoCE under both even and uneven class-incremental settings. While the observed difference is larger in the uneven setting, these experiments differ in the number of stages and do not isolate task-size heterogeneity. The original formal comparisons also combine graph routing with different execution-budget behavior. The empirical results demonstrate MoCE's applicability to uneven class-incremental learning, while the additional four-way ablation provides a more direct examination of the contributions of graph-based coordination and adaptive execution.