paper-with-me

Papers

A Physical Theory of Backpropagation: Exact Gradients from the Least-Action Principle

2026-02-02 · Antonino Emanuele Scurria arxiv

Backpropagation is typically presented as a symbolic procedure: a backward pass topologically distinct from inference, with non-local error signals and synchronous global clocking, features with no clear analog in physical reality. Existing physics-inspired alternatives recover gradients only approximately, in vanishing-perturbation limits, or under weight-symmetry constraints incompatible with feedforward architectures. In this paper, we address this gap by deriving exact backpropagation from Hamilton's least-action principle. By recasting the forward dynamics in continuous time and adapting a Lagrangian formalism for non-conservative systems to the resulting flow, we unify inference and gradient computation within a single variational framework on a doubled phase space, whose two conjugate fields jointly encode activations and sensitivities. A single global Lagrangian governs the dynamics: the task loss enters as a symmetry-breaking perturbation of the forward manifold, and credit assignment emerges as the tension that develops between the conjugate states. Inference and gradient computation thus unfold simultaneously through local interactions, requiring no separate backward circuit. Ultimately, standard backpropagation is recovered exactly as the discrete-time projection of this continuous flow. This perspective unifies the formalism of physics with backpropagation, opening a principled pathway for applying tools from classical mechanics - symplectic geometry, Noether's theorem, path-integral methods - to the analysis of learning dynamics. As a downstream consequence, it also points toward analog and neuromorphic substrates in which learning is embodied in the hardware itself.

📄 PDF Abstract BibTeX arXiv:2602.02281

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Training all-mechanical neural networks for task learning through in situ backpropagation

2024-04-23 · Shuaifeng Li, Xiaoming Mao

Recent advances unveiled physical neural networks as promising machine learning platforms, offering faster and more energy-efficient information processing. Compared with extensively-studied optical neural networks, the …

AllSelf-Learning

Gradients of unitary optical neural networks using parameter-shift rule

2025-06-13 · JinZhe Jiang, YaQian Zhao, Xin Zhang, Chen Li 외

This paper explores the application of the parameter-shift rule (PSR) for computing gradients in unitary optical neural networks (UONNs). While backpropagation has been fundamental to training conventional neural network…

Beyond Backpropagation: Optimization with Multi-Tangent Forward Gradients

2024-10-23 · Katharina Flügel, Daniel Coquelin, Marie Weiel, Achim Streit 외

The gradients used to train neural networks are typically computed using backpropagation. While an efficient way to obtain exact gradients, backpropagation is computationally expensive, hinders parallelization, and is bi…

Analyzing Inexact Hypergradients for Bilevel Learning

2023-01-11 · Matthias J. Ehrhardt, Lindon Roberts

Estimating hyperparameters has been a long-standing problem in machine learning. We consider the case where the task at hand is modeled as the solution to an optimization problem. Here the exact gradient with respect to …

Bilevel Optimization

Gradients without Backpropagation

2022-02-17 · Atılım Güneş Baydin, Barak A. Pearlmutter, Don Syme, Frank Wood 외

Using backpropagation to compute gradients of objective functions for optimization has remained a mainstay of machine learning. Backpropagation, or reverse-mode differentiation, is a special case within the general famil…