-
Notifications
You must be signed in to change notification settings - Fork 63
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
Expected an unbounded problem, but this problem has lower and/or upper bounds. #114
Comments
Hello turian, Thank you for your question, and for trying out EvoTorch! These algorithms support bounded problems:
Distribution-based search algorithm implementations of EvoTorch such as PGPE and CMAES do not support strictly bounded problems. Still, you could define I think such an augmented problem definition could look like this (I hope it works and/or helps, feel free to let me know):
EvoTorch also introduced helper functions for detecting the amount of violations for constraints, and for penalizing them (using exponential penalization or using log barriers), but they have not been included in a release yet: https://github.com/nnaisense/evotorch/blob/master/src/evotorch/tools/constraints.py. Feel free to let us know if you have further questions, or if something is not clear. |
I have a bounded problem, I tried both PGPE and CMAES but I get the error:
Is there any solver for bounded problems?
The text was updated successfully, but these errors were encountered: