aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
-rw-r--r--lenet.py3
-rw-r--r--report/paper.md2
2 files changed, 3 insertions, 2 deletions
diff --git a/lenet.py b/lenet.py
index 5ed6705..97479ed 100644
--- a/lenet.py
+++ b/lenet.py
@@ -64,7 +64,8 @@ def get_lenet(shape):
model.add(Dense(units=120, activation='relu'))
model.add(Dense(units=84, activation='relu'))
- model.add(Dense(units=10, activation = 'softmax'))
+ #model.add(Dense(units=10, activation = 'softmax'))
+ model.add(Dense(units=10, activation = 'relu'))
return model
def plot_history(history, metric = None):
diff --git a/report/paper.md b/report/paper.md
index b4a2a63..0227b1e 100644
--- a/report/paper.md
+++ b/report/paper.md
@@ -10,7 +10,7 @@ $$ V (D,G) = E_{x~p_{data}(x)}[logD(x)] + E_{zp_z(z)}[log(1-D(G(z)))] $$
The issue with shallow architectures (**present the example we used for mode collapse**) can be ontain really fast training,
while producing overall good results.
-One of the main issues that raises from this kind of architectures is mode collapse. As the discriminator keeps getting
+One of the main issues enctoured with GAN architectures is mode collapse. As the discriminator keeps getting
better, the generator tries to focus on one single class label to improve its loss. This issue can be observed in figure
\ref{fig:mode_collapse}, in which we can observe how after 200 thousand iterations, the output of the generator only represents few
of the labels originally fed to train the network. At that point the loss function of the generator starts getting worse as shown in figure