Radial basis function neural network training using variable projection and fuzzy means

Despina Karamichailidou, Georgios Gerolymatos, Panagiotis Patrinos, Haralambos Sarimveis, Alex Alexandridis
{"title":"Radial basis function neural network training using variable projection and fuzzy means","authors":"Despina Karamichailidou, Georgios Gerolymatos, Panagiotis Patrinos, Haralambos Sarimveis, Alex Alexandridis","doi":"10.1007/s00521-024-10274-3","DOIUrl":null,"url":null,"abstract":"<p>Radial basis function (RBF) neural network training presents a challenging optimization task, necessitating the utilization of advanced algorithms that can fully train the network so as to produce accurate and computationally efficient models. To achieve this goal, this work introduces a new framework where the original RBF training problem is divided into two simpler subproblems; the linear parameters, namely the network weights, are projected out of the problem using variable projection (VP), thus leaving a reduced functional, which depends only on nonlinear parameters, i.e., the RBF centers. The centers are updated using the Levenberg–Marquardt (LM) algorithm, while the optimal values of the synaptic weights are calculated in each iteration of the LM algorithm using linear regression. The proposed VP-LM scheme is coupled with the fuzzy means (FM) algorithm, which helps to select the number of RBF centers and enhances the overall search procedure, thus resulting to a framework that produces parsimonious models with enhanced accuracy in shorter training times. The proposed training scheme is evaluated on 12 both real-world and synthetic benchmark datasets and tested against various RBF training algorithms, as well as different neural network architectures. The experimental results underscore the effectiveness of the VP-FM algorithm in producing neural network models that outperform those generated by alternative methods in many aspects; to be more specific, the proposed approach achieves very competitive model accuracy, while resulting to smaller network sizes and thus lower complexity, which leads to shorter training times.</p>","PeriodicalId":18925,"journal":{"name":"Neural Computing and Applications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Neural Computing and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s00521-024-10274-3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Radial basis function (RBF) neural network training presents a challenging optimization task, necessitating the utilization of advanced algorithms that can fully train the network so as to produce accurate and computationally efficient models. To achieve this goal, this work introduces a new framework where the original RBF training problem is divided into two simpler subproblems; the linear parameters, namely the network weights, are projected out of the problem using variable projection (VP), thus leaving a reduced functional, which depends only on nonlinear parameters, i.e., the RBF centers. The centers are updated using the Levenberg–Marquardt (LM) algorithm, while the optimal values of the synaptic weights are calculated in each iteration of the LM algorithm using linear regression. The proposed VP-LM scheme is coupled with the fuzzy means (FM) algorithm, which helps to select the number of RBF centers and enhances the overall search procedure, thus resulting to a framework that produces parsimonious models with enhanced accuracy in shorter training times. The proposed training scheme is evaluated on 12 both real-world and synthetic benchmark datasets and tested against various RBF training algorithms, as well as different neural network architectures. The experimental results underscore the effectiveness of the VP-FM algorithm in producing neural network models that outperform those generated by alternative methods in many aspects; to be more specific, the proposed approach achieves very competitive model accuracy, while resulting to smaller network sizes and thus lower complexity, which leads to shorter training times.

Abstract Image

利用变量投影和模糊手段进行径向基函数神经网络训练
径向基函数(RBF)神经网络训练是一项极具挑战性的优化任务,需要利用先进的算法对网络进行全面训练,以生成精确且计算效率高的模型。为了实现这一目标,这项工作引入了一个新的框架,将原始的 RBF 训练问题分为两个更简单的子问题;使用变量投影(VP)将线性参数(即网络权重)投影到问题之外,从而留下一个仅取决于非线性参数(即 RBF 中心)的简化函数。使用 Levenberg-Marquardt (LM) 算法更新中心,而在 LM 算法的每次迭代中使用线性回归计算突触权重的最佳值。所提出的 VP-LM 方案与模糊手段(FM)算法相结合,有助于选择 RBF 中心的数量,并增强整体搜索程序,从而使该框架能在更短的训练时间内生成具有更高精度的简约模型。我们在 12 个真实世界和合成基准数据集上对所提出的训练方案进行了评估,并与各种 RBF 训练算法以及不同的神经网络架构进行了对比测试。实验结果凸显了 VP-FM 算法在生成神经网络模型方面的有效性,这些模型在很多方面都优于其他方法生成的模型;更具体地说,所提出的方法实现了极具竞争力的模型准确性,同时缩小了网络规模,从而降低了复杂性,缩短了训练时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
文献相关原料
公司名称 产品信息 采购帮参考价格
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信