- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2(+1)
Read review
Paper summary
This paper investigates distributed nonconvex optimization under biased gradient compression, with the aim of reducing the auxiliary memory required by error-feedback (EF) methods. The proposed ACTION condition requires a nonnegative inner product between the global gradient and the aggregated compression error. Its implementable variant, L-ACTION, uses the signs of the previous aggregated compressed gradient as the reference for direction-constrained quantization and sparsification. The revision changes the claimed L-ACTION guarantee to a convergence bound with a residual term, removes the zero-reference full-precision override from Algorithm 3, and adds analyses of compression-error ratios, memory usage, and stochastic training. The central question is whether the practical L-ACTION method offers a reliable memory-communication-accuracy advantage, rather than only promising behavior under idealized ACTION.
Critical strengths
Strength 1
A substantive correction of the main theoretical and implementation issues. The revised paper no longer defends the problematic learning-rate argument from the first submission, and it explicitly qualifies the L-ACTION convergence statement with a residual. Removing the full-precision override also addresses the central communication-budget inconsistency in the original Algorithm 3. These changes make the presentation more credible and justify recognizing an improvement in technical soundness.
Strength 2
A conceptually distinct compression rule with promising results in selected settings. Rather than accumulating numerical EF states, the paper controls compression errors through coordinatewise directional constraints, using only a lagged sign reference in L-ACTION. The 4-bit ResNet18/CIFAR100 result remains notable: Table 1 reports 132 rounds for LA-Q versus 856 for standard Q to reach 30% accuracy. The Appendix G comparison also makes the potential reduction in persistent auxiliary-state footprint explicit, although this is not yet a full system-level memory measurement.
Critical weaknesses
Assessment of the Authors' Responses
Response to Question 1
The authors acknowledge the gap in the original transition from Equation (43) to Equation (44) and replace the argument in Appendix D.2. The revised Theorem 2 now states a weaker result with a residual term under rω < 1. This substantively addresses my original algebraic objection; I would not repeat that objection against the revised proof. The remaining concern is whether the new condition provides a meaningful guarantee in the evaluated high-dimensional settings.
Response to Question 2
The full-precision override for zero-reference coordinates has been removed from Algorithm 3, and the direction-constrained sparsification procedure has been clarified. This is an important correction to the implementation description. However, the communication-efficiency claims still rely primarily on rounds to target accuracy rather than measured encoded bytes, including mask, indices, scales, reconstruction information, and downlink traffic.
Response to Question 3
Appendix F now records the sign-inconsistency energy ratio R_t, the observed compression-error ratio ω_t, and their product on actual training trajectories. These are useful diagnostics. Nevertheless, the observed ω_t is not the uniform constant ω required by Definition 1 and Theorem 2. Per-round products below one do not establish rω < 1; moreover, several 4-bit configurations exceed the observed threshold.
Response to Question 4
The added DGD baselines, auxiliary-state memory comparison, and three-seed stochastic-gradient experiments improve transparency. The reported stochastic results also reveal limitations: LA-Q deteriorates in later training, while LA-S can underperform S and EF21-S. The main larger-model evaluations remain full-batch, single-seed experiments with mildly heterogeneous data. Thus, the response improves the evidence but does not fully establish the claimed practical robustness.
Critical Weaknesses
Comment 1
The experiments do not yet establish a consistent advantage for the practical L-ACTION method. The strongest positive results are concentrated in selected low-bit, full-batch settings, while the idealized ACTION results use the current uncompressed global gradient and should not be treated as direct evidence for deployable L-ACTION. Appendix L.4, Figures 20-23, reports late-stage deterioration of LA-Q under stochastic gradients; LA-S also often trails S and EF21-S in those small-CNN tests. The sparsification results are similarly mixed: in Table 9, at the 30% target and k = 0.5M, LA-S requires 397 rounds, compared with 255 for EF21-S. These results make it difficult to conclude that the proposed direction constraint consistently improves practical training. Larger-model mini-batch experiments, multiple seeds, stronger non-IID partitions, and reporting of failure cases are needed to support such a conclusion.
Comment 2
The claimed communication and memory benefits are not yet demonstrated through matched end-to-end measurements. Removing the zero-reference override resolves one important defect, but the revised DC-S still transmits indices, a mask, values, and reconstruction information. The paper primarily reports the number of communication rounds rather than the cumulative encoded payload required to reach the same target accuracy. It also does not report wall-clock training time or measured peak memory. Figure 11 in Appendix G compares the sizes of persistent INT8 sign and FP32 EF states, which supports a narrower auxiliary-storage claim, but not necessarily a corresponding reduction in total training memory. Actual uplink and downlink bytes, measured persistent and peak memory, and time-to-accuracy under matched settings would be more conclusive.
Comment 3
The current ablations do not isolate the reason for the observed optimization improvement. Direction-constrained rounding changes not only the sign of the compression error but potentially the magnitude of the compressed update. Consequently, faster loss reduction at a fixed learning rate may partly reflect a different effective update scale rather than better directional information alone. This matters because the claimed contribution is a directional error-control mechanism. The authors should compare against well-tuned learning-rate baselines and norm-matched compressed updates, and report gradient alignment together with update-norm ratios. Such tests would distinguish the intended geometric mechanism from a step-size effect.
Comment 4
The incremental novelty over more closely related aggregate-feedback compression methods needs clearer positioning. Ortega et al., "Communication Compression for Distributed Learning without Control Variates" (arXiv:2412.04538, first posted December 2024), introduced CAFe, which uses previous global aggregate information to avoid client-specific EF control variates. CAFe compresses differences relative to a historical aggregate, whereas L-ACTION uses a historical sign reference to constrain compression errors; therefore, I do not regard the two mechanisms as identical. However, the motivation of avoiding numerical client-side EF state through past aggregate information overlaps. A direct explanation of what is new at the operator and theoretical levels, together with a fair matched-budget comparison where feasible, is needed to establish the incremental contribution.
Comment 5
The link between the revised theorem, the experiments, and the supplied implementation remains incomplete. Theorem 2 assumes rω < 1 and permits a nonvanishing residual proportional to 2rωζ²/(1-rω). Appendix F tracks the realized ω_t, which is not the uniform compressor bound ω; Appendix I gives dimension-dependent bounds that may be loose for large models. The supplementary code supplied with the manuscript also appears to predate the revision and uses quantization scaling and sign-state handling that do not clearly match the revised descriptions. These observations do not establish that the new experiments are incorrect, but they prevent the presented materials from fully verifying the practical scope of the theorem and the revised implementation. A version-aligned release and a tighter theory-to-experiment analysis would help resolve this concern.
Overall Assessment
I appreciate the substantial effort in the revision and consider the original algebraic gap and zero-reference override substantially addressed. These corrections improve the soundness of the paper. Nevertheless, the main claims concern the practical L-ACTION method, for which the evidence of a robust memory-communication-accuracy advantage over appropriate alternatives remains incomplete. The uneven stochastic and sparsification results, limited end-to-end cost measurements, and insufficient comparison with closely related aggregate-feedback work continue to affect my overall assessment. I therefore retain the overall recommendation while recognizing the improvement in technical rigor.
Questions for authors
Question 1
On the end-to-end communication and memory costs. Could the authors report cumulative actually encoded uplink and downlink bytes to reach matched target accuracies, including indices, masks, scales, and reconstructed values? Could they also report wall-clock time, persistent auxiliary memory, and peak training memory against Q/S, EF21, and uncompressed DGD under comparable settings?
Question 2
On the robustness of L-ACTION in realistic training. Could the authors repeat the mini-batch experiments with multiple seeds on at least one larger architecture and vary the non-IID partition strength? In particular, under which conditions does the late-stage instability of LA-Q disappear, and when does LA-S reliably outperform S and EF21-S?
Question 3
On the specific benefit of the directional constraint. Could the authors compare against learning-rate-tuned standard compression and norm-matched compressed updates, and report the gradient-alignment cosine and compressed-to-uncompressed update norm ratio? This would help determine whether the improvement is caused by the claimed alignment effect rather than an effective step-size change.
Question 4
On novelty relative to prior aggregate-feedback methods. How does L-ACTION differ in mechanism and required communication from CAFe (Ortega et al., arXiv:2412.04538) and its later development? Could the authors add a matched communication-budget and memory comparison, or explain clearly when such a comparison would not be appropriate?
Question 5
On the validity of the revised theorem and reproducibility. Can the authors distinguish the observed ω_t from the uniform ω required by Theorem 2 and quantify whether rω < 1 can be verified with a meaningful bound on the main high-dimensional tasks? Could they also provide code consistent with the revised quantizer, INT8 sign state, and new stochastic-gradient experiments?
5 comments
W1 & Q1: Corrected convergence for L-ACTION
We have revised the proof to remove the positive learning rate lower bound. The corrected theorem includes a residual term, and we have revised the corresponding claims throughout the paper.
The original transition from Eqs. (43) to (44) requires a positive learning-rate lower bound when , as the reviewer identified. It therefore does not justify the claimed choice . Simply adding the missing lower bound would not resolve this issue.
The revised proof uses a different Young-inequality parameter to bound the inner product between the previous global gradient and the current compression error. The new sufficient conditions are
0<\eta\le \frac{1-r\omega}{4+(8-2r)\omega}\cdot\frac{1}{L}$$ For fixed uniform bounds $r$ and $\omega$ satisfying $r\omega<1$, choosing $\eta=\Theta(1/\sqrt{T})$ subject to this upper bound yields $$\mathbb{E}\\|\nabla f(\hat x^T)\\|^2 \le\mathcal{O}(1/\sqrt{T}) +\frac{2r\omega}{1-r\omega}\zeta^2.$$ This is a weaker conclusion than the original claim: it bounds the expected squared gradient norm up to a residual, rather than establishing general convergence to stationarity. The residual vanishes when $r=0$, $\omega=0$, or $\zeta=0$. The revised definition of $r$ also includes zero-reference coordinates, as explained below. The complete proof is provided in Appendix D.2. The abstract, introduction, and theoretical discussion now distinguish this guarantee from that of ACTION.W2 & Q2: Zero-reference coordinates and communication cost
We have removed the full-precision override from Algorithm 3 and revised the analysis to cover the implementation used in the experiments. Zero-reference coordinates no longer require an additional transmission mechanism.
The override in the original Algorithm 3 was not implemented. We initially assumed that zero coordinates in the aggregated compressed gradient would be negligible after initialization, but this assumption was incorrect under aggressive compression. This caused a discrepancy between the algorithm description and the implementation.
The implementation handles zero-reference coordinates as follows:
- DC-Q: apply ordinary rounding.
- DC-S: include the coordinate in the safe set and apply the normal selection rule.
Neither method triggers additional full-precision transmission solely because the reference is zero. To analyze these rules, we now define
Accordingly, measures the fraction of global gradient energy on sign-reversed or zero-reference coordinates, and uniformly bounds this fraction. The initial iteration with a zero reference is handled separately in the proof. These changes bring Algorithm 3 and Theorem 2 into agreement with the existing implementation without changing the reported experimental trajectories.
For communication, Q, EF21-Q, and LA-Q use the same quantization-code and scale formats at a given bit width. Consequently, the reported reductions in rounds for LA-Q relative to Q and EF21-Q translate into proportional reductions in cumulative encoded uplink payload.
For DC-S, we reduce the number of explicitly transmitted entries to offset the mask overhead. The adjusted number remains positive in all evaluated configurations, so the fallback is never invoked. The two FP32 reconstruction scalars, and , add 8 bytes per client when the mask is used, which is negligible at the evaluated communication budgets.
We thank the reviewer for the constructive feedback and for recognizing the potential of sign-based auxiliary state. We have corrected the analysis and algorithm, expanded the empirical evaluation, and revised our claims accordingly. We have uploaded the revised PDF, with all changes marked in blue.