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

About the meaning of learned features #17

Closed
Fujiaoji opened this issue Mar 9, 2021 · 2 comments
Closed

About the meaning of learned features #17

Fujiaoji opened this issue Mar 9, 2021 · 2 comments

Comments

@Fujiaoji
Copy link

Fujiaoji commented Mar 9, 2021

Hi, I was wondering that the learned representations tend to conserve their unique information or common information. Maximizing Mutual information between patch and summary vector is to find more information between them, but the discriminator wants to distinguish the samples. So, I am confused.

@PetarV-
Copy link
Owner

PetarV- commented Mar 9, 2021

Hi Fujiao,

Thanks for your issue!
I think the key part here is that the discriminator distinguishes patches in the original from ones in a corrupted graph.
Pushing those apart will have as a consequence (see the Theorems proven in our work) a likely maximisation of mutual information within the vertices of the original graph.

Hope that helps!

Thanks,
Petar

@Fujiaoji
Copy link
Author

Hi Fujiao,

Thanks for your issue!
I think the key part here is that the discriminator distinguishes patches in the original from ones in a corrupted graph.
Pushing those apart will have as a consequence (see the Theorems proven in our work) a likely maximisation of mutual information within the vertices of the original graph.

Hope that helps!

Thanks,
Petar

Thanks for your help! :)
Best regards,
Fujiao Ji

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

2 participants