|
This article is available for purchase or by subscription. See below.
Abstract
|
|
We highlight a formal and substantial analogy between machine learning (ML)
algorithms and discrete dynamical systems (DDS) in relaxation form. The
analogy offers a transparent interpretation of the weights in terms of physical
information-propagation processes and identifies the model function of the forward
ML step with the local attractor of the corresponding discrete dynamics. Besides
improving the explainability of current ML applications, this analogy may also
facilitate the development of a new class ML algorithms with a reduced number of
weights.
|
PDF Access Denied
We have not been able to recognize your IP address
18.97.14.89
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription only.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.
You may also contact us at
contact@msp.org
or by using our
contact form.
Keywords
machine learning, partial differential equations, discrete
dynamical systems
|
Mathematical Subject Classification
Primary: 35Axx, 44Axx, 68Txx
|
Milestones
Received: 9 February 2025
Accepted: 23 March 2025
Published: 6 September 2025
Communicated by Roberto Natalini
|
| © 2025 MSP (Mathematical Sciences
Publishers). |
|