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...
Parallel programming is a requirement in the multi-core era. One of the most promising techniques to make parallel programming available for the general users is the use of parall...
Angeles G. Navarro, Rafael Asenjo, Siham Tabik, Ca...
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generat...
Paul Armand, Jean Charles Gilbert, Sophie Jan-J&ea...
In this paper, we give a theoretical analysis for the algorithms to compute functional decomposition for multivariate polynomials based on differentiation and homogenization which ...