正则化理论(二)

1、正则化网络
每个隐藏单元的激活函数由Green函数定义
(式1) G ( x , x i ) = e x p ( 1 2 σ i 2 x x i 2 ) G(x,x_i) = exp(- \frac{1}{2\sigma _i ^2}||x-x_i||^2) \tag {式1}
正则化网络2、广义径向基函数网络
F ( x ) = i = 1 m 1 w i φ ( x , t i ) F^*(x) = \sum _{i=1}^{m_1} w_i \varphi(x,t_i)
φ ( x , t i ) = G ( x t i ) \varphi(x,t_i) = G(||x-t_i||)

在这里插入图片描述
F ( x ) = i = 1 m 1 w i φ ( x , t i ) = i = 1 m 1 w i G ( x , t i ) = i = 1 m 1 w i G ( x t i ) F^*(x) = \sum _{i=1}^{m_1} w_i \varphi(x,t_i) = \sum _{i=1}^{m_1} w_i G(x,t_i)= \sum _{i=1}^{m_1} w_i G(||x-t_i||)
新的代价函数:
在这里插入图片描述其中:
在这里插入图片描述
D F 2 = < D F D F > H = [ i = 1 m 1 w i G ( x , t i ) , D ~ D i = 1 m i w i G ( X , t i ) ] H ||DF^*||^2 = <DF^*,DF^*>_H = [\sum _{i=1} ^ {m_1} w_iG(x,t_i),\tilde{D}D\sum _{i=1}^{m_i}w_i G(X,t_i)]_H
= [ i = 1 m 1 w i G ( X , t i ) , i = 1 m 1 w ) δ t i ] H = j = 1 m 1 i = 1 m 1 w j w i G ( t j , t i ) = W T G 0 W =[\sum _{i=1} ^{m_1} w_iG(X,t_i),\sum _{i=1}^{m_1} w )\delta_{t_i} ]_H = \sum_{j=1}^{m_1} \sum_{i=1}^{m_1}w_j w_iG(t_j,t_i)=W^TG_0W
3、加权范数
X C 2 = ( C X ) T ( C X ) = X T C T C X ||X|| _C ^2 = (CX)^T(CX) = X^TC^TCX
F ( x ) = i = 1 m 1 w i G ( x t i c ) F^*(x) = \sum _{i=1}^{m_1} w_i G(||x-t_i||_c)

一个以 t i t_i 为中心和具有范数加权矩阵C的高斯径向基函数 G ( X t i c ) G(||X-t_i||_c) 可写成
G ( X t i c = e x p ( ( X t i ) T C T C ( X t i ) ] = e x p [ 1 2 ( X t i ) T Σ 1 ( X t i ) ] ) ) G(||X-t_i||_c = exp(-(X-t_i)^TC^TC(X-t_i)] = exp[-\frac{1}{2}(X-t_i)^T \Sigma ^{-1} (X-t_i) ]))
1 2 Σ 1 = C T C \frac{1}{2} \Sigma ^{-1} = C^TC

猜你喜欢

转载自blog.csdn.net/moge19/article/details/84996331