LGDSOCMLApr 16

Zeroth-Order Optimization at the Edge of Stability

ETH Zurich
arXiv:2604.1466956.3h-index: 8
AI Analysis

Provides a theoretical understanding of stability in zeroth-order optimization for deep learning practitioners, revealing a distinct regularization mechanism compared to first-order methods.

Zeroth-order (ZO) methods are widely used but their optimization dynamics in deep learning are underexplored. This work provides an explicit step size condition for linear stability of ZO methods based on the two-point estimator, revealing that stability depends on the entire Hessian spectrum, and derives tractable bounds using only the largest eigenvalue and trace. Empirically, ZO-GD, ZO-GDM, and ZO-Adam stabilize near the predicted boundary, highlighting an implicit regularization effect where large step sizes regularize the Hessian trace.

Zeroth-order (ZO) methods are widely used when gradients are unavailable or prohibitively expensive, including black-box learning and memory-efficient fine-tuning of large models, yet their optimization dynamics in deep learning remain underexplored. In this work, we provide an explicit step size condition that exactly captures the (mean-square) linear stability of a family of ZO methods based on the standard two-point estimator. Our characterization reveals a sharp contrast with first-order (FO) methods: whereas FO stability is governed solely by the largest Hessian eigenvalue, mean-square stability of ZO methods depends on the entire Hessian spectrum. Since computing the full Hessian spectrum is infeasible in practical neural network training, we further derive tractable stability bounds that depend only on the largest eigenvalue and the Hessian trace. Empirically, we find that full-batch ZO methods operate at the edge of stability: ZO-GD, ZO-GDM, and ZO-Adam consistently stabilize near the predicted stability boundary across a range of deep learning training problems. Our results highlight an implicit regularization effect specific to ZO methods, where large step sizes primarily regularize the Hessian trace, whereas in FO methods they regularize the top eigenvalue.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes