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

The performance of this code #2

Open
DavidLee-4032 opened this issue Jun 17, 2019 · 0 comments
Open

The performance of this code #2

DavidLee-4032 opened this issue Jun 17, 2019 · 0 comments

Comments

@DavidLee-4032
Copy link

Hello, Louis.
Thanks for providing the code of pytorch version.
I've run the code and try to estimate the performance. I used 40000 graphs(all graphs are finished) and run for 5 epochs. (to speed up the procedure, I changed the method of adjacent matrix), and using 1000 graphs for test.
However, this code only have a performance of about 1.5 (in regards to the worst case) and an average performance of about 1.15 , lower than the ones in the origin code (worst case ~1.1 and avg. case ~1.001). I tried many approaches to improve but failed. Would you like to analyze the reasons? Thanks.

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

1 participant