a4f66628fd
* initial commit * run parametrized algorithm with command line parameters * skeleton: top level structure * OptimizationNodePacket scheme * pass parameters as HashSet * run Lean and read results * call method on optimization completion * refactor public interfaces - close ParameterSet collection; allow only get operations - explicit method to start LeanOptimizer * synchronize RunLean method; the result could come in before the backtest id is set in the collections * another portion of refactoring and interface changes * comments * comments & tests for Extremum, Minimization and Maximization classes * unify optimization paramater values (min, max, step) & mode GridSearch tests - swap min&max if necessary - iterate left => right (negate step value if necessary) & provide default step value if step == 0 - no StackOverflow Exception - parameterSet Id should be global for current generator and retain between steps - test signle point boundary (min == max) * BruteForceStrategy tests * more comments * Update Optimizer assembly information - Update Optimizer projects assembly information to match behavior of the other projects * Tweaks - Adding comments - Replace OnComplete for Ended event - Replace Abort for Dispose - ConsoleLeanOptimizer will keep track of running processes - Each backtest will store results in a separated directory, so they don't fight for the log.txt file. - Adding cmdline option for lean to close automatically - Adding concurrent execution backtest limit - Console optimizer will start Lean minimized - Escape spaces in Json path * remove parameter set generator abstraction layer we don't need this flexibility now. * refactor public methods; Step shouldn't be public * constraints: wip * define contract * comparison operators and tests * specify JsonProperty values * Move SafeMultiply100 to extensions * Throw exception on failed Optimizer.Start * constraints: wip * change finish & dispose process * minor fixes - handle force lean abort - notify consumer if target has been reached * target & constraints; adapt unit tests * Minor Tweaks and fixes - Some logging improvements - Remove Public since not required * Ignore empty ParameterValue * simplify condition * avoid reinitialization * reduce type; force immutable * unit tests for constraints and target value * parse & normalize percent values, i.e. 20% => 0.2 * fixup * Target & Constraint & OptimizationNodePacket unit tests * Add more json unit tests - Adding more json conversion unit tests. Fix bug for Extremum which wasn't using the converter. * LeanOptimizer tests * Estimation results * User thread safe counters * LeanOptimizer unit tests; push OptimizationResult on Ended event * more unit tests * Minor tweaks -Estimate ToString in a single line. -Typos and missing header file * Add base SendUpdate method - Add base SendUpdate method for LeanOptimizer * fix LeanOptimizer test; rely on internal Update rather than timer * Add OptimizationStatus - Add missing commments and OptimizationStatus * EulerSearch implementation: wip * OptimizationParameter custom converter * change the type * make step optional * change folder structure * enumerate optimization parameter using IEnumerable & IEnumerator * unit tests: parameters & objectives * unit tests: strategies * remove redundant TODO * change Euler search boundaries * more Euler tests * prevent race condition * Add account/read endpoint - Adding account/read endpoint. Adding unit test * Add status check before running lean * Minor self review - Adding missing comments, minor changes * remove array parameters * minor changes - tidy up config file, rename variable - accept min less or equal than max * move OptimizationParameter methods to strategies * Minor improvements for BaseResultHandler derivates * minor changes - strict requirements for Step and MinStep values - strategy specific settigs * Add TotalRuntime to estimate Co-authored-by: Martin Molinero <martin.molinero1@gmail.com>
143 lines
6.4 KiB
C#
143 lines
6.4 KiB
C#
/*
|
|
* QUANTCONNECT.COM - Democratizing Finance, Empowering Individuals.
|
|
* Lean Algorithmic Trading Engine v2.0. Copyright 2014 QuantConnect Corporation.
|
|
*
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
* you may not use this file except in compliance with the License.
|
|
* You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0
|
|
*
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
* See the License for the specific language governing permissions and
|
|
* limitations under the License.
|
|
*/
|
|
|
|
using System;
|
|
using System.Collections.Generic;
|
|
using System.Linq;
|
|
using QuantConnect.Optimizer.Objectives;
|
|
using QuantConnect.Optimizer.Parameters;
|
|
|
|
namespace QuantConnect.Optimizer.Strategies
|
|
{
|
|
/// <summary>
|
|
/// Advanced brute-force strategy with search in-depth for best solution on previous step
|
|
/// </summary>
|
|
public class EulerSearchOptimizationStrategy : StepBaseOptimizationStrategy
|
|
{
|
|
private object _locker = new object();
|
|
private readonly HashSet<ParameterSet> _runningParameterSet = new HashSet<ParameterSet>();
|
|
private int _segmentsAmount = 4;
|
|
|
|
/// <summary>
|
|
/// Initializes the strategy using generator, extremum settings and optimization parameters
|
|
/// </summary>
|
|
/// <param name="target">The optimization target</param>
|
|
/// <param name="constraints">The optimization constraints to apply on backtest results</param>
|
|
/// <param name="parameters">Optimization parameters</param>
|
|
/// <param name="settings">Optimization strategy settings</param>
|
|
public override void Initialize(Target target, IReadOnlyList<Constraint> constraints, HashSet<OptimizationParameter> parameters, OptimizationStrategySettings settings)
|
|
{
|
|
var stepSettings = settings as StepBaseOptimizationStrategySettings;
|
|
if (stepSettings == null)
|
|
{
|
|
throw new ArgumentNullException(nameof(settings),
|
|
"EulerSearchOptimizationStrategy.Initialize: Optimizations Strategy settings are required for this strategy");
|
|
}
|
|
|
|
if (stepSettings.DefaultSegmentAmount != 0)
|
|
{
|
|
_segmentsAmount = stepSettings.DefaultSegmentAmount;
|
|
}
|
|
|
|
base.Initialize(target, constraints, parameters, settings);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Checks whether new lean compute job better than previous and run new iteration if necessary.
|
|
/// </summary>
|
|
/// <param name="result">Lean compute job result and corresponding parameter set</param>
|
|
public override void PushNewResults(OptimizationResult result)
|
|
{
|
|
if (!Initialized)
|
|
{
|
|
throw new InvalidOperationException($"EulerSearchOptimizationStrategy.PushNewResults: strategy has not been initialized yet.");
|
|
}
|
|
|
|
lock (_locker)
|
|
{
|
|
if (!ReferenceEquals(result, OptimizationResult.Initial) && string.IsNullOrEmpty(result?.JsonBacktestResult))
|
|
{
|
|
// one of the requested backtests failed
|
|
_runningParameterSet.Remove(result.ParameterSet);
|
|
return;
|
|
}
|
|
|
|
// check if the incoming result is not the initial seed
|
|
if (result.Id > 0)
|
|
{
|
|
_runningParameterSet.Remove(result.ParameterSet);
|
|
ProcessNewResult(result);
|
|
}
|
|
|
|
if (_runningParameterSet.Count > 0)
|
|
{
|
|
// we wait till all backtest end during each euler step
|
|
return;
|
|
}
|
|
|
|
// Once all running backtests have ended, for the current collection of optimization parameters, for each parameter we determine if
|
|
// we can create a new smaller/finer optimization scope
|
|
if (Target.Current.HasValue && OptimizationParameters.OfType<OptimizationStepParameter>().Any(s => s.Step > s.MinStep))
|
|
{
|
|
var boundaries = new HashSet<OptimizationParameter>();
|
|
var parameterSet = Solution.ParameterSet;
|
|
foreach (var optimizationParameter in OptimizationParameters)
|
|
{
|
|
var optimizationStepParameter = optimizationParameter as OptimizationStepParameter;
|
|
if (optimizationStepParameter != null && optimizationStepParameter.Step > optimizationStepParameter.MinStep)
|
|
{
|
|
var newStep = Math.Max(optimizationStepParameter.MinStep.Value, optimizationStepParameter.Step.Value / _segmentsAmount);
|
|
var fractal = newStep * ((decimal)_segmentsAmount / 2);
|
|
var parameter = parameterSet.Value.First(s => s.Key == optimizationParameter.Name);
|
|
boundaries.Add(new OptimizationStepParameter(
|
|
optimizationParameter.Name,
|
|
Math.Max(optimizationStepParameter.MinValue, parameter.Value.ToDecimal() - fractal),
|
|
Math.Min(optimizationStepParameter.MaxValue, parameter.Value.ToDecimal() + fractal),
|
|
newStep,
|
|
optimizationStepParameter.MinStep.Value));
|
|
}
|
|
else
|
|
{
|
|
boundaries.Add(optimizationParameter);
|
|
}
|
|
}
|
|
|
|
OptimizationParameters = boundaries;
|
|
}
|
|
else if (!ReferenceEquals(result, OptimizationResult.Initial))
|
|
{
|
|
// we ended!
|
|
return;
|
|
}
|
|
|
|
foreach (var parameterSet in Step(OptimizationParameters))
|
|
{
|
|
OnNewParameterSet(parameterSet);
|
|
}
|
|
}
|
|
}
|
|
|
|
/// <summary>
|
|
/// Handles new parameter set
|
|
/// </summary>
|
|
/// <param name="parameterSet">New parameter set</param>
|
|
protected override void OnNewParameterSet(ParameterSet parameterSet)
|
|
{
|
|
_runningParameterSet.Add(parameterSet);
|
|
base.OnNewParameterSet(parameterSet);
|
|
}
|
|
}
|
|
}
|