Changeset 13496 for branches/HeuristicLab.EvolutionTracking/HeuristicLab.Problems.DataAnalysis.Symbolic/3.4/Tracking/SchemaDiversification/SchemaCreator.cs

Timestamp:

01/11/16 21:29:25 (9 years ago)

Author:

bburlacu

Message:

#1772: Update diversification operators (add extra evaluations to the evaluation counter, add the option for strict schema matching, add additional replacement ratio update rules.

File:

• branches/HeuristicLab.EvolutionTracking/HeuristicLab.Problems.DataAnalysis.Symbolic/3.4/Tracking/SchemaDiversification/SchemaCreator.cs (modified) (12 diffs)

branches/HeuristicLab.EvolutionTracking/HeuristicLab.Problems.DataAnalysis.Symbolic/3.4/Tracking/SchemaDiversification/SchemaCreator.cs

@@ -51 +51 @@
     private const string UseAdaptiveReplacementRatioParameterName = "UseAdaptiveReplacementRatio";
     private const string ReplacementRatioUpdateRuleParameterName = "ReplacementRatioUpdateRule";
+    private const string StrictSchemaMatchingParameterName = "StrictSchemaMatching";
     #endregion
 
@@ -60 +61 @@
     public IFixedValueParameter<BoolValue> UseAdaptiveReplacementRatioParameter {
       get { return (IFixedValueParameter<BoolValue>)Parameters[UseAdaptiveReplacementRatioParameterName]; }
+    }
+    public IFixedValueParameter<BoolValue> StrictSchemaMatchingParameter {
+      get { return (IFixedValueParameter<BoolValue>)Parameters[StrictSchemaMatchingParameterName]; }
     }
     public IFixedValueParameter<BoolValue> ExclusiveMatchingParameter {
@@ -104 +108 @@
     public bool ExecuteInParallel { get { return ExecuteInParallelParameter.Value.Value; } }
     public double PercentageOfPopulation { get { return PercentageOfPopulationParameter.Value.Value; } }
+    public bool StrictSchemaMatching { get { return StrictSchemaMatchingParameter.Value.Value; } }
     #endregion
 
     private UpdateEstimatedValuesOperator updateEstimatedValuesOperator;
     private DiversificationStatisticsOperator diversificationStatisticsOperator;
+
+    public override void ClearState() {
+      NumberOfChangedTreesParameter.Value.Value = 0;
+      NumberOfChangedTreesParameter.Value.Value = 0;
+      AverageSchemaLengthParameter.Value.Value = 0;
+      base.ClearState();
+    }
 
     public SchemaCreator() {
@@ -121 +133 @@
       Parameters.Add(new FixedValueParameter<BoolValue>(ScaleEstimatedValuesParameterName, new BoolValue(true)));
       Parameters.Add(new FixedValueParameter<BoolValue>(ExclusiveMatchingParameterName, new BoolValue(false)));
+      Parameters.Add(new FixedValueParameter<BoolValue>(StrictSchemaMatchingParameterName, new BoolValue(false)));
       Parameters.Add(new ValueParameter<IntValue>(NumberOfChangedTreesParameterName, new IntValue(0)));
       Parameters.Add(new ValueParameter<IntValue>(NumberOfSchemasParameterName, new IntValue(0)));
@@ -126 +139 @@
       Parameters.Add(new FixedValueParameter<BoolValue>(UseAdaptiveReplacementRatioParameterName, new BoolValue(true)));
 
-      var replacementRatioUpdateRules = new ItemSet<StringValue>(new[] { new StringValue("f(x) = x"), new StringValue("f(x) = tanh(x)"), new StringValue("f(x) = tanh(2x)"), new StringValue("f(x) = tanh(3x)") });
+      var replacementRatioUpdateRules = new ItemSet<StringValue>(new[] {
+        new StringValue("f(x) = x"),
+        new StringValue("f(x) = tanh(x)"),
+        new StringValue("f(x) = tanh(2x)"),
+        new StringValue("f(x) = tanh(3x)"),
+        new StringValue("f(x) = tanh(4x)"),
+        new StringValue("f(x) = 1-sqrt(1-x)")
+      });
       Parameters.Add(new ConstrainedValueParameter<StringValue>(ReplacementRatioUpdateRuleParameterName, replacementRatioUpdateRules));
       #endregion
@@ -146 +166 @@
     protected SchemaCreator(bool deserializing) : base(deserializing) { }
 
+
+    [StorableHook(HookType.AfterDeserialization)]
+    private void AfterDeserialization() {
+      if (!Parameters.ContainsKey(StrictSchemaMatchingParameterName))
+        Parameters.Add(new FixedValueParameter<BoolValue>(StrictSchemaMatchingParameterName, new BoolValue(false)));
+    }
+
     public override IOperation Apply() {
       // apply only when at least one generation has passed
@@ -153 +180 @@
 
       var n = (int)Math.Round(ExecutionContext.Scope.SubScopes.Count * PercentageOfPopulation);
-      var scopes = new ScopeList(ExecutionContext.Scope.SubScopes.Take(n));
 
       var updateEstimatedValues = new OperationCollection { Parallel = true };
@@ -159 +185 @@
         updateEstimatedValuesOperator = new UpdateEstimatedValuesOperator();
 
-      foreach (var s in scopes) {
-        if (!s.Variables.ContainsKey("EstimatedValues"))
-          s.Variables.Add(new Core.Variable("EstimatedValues"));
+      foreach (var s in ExecutionContext.Scope.SubScopes.Where(s => !s.Variables.ContainsKey("EstimatedValues"))) {
         updateEstimatedValues.Add(ExecutionContext.CreateChildOperation(updateEstimatedValuesOperator, s));
       }
@@ -185 +209 @@
             break;
           }
+        case "f(x) = tanh(4x)": {
+            rule = x => Math.Tanh(4 * x);
+            break;
+          }
+        case "f(x) = 1-sqrt(1-x)": {
+            rule = x => 1 - Math.Sqrt(1 - x);
+            break;
+          }
         default:
           throw new ArgumentException("Unknown replacement rule");
@@ -192 +224 @@
 
       // for now, only consider crossover offspring
+      var scopes = new ScopeList(ExecutionContext.Scope.SubScopes.OrderByDescending(x => ((DoubleValue)x.Variables["Quality"].Value).Value).Take(n));
       var vertices = from s in scopes
                      let t = (ISymbolicExpressionTree)s.Variables["SymbolicExpressionTree"].Value
@@ -222 +255 @@
     public static IEnumerable<ISymbolicExpressionTree> GenerateSchemas(IEnumerable<IGenealogyGraphNode<ISymbolicExpressionTree>> vertices, int minimumSchemaLength) {
       var anySubtreeSymbol = new AnySubtreeSymbol();
-      //      var anyNodeSymbol = new AnyNodeSymbol();
+      //            var anyNodeSymbol = new AnyNodeSymbol();
       var groups = vertices.GroupBy(x => x.Parents.First()).OrderByDescending(g => g.Count()).ToList();
       var hash = new HashSet<string>();
@@ -246 +279 @@
             continue;
 
-          //          var replacement = anySubtreeSymbol.CreateTreeNode();
-          //          ReplaceSubtree(node, replacement, false);
-          var replacement = new AnyNodeSymbol(node.Symbol.MinimumArity, node.Symbol.MinimumArity).CreateTreeNode();
-          ReplaceSubtree(node, replacement, true);
+          var replacement = anySubtreeSymbol.CreateTreeNode();
+          ReplaceSubtree(node, replacement, false);
+          //          var replacement = new AnyNodeSymbol(node.Symbol.MinimumArity, node.Symbol.MinimumArity).CreateTreeNode();
+          //          ReplaceSubtree(node, replacement, true);
           replaced = true;
         }