Combinatorial designs for deep learning
Combinatorial designs for deep learning
复制标题
DOI:
10.1002/jcd.21720
复制
发表时间:
2018-09
影响因子:
0.7
通讯作者:
S. Chisaki;R. Fuji-Hara;N. Miyamoto
中科院分区:
文献类型:
--
作者:
S. Chisaki;R. Fuji-Hara;N. Miyamoto
Deep learning is a machine learning methodology using a multilayer neural network. Let V1,V2,…,VL be mutually disjoint node sets (layers). A multilayer neural network can be regarded as a union of the complete bipartite graphs K∣Vi∣,∣Vi+1∣ on consecutive two node sets Vi and Vi+1 for i=1,2,…,L−1 . The edges of a bipartite graph function as weights which are represented as a matrix. The values of i th layer are basically computed by multiplication of the weight matrix and values of (i−1) th layer. Using mass training and teacher data, the weight parameters are estimated little by little. Overfitting (or overlearning) refers to a model that models the “training data” too well. It then becomes difficult for the model to generalize to new data which were not in the training set. The most popular method to avoid overfitting is called dropout. Dropout zeros out a random sample of activations (nodes) during the training process. A random sampling of nodes causes more irregular frequency of dropout edges. There is a similar sampling concept in the area of design of experiments. We propose a combinatorial design that drops out nodes from each layer. This design balances the edge frequencies. We analyze and construct such designs in this paper.