Second-Order Forward-Mode Automatic Differentiation for Optimization
Not on the map. Why?
Abstract (arXiv)
This paper introduces a second-order hyperplane search, a novel optimization step that generalizes a second-order line search from a line to a k-dimensional hyperplane. This, combined with the forward-mode stochastic gradient method, yields a second-order optimization algorithm that consists of forward passes only, completely avoiding the storage overhead of backpropagation. Unlike recent work that relies on directional derivatives (or Jacobian--Vector Products, JVPs), we use hyper-dual numbers to jointly evaluate both directional derivatives and their second-order quadratic terms. As a result, we introduce forward-mode weight perturbation with Hessian information (FoMoH). We then use FoMoH to develop a novel generalization of line search by extending it to a hyperplane search. We illustrate the utility of this extension and how it might be used to overcome some of the recent challenges of optimizing machine learning models without backpropagation. Our code is open-sourced at https://github.com/SRI-CSL/fomoh.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 9 of its 34 references that are in the map. First posted on arXiv 19 Aug 2024.
Builds on
9 of 34 references.
References · 9
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2014New insights and perspectives on the natural gradient methodcited by 435
- 2022The Forward-Forward Algorithm: Some Preliminary Investigationscited by 262
- 2023Sophia: A Scalable Stochastic Second-order Optimizer for Language Model Pre-trainingcited by 260
- 2020ADAHESSIAN: An Adaptive Second Order Optimizer for Machine Learningcited by 201
- 2022Gradients without Backpropagationcited by 73
- 2015Towards Biologically Plausible Deep Learningcited by 66
- 2022Scaling Forward Gradient With Local Lossescited by 65
- 2023Can Forward Gradient Match Backpropagation?cited by 26
Built on by
Citing papers per year: 2025: 4; 2026: 1.
5 papers.
- 2025Efficient Data Selection at Scale via Influence Distillationcited by 14
- 2025Memory Savings at What Cost? A Study of Alternatives to Backpropagationcited by 1
- 2025Backpropagation-Free Metropolis-Adjusted Langevin Algorithmcited by 0
- 2025IP-Basis PINNs: Efficient Multi-Query Inverse Parameter Estimationcited by 0
- 2026Adaptive directional gradients for parameterised quantum circuitscited by 0
- 2026Adaptive directional gradients for parameterised quantum circuits8 Jun 2026
- 2025IP-Basis PINNs: Efficient Multi-Query Inverse Parameter Estimation8 Sep 2025
- 2025Memory Savings at What Cost? A Study of Alternatives to Backpropagation27 Jun 2025
- 2025Efficient Data Selection at Scale via Influence Distillation25 May 2025
- 2025Backpropagation-Free Metropolis-Adjusted Langevin Algorithm23 May 2025