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 ELAN #2092

Open
jacksonsc007 opened this issue Oct 27, 2024 · 0 comments
Open

Question about ELAN #2092

jacksonsc007 opened this issue Oct 27, 2024 · 0 comments

Comments

@jacksonsc007
Copy link

Thanks for sharing your code. I did not find the repo for ELAN so I pose my question here:

In the original paper and ELAN:

Therefore, when practicing networklevel gradient path design strategies, we need to consider the longest shortest gradient path length for all of layers in the network, and the longest gradient path for the overall network.

And yolov7:

ELAN [1] in Figure 2 (c) considers the following design strategy – “How to design an efficient network?.” They came out with a conclusion: By controlling the shortest longest gradient path, a deeper network can learn and converge effectively.

What is the meaning of "longest shortest gradient path"?
@WongKinYiu

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