mlsanityData to 7 Oct 2026

Backpropagation-Free Trunk Training via the Split Forward Gradients

arXiv 2607.16612 ↗First posted 18 Jul 2026stat.ML cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Backpropagation makes training deep networks memory intensive because it must store intermediate activations. Forward-mode methods avoid this cost, but their gradient estimates become increasingly noisy as the number of trained parameters grows. We introduce Split Forward Gradient (Split-FG), which splits a network at an intermediate representation: it computes the output head gradient exactly and estimates only the trunk gradient with a Jacobian--vector product. This reduces estimator variance and requires no backward pass through the trunk, while retaining an Adam-style convergence guarantee. Our experiments reveal an important practical failure mode. On WikiText-103, naive forward-gradient training of the trunk performs worse than leaving a randomly initialized trunk frozen, likely because Adam updates every noisy, under-determined trunk coordinate too aggressively. Simply using a much smaller learning rate for the trunk reverses this result: a 16M-parameter GPT-2-style model reaches validation perplexity 387, compared with 668 for the frozen-trunk control and 2,885 for a matched pure forward-gradient baseline (backpropagation reaches 150). Split-FG also produces the strongest backprop-free results on our tabular benchmarks and reaches 60.5% on CIFAR-10 and 35.2% on CIFAR-100 with a heavy-head design. It reduces peak memory by up to 35% relative to matched backpropagation, although the performance gap widens as the forward-mode trunk grows.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 19 of its 31 references that are in the map. First posted on arXiv 18 Jul 2026.

Builds on

19 of 31 references.

References · 19

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2016Pointer Sentinel Mixture Modelscited by 2,992
  3. 2016Training Deep Nets with Sublinear Memory Costcited by 825
  4. 2019Generalization through Memorization: Nearest Neighbor Language Modelscited by 788
  5. 2017Evolution Strategies as a Scalable Alternative to Reinforcement Learningcited by 555
  6. 2017Large Batch Training of Convolutional Networkscited by 529
  7. 2020Hopfield Networks is All You Needcited by 461
  8. 2023Fine-Tuning Language Models with Just Forward Passescited by 337
  9. 2022The Forward-Forward Algorithm: Some Preliminary Investigationscited by 262
  10. 2016Equilibrium Propagation: Bridging the Gap Between Energy-Based Models and Backpropagationcited by 251
  11. 2016Direct Feedback Alignment Provides Learning in Deep Neural Networkscited by 240
  12. 2017The Reversible Residual Network: Backpropagation Without Storing Activationscited by 215
7 more
  1. 2024TabM: Advancing Tabular Deep Learning with Parameter-Efficient Ensemblingcited by 105
  2. 2020Predictive Coding Approximates Backprop along Arbitrary Computation Graphscited by 89
  3. 2023DeepZero: Scaling up Zeroth-Order Optimization for Deep Model Trainingcited by 76
  4. 2022Scaling Forward Gradient With Local Lossescited by 65
  5. 2020Scaling Equilibrium Propagation to Deep ConvNets by Drastically Reducing its Gradient Estimator Biascited by 60
  6. 2018Training of photonic neural networks through in situ backpropagationcited by 45
  7. 2021Reverse Differentiation via Predictive Codingcited by 23

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.