IEEE Trans Cybern. 2015 Dec;45(12):2925-36. doi: 10.1109/TCYB.2015.2389524. Epub 2015 Jan 27.
An efficient data based-modeling algorithm for nonlinear system identification is introduced for radial basis function (RBF) neural networks with the aim of maximizing generalization capability based on the concept of leave-one-out (LOO) cross validation. Each of the RBF kernels has its own kernel width parameter and the basic idea is to optimize the multiple pairs of regularization parameters and kernel widths, each of which is associated with a kernel, one at a time within the orthogonal forward regression (OFR) procedure. Thus, each OFR step consists of one model term selection based on the LOO mean square error (LOOMSE), followed by the optimization of the associated kernel width and regularization parameter, also based on the LOOMSE. Since like our previous state-of-the-art local regularization assisted orthogonal least squares (LROLS) algorithm, the same LOOMSE is adopted for model selection, our proposed new OFR algorithm is also capable of producing a very sparse RBF model with excellent generalization performance. Unlike our previous LROLS algorithm which requires an additional iterative loop to optimize the regularization parameters as well as an additional procedure to optimize the kernel width, the proposed new OFR algorithm optimizes both the kernel widths and regularization parameters within the single OFR procedure, and consequently the required computational complexity is dramatically reduced. Nonlinear system identification examples are included to demonstrate the effectiveness of this new approach in comparison to the well-known approaches of support vector machine and least absolute shrinkage and selection operator as well as the LROLS algorithm.
引入了一种基于留一法(LOO)交叉验证的概念,用于最大化泛化能力的径向基函数(RBF)神经网络的非线性系统辨识的有效数据建模算法。每个 RBF 核都有自己的核宽度参数,其基本思想是在正交前向回归(OFR)过程中,每次优化多对正则化参数和核宽度对,其中每个核与一个核相关联。因此,每个 OFR 步骤都包括基于 LOO 均方误差(LOOMSE)的模型项选择,然后基于 LOOMSE 优化相关的核宽度和正则化参数。由于与我们之前的最先进的局部正则化辅助正交最小二乘(LROLS)算法一样,相同的 LOOMSE 用于模型选择,因此我们提出的新 OFR 算法也能够生成具有出色泛化性能的非常稀疏的 RBF 模型。与我们之前的 LROLS 算法不同,该算法需要额外的迭代循环来优化正则化参数以及优化核宽度的额外过程,所提出的新 OFR 算法在单个 OFR 过程中同时优化核宽度和正则化参数,因此所需的计算复杂度大大降低。包含非线性系统识别示例,以证明与支持向量机、最小绝对收缩和选择算子以及 LROLS 算法等知名方法相比,该新方法的有效性。