Training Recurrent Neural Networks by Sequential Least Squares and the Alternating Direction Method of Multipliers
Not on the map. Why?
Abstract (arXiv)
This paper proposes a novel algorithm for training recurrent neural network models of nonlinear dynamical systems from an input/output training dataset. Arbitrary convex and twice-differentiable loss functions and regularization terms are handled by sequential least squares and either a line-search (LS) or a trust-region method of Levenberg-Marquardt (LM) type for ensuring convergence. In addition, to handle non-smooth regularization terms such as ℓ1, ℓ0, and group-Lasso regularizers, as well as to impose possibly non-convex constraints such as integer and mixed-integer constraints, we combine sequential least squares with the alternating direction method of multipliers (ADMM). We call the resulting algorithm NAILS (nonconvex ADMM iterations and least squares) in the case line search (LS) is used, or NAILM if a trust-region method (LM) is employed instead. The training method, which is also applicable to feedforward neural networks as a special case, is tested in three nonlinear system identification problems.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 14 of its 44 references that are in the map. First posted on arXiv 31 Dec 2021.
Builds on
14 of 44 references.
References · 14
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2019On the Convergence of Adam and Beyondcited by 841
- 2020Learning Stable Deep Dynamics Modelscited by 111
- 2015Global Convergence of ADMM in Nonconvex Nonsmooth Optimizationcited by 98
- 2014Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problemscited by 64
- 2016Training Neural Networks Without Gradients: A Scalable ADMM Approachcited by 61
- 2020Nonlinear state-space identification using deep encoder networkscited by 30
- 2019diffGrad: An Optimization Method for Convolutional Neural Networkscited by 29
- 2018Gradient Sampling Methods for Nonsmooth Optimizationcited by 23
- 2017Douglas-Rachford splitting and ADMM for nonconvex optimization: tight convergence resultscited by 21
- 2019On the smoothness of nonlinear system identificationcited by 17
- 2018E-RNN: Design Optimization for Efficient Recurrent Neural Networks in FPGAscited by 8
Built on by
Citing papers per year: 2024: 4; 2025: 4.
8 papers.
- 2024An L-BFGS-B approach for linear and nonlinear system identification under ℓ1 and group-Lasso regularizationcited by 8
- 2024Enhanced Transformer architecture for in-context learning of dynamical systemscited by 7
- 2024Regularized Gauss-Newton for Optimizing Overparameterized Neural Networkscited by 3
- 2025Manifold meta-learning for reduced-complexity neural system identificationcited by 2
- 2025Efficient identification of linear, parameter-varying, and nonlinear systems with noise modelscited by 2
- 2024Nonlinear sparse variational Bayesian learning based model predictive control with application to PEMFC temperature controlcited by 0
- 2025ADMM-Based Training for Spiking Neural Networkscited by 0
- 2025A proximal augmented Lagrangian method for nonconvex optimization with equality and inequality constraintscited by 0
- 2025A proximal augmented Lagrangian method for nonconvex optimization with equality and inequality constraints2 Sep 2025
- 2025ADMM-Based Training for Spiking Neural Networks8 May 2025
- 2025Efficient identification of linear, parameter-varying, and nonlinear systems with noise models16 Apr 2025
- 2025Manifold meta-learning for reduced-complexity neural system identification16 Apr 2025
- 2024Enhanced Transformer architecture for in-context learning of dynamical systems4 Oct 2024
- 2024Regularized Gauss-Newton for Optimizing Overparameterized Neural Networks23 Apr 2024
- 2024Nonlinear sparse variational Bayesian learning based model predictive control with application to PEMFC temperature control15 Apr 2024
- 2024An L-BFGS-B approach for linear and nonlinear system identification under ℓ1 and group-Lasso regularization6 Mar 2024