The task of finding the optimum of some function f(x) is commonly accomplished by generating and testing sample solutions iteratively, choosing each new sample x heuristically on t...
In some expensive multiobjective optimization problems, several function evaluations can be carried out at one time. Therefore, it is very desirable to develop methods which can g...
Qingfu Zhang, Wudong Liu, Edward P. K. Tsang, Boto...
In the last decades enormous advances have been made possible for modelling complex (physical) systems by mathematical equations and computer algorithms. To deal with very long run...
Gait optimization is a basic yet challenging problem for both quadrupedal and bipedal robots. Although techniques for automating the process exist, most involve local function opt...
Daniel J. Lizotte, Tao Wang, Michael H. Bowling, D...
Many applications require optimizing an unknown, noisy function that is expensive to evaluate. We formalize this task as a multiarmed bandit problem, where the payoff function is ...
Niranjan Srinivas, Andreas Krause, Sham Kakade, Ma...