Iteration with Single-Step Progression to Improve Flexibility and Adaptability in Algorithmic Strategies #1111
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
It is possible to split the run() function into two distinct functions, allowing for a single-step iteration on the ticks:
In which scenario do you want to use a next() function instead of a run()?
Using a next() function allows passing any kwargs to the Strategy.next() function. This flexibility enables processing additional information outside the strategy class and injecting it as needed.
However the run function is preserved in order to have the back-compatibility.
For example, one can utilize backtesting.py as an engine to train a reinforcement learning model, requiring an observation and an action at each step.
I've included a test/_iteration.py with a custom TestStrategy that works with both run and iteration, demonstrating how you can inject any parameters into the next function.
Here an example how I use the single step iteration in order to training an Env with gym and stable-baseline3 library:
https://gist.github.com/IperGiove/325832e30df44639ec78a618b84daf3c