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

Question about sparse resnet #13

Open
leoozy opened this issue Jan 6, 2020 · 1 comment
Open

Question about sparse resnet #13

leoozy opened this issue Jan 6, 2020 · 1 comment

Comments

@leoozy
Copy link

leoozy commented Jan 6, 2020

Hello:
Thank you for your job. I am interested in your sparse resnet. I am not quite sure how do you implement it. Or you just replace the "concat" operations with "add"?

@Spinkoo
Copy link

Spinkoo commented Feb 14, 2023

I do indeed share the same question, Like since the shortest path of the gradient is O(1) in a resnet due to the sum of all the previous feature maps (kind of implicitly), how exactly is the path then extended using sparsenet ?

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