moses-ann-pole2-hillclimbing.cc

#include <iostream>

#include <opencog/util/mt19937ar.h>
#include <opencog/util/Logger.h>
#include <opencog/asmoses/combo/interpreter/eval.h>


#include <opencog/asmoses/moses/deme/deme_expander.h>
#include <opencog/asmoses/moses/metapopulation/metapopulation.h>

#include <opencog/asmoses/moses/moses/moses_main.h>
#include <opencog/asmoses/moses/optimization/optimization.h>
#include <opencog/asmoses/moses/scoring/scoring_base.h>

#include "pole_scoring.h"


using namespace moses;
using namespace reduct;
using namespace boost;
using namespace std;
using namespace opencog;


int main(int argc, char** argv)
{

    //set flag to print only cassert and other ERROR level logs on stdout
    logger().set_print_error_level_stdout();

    combo_tree tr;
    cin >> tr;

    tree_transform trans;
    ann nn = trans.decodify_tree(tr);
    cout << tr << endl;
    cout << "Network depth: " << nn.feedforward_depth() << endl;
    cout << &nn << endl;

    randGen().seed(0);

    type_tree tt(id::lambda_type);
    tt.append_children(tt.begin(), id::ann_type, 1);


    // DOUBLE MARKOVIAN POLE TASK`
    ann_pole2_bscore p2_bscore;
    behave_cscore cscorer(p2_bscore);

    hill_climbing hc;
    deme_expander dex(tt, clean_reduction(), clean_reduction(), cscorer, hc);
    metapopulation metapop_pole2(tr, cscorer);

    moses_parameters pa;
    moses_statistics st;
    run_moses(metapop_pole2, dex, pa, st);

    combo_tree best = metapop_pole2.best_tree();
    ann bestnet = trans.decodify_tree(best);

    cout << "Best network: " << endl;
    cout << &bestnet << endl;
    bestnet.write_dot("best_nn.dot");

    //for parameter sweet
    cout << metapop_pole2.best_score() << endl;
}