We study a method of optimal data-driven aggregation of classifiers in a convex combination and establish tight upper bounds on its excess risk with respect to a convex loss funct...
Many practical optimization problems involve nonsmooth (that is, not necessarily differentiable) functions of thousands of variables. In the paper [Haarala, Miettinen, M¨akel¨a,...
— We propose a robot path planning method based on particle swarm optimization in an uncertain environment. We consider the case that a robot’s cognition to its environment is ...
Optimizing the ratio of two functions of binary variables is a common task in many image analysis applications. In general, such a ratio is not amenable to graph-cut based optimiz...
: - This paper introduces the main ideas of the nested partitions (NP) method, analyses its efficiency theoretically and proposes the way to improve the optimization efficiency of ...