jono/PolySolve
1
1
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

feat(ga, api): Implement advanced GA strategy and refactor API for v0.4.0 #16

Merged
jono merged 3 commits from v0.4.0-dev into main 2025-10-27 14:20:56 +00:00
Conversation 0 Commits 3 Files Changed 4
+237 -107
3 Commits
Author SHA1 Message Date
jono 663e72eabf fix(ga): Prevent premature convergence by widening parent pool
Run Python Tests / test (3.10) (pull_request) Successful in 11s
Details
Run Python Tests / test (3.12) (pull_request) Successful in 14s
Details
Run Python Tests / test (3.8) (pull_request) Successful in 10s
Details 
The GA tests were failing because the algorithm converged on a single root (e.g., -1.0) and failed to find the other (e.g., 2.5).

This was caused by creating a 'parent pool' from only the top 50% of solutions. This was too aggressive and discarded the 'niche' solutions that were exploring other valid roots.

This commit modifies the parent selection logic in both `_solve_x_numpy` and `_solve_x_cuda`. Parents for crossover and mutation are now selected from the *entire* sorted population (`data_size`).

This maintains population diversity and allows the algorithm to explore multiple optima, fixing the failing tests.
 2025-10-27 10:20:08 -04:00
jono 415e2a3ef5 fix: Remove quadratic_solve import from test
Run Python Tests / test (3.10) (pull_request) Successful in 15s
Details
Run Python Tests / test (3.12) (pull_request) Failing after 15s
Details
Run Python Tests / test (3.8) (pull_request) Failing after 3m8s
Details
2025-10-27 10:14:58 -04:00
jono 34019a67b0 feat(ga, api): Implement advanced GA strategy and refactor API for v0.4.0
Run Python Tests / test (3.10) (pull_request) Failing after 16s
Details
Run Python Tests / test (3.8) (pull_request) Failing after 41s
Details
Run Python Tests / test (3.12) (pull_request) Has been cancelled
Details 
This commit introduces a major enhancement to the genetic algorithm's convergence logic and refactors key parts of the API for better clarity and usability.

- **feat(ga):** Re-implements the GA solver (CPU & CUDA) to use a more robust strategy based on Elitism, Crossover, and Mutation. This replaces the previous, less efficient model and is designed to significantly improve accuracy and convergence speed.

- **feat(api):** Updates `GA_Options` to expose the new GA strategy parameters:
    - Renames `mutation_percentage` to `mutation_strength` for clarity.
    - Adds `elite_ratio`, `crossover_ratio`, and `mutation_ratio`.
    - Includes a `__post_init__` validator to ensure ratios are valid.

- **refactor(api):** Moves `quadratic_solve` from a standalone function to a method of the `Function` class (`f1.quadratic_solve()`). This provides a cleaner, more object-oriented API.

- **docs:** Updates the README, `GA_Options` doc page, and `quadratic_solve` doc page to reflect all API changes, new parameters, and updated usage examples.

- **chore:** Bumps version to 0.4.0.
 2025-10-27 10:12:45 -04:00