-
Notifications
You must be signed in to change notification settings - Fork 11
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 min-max modeling. #3
Comments
Hi @cjfcsjt, Sorry for the late reply. In paper we did solve it by a naive bi-level optimization if referring to section 3.2. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
The research work is exciting! I noticed that you formulate the automated graph contrastive learning as the min-max optimization problem. May I ask that why not use the bi-level optimization where the upper level objective is to search the augmentation operations and the lower level objective is to optimize the contrastive loss (like existing one-shot neural architecture search methods)?
The text was updated successfully, but these errors were encountered: