| Crates.io | haru_cmaes |
| lib.rs | haru_cmaes |
| version | 1.0.9 |
| created_at | 2024-07-26 06:54:48.993114+00 |
| updated_at | 2025-02-03 05:32:23.274678+00 |
| description | A simple CMA-ES optimization algorithm implementation based on Hansen's purecma Python implementation. |
| homepage | |
| repository | https://github.com/maulberto3/haru_cmaes |
| max_upload_size | |
| id | 1315871 |
| size | 898,168 |
This is my own Rust implementation of the CMA-ES optimization algorithm based in Hansen's purecma python implementation.
Now that I have migrated this crate to nalgebra matrix crate, current roadmap is to refactor all code for maximum performance.
Also, I plan to provide some interface utilities for users and provide more examples on how to use this tool.
Please see: - ask_tell_use.rs for a detailed and flexible use, - express_use.rs for a quick run with default configurations, - fold_use.rs to run for a specific number of generations. - To run other fitness examples, please see objectives.rs and adjust accordingly i.e. commented out code
Although, I have conditionally configured-coded this tool to make use of openblas, netlib, accelerate and/or intel-mkl backends, I have noit yet tested them.
You can contribute any way you like.
Current suggestions: - Test backends functionality - More documentation - Bugs - Any other thing you'd like to contribute