Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

D Loss Interpretation #13

Open
ghost opened this issue Dec 5, 2017 · 0 comments
Open

D Loss Interpretation #13

ghost opened this issue Dec 5, 2017 · 0 comments

Comments

@ghost
Copy link

ghost commented Dec 5, 2017

Thank you for sharing the code.

Say if,
D should maximise D(f)-D(r) , => minimising D(r)- D(f)
and G should minimise D(f)-D(r) => minimising D(f).

And your code also follows the same logic. But I'm unable to comprehend from D loss curve, why is the loss increasing from ( -15 to around zero). Shouldn't the curve go down as iterations happen, since we are minimising the loss( D(r)-D(f)?

Please share your thoughts

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

0 participants