You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
When running the max cut scheduling algorithm on a model with a multi-head attention, with num_heads >= 3, the algorithm does not converge to a solution, even if increasing the number of search iteration limits up to 5,000, or increasing the heuristic search boundary.
Expected behaviour
The algorithm should find a max cut solution.
Code to reproduce the issue
Runthemaxcutalgorithmonamodelwithasinglemhalayer
Log output
No response
The text was updated successfully, but these errors were encountered:
Issue Type
Bug
Source
source
MCT Version
Nightly
OS Platform and Distribution
No response
Python version
No response
Describe the issue
When running the max cut scheduling algorithm on a model with a multi-head attention, with num_heads >= 3, the algorithm does not converge to a solution, even if increasing the number of search iteration limits up to 5,000, or increasing the heuristic search boundary.
Expected behaviour
The algorithm should find a max cut solution.
Code to reproduce the issue
Log output
No response
The text was updated successfully, but these errors were encountered: