Changeset 11977

Timestamp:

02/11/15 03:01:59 (9 years ago)

Author:

gkronber

Message:

#2283 commit for 'realistic' (same settings for ant and symbreg) experiment

Location:

branches/HeuristicLab.Problems.GrammaticalOptimization

Files:

• HeuristicLab.Algorithms.GrammaticalOptimization/SequentialDecisionPolicies/GenericFunctionApproximationGrammarPolicy.cs (modified) (5 diffs)
• HeuristicLab.Algorithms.GrammaticalOptimization/Solvers/SequentialSearch.cs (modified) (3 diffs)
• HeuristicLab.Problems.GrammaticalOptimization/Problems/SantaFeAntProblem.cs (modified) (1 diff)
• Main/Main.csproj (modified) (1 diff)
• Main/Program.cs (modified) (7 diffs)

branches/HeuristicLab.Problems.GrammaticalOptimization/HeuristicLab.Algorithms.GrammaticalOptimization/SequentialDecisionPolicies/GenericFunctionApproximationGrammarPolicy.cs

@@ -62 +62 @@
 
 
-      /*
-      const double beta = 1;
+      
+      const double beta = 20;
       var w = from idx in Enumerable.Range(0, maxIdx)
               let afterStateQ = activeAfterStates[idx]
@@ -71 +71 @@
       selectedStateIdx = actionIndexMap[bestAction];
       Debug.Assert(selectedStateIdx >= 0);
-      */
-
-
+      
+
+      /*
       if (random.NextDouble() < 0.2) {
         selectedStateIdx = actionIndexMap[random.Next(maxIdx)];
@@ -91 +91 @@
         selectedStateIdx = actionIndexMap[bestIdxs[random.Next(bestIdxs.Count)]];
       }
-
-
-
-
+      */
       return true;
     }
@@ -132 +129 @@
 
     public double GetValue(string state) {
-      return problem.GetFeatures(state).Average(feature => GetWeight(feature));
+      return problem.GetFeatures(state).Sum(feature => GetWeight(feature));
     }
 
@@ -142 +139 @@
     private void UpdateWeights(string state, double reward) {
       double delta = reward - GetValue(state);
-      delta /= problem.GetFeatures(state).Count();
-      const double alpha = 0.001;
+      // delta /= problem.GetFeatures(state).Count();
+      //const double alpha = 0.01;
       foreach (var feature in problem.GetFeatures(state)) {
         featureTries[feature.Id] = GetFeatureTries(feature.Id) + 1;
         Debug.Assert(GetFeatureTries(feature.Id) >= 1);
-        //double alpha = 1.0 / GetFeatureTries(feature.Id);
-        //alpha = Math.Max(alpha, 0.01);
+        double alpha = 1.0 / GetFeatureTries(feature.Id);
+        alpha = Math.Max(alpha, 0.001);
 
         double w;

branches/HeuristicLab.Problems.GrammaticalOptimization/HeuristicLab.Algorithms.GrammaticalOptimization/Solvers/SequentialSearch.cs

@@ -62 +62 @@
     }
 
+    public bool StopRequested {
+      get;
+      set;
+    }
+
     public override void Run(int maxIterations) {
       Reset();
 
-      for (int i = 0; /*!bestQuality.IsAlmost(1.0) && */!Done() && i < maxIterations; i++) {
+      for (int i = 0; !StopRequested && !Done() && i < maxIterations; i++) {
         var phrase = SampleSentence(problem.Grammar);
         // can fail on the last sentence
@@ -171 +176 @@
 
     private void Reset() {
+      StopRequested = false;
       behaviourPolicy.Reset();
       greedyPolicy.Reset();
@@ -238 +244 @@
     }
     #endregion
-  
+
   }
 }

branches/HeuristicLab.Problems.GrammaticalOptimization/HeuristicLab.Problems.GrammaticalOptimization/Problems/SantaFeAntProblem.cs

@@ -129 +129 @@
       do {
         oldPhrase = canonicalPhrase;
-        sb.Replace("ll", "rr").Replace("rl", "").Replace("lr", "").Replace("lll", "r").Replace("rrr", "l");
-        sb.Replace("?(m)(m)", "?()()m").Replace("?(l)(l)", "?()()l").Replace("?(r)(r)", "?()()r").Replace("?()()", "");
+        sb.Replace("ll", "rr").Replace("rl", "").Replace("lr", "").Replace("lll", "r").Replace("rrr", "l").Replace("?()()", "");
+        //sb.Replace("?(m)(m)", "?()()m").Replace("?(l)(l)", "?()()l").Replace("?(r)(r)", "?()()r");
         canonicalPhrase = sb.ToString();
       } while (canonicalPhrase != oldPhrase);

branches/HeuristicLab.Problems.GrammaticalOptimization/Main/Main.csproj

@@ -56 +56 @@
       <Name>HeuristicLab.Algorithms.GrammaticalOptimization</Name>
     </ProjectReference>
+    <ProjectReference Include="..\HeuristicLab.Common\HeuristicLab.Common.csproj">
+      <Project>{3A2FBBCB-F9DF-4970-87F3-F13337D941AD}</Project>
+      <Name>HeuristicLab.Common</Name>
+    </ProjectReference>
     <ProjectReference Include="..\HeuristicLab.Distributions\HeuristicLab.Distributions.csproj">
       <Project>{31171165-E16F-4A1A-A8AB-25C6AB3A71B9}</Project>

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

@@ -13 +13 @@
 using HeuristicLab.Algorithms.GeneticProgramming;
 using HeuristicLab.Algorithms.GrammaticalOptimization;
+using HeuristicLab.Common;
 using HeuristicLab.Problems.GrammaticalOptimization;
 using HeuristicLab.Problems.GrammaticalOptimization.SymbReg;
@@ -30 +31 @@
       // RunGridTest();
       //RunGpGridTest();
-     RunFunApproxTest();
+      RunFunApproxTest();
     }
 
@@ -308 +309 @@
 
     private static void RunFunApproxTest() {
-      const int nReps = 20;
+      const int nReps = 30;
       const int seed = 31415;
       //const int maxIters = 50000;
@@ -314 +315 @@
       var problemFactories = new Func<Tuple<int, int, ISymbolicExpressionTreeProblem>>[]
       {
-        //() => Tuple.Create(100000, 23,  (ISymbolicExpressionTreeProblem)new SymbolicRegressionPoly10Problem()), 
+        () => Tuple.Create(100000, 23,  (ISymbolicExpressionTreeProblem)new SymbolicRegressionPoly10Problem()), 
         () => Tuple.Create(100000, 17, (ISymbolicExpressionTreeProblem)new SantaFeAntProblem()), 
         //() => Tuple.Create(50000, 32,(ISymbolicExpressionTreeProblem)new RoyalSymbolProblem()), 
@@ -330 +331 @@
 
       // skip experiments that are already done
-      foreach (var problemFactory in problemFactories) {
-        for (int i = 0; i < nReps; i++) {
+      for (int i = 0; i < nReps; i++) {
+        foreach (var problemFactory in problemFactories) {
           {
             var solverSeed = rand.Next();
@@ -343 +344 @@
 
             int iterations = 0;
+            double bestQuality = double.NegativeInfinity;
             var globalStatistics = new SentenceSetStatistics(prob.BestKnownQuality(maxSize));
             var algName = alg.GetType().Name;
             var probName = prob.GetType().Name;
             alg.SolutionEvaluated += (sentence, quality) => {
+              bestQuality = Math.Max(bestQuality, quality);
               iterations++;
               globalStatistics.AddSentence(sentence, quality);
@@ -357 +360 @@
               if (iterations % 200 == 0) {
                 Console.WriteLine("\"{0,25}\" {1} \"{2,25}\" {3}", algName, maxSize, probName, globalStatistics);
+                if (bestQuality.IsAlmost(1.0)) {
+                  alg.StopRequested = true;
+                }
               }
             };