A new modified hybrid learning algorithm for feedforward neural networks

被引:0
作者
Han, F
Huang, DS
Cheung, YM
Huang, GB
机构
[1] Chinese Acad Sci, Intelligent Comp Lab, Hefei Inst Intelligent Machines, Hefei 230031, Anhui, Peoples R China
[2] Univ Sci & Technol China, Dept Automat, Hefei 230027, Anhui, Peoples R China
[3] Hong Kong Baptist Univ, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China
[4] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore, Singapore
来源
ADVANCES IN NEURAL NETWORKS - ISNN 2005, PT 1, PROCEEDINGS | 2005年 / 3496卷
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, a new modified hybrid learning algorithm for feedforward neural networks is proposed to obtain better generalization performance. For the sake of penalizing both the input-to-output mapping sensitivity and the high frequency components in training data, the first additional cost term and the second one are selected based on the first-order derivatives of the neural activation at the hidden layers and the second-order derivatives of the neural activation at the output layer, respectively. Finally, theoretical justifications and simulation results are given to verify the efficiency and effectiveness of our proposed learning algorithm.
引用
收藏
页码:572 / 577
页数:6
相关论文
共 10 条
[1]   IMPROVING GENERALIZATION PERFORMANCE USING DOUBLE BACKPROPAGATION [J].
DRUCKER, H ;
LECUN, Y .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 1992, 3 (06) :991-997
[2]   ON THE APPROXIMATE REALIZATION OF CONTINUOUS-MAPPINGS BY NEURAL NETWORKS [J].
FUNAHASHI, K .
NEURAL NETWORKS, 1989, 2 (03) :183-192
[3]  
HORNIK K, 1989, APPROXIMATORS NEURAL, V2, P359
[4]   A neural root finder of polynomials based on root moments [J].
Huang, DS ;
Ip, HHS ;
Chi, ZR .
NEURAL COMPUTATION, 2004, 16 (08) :1721-1762
[5]   Finding roots of arbitrary high order polynomials based on neural network recursive partitioning method [J].
Huang, DS ;
Chi, ZR .
SCIENCE IN CHINA SERIES F-INFORMATION SCIENCES, 2004, 47 (02) :232-245
[6]   A constructive approach for finding arbitrary roots of polynomials by neural networks [J].
Huang, DS .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 2004, 15 (02) :477-491
[7]   Dilation method for finding close roots of polynomials based on constrained learning neural networks [J].
Huang, DS ;
Ip, HHS ;
Chi, ZR ;
Wong, HS .
PHYSICS LETTERS A, 2003, 309 (5-6) :443-451
[8]  
IRIE B, 1988, P IEEE INT C NEUR NE, V1, P641, DOI DOI 10.1109/ICNN.1988.23901
[9]   Merging back-propagation and Hebbian learning rules for robust classifications [J].
Jeong, DG ;
Lee, SY .
NEURAL NETWORKS, 1996, 9 (07) :1213-1222
[10]   Adaptive learning algorithms to incorporate additional functional constraints into neural networks [J].
Jeong, SY ;
Lee, SY .
NEUROCOMPUTING, 2000, 35 :73-90