Deep Learning via Neural Energy Descent

This paper proposes a method called Neural Energy Descent (NED) via neural network (NN) evolution equations for a wide class of deep learning (DL) problems. We demonstrate that the training process of DL can be reformulated as the evolution of the network parameters governed by a partial differential equation (PDE) where the steady-state solution yields a solution for DL. This equation corresponds to a gradient descent flow of a variational problem and hence the proposed PDE solves an energy minimization problem to obtain a global minimizer of DL. This gives a novel interpretation and solution for DL optimization. The computational complexity of the proposed energy descent method can be enhanced by randomly sampling the spatial domain of the PDE. Numerical examples are provided to demonstrate the numerical advantages of NED over stochastic gradient descent (SGD) method and Adam.

Authors

Institutions

Publication Details

Journal
Communications in Computational Physics
Published
2026-05-31
DOI
https://doi.org/10.4208/cicp.oa-2024-0195
Citations
1
Primary Topic
Model Reduction and Neural Networks
Type
preprint
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Deep Learning via Neural Energy Descent

Wenrui Hao, Haizhao Yang, Chunmei Wang, Xu Xingjian
1 citations
Communications in Computational Physics
Model Reduction and Neural Networks
preprint

Deep Learning via Neural Energy Descent

Wenrui Hao, Haizhao Yang, Chunmei Wang, Xu Xingjian
preprint en
1 citations

Abstract

This paper proposes a method called Neural Energy Descent (NED) via neural network (NN) evolution equations for a wide class of deep learning (DL) problems. We demonstrate that the training process of DL can be reformulated as the evolution of the network parameters governed by a partial differential equation (PDE) where the steady-state solution yields a solution for DL. This equation corresponds to a gradient descent flow of a variational problem and hence the proposed PDE solves an energy minimization problem to obtain a global minimizer of DL. This gives a novel interpretation and solution for DL optimization. The computational complexity of the proposed energy descent method can be enhanced by randomly sampling the spatial domain of the PDE. Numerical examples are provided to demonstrate the numerical advantages of NED over stochastic gradient descent (SGD) method and Adam.

Communications in Computational PhysicsVol. 40(3)
Pennsylvania State University (US), University of Florida (US), University of Maryland, College Park (US)
National Science Foundation, National Institutes of Health, Office of Naval Research
Affordable and clean energy
Openalex Percentile: Top 100%
Model Reduction and Neural Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.