- Rating
- 4(+1)
- Confidence
- 4
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper studies vertical federated multi-view clustering in an asynchronous incremental setting, where clients arrive sequentially and earlier clients may no longer participate. Each client performs local clustering and uploads only a label matrix. The server interacts only with the current client, alternating between updating the global consensus and the newly received label matrix. The two matrices are stacked into a third-order tensor and regularized by a tensor Schatten p-norm with dynamic weights, solved via augmented Lagrangian and projected gradient ascent, with a closed-form tensor thresholding step. Experiments on six benchmark datasets compare with centralized and synchronous federated methods using ACC, NMI, and Purity, and also analyze anchor rate, parameter sensitivity, and convergence. The work provides a practical incremental framework that avoids re-engaging previous clients and keeps server storage independent of the number of historical clients.
Critical strengths
1.The problem setting is practically meaningful and novel. The paper targets a realistic vertical federated multi-view clustering scenario where clients join sequentially and old clients may be offline. Most existing methods assume all clients are simultaneously available and require repeated participation, which is often unrealistic. The proposed framework avoids re-engaging previous clients, keeps server-side storage independent of the number of historical clients, and reduces repeated communication and exposure. This is a valuable contribution to federated clustering.
2.The method is lightweight and flexible. Clients upload only a label matrix, not raw features, gradients, or model parameters. This reduces server-side intrusion into local models and avoids direct transmission of feature-level representations. The framework also imposes no restriction on the local clustering model, allowing heterogeneous client-side algorithms. Experiments on six datasets show results comparable to, and in some cases better than, centralized and synchronous federated methods, which supports the feasibility and applicability of the incremental fusion idea.
Critical weaknesses
- The current experiments provide useful evidence of final clustering performance, but the incremental process itself could be illustrated more explicitly. If feasible, it would further strengthen the paper to show how the global consensus evolves as clients arrive sequentially and how the incremental update compares with a simple fusion baseline.
Questions for authors
1.The fusion in Eqs. (2) and (3) appears to require row-wise correspondence between the historical consensus and the newly uploaded label matrix. Could the authors clarify whether perfect sample alignment is assumed, i.e., identical sample IDs in the same row order, and whether this assumption holds throughout the experiments? 2. For practical deployment, could the authors clarify the communication cost of one incremental update upon a new client arrival and, if feasible, compare it with the cost of retraining a standard synchronous federated clustering model over all clients? 3. The paper reports parameter sensitivity but does not explain how the hyperparameters were selected in the main experiments. Could the authors clarify the search ranges and selection criteria, and whether the same tuning protocol was followed across all datasets?
Response to Reviewers
We sincerely thank you for the constructive feedback. Your suggestions regarding the incremental process, sample alignment, communication cost, and hyperparameter selection are highly valuable for improving the practicality and rigor of our paper. We respond as follows:
Response to Critical Weaknesses
On the evolution of global consensus (Per-arrival curves): We fully agree. In the revision, we will add per-arrival curves to illustrate how the global consensus evolves and converges smoothly as new clients arrive sequentially.
On the comparison with a simple fusion baseline: We accept this suggestion. We will introduce a naive Simple Linear Averaging Fusion baseline for comparison. We will demonstrate that, compared to simple matrix averaging, our tensor Schatten-p fusion mechanism more effectively extracts cross-view complementary information and resists feature drift during the incremental process.
Response to Questions for Authors
Q1: On row-wise correspondence and sample alignment assumption A: This is a critical point. Yes, under our Vertical Federated setting, we assume perfect sample alignment, meaning all clients have identical sample IDs and maintain the same row order when uploading label matrices. This is a standard premise in vertical federated learning. All benchmark datasets used in our experiments (e.g., Yale, 3-sources, Sonar) were strictly aligned by sample ID and order during preprocessing. To eliminate ambiguity, we will explicitly state this assumption in the Problem Formulation section of the revision.
Q2: On communication cost of incremental update A: We objectively compare the communication cost of our method with standard synchronous federated methods. Single incremental update cost: When a new client arrives, the server and this client perform alternating iterations until convergence. Let T be the number of iterations (experiments show T is typically a single digit). Each round transmits the n-by-k label matrix H_v and consensus H_s. The total communication cost per update is O(T * n * k). Comparison with synchronous FL: Standard synchronous federated clustering requires all M clients to stay online for T global iterations, with a total cost of O(T * M * n * k). Our method's cost does not grow with the number of historical clients M, and it completely eliminates the need to recall historical clients, offering significant communication and privacy advantages in incremental scenarios.
Q3: On hyperparameter search ranges and selection criteria A: For absolute fairness in benchmarking, we adopted a unified Grid Search Protocol across all datasets. Search ranges: Anchor rate in [0.001, 1.0], client regularization weight λ_v in [0.0001, 0.01] (empirically, optimal values consistently fall within [0.0003, 0.008], validating our theoretical analysis on minimal weights), server tensor weight λ in [1, 12], and parameters p and p_1 in [0.1, 1.0]. Selection criteria: To explore the upper-bound performance, we adopted the Oracle evaluation paradigm using ground-truth labels to select the combination that maximizes clustering metrics (ACC/NMI). We will explicitly add these details to the revision.
Thank you again for your valuable suggestions. We will fully implement these additions in the revised manuscript.