Least action principles and well-posed learning problems
From MaRDI portal
Publication:2216004
DOI10.1007/978-3-030-34960-8_10zbMATH Open1474.68238arXiv1907.02517OpenAlexW2954334142MaRDI QIDQ2216004FDOQ2216004
Publication date: 15 December 2020
Abstract: Machine Learning algorithms are typically regarded as appropriate optimization schemes for minimizing risk functions that are constructed on the training set, which conveys statistical flavor to the corresponding learning problem. When the focus is shifted on perception, which is inherently interwound with time, recent alternative formulations of learning have been proposed that rely on the principle of Least Cognitive Action, which very much reminds us of the Least Action Principle in mechanics. In this paper, we discuss different forms of the cognitive action and show the well-posedness of learning. In particular, unlike the special case of the action in mechanics, where the stationarity is typically gained on saddle points, we prove the existence of the minimum of a special form of cognitive action, which yields forth-order differential equations of learning. We also briefly discuss the dissipative behavior of these equations that turns out to characterize the process of learning.
Full work available at URL: https://arxiv.org/abs/1907.02517
Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27) Memory and learning in psychology (91E40)
This page was built for publication: Least action principles and well-posed learning problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2216004)
