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.

Sign up for GitHub

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

Jump to bottom

DiscoGAN paper said that they don't need paired data unlike Conditional GAN. but... #14

Open
timothy-jhang opened this issue Jul 3, 2018 · 0 comments
Open

DiscoGAN paper said that they don't need paired data unlike Conditional GAN. but... #14

timothy-jhang opened this issue Jul 3, 2018 · 0 comments

Comments

@timothy-jhang
Copy link

timothy-jhang commented Jul 3, 2018 •
edited
Loading

DiscoGAN paper they assert that
"to avoid costly pairing, we address
the task of discovering cross-domain relations
given unpaired data"
But, I don't know why this implementation of DiscoGAN requires paired data?
(as far as I know/see, in the dataset downloaded )
Or, is it just to simplify the input process?
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@timothy-jhang