- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
In this paper, the authors investigate a forward-only, gradient-free learning method based on antisymmetric random perturbations and scalar feedback, interpreting it as a three-factor Hebbian learning rule. The authors derive the relationship between gradient-estimate alignment, the number of probes, and the problem dimension. They further propose a query-budget law based on the coupling range (S) and feedback bandwidth (K) to explain how different network architectures affect the efficiency of zeroth-order optimisation. The experiments cover convolutional autoencoders and denoising networks, ViT classification, vector-quantised codebooks, and multi-step DDPM generation tasks. The problem addressed by this paper is meaningful, and the proposed method avoids the need to store activations for backpropagation while achieving competitive results on some reconstruction and denoising tasks.
Critical strengths
S1: Forward-only learning avoids the need to store activations for backpropagation and offers a viable approach to optimising non-differentiable objectives. S2: The authors derive gradient alignment under Gaussian random probing and conduct supplementary simulations to examine the associated scaling laws. S3: The paper discloses discrepancies between some multi-seed results and the originally reported results, issues identified during baseline re-evaluation, and experiments that remain incomplete, helping readers assess the reliability of the current evidence.
Critical weaknesses
W1: The paper uses global scalar feedback for parameter updates but relates the query budget to the coupling range (S) and feedback bandwidth (K). However, the separability of output residuals does not necessarily imply that parameter gradients are decomposable. The authors need to further clarify this theoretical connection and the conditions under which it holds. W2: The paper establishes that the estimator is unbiased for the gradient of the Gaussian-smoothed objective. However, under the assumption that the objective is merely convex and Lipschitz continuous, treating this estimator directly as an unbiased estimate of the original objective's gradient and using it to derive the optimal query complexity lacks sufficient treatment of the smoothing bias. W3: The existing coupling experiments are primarily based on synthetic problems and do not sufficiently validate the gradient coupling structure in real CNNs/U-Nets. Nor do they establish that the idealized frequency-domain separability properties hold in practical nonlinear networks. W4: The paper does not compare the proposed method with standard SPSA or Evolution Strategies, making it difficult to establish its distinct advantages over existing methods.
Questions for authors
Q1: Please explain how global scalar feedback can support (K) independent feedback channels, and clarify the theoretical justification and conditions under which the dimension (P) in the gradient alignment formula can be replaced by the coupling range (S). Q2: Under the assumptions that the objective is only convex and Lipschitz continuous, how does Proposition 4 guarantee that the estimator is unbiased for the gradient of the original objective? Please revise the relevant assumptions or provide an analysis of the smoothing bias. Q3: Please measure cross-channel gradient coupling in practical CNNs/U-Nets and verify whether the proposed (S/K) query-budget law holds. Q4: Please compare the proposed method with standard SPSA or Evolution Strategies under matched query budgets, runtime, and peak memory usage to clarify its distinct contributions.