• 検索結果がありません。

Deep Learning Using Dropout by Intermittency Chaos

N/A
N/A
Protected

Academic year: 2021

シェア "Deep Learning Using Dropout by Intermittency Chaos"

Copied!
1
0
0

読み込み中.... (全文を見る)

全文

(1)

Deep Learning Using Dropout by Intermittency Chaos

Ryuta YOSHIMURA1 Shinsaburo KITTAKA1 Yoko UWATE1 Yoshifumi NISHIO1 (1 Tokushima University)

1. Introduction

A team who using the new machine learning method of the deep learning won the championship at competition of the image recognition in 2012. It is said that the main factor is a technique that is called dropout. We focus on technique in dropout and propose a new system. Because the neural network is too strong in expression and occurs overfitting.

The dropout is used to suppress overfitting. The propability of dropout is detarmined by random function. We propose the technique using the chaos function instead of random function. Furthermore, we investigate error rate of neural network which has 4 and 10 hidden nodes.

2. Proposed system

Proposed system that is used in this study is shown in Fig. 1. When a node transmits information to the next layer, the network ignores a node for preventing the net- work from transmiting information with any probability in dropout. The propability of dropout depends on the ran- dom function in the conventional method. The proposed system uses a logistic map for chaos function to decide the probability instead of random function. Parameteramakes the logistic map constant value, periodic vibration or ape- riodic complicated behavior that is called the chaos. We determine that the parametera is 3.828327. We call the part which shifts from the periodic orbit to the chaos or- bit intermittency chaos. We show intermittency chaos in Fig. 2.

f(xn) = axn(1−xn) (1)

Figure 1: Dropout.

Figure 2: Logistic map (a= 3.828327).

3. Simulation results

We show error rate in Fig. 3. The plot of the lozenge shows error rate that is used chaos function. The plot of the square shows error rate that is used random function. When the probability rises, the error rate rises. When we see Fig. 3 partially, error rate with chaos function is smaller than it with random function at the time of 33.3% and 66.6%. Ta- ble 1 shows the comparison between random function and chaos function at the time of 33.3% and 66.6%.

We show error rate with each number of hidden node in Figs. 3 and 4. The difference value with 4 hidden node between random function and chaos function is bigger than it with 10 hidden node.

Table 1: An error rate at the time of 33.3% and 66.6% with 4 hidden nodes.

probability(%) random chaos

33.3 0.0854 0.0839

66.6 0.1052 0.1047

Figure 3: A error rate of each function with 4 hidden nodes.

Figure 4: A error rate of each function with 10 hidden nodes.

4. Conclusions

The propability of dropout is detarmined by random function in conventional method. In this study, we use chaos function instead of random function. We use logistic map for a chaos function in this time. And the parameter assumes ita= 3.828327. Error rate with chaos function is smaller than it with random function at the time of 33.3%

and 66.6%.

平成28年度電気関係学会四国支部連合大会 講演論文集(2016徳島大学) 2016 SHIKOKU-SECTION JOINT CONVENTION RECORD OF THE INSTITUTES OF ELECTRICAL AND RELATED ENGINEERS (TOKUSHIMA)

1-24

24

Figure 1: Dropout.

参照

関連したドキュメント

Taking a partially penetrating well as a uniform line sink in three dimensional space, by the orthogonal decomposition of Dirac function and using Green’s function to

Most papers on economic growth considering the Solow-Swan or neoclassical model used the Cobb-Douglas specification of the production function, which describes a process with a

Zaslavski, Generic existence of solutions of minimization problems with an increas- ing cost function, to appear in Nonlinear

In [10, 12], it was established the generic existence of solutions of problem (1.2) for certain classes of increasing lower semicontinuous functions f.. Note that the

(A precise definition is given in Section 3.) In particular, we show that Z is equal in distribution to a Brownian motion running on an independent random clock for which

– proper & smooth base change ← not the “point” of the proof – each commutative diagram → Ð ÐÐÐ... In some sense, the “point” of the proof was to establish the

Guo, “A class of logarithmically completely monotonic functions and the best bounds in the second Kershaw’s double inequality,” Journal of Computational and Applied Mathematics,

On the other hand, modeling nonlinear dynamics and chaos, with its origins in physics and applied mathematics, usually concerned with autonomous systems, very often