.png){kind=icon}
.png){kind=icon}
Return
Optimal Control Theoretic Neural Optimizer: From Backpropagation to Dynamic Programming
.png){kind=icon}
PRE
AI
DOI：10.1109/TPAMI.2025.3634391.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Optimization of deep neural networks (DNNs) has been driving modern advancements in artificial intelligence. With DNNs characterized by a prolonged sequence of nonlinear propagation, determining their optimal parameters given an objective naturally fits within Optimal Control Programming. Such an interpretation of DNNs as dynamical systems has proven crucial in offering principled analysis from numerical equations to physics. In parallel to these theoretical pursuits, this paper focuses on an algorithmic perspective. Our motivated observation is the striking algorithmic resemblance between the Backpropagation algorithm for computing gradients in DNNs and the optimality conditions for dynamical systems, expressed through another backward process known as dynamic programming. Consolidating this connection, where Backpropagation admits a variational structure, solving an approximate dynamic programming up to the first-order expansion, leads to a new class of optimization methods exploring higher-order expansions of the Bellman equation. The resulting optimizer, Optimal Control Theoretic Neural Optimizer (OCNOpt), enables rich algorithmic opportunities, including layer-wise feedback policies, game-theoretic applications, and higher-order training of continuous-time models such as Neural ODEs. Extensive experiments demonstrate that OCNOpt improves upon existing methods in robustness and efficiency while maintaining manageable computational complexity, paving new avenues for principled algorithmic design grounded in dynamical systems and optimal control theory.
Keywords:
Optimization
deep neural network
optimal control
differential dynamic programming
backpropagation
Journal
IF:
18.6
Papers:
831
Citations:
9.8W
View more organizations