A new family of boosting algorithms, denoted TaylorBoost, is proposed. It supports any combination of loss function and first or second order optimization, and includes classical...
Mohammad Saberian, Hamed Masnadi-Shirazi, Nuno Vas...
We propose a new method for comparing learning algorithms on multiple tasks which is based on a novel non-parametric test that we call the Poisson binomial test. The key aspect of...
In this article, we focus on numerical algorithms for which, in practice, parallelism and accuracy do not cohabit well. In order to increase parallelism, expressions are reparsed,...
Philippe Langlois, Matthieu Martel, Laurent Th&eac...
Algorithm portfolios aim to increase the robustness of our ability to solve problems efficiently. While recently proposed algorithm selection methods come ever closer to identifyin...
Serdar Kadioglu, Yuri Malitsky, Ashish Sabharwal, ...
Abstract—The peer-to-peer networking concept has revolutionized the cost structure of Internet data dissemination by making large scale content delivery with low server cost feas...