- Rating
- 3
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper proposes DiSPART for distributed stochastic nonconvex optimization with general affine coupling constraints over unbalanced directed networks. The algorithm combines push–sum residual and multiplier tracking, gradient smoothing, and moving-center regularization. Under the stated assumptions, it establishes finite-time bounds on the average expected squared KKT residual, achieving convergence with stochastic gradients and with exact gradients. The analysis explicitly characterizes the effects of network mixing, Perron imbalance, and constraint coupling.
Critical strengths
The paper addresses a meaningful combination of challenges and provides a technically substantial convergence analysis. The guarantees jointly control stationarity and feasibility, allow infeasible primal initialization, and use a fixed penalty without assuming bounded multipliers. The key steps of the main convergence argument appear internally consistent upon inspection. The algorithm requires only one fresh stochastic gradient per node and one communication exchange per iteration, and the controlled ablations support its main design choices. Overall, I consider this a solid and useful contribution.
Critical weaknesses
My main concerns concern the completeness and interpretation of the experimental evidence. First, although Section 5 refers readers to Appendix G for experimental details, the appendix describes only the synthetic experiments. The objectives, sources of nonconvexity, coupling constraints, data partitioning, and parameter settings for a9a and Multiple Features are not specified, limiting reproducibility and assessment of their relevance to the proposed setting. Second, the comparison with Du et al. uses an unbalanced communication matrix and unbounded local domains, outside that method’s stated assumptions, as the authors acknowledge. This limits the conclusions that can be drawn from its relative performance. Third, the experiments use empirically selected parameters outside the theorem’s sufficient conditions, while the theoretical choices require global problem and network quantities. More guidance is needed to connect the guarantees with practical parameter selection. Finally, the small synthetic problems provide limited evidence of scalability with the number of agents or coupling constraints, particularly since each message contains two vectors whose dimension equals the number of coupling constraints.
Questions for authors
Could the authors provide complete modeling and implementation details for the two real-data experiments, particularly the sources of nonconvexity and the construction of the coupling constraints? Could the comparison with Du et al. be supplemented by experiments in a setting satisfying both methods’ assumptions? How sensitive is DiSPART to its main parameters, and can the authors provide practical selection guidance or an experiment using theoretically admissible parameters? Finally, how do communication volume and runtime scale with the number of agents and the dimension of the coupling constraints?
6 comments
Response to Reviewer XCpC — Point 1: Real-data models and implementation
Point 1: Specifying the real-data learning problems and their connection to the theory
Thank you for pointing this out. We have expanded Section 5 and added Appendix H, Real-Data Experiments, covering both tasks.
(a) Learning tasks and data partitioning. Both tasks use linear prediction models with features distributed across six nodes, all indexing the same examples. Adult/a9a is binary income classification with LIBSVM-encoded features, split into blocks ; node 1 adds the only intercept. Multiple Features is ten-class digit recognition with six native views of dimensions , one per node. The training/validation/test sizes are for a9a and for Multiple Features. Both use stratified splitting; a9a splits only its development set, retaining the supplied test set. Preprocessing uses training statistics only. Appendix H.1 specifies the split seeds and feature-assignment rules.
(b) Local objectives, nonconvexity, and coupling. Let be node 's feature matrix and its weights. Training rows are assigned cyclically through ; node owns the corresponding auxiliary scores and loss terms. Both tasks solve
Here is the training size, and
The regularizer is , penalizing all weights except the a9a intercept. Its negative curvature makes the lifted objective nonconvex. To construct the coupling locally, node contributes , where places its owned rows into an otherwise zero score array. Summing these contributions gives the displayed equality. Eliminating recovers the regularized classifier with scores ; Appendix H.2 provides the corresponding operators.
(c) Correspondence to the setting and implementation. Both tasks follow the structure of problem (1): each node's weights and owned auxiliary scores form its local variable, its regularizer and owned losses form the smooth nonconvex objective , and consistency between the auxiliary scores and combined local predictions gives the global affine coupling constraint. DiSPART operates over a fixed column-stochastic, unbalanced directed network in both tasks. Both tasks therefore match the setting studied here.
Fresh local estimates average component gradients sampled uniformly from and are unbiased for . Stochastic DiSPART uses for Multiple Features and with replacement for a9a, including initialization. The latter follows the appendix's with-replacement oracle analysis; at , with- and without-replacement sampling coincide. Appendix H.3 verifies the model and oracle conditions.
The empirical DiSPART settings are listed as , where is the EMA coefficient:
| Task and method | Parameter tuple |
|---|---|
| Multiple Features, DiSPART | |
| Multiple Features, DiSPART-Det. | |
| a9a, DiSPART | |
| a9a, DiSPART-Det. |
Appendix H.4 gives all baseline configurations, initialization, run lengths, and repetition seeds. The distinction between empirical settings and theorem-sufficient choices is addressed in Point 3.
(d) Interpretation of the results. Figures 4–5 compute validation cross-entropy from the learned weights through , not from auxiliary training scores. Tables 2–3 separately report predictive quality, physical constraint violation, a common stationarity/feasibility diagnostic, and gradient-query costs including training and evaluation. Appendix H.5 defines these quantities. Results use five paired initialization/oracle repetitions on each fixed prepared task.
The results show that DiSPART combines competitive predictive performance with accurate constraint satisfaction on both real-data tasks. In particular, stochastic DiSPART achieves lower mean validation cross-entropy than all three baselines on Multiple Features, while using substantially fewer gradient queries than the exact-gradient baselines on both tasks at the reported communication budgets. These findings support the practical effectiveness of the proposed method for the coupled learning problems considered here.
Response to Reviewer XCpC — Point 2: Du comparison under compact domains and balanced mixing
Point 2: Explaining the original Du comparison and the supplementary comparison under Du's setting
Thank you for this helpful suggestion. The original comparison examined different methods under our target setting, so we adapted Du et al.'s method to the same problem and communication environment. Your suggestion helps us examine how these findings depend on the network and local-domain conditions, strengthening the experimental evidence. We have completed the supplementary comparison under Du's setting and prepared its specification and results for the baseline-comparison section of Appendix G.4.
(a) Rationale for the original comparison. Du et al. also study distributed nonconvex optimization with coupling constraints, and their primal–dual structure and constraint-tracking mechanism are closely related to ours. To compare implementations under our target setting, we encoded the affine equality as equivalent paired inequalities, used unrestricted local domains and the same unbalanced column-stochastic communication matrix as DiSPART, and retained Du's main update structure. Both implementations thus used the same problem, initialization, and communication conditions. DiSPART-Det. attained lower final mean comparison residuals and constraint violations, supporting its design for our target setting. These findings concern the implementations evaluated in that environment.
(b) Supplementary comparison under Du's setting and adjustments to our method. The supplementary experiment uses a doubly stochastic communication matrix , satisfying and , and common compact convex boxes . It retains nonconvex objectives and affine coupling, with , , and , directly addressing the communication-weight and compact-domain conditions you identified.
Du uses its native updates and local box-constraint treatment. Our supplementary method is explicitly labeled Projected DiSPART-Det., with the primal step adjusted to
Constraint tracking uses the actual post-projection increment , while gradient smoothing, moving-center regularization, and multiplier tracking retain their original structure. Both methods use exact fresh gradients; under doubly stochastic mixing, the push–sum weights remain one. This projected version is used for the supplementary comparison. The main-text algorithm and Theorem 1 remain unchanged, and the theorem's guarantee is not directly extended to this variant.
(c) Experimental results and main findings. Under Du's doubly stochastic network and compact-domain conditions, each method evaluated 25 candidate configurations on the same three development problems with an equal tuning budget. After freezing the selected configurations, we evaluated them on ten new independent paired problems, running each trajectory for 6000 iterations. All runs completed successfully.
We use a common box-aware KKT residual and the physical constraint error to assess joint stationarity/feasibility and affine feasibility, respectively. For each problem, we first average the last 20 saved checkpoints; the table reports the cross-problem mean and sample standard deviation.
| Method | KKT residual | Physical RMS |
|---|---|---|
| Projected DiSPART-Det. | ||
| Du et al. |
Projected DiSPART-Det. achieved lower late-window values for both metrics on all ten paired problems. At the same 6000-iteration budget, its mean KKT residual and physical constraint error were approximately and of Du's, respectively. Thus, after restoring Du's network and local-domain conditions and providing equal additional tuning opportunities, our projected supplementary version still achieved a lower KKT residual and more accurate constraint satisfaction. This provides further support for the effectiveness observed in the original comparison within the tested setting and search range.
Response to Reviewer XCpC — Overview
Thank you for your careful review and constructive suggestions. Your comments have helped us clarify our models and better connect theory with experiments. We address the weaknesses and their corresponding questions together in the following four points. We hope that these clarifications and additional evidence have addressed your concerns and strengthened your confidence in this work.