Skip to main content
Erschienen in: Designs, Codes and Cryptography 8/2021

29.05.2021

A construction for circulant type dropout designs

verfasst von: Shoko Chisaki, Ryoh Fuji-Hara, Nobuko Miyamoto

Erschienen in: Designs, Codes and Cryptography | Ausgabe 8/2021

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Dropout is used in deep learning to prevent overlearning. It is a method of learning by invalidating nodes randomly for each layer in the multi-layer neural network. Let \(V_1, V_2,\ldots , V_n\) be mutually disjoint node sets (layers). A multi-layer neural network can be regarded as a union of the complete bipartite graphs \(K_{|V_i|,|V_{i+1}|}\) on two consecutive node sets \(V_i\) and \(V_{i+1}\) for \(i=1,2,\ldots ,n-1\). The dropout method deletes a random sample of activations (nodes) to zero during the training process. A random sample of nodes also causes irregular frequencies of dropout edges. A dropout design is a combinatorial design on dropout nodes from each layer which balances frequencies of selected edges. The block set of a dropout design is \( {\mathcal {B}} = \{\{C_1\,|\, C_2\,|\, \ldots \,|\, C_n\} \ \bigm | \ C_i \subseteq V_i,\ C_i \ne \emptyset , 1\le i \le n \} \) having a balancing condition in consecutive t sub-blocks \(C_i, C_{i+1},\ldots , C_{i+t-1}\), see [3]. If \(|V_i |\) and \(|C_i|\) are constants for \(1 \le i\le n\), then the dropout design is called uniform. If a uniform dropout design satisfies the circulant property, then the design can be extended to a design with as many layers as you need. In this paper, we describe a construction for uniform dropout designs of circulant type by using affine geometries.
Anhänge
Nur mit Berechtigung zugänglich
Literatur
1.
Zurück zum Zitat Batten, L.M.: Combinatorics of Finite Geometries. Cambridge University Press, Cambridge (1997)CrossRef Batten, L.M.: Combinatorics of Finite Geometries. Cambridge University Press, Cambridge (1997)CrossRef
2.
Zurück zum Zitat Beth, T., Jungnickel, D., Lenz, H.: Design Theory, vol. 2. Cambridge University Press, Cambridge (1999)CrossRef Beth, T., Jungnickel, D., Lenz, H.: Design Theory, vol. 2. Cambridge University Press, Cambridge (1999)CrossRef
3.
Zurück zum Zitat Chisaki, S., Fuji Hara, R., Miyamoto, N.: Combinatorial designs for deep learning. J. Comb. Des. 28, 633–657 (2020)MathSciNetCrossRef Chisaki, S., Fuji Hara, R., Miyamoto, N.: Combinatorial designs for deep learning. J. Comb. Des. 28, 633–657 (2020)MathSciNetCrossRef
5.
Zurück zum Zitat Hirschfeld, J.: Projective Geometries over Finite Fields, 2nd edn. Clarendon Press, Oxford (1998)MATH Hirschfeld, J.: Projective Geometries over Finite Fields, 2nd edn. Clarendon Press, Oxford (1998)MATH
6.
Zurück zum Zitat Mejza, I.: A note on analysis of split-block designs. In: Proceedings of the SDA’87 - Statistical Data Analysis, pp. 128–132 (1987) Mejza, I.: A note on analysis of split-block designs. In: Proceedings of the SDA’87 - Statistical Data Analysis, pp. 128–132 (1987)
7.
Zurück zum Zitat Mishima, M., Jimbo, M., Kageyama, S.: Constructions for a certain type of balanced bipartite block designs. J. Stat. Plan. Inference 95(1–2), 257–268 (2001)MathSciNetCrossRef Mishima, M., Jimbo, M., Kageyama, S.: Constructions for a certain type of balanced bipartite block designs. J. Stat. Plan. Inference 95(1–2), 257–268 (2001)MathSciNetCrossRef
8.
Zurück zum Zitat Ozawa, K., Kuriki, S., Yumiba, H., Jimbo, M.: Balanced and semi-balanced incomplete split-block designs. Congr. Numer. 145, 193–201 (2000)MathSciNetMATH Ozawa, K., Kuriki, S., Yumiba, H., Jimbo, M.: Balanced and semi-balanced incomplete split-block designs. Congr. Numer. 145, 193–201 (2000)MathSciNetMATH
9.
Zurück zum Zitat Ozawa, K., Jimbo, M., Kageyama, S., Mejza, S.: Optimality and constructions of incomplete split-block designs. J. Stat. Plan. Inference 106(1–2), 135–157 (2002)MathSciNetCrossRef Ozawa, K., Jimbo, M., Kageyama, S., Mejza, S.: Optimality and constructions of incomplete split-block designs. J. Stat. Plan. Inference 106(1–2), 135–157 (2002)MathSciNetCrossRef
10.
Zurück zum Zitat Srivastava, N., Hinton, G., Krizhevsky, A., Sutskever, I., Salakhutdinov, R.: Dropout: a simple way to prevent neural networks from overfitting. J. Mach. Learn. Res. 15(1), 1929–1958 (2014)MathSciNetMATH Srivastava, N., Hinton, G., Krizhevsky, A., Sutskever, I., Salakhutdinov, R.: Dropout: a simple way to prevent neural networks from overfitting. J. Mach. Learn. Res. 15(1), 1929–1958 (2014)MathSciNetMATH
Metadaten
Titel
A construction for circulant type dropout designs
verfasst von
Shoko Chisaki
Ryoh Fuji-Hara
Nobuko Miyamoto
Publikationsdatum
29.05.2021
Verlag
Springer US
Erschienen in
Designs, Codes and Cryptography / Ausgabe 8/2021
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-021-00890-8

Weitere Artikel der Ausgabe 8/2021

Designs, Codes and Cryptography 8/2021 Zur Ausgabe

Premium Partner