This paper proposes a least squares approach for the training of quadratic neural networks with regularization.
The proposed methodology yields a lower bound on the solution of the training optimization problem for the case where the regularization coefficient is positive.
Moreover, it yields closed-form expressions for the approximate solution and its sensitivity.
The lower bound is tight and the approximate solution is the optimal solution when the regularization coefficient is zero.
Having a closed-form expression for the weights reduces considerably the computational time when compared with iterative numerical methods such as backpropagation that can get stuck in local minima.
The proposed approach has three main contributions, namely,
- it yields an analytical expression for the weights,
- an analytical expression for the sensitivity of the weights to errors in the data is also provided,
- it establishes a connection between the optimization to compute a lower bound and nuclear norm minimization.
The proposed least squares training is successfully applied to a nonlinear system identification example where the proposed lower bound is compared with the optimal value.