Join GitHub today
GitHub is home to over 50 million developers working together to host and review code, manage projects, and build software together.
Sign upSuggestion for Faster way to optimize vs GridSearch #69
Comments
|
Thanks for the kind words.
Sounds useful. We should certainly look into using that package as a library: https://github.com/fmfn/BayesianOptimization#1-specifying-the-function-to-be-optimized In most cases probably even something as simple as random grid search should work much faster, while still giving sufficient ballpark results: backtesting.py/backtesting/backtesting.py Lines 816 to 823 in 7010d68 |
|
I would suggest using |
|
We could use skopt as our constraints do match. |
|
Sure, if nothing comes up I'll work on this in the next few days. I'll also look into |
|
Exactly. For random search I also envisioned an argument: |
Think you can just return the raw We should, however, look into adopting the lower-triangular subplot layout for the |
|
Yes, plotting the optimization results in a jupyter notebook is straightforward with I quickly looked at the heatmap plots from backtesting.lib.plot_heatmaps() and they are not as nice and clear with contour lines and test points etc. |
I don't fully understand why we'd want it to integrate it with Bokeh.
They are not. It's just an unrelated note-to-self proposal that we lay them out sorted in a more immediately clear lower-triangular instead of the simple grid layout. |
|
this should be on the top priority! big win if we have this feature! |



Hey,
First of all thank you for the hard work put into this, it's a really awesome project that I still learn how to use.
I'm not that proficient in using python so that is why I'll put my suggestion here. I have used python more for machine learning stuff and there the option of searching hyperparameters was also between grid and random search. However, I found that using bayesian optimization, code runs way faster because it add probabilities to the mix by building a surrogate probability model of the objective function. That being said, you can have a look maybe over this to find out more here
My guess is that this can be applied to your maximize_func in some way and computations should, in theory, run faster.
I'll spend the next few days trying and playing around with this and if I come up with something, I'll let you know.
Keep it up!