Aug 2026· Mathematics· Vol 14, pp. 2869· 0 citations· 108 references
TL;DR
This paper presents a multi-stage evolutionary technique based on genetic algorithms for the effective training of RBF networks, applied to a large set of classification and data-fitting problems, yielding excellent results.
Abstract
A large collection of real-world classification and regression problems can be addressed using machine learning tools such as, for example, radial basis function networks (RBF networks). However, the techniques used for training RBF networks often exhibit various problems, such as getting trapped in the local minima of the error function, or even encountering numerical issues when solving systems of linear equations in order to estimate the parameters of the RBF network. This paper presents a multi-stage evolutionary technique based on genetic algorithms for the effective training of RBF networks. In the first stage, the value ranges of the RBF network parameters are estimated using the K-Means algorithm. In the second stage, the chromosomes of the genetic algorithm are initialized within the parameter ranges determined in the first stage, followed by the execution of the genetic algorithm. Each chromosome of the genetic algorithm is considered a candidate parameter vector for the machine learning model. The centers and variances of the RBF network are estimated by the genetic algorithm, while the network weights are determined by solving a system of linear equations. This method was applied to a large set of classification and data-fitting problems, yielding excellent results.
A systematic comparison of backpropagation and ten variants of a genetic algorithm for training multi-layer perceptrons (MLPs), with particular focus on the role of crossover operators, helps clarify when gradient-free training is competitive and which evolutionary operators drive its effectiveness.
Mikołaj Petecki, W. Książek, Artur Niewiarowski· Applied Sciences· 0 citations
In engineering, complex optimization problems often require efficient and reliable solution methods. An example of a metaheuristic algorithm is particle swarm optimization (PSO), which is widely used for its simplicity and adaptability. However, PSO performance is highly sensitive to parameter settings. To tackle this...
P. O. Adebayo, W. Yahya, R. Jimoh· International Journal of Ele...· 0 citations
Solving systems of nonlinear equations is an important problem in applied mathematics, engineering, and scientific computing. Traditional numerical methods often require derivative information and suitable initial approximations, which may reduce their effectiveness when dealing with complex nonlinear systems. This pap...
R. Karyakos, S. A. Al-kababchee, Z. Algamal et al.· مجلة العلوم الأساسـية· 0 citations
Recurrent neural networks (RNNs) are widely used in reservoir operation because they can represent temporal dependencies, but their performance depends strongly on hyperparameter selection. This study compares eight evolutionary strategies—genetic algorithm (GA), particle swarm optimization (PSO), simulated annealing (...
Bo-Ran Zhu, Di Zhang, Jun-Qiang Lin et al.· Applied Sciences· 0 citations
An improved multi-operator differential evolution algorithm, called NN-IMODE, tailored for comprehensive Feedforward Neural Networks optimization, encompassing the number of hidden layers, neurons per layer, weights, biases, and activation functions, is introduced.
Aridj Ferhat, Farouq Zitouni, Karam M. Sallam et al.· Cluster Computing· 0 citations
The RBF neural network (RBFNN) is proposed to address the challenges of modeling nonlinear dynamic systems. However, the modeling effectiveness is often affected by the insufficient adjustment of the structure and parameters. To address this problem, a collaborative optimization algorithm based on activity density (AD-...
Miaoli Ma, Yan-Ni Su, Han Zhang et al.· Neural Processing Letters· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.