13#if !defined(VITA_SEARCH_H)
30 std::set<unsigned> good_runs = {};
32 unsigned best_run = 0;
52template<
class T,
template<
class>
class ES =
vita::std_es>
60 template<
class E,
class... Args>
search &training_evaluator(Args && ...);
61 template<
class E,
class... Args>
search &validation_evaluator(Args && ...);
66 typename evolution<T, ES>::after_generation_callback_t);
68 virtual bool is_valid()
const;
73 virtual void after_evolution(
const summary<T> &);
75 virtual void calculate_metrics(
summary<T> *)
const;
79 virtual bool can_validate()
const;
92 tinyxml2::XMLDocument *)
const;
97 virtual void tune_parameters();
100 std::unique_ptr<evaluator<T>> eva1_;
101 std::unique_ptr<evaluator<T>> eva2_;
102 std::unique_ptr<vita::validation_strategy> vs_;
108 typename evolution<T, ES>::after_generation_callback_t
109 after_generation_callback_;
117#include "kernel/search.tcc"
Simplifies the calculation of statistics regarding a sequence (mean, variance, standard deviation,...
Aggregates the problem-related data needed by an evolutionary program.
Search drives the evolution.
Standard evolution strategy.
A summary of evolution (results, statistics...).
Interface for specific training / cross validation techniques (e.g.
The main namespace for the project.
A collection of measurements.
unsigned runs
index of the run giving the best solution