- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper introduces Taxonomy-Free Federated Few-Shot Class-Incremental Learning (FFSCIL), addressing the challenge of aligning private and partially overlapping class taxonomies across clients without a shared label space. It proposes FedTaxo, which represents local classes as concept capsules and uses constrained, revisable clustering to construct a shared concept graph while preserving client-specific labels. The paper also provides theoretical analysis of concept matching and assignment recovery. Experiments on four benchmarks demonstrate that constrained re-clustering recovers approximately 85% of the oracle's novel-class improvement, outperforming greedy assignment and text-based alignment methods.
Critical strengths
- The paper introduces Taxonomy-Free FFSCIL, addressing the realistic challenge of inconsistent and partially overlapping class taxonomies across federated clients. This extends conventional FFSCIL beyond the shared-label-space assumption.
- FedTaxo employs constrained, revisable clustering to align local concepts across clients. The theoretical analysis provides additional justification for the proposed assignment strategy.
- Experiments on four benchmarks demonstrate substantial improvements over existing alignment strategies. The controlled comparisons and ablation studies further highlight the importance of assignment procedures over matching scores.
Critical weaknesses
- The experiments rely primarily on simulated client taxonomies rather than independently constructed real-world label systems. This limits the evidence for practical applicability in realistic federated environments.
- FedTaxo relies on within-client cannot-link constraints and compatible concept hierarchies. Its performance degrades when these assumptions are violated, particularly under duplicate labels and cross-cutting taxonomies, raising concerns about generalizability.
Questions for authors
- Clarify how well the simulated taxonomy settings reflect real-world federated environments and discuss the expected performance when clients use independently developed label systems.
- Explain the sensitivity of FedTaxo to violations of within-client cannot-link constraints and cross-cutting taxonomies, and clarify whether the proposed soft-constraint strategy can effectively mitigate these limitations.
Response to Reviewer DE5i
Response to Reviewer DE5i:
Thank you for the review. The revised PDF marks all changes in blue. The main addition is a federation of real, separately built label systems (new Sec. 4.5, Table 4); Appendix H holds every new experiment. An evidence map after the appendix contents lists the tables behind each research question.
W1 / Q1. Real, independently developed label systems. Each client in the new federation is a real remote-sensing scene dataset with its own class list. The seven datasets are UC Merced, NWPU-RESISC45, AID, PatternNet, RSI-CB256, WHU-RS19 and RSSCN7 (7 to 45 classes), built by teams at four universities. Clients keep their original class names. Nothing is renamed or corrupted, and there is no shared base session and no labeled reference. Every client is scored on its own test images in its own label space.
How well does the simulator reflect this? Three differences matter.
Expected performance. FedTaxo recovers the correspondence best. It gains 2.1 Avg at one shot (half of the oracle's 4.0), while every other similarity-based rule loses 8 to 26; exact name matching gains slightly more (+0.8 ± 0.4 over FedTaxo). At five shots neither the similarity-based rules nor the oracle improve on not federating: FedTaxo loses 1.6, the oracle 0.5, other similarity rules 5 to 14, and name matching ties. A new client-side check (below) brings every rule but discovery to within 0.11 of not federating there; it reduces negative transfer but does not guarantee none. We revised the abstract, contributions and conclusion to state these mixed results plainly.
W2 / Q2. Violated assumptions. Your comment covers two assumptions, so we answer them in turn.
(a) Duplicate labels break the within-client cannot-link. When a client holds a duplicate label for a concept with probability p = 0.2 or 0.4, FedTaxo loses 2.1 or 3.3 Avg while the oracle gains (Table 29). The soft rule lets a client's two labels merge above a raised threshold. It is the best of hard, soft and no constraint in five of six cells, and always beats dropping the constraint. It recovers only part of the loss, though: 36 and 38% on CIFAR-100 and 59 and 53% on CUB-200 (Table 31; these results were already in the submission). So it mitigates the problem but does not solve it. We also tested the new client check here (Appendix H.6, Table 48). It does not help, because the harm is under-merging, not a wrong merge. The paper names duplicate labels as the method's main exposure.
(b) Cross-cutting taxonomies break hierarchy compatibility. When clients partition the same classes in incompatible ways, no method gains consistently (Table 12; Appendix D.2). FedTaxo stays close to not federating on all four datasets (79.25 vs. 79.18, 92.71 vs. 92.76, 83.65 vs. 83.44, 57.98 vs. 57.75). Text alignment loses up to 3.0, and merging by true class overlap up to 1.8. The new client check holds out each of a client's own shots and keeps the merged prototypes only if they do not lower its classification margins. With it, FedTaxo matches or beats not federating on all four datasets, and text-NN rises to within 0.02 of not federating. In the default and coarse-label regimes the check keeps at least 99% of FedTaxo's merges, so it costs almost nothing where alignment helps. We state cross-cutting taxonomies as a boundary of the formulation: a concept graph whose nodes are concepts cannot represent overlapping, non-nested partitions.
Other additions, in brief.