Regularization of linear machine learning problems
S. Liu, S.I. Kabanikhin, S.V. Strijhak

TL;DR
This paper explores how linear neural networks can be analyzed and regularized through their connection to systems of linear algebraic equations, providing methods to construct and regularize the weight matrix Q.
Contribution
It introduces a framework linking linear neural networks to SLAEs and proposes regularization methods for the resulting systems.
Findings
LNEs are reducible to SLAEs.
Methods for regularizing the constructed SLAEs are presented.
The approach facilitates constructing neural network weights from training data.
Abstract
In this paper, we consider the simplest version of a linear neural network (LNN). Assuming that for training (constructing an optimal weight matrix ) we have a set of training pairs, i.e. we know the input data \begin{equation} G=\left\{g^{\left(1\right)},g^{\left(2\right)},\cdots,g^{\left(K\right)}\right\}, \end{equation} as well as the correct answers to these input data \begin{equation} H=\left\{h^{\left(1\right)},h^{\left(2\right)},\cdots,h^{\left(K\right)}\right\}. \end{equation} We will study the possibilities of constructing a weight matrix of a neural network that will give correct answers to arbitrary input data based on the connection of the specified problem with a system of linear algebraic equations (SLAE). Consider a class of neural networks in which each neuron has only one output signal and performs linear operations. We will show how such LNEs are reduced to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical and numerical algorithms · Neural Networks and Applications · Advanced Control and Stabilization in Aerospace Systems
