Update README.md

README.md

@@ -6,7 +6,7 @@ Code accompanying the paper ["Wasserstein GAN"](https://arxiv.org/abs/1701.07875
 ##A few notes
 
 - The first time running a dataset it can take a long time (up to an hour) to create the dataloader. After the first run a small cache file will be created and the process should take a matter of seconds.
-- The only addition to the code (that we forgot, and will add, on the paper) are the [lines 169-172 of main.py](https://github.com/martinarjovsky/WassersteinGAN/blob/master/main.py#L169-L172). These lines act only on the first 25 generator iterations or very sporadically (once every 500 generator iterations). In such a case, they set the number of iterations on the critic to 100 instead of the default 5. This helps to start with the critic at optimum even in the first iterations. There shouldn't be a major difference in performance, but it can help, especially when visualizing learning curves (since otherwise you'd see the loss going up until the critic is properly trained). This is also why the first 25 iterations take significantly longer than the rest of the training as well.
+- The only addition to the code (that we forgot, and will add, on the paper) are the [lines 169-172 of main.py](https://github.com/martinarjovsky/WassersteinGAN/blob/master/main.py#L166-L169). These lines act only on the first 25 generator iterations or very sporadically (once every 500 generator iterations). In such a case, they set the number of iterations on the critic to 100 instead of the default 5. This helps to start with the critic at optimum even in the first iterations. There shouldn't be a major difference in performance, but it can help, especially when visualizing learning curves (since otherwise you'd see the loss going up until the critic is properly trained). This is also why the first 25 iterations take significantly longer than the rest of the training as well.
 
 ##Prerequisites