-
Notifications
You must be signed in to change notification settings - Fork 37
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
Search in specified discrete combinatory space #6
Comments
Yep, that's the solution that I currently recommend as a quick fix, but it's clearly not ideal. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Is it possible to specify discrete valid values for each dimension of the parameter (of the cost function) such that only those values on the grid are evaluated? A special case would be optimizing a single integer variable. An extension is being able to specify some dimensions of the parameter to be discrete and specify the discrete space over which it takes values. Some problems are discrete in nature, but combinatorics kills any attempt to do greedy grid search due to the curse of dimensionality.
One possible solution would be to put a map inside the evaluated function (logL) s.t. it maps continuous space into discrete one(e.g. p(1)=round(p(1)). But this wastes function evaluations for no good reason, and would be horrible for slow function evaluations.
The text was updated successfully, but these errors were encountered: