feat(optimizer): Add complexity-based early cutting in atomic pattern optimization #1206
Conversation
|
Thank you for your pull request. We require contributors to sign our Contributor License Agreement / Terms and Conditions, and we don't seem to have the users @DeVikingMark on file. In order for us to review and merge your code, please sign:
If you already signed one of this document, just wait to be added to the bot config. |
There was a problem hiding this comment.
Hello @DeVikingMark, thank you for the contribution, where is define the estimate_min_complexity, have you missed to add ?
|
Thank you for your pull request. We require contributors to sign our Contributor License Agreement / Terms and Conditions, and we don't seem to have the users @DeVikingMark on file. In order for us to review and merge your code, please sign:
If you already signed one of this document, just wait to be added to the bot config. |
@BourgerieQuentin fixed, hope now it's good |
|
@DeVikingMark can you sign the cla 🙏 |
|
@cla-bot check |
|
The cla-bot has been summoned, and re-checked this pull request! |
3 participants
Add an early cutting mechanism in the atomic pattern optimizer that checks if the minimum possible complexity for given parameters is higher than the current best solution. This optimization helps reduce the search space and improve performance by skipping configurations that cannot lead to better solutions.