60行代码徒手实现深度神经网络

Cristalyin

2019-07-25

关注关注

准备数据集

采用的数据集是sklearn中的breast cancer数据集，30维特征，569个样本。训练前进行MinMax标准化缩放至[0,1]区间。按照75/25比例划分成训练集和验证集。

# 获取数据集
import numpy as np
import pandas as pd
from sklearn import datasets
from sklearn import preprocessing
from sklearn.model_selection import train_test_split
breast = datasets.load_breast_cancer()
scaler = preprocessing.MinMaxScaler()
data = scaler.fit_transform(breast['data'])
target = breast['target']
X_train,X_test,y_train,y_test = train_test_split(data,target)

模型结构图

正反传播公式

NN实现代码

import numpy as np
import pandas as pd
#定义激活函数
ReLu = lambda z:np.maximum(0.0,z)
d_ReLu = lambda z:np.where(z<0,0,1)
LeakyReLu = lambda z:np.maximum(0.01*z,z)
d_LeakyReLu = lambda z:np.where(z<0,0.01,1)
Sigmoid = lambda z:1/(1+np.exp(-z))
d_Sigmoid = lambda z: Sigmoid(z)*(1-Sigmoid(z)) #d_Sigmoid = a(1-a)
Tanh = np.tanh
d_Tanh = lambda z:1 - Tanh(z)**2 #d_Tanh = 1 - a**2
class NNClassifier(object):
def __init__(self,n = [np.nan,5,5,1],alpha = 0.1,ITERNUM = 50000, gfunc = 'ReLu'):
self.n = n #各层节点数
self.gfunc = gfunc #隐藏层激活函数
self.alpha,self.ITERNUM = alpha,ITERNUM
self.dfJ = pd.DataFrame(data = np.zeros((ITERNUM,1)),columns = ['J'])
self.W,self.b = np.nan,np.nan
# 确定各层激活函数
self.g = [eval(self.gfunc) for i in range(len(n))];
self.g[-1] = Sigmoid;self.g[0] = np.nan
# 确定隐藏层激活函数的导数
self.d_gfunc = eval('d_' + self.gfunc)
def fit(self,X_train,y_train):
X,Y = X_train.T,y_train.reshape(1,-1)
m = X.shape[1] #样本个数
n = self.n; n[0] = X.shape[0] # 各层节点数量
# 节点值和参数初始化
A = [np.zeros((ni,m)) for ni in n];A[0] = X #各层节点输出值初始化
Z = [np.zeros((ni,m)) for ni in n];Z[0] = np.nan #各层节点中间值初始化
W = [np.nan] + [np.random.randn(n[i],n[i-1]) * 0.01 for i in range(1,len(n))] #各层系数参数
b = [np.zeros((ni,1)) for ni in n];b[0] = np.nan #n各层偏置参数
# 导数初始化
dA = [np.zeros(Ai.shape) for Ai in A]
dZ = [np.zeros(Ai.shape) for Ai in A]
dW = [np.zeros(Wi.shape) if isinstance(Wi,np.ndarray) else np.nan for Wi in W]
db = [np.zeros(bi.shape) if isinstance(bi,np.ndarray) else np.nan for bi in b]
for k in range(self.ITERNUM):
# ---------正向传播 ----------
for i in range(1,len(n)):
Z[i] = np.dot(W[i],A[i-1]) + b[i]
A[i] = self.g[i](Z[i])
J = (1/m) * np.sum(- Y*np.log(A[len(n)-1]) -(1-Y)*np.log(1-A[len(n)-1]))
self.dfJ.loc[k]['J']= J
# ----------反向传播 ---------
hmax = len(n) - 1
dA[hmax] = 1/m*(-Y/A[hmax] + (1-Y)/(1-A[hmax]))
dZ[hmax] = 1/m*(A[hmax]-Y)
dW[hmax] = np.dot(dZ[hmax],A[hmax-1].T)
db[hmax] = np.dot(dZ[hmax],np.ones((m,1)))
for i in range(len(n)-2,0,-1):
dA[i] = np.dot(W[i+1].T,dZ[i+1])
dZ[i] = dA[i]* self.d_gfunc(Z[i])
dW[i] = np.dot(dZ[i],A[i-1].T)
db[i] = np.dot(dZ[i],np.ones((m,1)))
#-----------梯度下降 ---------
for i in range(1,len(n)):
W[i] = W[i] - self.alpha*dW[i]
b[i] = b[i] - self.alpha*db[i]
# 显示进度
if (k+1)%1000 == 0:
print('progress rate：{}/{}'.format(k+1,self.ITERNUM),end = '\r')
self.W,self.b = W,b
def predict_prob(self,X_test):
# ---------正向传播 ----------
W,b = self.W,self.b
Ai = X_test.T
for i in range(1,len(self.n)):
Zi = np.dot(W[i],Ai) + b[i]
Ai = self.g[i](Zi)
return(Ai.reshape(-1))
def predict(self,X_test):
Y_prob = self.predict_prob(X_test)
Y_test = Y_prob.copy()
Y_test[Y_prob>=0.5] = 1
Y_test[Y_prob< 0.5] = 0
return(Y_test)