Skip to content

Approaching Backpropagation Accuracy with Weight Perturbation on MNIST

Oct 2026 · 0 citations · 32 references
Computer Science

TL;DR

This work examines how batch size, training duration, and estimator stabilization affect weight perturbation accuracy in fully connected MNIST networks, and identifies near-BP accuracy as a configuration- and budget-dependent possibility, rather than evidence of equal efficiency or an unconditional accuracy guarantee across depth.

Abstract

Weight perturbation (WP) estimates learning directions from random parameter perturbations and a scalar change in loss, without backpropagating derivatives. We examine how batch size, training duration, and estimator stabilization affect its attainable accuracy in fully connected MNIST networks. In the shallow configuration, large-batch training reaches approximately 97\% test accuracy, compared with an early backpropagation (BP) reference near 97.5--98\%. The same comparison exposes a substantial efficiency gap: under a ten-epoch budget, shallow WP reaches 90.2\%, whereas the reported BP reference reaches 97.4\%. Epoch-indexed curves show diminishing returns from increasing batch size beyond 4,000. Learning-rate reduction and averaging independent perturbation-based updates also stabilize deeper networks, although their recorded results do not establish BP-level accuracy. We distinguish these empirical findings from a finite-horizon approximation argument: under stated regularity conditions, population WP can approximate a fixed gradient-descent trajectory arbitrarily closely at any fixed finite depth. Positive classification margins then suffice to preserve the reference predictions on a finite test set with arbitrarily high probability. Together, the results identify near-BP accuracy as a configuration- and budget-dependent possibility, rather than evidence of equal efficiency or an unconditional accuracy guarantee across depth.

View source

Similar papers

Sep 2026

Gradient-coupled continual backpropagation: dynamic plasticity control for nonstationary data streams

This work proposes Gradient-Coupled Continual Backpropagation (G-CBP), which modulates layer-wise replacement rates from normalized gradient norms and constrains early turnover through an Adaptive Moving Envelope, and identifies an empirical reconstruction–perturbation relationship.

Wei-Bang Zhou, Xiang-Sheng Huang, Xiao Yang et al. · 0 citations
#machine learning Preprint Sep 2026

A Theoretical Analysis of Generalization Dynamics in Neural Networks under Gradient Descent with Weight Decay

A broad class of neural networks trained under the $\ell^2$ loss by gradient descent with weight decay with weight decay is studied, and the convergence of GD to a neighbourhood of the global minimizers of the empirical loss is proved.

Yu-Qing Wang, I. Kevrekidis, Mikhail Belkin · 1 citation
#machine learning Preprint Sep 2026

Scaling Zero-Order Pretraining through Model Sharding

Zero-order optimization (ZO) trains without backpropagation, making it relevant to forward-only hardware and non-differentiable loss, but its gradient variance grows with perturbed dimension, inhibiting large-model training. Sharded Optimization Mixture of Assemblies (SOMA) trains LSTM experts independently on $N$ data...

Francois Chaubard, M. Kochenderfer, Chris Ré · 0 citations
Preprint Aug 2026

Finite-Horizon Input-Output Dynamics of Minibatch Perturbations in AdamW

This work forms AdamW as a finite-horizon input--state--output (ISO) system whose state contains the model parameters and first- and second-moment estimates, and derives an exact multistep error decomposition and establishes first-order finite-horizon accuracy under local smoothness and controlled activation switching.

Kangning Liu, Su-Yan Li · 1 citation
2025

Convergence Rate Bounds for Stochastic Gradient Descent With Adaptive Step Sizes on Non-Convex Loss Surfaces

This study investigates convergence rate bounds for stochastic gradient descent with adaptive step-size schedules on non-convex loss surfaces within the context of mathematical optimization theory and machine learning theory, an area of growing scientific importance given its implications for training efficiency of lar...

Valentina K. Petrakis, Olumide T. Adesanya, William J. Harrington · 0 citations

Related blog posts

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

MIT News · Artificial Intelligence Oct 23, 2026

Q&A: How AI came to model the “messy” human mind

Assistant Professor Benjamin Lindquist studies how engineers deliberately injected randomness into early AI, giving rise to deep-learning models that sometimes hallucinate.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.