Commit 4e700dfd authored by Konstantinos Chatzilygeroudis's avatar Konstantinos Chatzilygeroudis
Browse files

Fix for #128 [ci skip]

parent fab634a1
......@@ -194,7 +194,7 @@ In your main function, you need to have something like the following:
.. literalinclude:: ../../src/tutorials/advanced_example.cpp
:language: c++
:linenos:
:lines: 121-148
:lines: 121-151
Running the experiment
^^^^^^^^^^^^^^^^^^^^^^^^^
......@@ -218,4 +218,4 @@ Then, an executable named ``arm_example`` should be produced under the folder ``
6 new point: 0.455737 0.978531 0.55947 0.0435089 0.0143673 0.999978 value: -0.0113502 best:-0.0113502
Using state-based bayesian optimization, we can transfer what we learned doing one task to learn faster new tasks.
\ No newline at end of file
Using state-based bayesian optimization, we can transfer what we learned doing one task to learn faster new tasks.
......@@ -143,6 +143,9 @@ int main()
boptimizer.optimize(eval_func<Params>(), aggregator);
std::cout << "New target!" << std::endl;
aggregator = DistanceToTarget<Params>({2, 1.5});
// Do not forget to pass `false` as the last parameter in `optimize`,
// so you do not reset the data in boptimizer
// i.e. keep all the previous data points in the Gaussian Process
boptimizer.optimize(eval_func<Params>(), aggregator, false);
return 1;
}
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment