Skip to content
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.

Sign up for GitHub

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

Jump to bottom

estimate_sparsity #116

Open
Yawgmoth90 opened this issue May 30, 2017 · 1 comment
Open

estimate_sparsity #116

Yawgmoth90 opened this issue May 30, 2017 · 1 comment
Labels
enhancement help wanted

Comments

@Yawgmoth90
Copy link
Contributor

The function estimate_sparsity currently computes the fitness by changing each component of the decision vector x by the same amount (default 1e-8). This causes issues for problems that are not scaled in a proper way.

A possible fix would be to pass instead the lower and upper bounds of x as arguments, in addition to a number N: the function could compute a random x within the bounds, then for every component of x change it N times (one by one) within the respective bounds, and check if the fitness components are constant in all of the N points obtained.
@darioizzo
Copy link
Member

Indeed the current implementation fails miserably on unscaled problems. The proposed solution would definitely fix this. When #110 and #115 are merged a PR would be welcomed.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement help wanted
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
3 participants
@bluescarni @darioizzo @Yawgmoth90