From the archives
Sequential Optimization and Computer Experiments
Historical material. Affiliations, schedules and roles on this page describe their original context.
Context: Toulouse
Resume:
Every day, one pick a point $x$ and observe the (possibly noisy) value of an unknown function $f$ at point $x$. How to find as fast as possible the minimum value of $f$? In this introductory talk, we will discuss some possible answers of this question. We will focus on the answers inspired on bandit models.
Slides: mascotnum_20160323.pdf Date: March, 2016 Event url: MASCOT-NUM 2016 Meeting Keywords: