vix.ing · top · new · best · stats · spec

Training Recurrent Neural Networks as a Constraint Satisfaction Problem

2018/03/20 by Hamid Khodabandehlou, Khodabandehlou, Hamid, Mohammad Sami Fadali +1
Computer Science · #FOS: Computer and information sciences #FOS: Electrical engineering #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Metaheuristic Optimization Algorithms Research #Neural Networks and Applications #Neural Networks and Reservoir Computing #Signal Processing (eess.SP) #electronic engineering #information engineering

paper · pdf · doi:10.48550/arxiv.1803.07200

openalex publication_date 2018/03/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This paper presents a new approach for training artificial neural networks using techniques for solving the constraint satisfaction problem (CSP). The quotient gradient system (QGS) is a trajectory-based method for solving the CSP. This study converts the training set of a neural network into a CSP and uses the QGS to find its solutions. The QGS finds the global minimum of the optimization problem by tracking trajectories of a nonlinear dynamical system and does not stop at a local minimum of the optimization problem. Lyapunov theory is used to prove the asymptotic stability of the solutions with and without the presence of measurement errors. Numerical examples illustrate the effectiveness of the proposed methodology and compare it to a genetic algorithm and error backpropagation.

Citations

Related