Changeset 11973 for branches

Timestamp:

02/09/15 14:50:43 (10 years ago)

Author:

gkronber

Message:

#2283: preparation for seq-search with fun approx symbreg experiment

File:

• branches/HeuristicLab.Problems.GrammaticalOptimization/Main/Program.cs (modified) (2 diffs)

branches/HeuristicLab.Problems.GrammaticalOptimization/Main/Program.cs

@@ -29 +29 @@
       //RunGpDemo();
       //RunGridTest();
-      RunGpGridTest();
+      //RunGpGridTest();
+      RunFunApproxTest();
     }
 
@@ -306 +307 @@
 
 
+    private static void RunFunApproxTest() {
+      const int nReps = 20;
+      const int seed = 31415;
+      //const int maxIters = 50000;
+      var rand = new Random(seed);
+      var problemFactories = new Func<Tuple<int, int, ISymbolicExpressionTreeProblem>>[]
+      {
+        () => Tuple.Create(100000, 23,  (ISymbolicExpressionTreeProblem)new SymbolicRegressionPoly10Problem()), 
+        //() => Tuple.Create(100000, 17, (ISymbolicExpressionTreeProblem)new SantaFeAntProblem()), 
+        //() => Tuple.Create(50000, 32,(ISymbolicExpressionTreeProblem)new RoyalSymbolProblem()), 
+        //() => Tuple.Create(50000, 64, (ISymbolicExpressionTreeProblem)new RoyalPairProblem()), 
+        //() => Tuple.Create(50000, 64,(ISymbolicExpressionTreeProblem)new RoyalSymbolProblem()), 
+        //() => Tuple.Create(50000, 128, (ISymbolicExpressionTreeProblem)new RoyalPairProblem()), 
+        //() => Tuple.Create(50000, 128,(ISymbolicExpressionTreeProblem)new RoyalSymbolProblem()), 
+        //() => Tuple.Create(50000, 256, (ISymbolicExpressionTreeProblem)new RoyalPairProblem()), 
+        //() => Tuple.Create(50000, 256,(ISymbolicExpressionTreeProblem)new RoyalSymbolProblem()), 
+        //() => new RoyalPairProblem(), 
+        //() => new FindPhrasesProblem(rand, 20, 5, 3, 5, 0, 1, 0, true), 
+        //() => new FindPhrasesProblem(rand, 20, 5, 3, 5, 0, 1, 0, false), 
+        //() => new FindPhrasesProblem(rand, 20, 5, 3, 5, 50, 1, 0.8, false), 
+      };
+
+      // skip experiments that are already done
+      foreach (var problemFactory in problemFactories) {
+        for (int i = 0; i < nReps; i++) {
+          {
+            var solverSeed = rand.Next();
+            var tupel = problemFactory();
+            var maxIters = tupel.Item1;
+            var maxSize = tupel.Item2;
+            var prob = tupel.Item3;
+
+            var alg = new SequentialSearch(prob, maxSize, new Random(solverSeed), 0,
+          new HeuristicLab.Algorithms.Bandits.GrammarPolicies.GenericFunctionApproximationGrammarPolicy(prob, true));
+
+            int iterations = 0;
+            var globalStatistics = new SentenceSetStatistics(prob.BestKnownQuality(maxSize));
+            var algName = alg.GetType().Name;
+            var probName = prob.GetType().Name;
+            alg.SolutionEvaluated += (sentence, quality) => {
+              iterations++;
+              globalStatistics.AddSentence(sentence, quality);
+
+              if (iterations % 1000 == 0) {
+                Console.WriteLine("\"{0,25}\" {1} \"{2,25}\" {3}", algName, maxSize, probName, globalStatistics);
+              }
+            };
+
+            alg.Run(maxIters);
+
+          }
+
+        }
+      }
+    }
+
     private static void RunGpGridTest() {
       const int nReps = 20;