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

Contrastive learning implementation in unsupervised_Cora_Citeseer #35

Closed
vpozdnyakov opened this issue Oct 11, 2021 · 3 comments
Closed

Comments

@vpozdnyakov
Copy link

vpozdnyakov commented Oct 11, 2021

Hello, I have read the paper "Graph Contrastive Learning with Augmentations" with the appendix, but implementation of contrastive learning in unsupervised_Cora_Citeseer looks a bit unclear for me. Could you please clarify a few details?

  1. What is the discriminator with a bilinear layer in unsupervised_Cora_Citeseer/layers/discriminator.py? What is its purpose?
  2. Why do you use cross entropy instead of contrastive loss in unsupervised_Cora_Citeseer/execute.py? Is it still called contrastive learning?
@yyou1996
Copy link
Collaborator

Hi @vpozdnyakov,

Thanks for your questions. @yongduosui please give some comments on it, thanks!

@yongduosui
Copy link
Collaborator

Please check paper DEEP GRAPH INFOMAX[1], this paper maximizing mutual information between patch representations and corresponding high-level summaries of graphs. We also add augmentation graphs information to maximizing mutual information, which is equal to optimize GraphCL loss. You can check and compare the theoretical proof in our paper Appendix section with the paper DEEP GRAPH INFOMAX[1] for more details.

[1] Petar Veliˇckovi´c, William Fedus, William L Hamilton, Pietro Liò, Yoshua Bengio, and R Devon Hjelm. Deep graph infomax. arXiv preprint arXiv:1809.10341, 2018.

@vpozdnyakov
Copy link
Author

@yongduosui thanks a lot for comment

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

3 participants