-
Notifications
You must be signed in to change notification settings - Fork 0
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
The latent representation of compiler phase order #5
Comments
We used a random representation (e.g., projecting the state space using a random MLP network). It is very similar to the maze environment except changing the CNN network into a MLP one. |
Thanks for your reply. Several other questions: Did you use a pretrained network, or just use the collected label during search to train the MLP network? Is the network an auto-encoder and you use a decoder to obtain the candidate? if so, how do you train it? For example, jointly training a predictor and auto-encoder-decoder? |
No, we don't pretrain/train the network. We use a random network for projecting. So pretty much a randomly initialized MLP could work. We use this for classification but not for sampling. You can achieve this by setting "--latent=True" and "--latent_sample=False". |
Hi, I think I still have a new question, i.e., what is the state space for compiler phase order problem? Is it the action sequence or the binary file? |
Hi, thank you for your good work.
Can I know how do you learn the latent representation of compiler phase order task? That is not mentioned in the paper.
The text was updated successfully, but these errors were encountered: