使用最小二乘法减少神经网络的隐单元  

Reducing the Hidden Units in Neural Networks by Using Least Square Method

作　　者：刘英敏[1] 吴沧浦[1] 毕大川 

机构地区：[1]北京理工大学自动控制系,北京100081 [2]中国技术创新公司,北京100036

出　　处：《北京理工大学学报》2000年第6期693-697,共5页Transactions of Beijing Institute of Technology

基　　金：国家自然科学基金资助项目! ( 69674 0 0 5)

摘　　要：提出新的逐步减少神经元个数并保持神经网络性能的方法 .每一步中利用提出的规则之一选择被消去的单元 ,然后求解一个线性最小二乘问题调整网络中部分剩余权值 ,使简化网络的输入 -输出关系在训练集上尽量保持不变 .该方法可以得到比已有的启发式方法规模更小 ,但性能相近的网络 。A novel pruning algorithm, which can keep the performance of the network while its neurons are removed one by one, is proposed. In each step, a hidden unit is chosen to be deleted according to one of two proposed rules, then a linear least square problem is solved to adjust part of the remaining weights in order that the performance of the reduced network is as close as possible to the original one. Compared with the existing pruning algorithms, the proposed method may lead to networks with smaller size. The simulation results of finding the functional relationship between GDP(gross domestic product) and GE(gross export), GI(gross import) show the effectiveness of the proposed method.

关 键 词：神经网络 最小二乘法 隐单元 修剪算法 泛化能力 

分 类 号：TP183[自动化与计算机技术—控制理论与控制工程] O241.5[自动化与计算机技术—控制科学与工程]