Model Evolution Under Zeroth-Order Optimization: A Neural Tangent Kernel Perspective
Not on the map. Why?
Abstract (arXiv)
Zeroth-order (ZO) optimization enables memory-efficient training of neural networks by estimating gradients via forward passes only, eliminating the need for backpropagation. However, the stochastic nature of gradient estimation significantly obscures the training dynamics, in contrast to the well-characterized behavior of first-order methods under Neural Tangent Kernel (NTK) theory. To address this, we introduce the Neural Zeroth-order Kernel (NZK) to describe model evolution in function space under ZO updates. For linear models, we prove that the expected NZK remains constant throughout training and depends explicitly on the first and second moments of the random perturbation directions. This invariance yields a closed-form expression for model evolution under squared loss. We further extend the analysis to linearized neural networks. Interpreting ZO updates as kernel gradient descent via NZK provides a novel perspective for potentially accelerating convergence. Extensive experiments across synthetic and real-world datasets (including MNIST, CIFAR-10, and Tiny ImageNet) validate our theoretical results and demonstrate acceleration when using a single shared random vector.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 22 of its 29 references that are in the map. First posted on arXiv 22 Mar 2026.
Builds on
22 of 29 references.
References · 22
- 2022Training language models to follow instructions with human feedbackcited by 15,712
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2020Learning to summarize from human feedbackcited by 2,562
- 2016An overview of gradient descent optimization algorithmscited by 1,021
- 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 732
- 2019On Exact Computation with an Infinitely Wide Neural Netcited by 572
- 2023Fine-Tuning Language Models with Just Forward Passescited by 337
- 2019Gradient Descent Maximizes the Margin of Homogeneous Neural Networkscited by 308
- 2013Optimal rates for zero-order convex optimization: the power of two function evaluationscited by 190
- 2018Algorithmic Regularization in Learning Deep Homogeneous Models: Layers are Automatically Balancedcited by 172
- 2020A Primer on Zeroth-Order Optimization in Signal Processing and Machine Learningcited by 160
- 2020On the linearity of large non-linear models: when and why the tangent kernel is constantcited by 129
10 more
- 2019A Theoretical and Empirical Comparison of Gradient Approximations in Derivative-Free Optimizationcited by 66
- 2020The Surprising Simplicity of the Early-Time Learning Dynamics of Neural Networkscited by 58
- 2019An ADMM Based Framework for AutoML Pipeline Configurationcited by 47
- 2022Understanding the Role of Nonlinearity in Training Dynamics of Contrastive Learningcited by 19
- 2024Nonparametric Teaching of Implicit Neural Representationscited by 13
- 2023Nonparametric Iterative Machine Teachingcited by 9
- 2023Nonparametric Teaching for Multiple Learnerscited by 7
- 2025Nonparametric Teaching for Graph Property Learnerscited by 5
- 2025NTK-Guided Implicit Neural Teachingcited by 2
- 2026Nonparametric Teaching of Attention Learnerscited by 1
Built on by
Not cited yet.