Orthogonal Least Squares Algorithm for the Approximation of a Map and its Derivatives with a RBF Network
Carlo Drioli, Davide Rocchesso
Abstract
Radial Basis Function Networks (RBFNs) are used primarily to solve curve-fitting problems and for non-linear system modeling. Several algorithms are known for the approximation of a non-linear curve from a sparse data set by means of RBFNs. However, there are no procedures that permit to define constrains on the derivatives of the curve. In this paper, the Orthogonal Least Squares algorithm for the identification of RBFNs is modified to provide the approximation of a non-linear 1-in 1-out map along with its derivatives, given a set of training data. The interest on the derivatives of non-linear functions concerns many identification and control tasks where the study of system stability and robustness is addressed. The effectiveness of the proposed algorithm is demonstrated by a study on the stability of a single loop feedback system.
Create a lesson
Related papers
DyssomniaNN: Multi-Scale Spiking Neural Modeling of Human Sleep Disorders and Perceived Restedness
Daniel Szelogowski
REMBGO for Evaluation-Limited Optimization: CEC2022 Benchmarking and EAF-STATCOM Generalization
Vikram Chekuri, Narapareddy Ramarao, Prashanth N A
Learning to Orchestrate Evolutionary Search: Progression-Aware Deep Reinforcement Learning for Dynamic DE-CMA-ES Coordination in Optimization and Structural Model Updating
Lechen Li, Rongye Shi, Wanhuan Zhou
Evolutionary Architecture Search for Chlorophyll-a Prediction in Lakes using Sentinel-2
Kursat Komurcu, Linas Petkevicius
The Modular CMA-ES: A Framework for Modern Evolution Strategies
Jacob de Nobel, Diederick Vermetten, Anna V. Kononova et al.
Relocating Nonlinearity: How a Downstream Learner Reshapes What Genetic Programming Must Evolve
Nam H. Le