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

Potential optimization of our model. #49

Open
yangtcai opened this issue Aug 7, 2022 · 3 comments
Open

Potential optimization of our model. #49

yangtcai opened this issue Aug 7, 2022 · 3 comments

Comments

@yangtcai
Copy link
Collaborator

yangtcai commented Aug 7, 2022

The paper DN-DETR presents a novel denoising training method to speed up DETR training, and they said that the bipartite graph matching algorithm we choose is unstable, and it may cause inconsistent optimization goals. So I think maybe we can adopt this idea into our model.

@williamstark01
Copy link
Collaborator

Is this model more or less complex than the original DETR?

@yangtcai
Copy link
Collaborator Author

That model is more complex than DETR, it optimizes the Hungarian match.

@williamstark01
Copy link
Collaborator

If you fully understand the algorithm they use and the math behind it and you think it might improve the performance of our network, it may be a good option to pursue.

That said, in my view anything that increases the complexity of the current model should be delayed until after we have a more robust training resulting to models with relatively good performance.

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