- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes ASFMVC, a semi-supervised method for vertical federated multi-view clustering, in which each of V clients holds one view of the same N samples, with labels available for a subset of samples. The authors argue that existing federated multi-view clustering methods rely largely on unsupervised or self-supervised signals and thus fail to exploit available prior knowledge.
Building on the communication-efficient federated multi-view clustering framework CeFMC (Liu et al., 2026a), the proposed method introduces three components: (1) label-guided representation learning that incorporates observed labels into each client's local representation, (2) adaptive client weighting based on agreement with the global consensus, and (3) signed pairwise constraints derived from the same labels to refine consensus clustering through must-link and cannot-link relations. The algorithm alternates between client- and server-side updates while retaining compact communication and claimed linear computational complexity in N. Experiments on six benchmark datasets using a 20% label ratio show improvements over unsupervised federated baselines but mixed results against centralized semi-supervised methods. Additional evaluations include ablation studies, varying label ratios, convergence curves, and parameter sensitivity analyses.
Critical strengths
-
Practically relevant problem setting.The paper addresses an important gap in existing federated multi-view clustering methods, which largely rely on unsupervised or self-supervised learning despite the potential availability of partial labels. This is particularly relevant in applications such as healthcare, where data may be distributed across institutions and only a subset of cases have expert annotations. A well-designed method for incorporating such supervision into federated clustering would be valuable to the community.
-
Efficient integration of supervision. The proposed method incorporates supervision through local representation learning and server-side consensus refinement while largely preserving the compact communication structure of CeFMC. The alternating updates remain computationally efficient, with no substantial additional per-round communication overhead. This is a useful practical feature given the importance of communication efficiency in federated learning, although the underlying efficiency is primarily inherited from the published CeFMC framework.
Critical weaknesses
-
Limited novelty relative to CeFMC and insufficient evidence for the proposed components. The method is largely built on the published CeFMC framework (Liu et al., 2026a) with three additive terms, and setting the new terms to zero recovers CeFMC exactly. The underlying objective structure, initialization, alternating update scheme, and communication and complexity analyses are substantially inherited from CeFMC, but the manuscript does not sufficiently acknowledge or distinguish these inherited elements. In particular, the third listed contributio( efficient alternating optimization, compact communication, and linear computational complexity) largely belongs to CeFMC. Moreover, the ablation studies suggest that much of the improvement comes from the must-link/cannot-link constraints, a standard semi-supervised clustering technique, while the other two components provide relatively small gains on several datasets. Consequently, it remains unclear whether the proposed combination constitutes a sufficiently substantial methodological advance beyond incorporating established semi-supervised techniques into CeFMC.
-
Insufficient theoretical justification and experimental validation. The adaptive weights are not derived from the stated objective, and weighting views by agreement with the current consensus does not necessarily reflect their reliability; it may reinforce early errors by upweighting views that agree with an incorrect consensus. The convergence analysis assumes fixed weights and does not establish convergence of the full algorithm, in which the weights are updated every outer iteration. Empirically, ASFMVC uses 20% labeled samples while all federated baselines are unsupervised, so the reported improvements cannot separate the benefit of the proposed mechanisms from the benefit of the additional labels.
Questions for authors
- Are the labeled samples included when computing ACC, NMI, and Purity? As this is important for determining whether the reported improvements reflect better clustering of previously unseen labels rather than agreement with labels already used during training.
- The hyperparameter values in Table 7 vary substantially across datasets. How were these values selected? Were ground-truth labels from the evaluation samples used for tuning?
- Could the authors compare ASFMVC against CeFMC augmented only with the signed pairwise-constraint term, without label-guided representation learning or adaptive weighting? The existing ablations suggest that signed constraints account for much of the improvement on several datasets, but they do not evaluate this simpler model directly. This comparison is essential for establishing the incremental contributions of the other two components.
- The convergence analysis establishes monotonicity only when the adaptive weights are fixed. Does the objective remain non-decreasing when these weights are refreshed after each outer iteration? Can the adaptive weighting rule be derived from a single well-defined optimization objective, or can the authors otherwise justify convergence of the complete algorithm?
- The weight on the signed-constraint term is small across all datasets (2^-8 to 2^-6), yet removing the signed-constraint term produces some of the largest performance drops in the ablation study. How does the magnitude of this term compare with the other objective components during optimization?
- Where are the observed labels stored, and which parties have access to them? The formulation appears to require supervision at both the clients and the server, and initialization involves transmitting each client’s full initial representation to the server. How do these requirements affect the claimed privacy preservation?
- Given the claimed linear computational complexity and inherited communication-efficient structure, the authors should also consider those larger datasets used in CeFMC. Could the authors provide results including runtime and communication cost, to support the scalability claims and enable a more direct comparison with CeFMC?
4 comments
Rebuttal Part 2: Responses to Q3–Q6
Q3: Missing semi-supervised federated baseline
A3: As discussed in A1, existing federated MVC methods predominantly focus on unsupervised learning, and we have not identified a directly applicable semi-supervised federated MVC baseline. Therefore, to enable a more meaningful comparison under matched supervision and federated settings, we construct CeFMC+S by incorporating must-link and cannot-link constraints into the original CeFMC framework, using the same 20% labeled-data budget.
Table 2. ACC comparison under a 20% label ratio.
| Dataset | CeFMC | CeFMC+S | ASFMVC |
|---|---|---|---|
| BBC | 77.24±0.05 | 81.43±1.20 | 84.26±0.50 |
| Reuters | 47.27±0.30 | 49.23±0.40 | 53.00±2.27 |
| HW | 94.17±0.21 | 95.44±0.23 | 95.59±0.26 |
| Scene-15 | 30.31±4.80 | 38.01±4.94 | 38.20±4.84 |
| Flower17 | 33.93±2.05 | 40.08±1.96 | 40.90±2.08 |
| ORL | 71.88±2.61 | 72.92±2.49 | 73.72±2.59 |
CeFMC+S consistently improves upon CeFMC, demonstrating the benefit of incorporating supervision into federated clustering. Besides, ASFMVC achieves higher ACC than CeFMC+S, indicating that the proposed framework offers benefits beyond supervision alone. We will include this additional baseline in the revised manuscript.
Q4: Whether the weighting rule may reinforce early errors
A4: To investigate this particular aspect, we conducted additional noise experiments on Reuters. Specifically, we injected Gaussian noise into the fifth view (View 5) at different noise levels and compared ASFMVC with its variant without adaptive weighting (w/o AW).
Table 3. Noise experiments on Reuters.
| Noise level | View discrepancy | Fusion weight (%) | ASFMVC ACC (%) | w/o AW ACC (%) |
|---|---|---|---|---|
| 0 | 16.34 | 22.81 | 53.00±2.27 | 49.43±0.41 |
| 0.5 | 19.45 | 20.69 | 52.44±1.22 | 48.88±0.57 |
| 1.0 | 20.29 | 20.52 | 52.04±2.18 | 48.55±2.61 |
As the noise level increases, the discrepancy between the corrupted view and the global consensus increases from 16.34 to 20.29, while its normalized fusion weight declined from 22.81% to 20.52%. Moreover, ASFMVC consistently achieves higher mean ACC than w/o AW under the evaluated noise levels. These results indicate that the adaptive weighting mechanism can respond to the degradation of a view by reducing its relative contribution.
Q5: Whether labeled samples are included in ACC/NMI/Purity
A5: Yes. We compute ACC, NMI, and Purity over all samples. The same evaluation protocol is consistently applied to ASFMVC and all compared methods, ensuring a fair comparison under a consistent evaluation setting.
Q6: Hyperparameter selection
A6: We use the ground-truth labels to guide hyperparameter selection based on clustering performance. Following the parameter search and sensitivity analysis practices adopted in existing semi-supervised multi-view clustering studies, such as FSSMSC (Ling et al., 2025) and Hypergraph Learning-Based Semi-Supervised Multi-View Spectral Clustering (2023), we examined candidate hyperparameter configurations based on their clustering performance. To further examine the reasonableness of the dataset-specific settings, we conducted additional parameter sensitivity experiments on all six datasets. The results demonstrate the robustness of ASFMVC to hyperparameter variations and support the reasonableness of our parameter selection strategy. We will include these additional results in the revised manuscript.
Rebuttal Part 3: Responses to Q7–Q9
Q7: Magnitude of the signed-constraint term
A7: We evaluated the five components of Eq. (14) on four datasets. Let – denote the representation, label-guidance, local-clustering, weighted-consensus, and signed-constraint terms, respectively, before applying their respective external coefficients. Table 4 reports these unscaled terms, while Table 5 reports their weighted contributions to the objective, where , , , , and .
Table 4. Magnitudes of the five objective terms before applying their respective coefficients.
| Dataset | |||||
|---|---|---|---|---|---|
| BBC | 246.491 | 99.874 | 15.037 | 0.335 | 66.131 |
| Reuters | 530.115 | 110.688 | 46.614 | 0.491 | 103.121 |
| Scene-15 | 13396.918 | 136.146 | 18.623 | 0.305 | 420.525 |
| Flower17 | 8132.797 | 109.872 | 46.874 | 0.967 | 131.100 |
Table 5. Weighted contributions of the five objective terms after applying their respective coefficients.
| Dataset | |||||
|---|---|---|---|---|---|
| BBC | 246.491 | 6.242 | 30.074 | 0.670 | 0.258 |
| Reuters | 530.115 | 0.432 | 186.457 | 1.963 | 0.403 |
| Scene-15 | 13396.918 | 0.133 | 74.493 | 1.220 | 6.571 |
| Flower17 | 8132.797 | 1.717 | 187.495 | 3.866 | 2.048 |
As shown in Table 5, the signed-constraint term makes a relatively small contribution to the overall objective magnitude, partly due to the dominant representation term. However, its contribution is not negligible relative to the components directly involved in global consensus optimization. In particular, ranges from 0.205 to 5.387, indicating that the signed-constraint term can be comparable to or even larger than the weighted consensus term in magnitude.
More importantly, the influence of signed constraints depends on their effect on discrete label assignments rather than their overall objective magnitude. As shown in Eq. (21), signed constraints introduce an additional correction to the consensus scores. When the scores of competing clusters are close, even a relatively small correction may change the final assignment. Our additional experiments show that the magnitude of the signed-constraint correction can be substantial relative to the score differences between competing clusters.
Q8: Location of labels, supervision and privacy
A8: The observed labels are stored locally on the clients, while the must-link/cannot-link relationships are maintained on the server. Both forms of supervision are treated as prior knowledge and directly incorporated into the corresponding client-side and server-side optimization objectives. We do not transmit observed labels or must-link/cannot-link relationships between clients and the server during communication.
Q9: Large-scale dataset results and efficiency
A9: We conducted additional experiments on YouTubeFace10 (38,654 samples, 4 views, 10 clusters). We compared ASFMVC with both unsupervised federated MVC methods and centralized semi-supervised MVC methods.
Table 6. Performance and efficiency comparison with unsupervised federated MVC methods on YouTubeFace10.
| Method | ACC (%) | NMI (%) | Purity (%) | Time (s) | Comm. (MB) |
|---|---|---|---|---|---|
| FedCMv | 61.53±1.78 | 65.02±1.07 | 66.20±1.10 | 20.50 | 326.56 |
| FedFCMv | 26.45±0.10 | 16.67±0.10 | 26.45±0.10 | 394.46 | 630.83 |
| FedMVL | OOM | OOM | OOM | OOM | OOM |
| CeFMC | 76.86±1.60 | 74.86±1.97 | 79.81±1.49 | 6.80 | 16.71 |
| ASFMVC | 80.02±1.46 | 79.25±1.81 | 82.43±1.70 | 20.62 | 15.47 |
Table 7. Performance and running time comparison with centralized semi-supervised MVC methods on YouTubeFace10.
| Method | ACC (%) | NMI (%) | Purity (%) | Time (s) |
|---|---|---|---|---|
| AMGL | OOM | OOM | OOM | OOM |
| MLAN | OOM | OOM | OOM | OOM |
| SMGC | OOM | OOM | OOM | OOM |
| ASFMVC | 80.02±1.46 | 79.25±1.81 | 82.43±1.70 | 20.62 |
OOM (Out of Memory) indicates that the method failed to complete the experiment due to insufficient memory.
As shown in Table 6, ASFMVC achieves the highest ACC, NMI, and Purity among the compared methods, outperforming all unsupervised federated MVC baselines, while maintaining comparable communication overhead. ASFMVC also maintains a reasonable running time compared with the other federated methods, demonstrating its practical computational efficiency on large-scale datasets.
Furthermore, Tables 6 and 7 show that ASFMVC successfully processes YouTubeFace10, whereas FedMVL, AMGL, MLAN, and SMGC fail to complete the experiments due to insufficient memory. These results demonstrate the practical scalability of ASFMVC and its ability to handle large-scale multi-view clustering while maintaining competitive clustering performance and low communication overhead. We will include these additional results in the revised manuscript.
Dear Reviewer,
Thank you again for your valuable comments and suggestions.
As the discussion period is approaching its end, we hope that our detailed responses and additional experimental results have adequately addressed your concerns. If there are any remaining questions or issues that require further clarification, please let us know. We would be happy to provide additional explanations.
Thank you for your time and effort in reviewing our paper !
Rebuttal Part 1: Responses to Q1–Q2
We thank Reviewer HeDy for the constructive review. We provide point-by-point responses to the concerns raised as follows:
Q1: Novelty beyond the existing framework
A1: We acknowledge that ASFMVC inherits the CeFMC framework, and we do not claim its existing architecture and optimization mechanisms as our contributions. To the best of our knowledge, existing federated multi-view clustering methods predominantly focus on unsupervised learning, and we have not identified an existing semi-supervised federated MVC method directly applicable to our vertical federated setting. Meanwhile, centralized semi-supervised MVC methods assume joint access to all views, making their direct application to vertically partitioned data challenging. Therefore, the key challenge is to use supervision across separate views at both local and global levels, without repeatedly transmitting full representations. Rather than simply combining existing techniques, we adapt three mechanisms to the federated framework.
First, LGR integrates the observed-label matrix into the orthogonality-constrained local representation objective. Accordingly, we modify the client-side SVD update by introducing the supervision-dependent term ηYo(Yo⊤Hv), enabling local representations to exploit labels without transmitting them to the server.
Second, AW is incorporated into the original consensus alignment through discrepancy-dependent coefficients αv. This modifies both local pseudo-label optimization and server-side consensus construction, allowing client contributions to be adjusted using existing clustering information without additional high-dimensional communication.
Third, signed constraints are adapted to the server-side discrete consensus update through a balanced and normalized signed graph. The resulting label-update rule jointly considers weighted client agreement and must-link/cannot-link relationships.
Together, these modifications establish a optimization process in which supervision influences both local representations and global consensus, while the updated consensus guides subsequent client optimization, forming an iterative supervision-feedback loop rather than three isolated additions.
In the revised manuscript, we will explicitly acknowledge and cite the components inherited from CeFMC, and more clearly distinguish them from our methodological extensions. Furthermore, by introducing limited supervision into federated multi-view clustering, ASFMVC provides a foundation for future research on supervision-enhanced federated clustering, including more flexible supervision mechanisms and federated optimization strategies.
Q2: Limited incremental contributions of LGR and AW
A2: We acknowledge that the improvements from LGR and AW are relatively modest under some experimental settings. However, their contributions vary with the amount of available supervision. To further investigate this behavior, we conducted additional ablation experiments on Reuters and leave experiments on other datasets for future work due to the tight time limit during the rebuttal period.
Table 1. Ablation study on Reuters under different label ratios (ACC).
At 20%, 30%, and 40%, removing AW lowers ACC by 3.57, 5.30, and 4.94 points; removing LGR lowers it by 2.44 and 1.99 points at 30% and 40%. The three components serve different roles, so their effects on final ACC don't need to be equally large. These additional experiments indicate that LGR and AW can provide meaningful improvements under certain supervision conditions.