Fast greedy C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {C}$$\end{document}-bound minimization with guarantees

The C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {C}$$\end{document}-bound is a tight bound on the true risk of a majority vote classifier that relies on the individual quality and pairwise disagreement of the voters and provides PAC-Bayesian generalization guarantees. Based on this bound, MinCq is a classification algorithm that returns a dense distribution on a finite set of voters by minimizing it. Introduced later and inspired by boosting, CqBoost uses a column generation approach to build a sparse C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {C}$$\end{document}-bound optimal distribution on a possibly infinite set of voters. However, both approaches have a high computational learning time because they minimize the C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {C}$$\end{document}-bound by solving a quadratic program. Yet, one advantage of CqBoost is its experimental ability to provide sparse solutions. In this work, we address the problem of accelerating the C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {C}$$\end{document}-bound minimization process while keeping the sparsity of the solution and without losing accuracy. We present CB-Boost, a computationally efficient classification algorithm relying on a greedy–boosting-based–C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {C}$$\end{document}-bound optimization. An in-depth analysis proves the optimality of the greedy minimization process and quantifies the decrease of the C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {C}$$\end{document}-bound operated by the algorithm. Generalization guarantees are then drawn based on already existing PAC-Bayesian theorems. In addition, we experimentally evaluate the relevance of CB-Boost in terms of the three main properties we expect about it: accuracy, sparsity, and computational efficiency compared to MinCq, CqBoost, Adaboost and other ensemble methods. As observed in these experiments, CB-Boost not only achieves results comparable to the state of the art, but also provides C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {C}$$\end{document}-bound sub-optimal weights with very few computational demand while keeping the sparsity property of CqBoost.


Introduction
Ensemble-based supervised classification consists in training a combination of many classifiers learnt from various algorithms and/or sub-samples of the initial dataset. Some of the most prominent ensemble learning frameworks include Boosting, with the seminal elegant Adaboost (Freund and Schapire 1997), which has been the inspiration of numerous other algorithms, Bagging (Breiman 1996) leading to the successful Random Forests (Breiman 2001), but also Multiple Kernel Learning (MKL) approaches (Sonnenburg et al. 2006;Lanckriet et al. 2004) or even the Set Covering Machines (Marchand and Taylor 2003). Most of these approaches are founded on theoretical aspects of PAC learning (Valiant 1984). Among them, the PAC-Bayesian theory studies the properties of the majority vote that is used to combine the classifiers (McAllester 1999) according to the distributions among them. Experimentally, valuable ad-hoc studies have been made over specific application domains in order to build relevant sets of classifiers. We address here the problem of learning one independently from the priors relevant to the application domain, together with a weighted schema that defines a majority vote over the members of that set of classifiers.
Introduced by McAllester (1999), the PAC-Bayesian theory provides some of the tightest Probably Approximately Correct (PAC) learning bounds. These bounds are often used for a better understanding of the learning capability of various algorithms (Seeger 2002;McAllester 2003;Langford and Shawe-Taylor 2003;Catoni 2007;Seldin et al. 2012;Dziugaite and Roy 2018). Based on the fact that PAC-Bayesian bounds gave rise to a powerful analysis of many algorithms' behavior, it has incited a research direction that consists in developing new (or new variants of) algorithms that simply are bound minimizers (Germain et al. 2009;Parrado-Hernández et al. 2012;Dziugaite and Roy 2018;Germain et al. 2015). In this paper, we revisit one of such algorithms, MinCq (Germain et al. 2015), which focuses on the minimization of the C-bound and comes with PAC-Bayesian guarantees. The C-bound, introduced in Lacasse et al. (2006), bounds the true risk of a weighted majority vote based on the averaged true risk of the voters, coupled with their averaged pairwise disagreement. According to the C-bound, the quality of each individual voter can be compensated if the voting community tends to balance the individual errors by having plural opinions on "difficult" examples.
Although MinCq has state of the art performance on many tasks, it computes the output distribution on a set of voters through a quadratic program, which is not tractable for more than medium-sized datasets. To overcome this, CqBoost (Roy et al. 2016) has then been proposed. It iteratively builds a sparse majority vote from a possibly infinite set of classifiers, within a column generation setting. However, CqBoost's approach only partially tackles the computational challenge. In order to overcome this drawback, we propose CB-Boost, a greedy, boosting-based, C-bound minimization algorithm designed to greatly reduce the computational cost of CqBoost and MinCq while maintaining the attractive peculiarities of the C-bound on a finite set of hypothesis.
CB-Boost is somewhat similar to CqBoost, while closer to boosting in the sense that at each iteration, it selects a voter, finds its associated weight by minimizing an objective quantity (the C-bound in the case of CB-Boost, and the exponential loss as for Adaboost) and adds it to the vote.
The main advantage of CB-Boost comes from the fact that at each iteration, it solves a C-bound minimization problem by considering only one direction. Interestingly, it is possible to solve it analytically and with only a few light operations. Furthermore, we derive a guarantee that the C-bound decreases throughout CB-Boost 's iterations.
This paper is organised as follows. Section 2 sets up basic notation and definitions, reviews the C-bound and its PAC-Bayesian framework, and briefly introduces MinCq and CqBoost, two existing algorithms that aim at learning an ensemble of classifiers based on the minimization of the C-bound. Section 3 introduces our new boosting-based algorithm named CB-Boost, which aims at keeping the benefits of these two algorithms, while reducing the disadvantages. Finally, Sect. 4 addresses the theoretical properties of CB-Boost, while Sect. 5 focuses on experiments that not only validate the theoretical aspects, but also shows that CB-Boost performs well empirically on major aspects.

Context
After setting up basic notations and definitions, the context of PAC-Bayesian learning is introduced through the C-bound and two theorems, which are pivotal components of our contribution.

Basic notations and definitions
Definition 4 The Kullback-Leibler (KL) divergence between distributions Q and P is defined as

3
In the following study, let P denote the prior distribution on H that incorporates preexisting knowledge about the task. And let Q denote the posterior distribution, which is an update of P after observing the task's data.

Previous work: the C-Bound & PAC-Bayesian guarantees
Here, we state the main context of our work by presenting the C-bound and its properties, as introduced in Lacasse et al. (2006). Let us first define one core concept: the margin of the majority vote.

Definition 5
Given an example x ∈ X and its label y ∈ Y drawn according to a distribution D, M D Q is the random variable that gives the margin of the majority vote B Q , defined as Given the margin's definition, the C-bound is presented in Lacasse et al. (2006) as follows.

Definition 6 For any distribution
being the first moment of the margin and 2 (M D Q ) being the second moment of the margin where the last equality comes from the fact that y ∈ {−1, 1} , so y 2 = 1.

Definition 7 For any distribution Q on H and any
The following theorem, established and proven in Lacasse et al. (2006), shows that the C-bound is an upper bound of the true risk of the majority vote classifier.
Theorem 1 Lacasse et al. (2006) For any distribution Q on a set H of hypotheses, and for From this result, we derive a corollary for the empirical risk, i.e., the training error that is used in Sect. 4:

Corollary 1 For any distribution Q on a set H of hypotheses, and for
In terms of generalization guarantees, the PAC-Bayesian framework (McAllester 1999) provides a way to bound the true risk of B Q , given the empirical C-bound, and P and Q the prior and posterior distributions. The important following theorem, established by Roy et al. (2016) is used in Sect. 4.3; it gives an upper bound of the true risk of the majority vote, which depends on the first and second moments of the margin as introduced in Definitions 5 and 6, and on the Kullback-Leibler divergence between the prior and posterior distributions.
Theorem 2 Roy et al. (2016) For any distribution D on X × Y , for any set H of voters h ∶ X → {−1, 1} , for any prior distribution P on H and any ∈]0, 1] over the choice of

Existing algorithms: MinCq & CqBoost
Let us focus on two algorithms that rely on the minimization of the empirical C-bound in order to learn an accurate ensemble of classifiers. MinCq (Germain et al. 2015) finds the weights that minimize the empirical C-bound on a given set of voters, and CqBoost (Roy et al. 2016), inversely, uses column generation and boosting to iteratively build a set of voters by minimizing the C-bound.
MinCq 1 (Germain et al. 2015) The principle of MinCq is to create a majority vote over a finite set of voters, whose weights minimize the C-bound. To avoid overfitting, it considers a restriction on the posterior distribution named quasi-uniformity (Germain et al. 2015), and adds an equality constraint on the first moment of the margin.
Beneficially, it is ensured to perform as well in train as in generalization, according to Corollary 1 and Theorem 2. The main drawback of MinCq is its computational training time: its algorithmic complexity is O(m × n 2 + n 3 ) , which prevents it from scaling up to large datasets.
CqBoost 2 (Roy et al. 2016) Like MinCq, CqBoost is an algorithm based on the minimization of the C-bound. It was designed to accelerate MinCq and has proven to be a sparser C-bound minimizer, hence enabling better interpretability and faster training.
CqBoost is based on a column generation process that iteratively builds the majority vote. It is similar to boosting in the way that, at each iteration t, the choice of the voter to add is made by greedily optimizing the edge criterion (Demiriz et al. 2002). Once a voter has been added to the current selected set, CqBoost finds the optimal weights by minimizing the C-bound similarly to MinCq, solving a quadratic program.
The sparsity of CqBoost is explained by its ability to stop the iterative vote building early enough to avoid overfitting. Nevertheless, even though CqBoost is faster and sparser than MinCq, it is still not applicable to large datasets because of its algorithmic complexity is O(m × T 2 + T 3 ) , where T is the number of boosting iterations.

CB-Boost: A fast C-Bound minimization algorithm
In this section, we present the mono-directional C-bound minimization problem and its solution, which are central in CB-Boost. Then, we introduce CB-Boost 's pseudo-code in Algorithm 1.
The empirical C-bound of a distribution Q = { 1 , … , n } of n weights over H = {h 1 , … , h n } a set of n voters, on a learning sample S of m examples, is as follows.
It is proven in Appendix D.1 that if we use positive weights { 1 , … , n } ∈ (ℝ + ) n instead of a distribution, the empirical C-bound is equivalent to using the distribution s . From here, we use the weights that do not sum to one in order to simplify the proofs.
The pseudo-code of MinCq is given in Appendix A.1.

Optimizing the C-Bound in one direction
We outline some basic definitions to clarify the contributions of the following work : agreement ratio, margin and norm.

Definition 8
The agreement ratio between two voters h, h � ∈ H (or two combination of

Definition 9
The empirical margin of a single voter h ∈ H (or combination of voters in Definition 10 The squared and normalized L2-norm of h ∈ H (or combination of voters in Here, we consider the C-bound optimization in a single direction, meaning that all weights, except one, are fixed. For readability reasons, we introduce ∀i ∈ [m] , which denotes the majority vote built by all the fixed weights and their corresponding voters, and ( , h k ) the weight that varies during the optimization and its corresponding voter. We can thus rewrite the empirical C-bound with respect to k , the varying direction, as Our goal here is to find the optimal in terms of C-bound, denoted by * k = arg min The following theorem is the central contribution of our work as it provides an analytical solution to this problem.

Theorem 3 ∀k ∈ [n] with the previously introduced notations, if
The proof is provided in the Appendix, in Sect. D.1. Theorem 3 states that in a specific direction, the C-bound has a global minimum, provided three conditions. The first two ( (h k ) > 0 and (F k ) > 0 ) are met trivially within our framework as h k is a weak classifier 3 and F k is a positive linear combination of weak classifiers. The third one (F k , h k ) < (F k ) (h k ) means that F k and h k are not supposed to be colinear, which in the next section, we will show is not restrictive.
This theoretical result is the main step in building a greedy C-bound minimization algorithm. Moreover, as long as there is a direction k in which (F k , h k ) < (F k ) (h k ) , the C-bound can be optimized in this direction, and every other one in which (F k In terms of complexity, the solution to the minimization problem is obtained in O(m) as (h k ) , F k , (F k ) , and (F k , h k ) are sums over the m examples of the training set S.

Optimally choosing the direction
In the previous subsection, we presented a theoretical result proving that, for a given direction, the C-bound minimization problem has a unique solution. Here, we propose a way to optimally choose this direction and compare it to the main existing method.
Exhaustive search In our framework, H is finite and has a cardinality of n, implying that we have a finite number of available directions to choose from. As stated before, the minimum C-bound in one direction is available in O(m) . So by computing these minima in each direction, in O(n × m) , we are able to choose the optimal direction, in which the C-bound decreases the most.
Comparison with gradient boosting In the gradient boosting framework (a), the optimization direction is chosen by gradient minimization. Coupled with an adequate method to choose the step size, it is a very efficient way of optimizing a loss function. However, thanks to our theoretical analysis, we know that at each iteration of CB-Boost, the best direction is chosen and the optimal step size is known analytically.
Nonetheless, we present a comparison between our exhaustive method and a gradient boosting version that we call GB-CB-Boost. We show in the experiments (Sects. 5.1 and 5.2) that it has no significant advantage and it is less stable than CB-Boost. The details about the gradient boosting variant are explained in Appendix B, and a toy example gives an intuition on the difference between the two processes in Appendix C.

Presenting CB-Boost
Armed with the theoretical and practical results presented in the previous subsections, we are now ready to present the overall view of CB-Boost, which optimizes the training error of the majority vote through the iterative minimization of the mono-directional C-bound presented in Theorem 3.

Algorithm 1 CB-Boost
Require: T # the maximum number of iterations Require: H = h1, . . . , hn #Precomputed set of classifiers 1: α1, . . . , αn ← 0, . . . , 0 2: I1, . . . , I T ← 0, . . . , 0 #The list containing the indices of the chosen hypothesis 3: I1 ← arg max k∈ [n] γ(h k ) #Find the index of the voter of H with the highest margin 4: α I1 ← 1 # Initialize its weight with 1 5: for t in 2, . . . , T do 6: # Find the optimal weight in every direction 10: end if 11: end for 12: It ← arg min For the sake of clarity, we define I 1 , … , I T as a list that is initialized with zeros (Line 2), and that contains each of the chosen directions' indices (Updated in Lines 3 and 12). To initialize CB-Boost, we use h I 1 ∈ H the hypothesis with the best margin, we set its weight to 1, and all the others to zero (Lines 1, 3 and 4). This aims at accelerating the convergence by starting the vote building with the strongest available hypothesis.
Then, for each iteration t, we compute the C-bound-optimal weights in every available direction, by solving multiple mono-directional optimization problems (Lines 7 to 11). The direction is then exhaustively chosen (Line 12).
After the initialization, the weights on H are a Dirac distribution with the best-margin hypothesis's weight being the only one non-zero, and at each iteration t, one more element of H will have a non-zero weight I t .
One major advantage of CB-Boost when compared to MinCq and CqBoost is the simplicity of Line 9, where its predecessors solve quadratic programs. Indeed, the algorithmic complexity of CB-Boost only depends on the number of iterations T, the number of examples m, and the number of hypotheses n. As the mono-directional C-bound optimization is solved in O(n × m) CB-Boost 's complexity is O(n × m × T).

Remarks
On the C-bound indirect example re-weighting To bring diversity in the majority vote, Adaboost (Freund and Schapire 1997) updates weights over the examples at each iteration, exponentially emphasizing the examples on which it previously failed.
In CB-Boost, by considering both the first and second moments of the margin, the C-bound takes into account the individual performance of each voter and their disagreement. Therefore, minimizing the C-bound requires to keep a trade-off between maximizing the vote's margin and internal disagreement. This is the reason why CB-Boost does not include any example weighting. Indeed, the mono-directional C-bound minimization problem is equivalent to minimizing the following quantity 1 3 Intuitively, in this expression,

so it decreases as h
and F disagreement increases. It encourages CB-Boost to choose directions that perform well on hard examples. Moreover, 2 can be interpreted as a regularization term and 1 ( (F k )+ (h k )) 2 encapsulates the quality of the vote.
On the difference between the majority votes Intuitively, the concession made in CB-Boost to accelerate CqBoost and MinCq is focused on the weights of the majority vote. Indeed, CqBoost returns the majority vote that exactly minimizes the C-bound, for the considered set of voters where CB-Boost returns sub-optimal weights because they have been optimized greedily throughout the iterations. Nevertheless, the C-bound computed during the training phase is not an approximation for the considered majority vote, which explains the theoretical results of the next section. Moreover, in Fig. 5 (page 19), we empirically show that the weight-by-weight optimization has similar accuracy than the quadratic programs of MinCq and CqBoost.
On the stopping criterion In Sect. 3.1, we stated that as long as there is still a direction in , the C-bound can be optimized by CB-Boost. However, this is a very loose stopping criterion. i In fact, as experimentally seen in Sect. 5, as in CqBoost, it is far more interesting to use a fixed number of iterations as an hyper-parameter of the algorithm, as the main improvements are made during the first iterations of the algorithm. This way of restricting the number of iterations helps to reach a sparse model.

Quantifying the empirical C-Bound decrease
In this section, we quantify the decrease rate of the empirical C-bound for each iteration of CB-Boost, depending on the previous one and the considered direction.

h s the majority vote of all the other directions, then the empirical C-bound decreases exactly by
The proof is provided in the Appendix, in Sect. D.4.

Corollary 2 The training error of the majority vote, built by CB-Boost at iteration t > 2 is bounded by
with S j being the quantity introduced in Property 1.
The proof is straightforward by combining Corollary 1 and Property 1. This training error bound allows us to assess CB-Boost 's capacity to learn relevant models based on the available pool of voters.

Generalization guarantees
Theorem 2 presents a PAC-bound that gives generalization guarantees based on the empiri- s . Note that only the T weights corresponding to the chosen directions are non-zero. So, according to Theorem 2, with probability 1 − , for any sample S drawn according to D, These guarantees are tighter when the empirical C-bound of a majority vote is small, which is exactly what CB-Boost aims at returning. Moreover, as seen in Sect. 2.2, returning a majority vote with a small KL(Q||P) is essential in order to have good generalization guarantees. In Roy et al. (2016), the authors established that if the number of voters is far lower than the number of examples, n << m , then minimizing KL(Q||P) is negligible in comparison with minimizing the C-bound of the majority vote.
If the case n << m is not applicable, we need to characterize KL(Q||P) intuitively. We use a uniform prior on H , and as at each iteration of CB-Boost, one more weight of Q will be non-zero, KL(Q||P) will increase as the posterior's number of non-zero weight augments. Moreover, we proved that the C-bound of Q decreases over the iterations of CB-Boost. Thus, in order to keep the trade-off between KL(Q||P) and the C-bound for the bound of Theorem 2, it is relevant to use early-stopping by choosing a maximal number of iterations. Consequently, based on the generalization guarantees, we set the maximum number of iterations on CB-Boost as an hyper-parameter that can be chosen using hold-out data.

Comparison to non PAC-Bayesian generalization bounds
, which CB-Boost is explicitly processing.

Computational time improvement
In order to highlight the main advantage of CB-Boost, we first analyze the computational time improvement obtained by greedily minimizing the C-bound, comparing CB-Boost and GB-CB-Boost to CqBoost's and MinCq's quadratic programs. Moreover to compare them with a fast, broadly used boosting algorithm, we challenge CB-Boost 's computational efficiency with Adaboost's. Protocol In this experiment, we want to compare MinCq, CqBoost , GB-CB-Boost, CB-Boost and Adaboost by varying three factors : the training set size, the hypothesis set size, and the number of boosting iterations, respectively denoted, m, n and T. To do so, we use MNist 4vs9 (LeCun and Cortes 2010) as it provides 11791 examples and 784 features. Moreover, to be as fair as possible with the quadratic programs, we allowed 8 threads for the solver. For comparative purposes, the only difference between GB-CB-Boost and CB-Boost 's implementations is the gradient computation, as they are based on the same code.
Results In Fig. 1a, we vary n, the number of available hypotheses, with constant m and T and, as expected, MinCq has a very long computational time. Moreover, even if CqBoost's boosting-like structure reduce its time consumption, it is still much longer than the three other algorithms.
In Fig. 1b, we vary m. It has a small effect on MinCq, but has a huge effect on CqBoost as it runs T = 50 iterations in which it solves one increasingly complex quadratic programs per iteration, whereas MinCq has only one. Here, the apparently small difference between the other algorithms is due to CqBoost's and MinCq's long duration. Figure 1c only plots the iterative algorithms, and the duration difference between CqBoost and the greedy ones is clear even for this small learning set.
To sum up the results of these three sub-experiments, Adaboost, CB-Boost and GB-CB-Boost are far faster than the other C-bound algorithms. However, Adaboost and GB-CB-Boost seem to be slightly more time consuming than CB-Boost. To compare them, we analyze Fig. 1d, showing that even though they are close, CB-Boost is constantly faster than the others. Moreover, it is visible that GB-CB-Boost 's gradient computation is more time consuming than CB-Boost 's exhaustive search.  To conclude, CB-Boost is a substantial acceleration of CqBoost and MinCq, and is faster than Adaboost and GB-CB-Boost, which means that it is able to scale up to much bigger datasets than the other C-bound-based algorithms.

Performance comparison: C-bound-based algorithms equivalence
Here, we compare CB-Boost 's performance in zero-one loss with the other C-bound minimizers. Our goal is to measure the potential decrease in accuracy that greedy minimization would imply.

Protocol
-Datasets All the datasets used in this experiment are presented in Table 1, an indepth presentation is made in Appendix E. -Classifiers For each classifier, hyper-parameters were found with a randomized search with 30 draws, over a distribution that incorporates prior knowledge about the algorithm, but is independent from the dataset. They were validated by a 5-folds cross-validation and each experiment was run ten times, with the result in Table 2 being the mean and standard deviation over them. These results are not statistically significant, but multiplying the experiments helps avoiding an outlier split that could bias the results.
Results Table 2 shows that, for all datasets except Ionosphere and MNist-5v6, CB-Boost is performing at least as well as the other C-bound algorithms, considering the standard deviation. It is quite clear that MinCq has the best zero-one loss on nearly all the datasets, as it uses all the available hypotheses. However, CB-Boost is competitive with both CqBoost and MinCq, and is even better on three datasets. On the more complex Animals with Attributes, CB-Boost is the best of the C-bound algorithms. As expected, GB-CB-Boost shows no significant improvement of the accuracy, and is even less stable on australian, MNist-7v9 and 5v6.
CB-Boost is competitive with both the quadratic C-bound minimization algorithms 11 times out of 13, and has the best mean 3 times. Considering its shorter computational time, it is more efficient at extracting the information.

Sparsity conservation
Protocol We analyze here the convergence speed of the five previously studied algorithms with grid-searched optimal hyper-parameters, when needed (MinCq's margin hyper-parameter set to 0.05, and CqBoost's margin and error parameters, respectively set to 0.001 and 10 −6 ). The chosen dataset is MNIST 0v9 as it is more complex than UCI datasets but still small enough for CqBoost and MinCq to have reasonable computing time on it. We use the same hypotheses, training and testing sets as previously.
Results Figure 2 shows that, even if CB-Boost converges a bit less quickly than Adaboost and CqBoost on the training set, its performance on the test set is slightly better than all the other algorithms. Moreover, it is visible that CqBoost's and CB-Boost 's sparsity prevent them from the slight overfitting of MinCq. Furthermore, CqBoost seems to profit more from early-stopping than CB-Boost, even if their sparsity is clear as they have a better test performance than MinCq from the 30th voter. Finally, the experiments do not reveal any visible difference in sparsity between CB-Boost and GB-CB-Boost.
So, thanks to the closed form solution used in the calculation of CB-Boost, its computing time will always have an edge when compared to GB-CB-Boost. This, together with the fact that, as expected (and empirically shown), GB-CB-Boost is less stable, leads us to concentrate our analysis to CB-Boost for the remaining of the paper.

Performance comparison: noise robustness equivalence
In this section, we compare CB-Boost and Adaboost considering accuracy. The aim here is (1) to quantify how far CB-Boost is from Adaboost and (2) to evaluate their compared robustness to noise. Please note that the version of Adaboost used for these experiments is Adaboost.SAMME (Zhu et al. 2006), which is more robust to noise than the original. Protocol We use the same framework as in Sect. 5.2 regarding datasets, train-test splits and hyper-parameter optimization. A Gaussian distribution is used to add noise to the data (see Appendix F.1 for a detailed protocol and an example). The MNist dataset requires a special pre-processing to reduce its contrast in order for the noise to have an effect on classification. See Appendix F.2 for details.
Results In Fig. 3, we show a view of the results with each matrix presenting the comparison between Adaboost and CB-Boost for each dataset (rows), and noise level Fig. 3 Zero-one loss of CB-Boost and Adaboost. For each dataset (rows), we used several levels of noise (columns). An orange square means that Adaboost is better than CB-Boost in zero-one-loss ( L(Ada) < L(CB-B) ), and the difference between their scores is printed inside. A blue square means that they are equivalent, when considering their standard deviation (columns). It shows that, except for the four first noise levels of ionosphere where the difference is noteworthy, no significant loss of accuracy is observed when using CB-Boost, as the maximum difference between the other scores is 2.5%. In Appendix F.3, the numerical results are provided.

Performance comparison: ensemble methods equivalence
We present the result of the performance comparison between CB-Boost and four other ensemble methods : Adaboost (Freund and Schapire 1997), Bagging (Breiman 1996), Random Forests (Breiman 2001), and Gradient Boosting (a) for which we use the same protocol as in Sect. 5.4. This experiment differs from Sect. 5.4 in the fact that we do not mean the results on each dataset but instead, in Fig. 4 we plot one dot for each train/test split on each dataset, for a matter of legibility.
Results In Fig. 4, the distance to the x = y line represents the difference in zero-one loss. So, a dot under the line means that the ensemble method has lower loss and one over the line means it has higher loss. One can see that CB-Boost is similar to the state of the art for most of the datasets and train/test splits. The only perceptible tendency is that Bagging is frequently worse than CB-Boost, the other methods are equivalent to CB-Boost.

C-bound approximation characterization
Here, we aim at empirically analyzing the approximation made by greedily minimizing the C-bound instead of using a quadratic program solver. To do so, at each iteration of CB-Boost, we run MinCq on the selected subset of voters to compute its optimal C-bound. Protocol We use the MNist 4v9 dataset with the same sets as previously and predefined hyper-parameters: CB-Boost 's maximum number of iterations is set to 200, and MinCq's margin parameter to 0.05.
Results Figure 5 shows that there is a slight, but noticeable difference between the C-bound of CB-Boost 's majority vote and MinCq's one. However, this difference only has a small impact on CB-Boost 's performance for the first 30 iterations in train and 80 iterations in test. So even if the expected difference in C-bound optimality is noteworthy, it does not impact the performance of CB-Boost. Finally, the small gap between both the C-bounds empirically suggests that CB-Boost keeps the qualities of CqBoost and MinCq.

Conclusion
In this paper, we presented CB-Boost, a greedy C-bound minimization algorithm. While maintaining its predecessors' sparsity and accuracy properties, it has much lighter computational demands. Its optimization process relies on a theoretical result allowing CB-Boost to efficiently minimize the C-bound in one direction at a time. This algorithm keeps the training and generalization guarantees given by the C-bound (Lacasse et al. 2006) and has the interesting property to allow a quantification of the decrease of its bound and training error.
Experimentally, the comparison of CB-Boost with relevant methods shows its real improvement in computational demand, without loss of accuracy. Furthermore, experiments shows that CB-Boost slightly improves the sparsity of the models, which is the main property of CqBoost. Finally, it is competitive with four state of the art ensemble methods with regards to performance, and with Adaboost in computational efficiency, sparsity and noise robustness.
In future work, we will analyze deeper theoretical properties of CB-Boost, focusing on its dual form, finding a stronger stopping criterion and adapting CB-Boost to infinite hypothesis spaces. Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creat iveco mmons .org/licen ses/by/4.0/.

A Appendix: algorithms
Here, we briefly introduce MinCq (Germain et al. 2015) and CqBoost (Roy et al. 2016). The notation is adapted to use our paper's instead of the original authors' to avoid any confusion. -

A.1 MinCq
MinCq is simply a bound-minimizer, and therefore, its pseudo code is solving a quadratic program to output a weight vector on the hypothesis space, for details on the problem itself, see (Germain et al. 2015). [InIn] q = µ, q ≥ 02n.

A.2 CqBoost
CqBoost is a bit more complex than MinCq, so we will analyze the main steps of the pseudocode : -Lines 1 to 3 initialize the problem with a null weight vector over the voters, a uniform distribution on the examples. -For each iteration, -Line 5 finds the voter with the best weighted edge, the edge being the dual of the margin, it allows to find the voter that has the best decision, given the weights of each example. -And Line 10 solves a C-bound minimization problem to update the weights on the voters and examples.
Let us introduce the quadratic program that is solved at Line 10,

B.1 Getting a gradient boosting version of CB-Boost
To build the gradient boosting version of CB-Boost, we follow the method presented in Schapire and Freund (2012), with the C-bound as the choice of loss function, defined for any F ∈ Conv(H) as The gradient ∇C(F) = C(F(x 1 )) is given, ∀i ∈ [1..m] , by Given this result, at iteration t of the gradient boosting algorithms finds the following direction of optimization, with F k and h k defined as in Sect. 3.1: Once this direction is found, the next goal is to find the best weight for the voter (or optimization step). Here, thanks to Theorem 3, the optimal weight is given by Armed with these results, we present GB-CB-Boost in Algorithm 4 as the gradient boosting variant of CB-Boost.

B.2 Difference between CB-Boost and GB-CB-Boost
The only difference between the two greedy algorithms is the choice of the optimization direction, made in step 12 of Algorithm 1: and step 4 of Algorithm 4: In CB-Boost, the direction is chosen as the one in which the C-bound has the lowest minimum whereas in GB-CB-Boost, the choice is based on the maximum of the negative gradient. .
As seen in Sects. 5.1 and 5.2, it has an empirical impact on the computational efficiency and on the stability of the algorithm, as CB-Boost is faster and more stable than its gradient boosting counterpart. However, it does not have a significant impact on performance nor sparsity.
Concerning sheer C-bound optimization, Fig. 6 shows that CB-Boost is as optimal as gradient boosting, and even slightly better, particularly on MNist-5v3. Therefore, it would be interesting to lead a more in-depth study on the differences between these variants. For example, in Appendix C, a toy example points a case where gradient boosting needs one more optimization step than our method to find the minimum of a toy loss.

C Appendix: intuitive understanding of direction choice on a toy example
Here, we present a toy example that is meant to give the reader an intuition on the difference between gradient boosting bound minimization, and CB-Boost 's C-bound minimization process. To do so, we use a toy loss of two variables L ∶ x, y ↦ z and analyze how the two approaches tackle the optimization problem. In Fig. 7, we plot it in two dimensions, a 3D plot is available here. 5 This loss is convex and defined as Fig. 6 The empirical (training) C-bound for CB-Boost and GB-CB-Boost on the four MNist datasets presented in Table 1 over 75 boosting iterations with c 0 , c 1 , c 2 constants. In Fig. 7, we can see that when starting at the same place on the loss function's surface (the "Start" point), Gradient Boosting (GB) will choose the direction where the gradient is the lowest (x), and even with a perfectly tuned step size, will have to use two iterations to reach the loss' minima, as in this direction, it is not attainable. However as CB-Boost 's strategy is to find the direction in which the attainable minimum is the lowest (y), regardless of the gradient, CB-Boost will find one minimum in just one iteration. In Fig. 8, we projected the gradient directions and the function in 2D, in order to have a clearer point of view.
This example is not meant to prove a theoretical nor empirical superiority but to point the difference between the two methods.  Fig. 7 gradient directions, the dashed lines represent the gradient at the starting point, and the red line represents the mono-directional optimization path that is available for the algorithm. The green dots represent the optimal first step for gradient boosting ( GB 1 ) and CB-Boost ( CB 1 )

D.1 Proof of the equivalence between the distribution, and the weights version of the C-bound
Let us consider a set of weights { 1 , … , n } ∈ (ℝ + ) n that do not sum to one, and the distri-

D.2 Proof of Theorem 3
The proof that follows is not technically complex; it mainly relies on second order polynomial analysis, but it is quite long. Therefore we propose in Sect. D.3 a graph version of it that is easier to read and provides the main steps and implications.
In this proof, we will use the same notations as in the theorem, is the variable weight and its corresponding voter.

So
With, F k (x i ) ∈ ℝ and h k ( Deriving the C-bound with respect to , we obtain as the third order terms of the numerator are simplified. With

So, with our notations
For the sake of brevity, we define P( ) = C 2 2 + C 1 + C 0 . Eventually, we will use only h k that are weak classifiers, so (h k ) > 0 . This implies that (F k ) > 0 because F k is a linear combination, with only positive coefficients of weak classifiers.

D.2.1 Analysis of
Let us recall the definition of the denominator, The only way to cancel this sum of squares is if ∀i ∈ which is absurd, as we supposed (F k ) > 0 and (h k ) > 0 , or h k = − F k with ≤ 0 which is absurd as we supposed ≥ 0. So our hypotheses lead to B 2 2 + B 1 + B 0 ≠ 0, ∀ ∈ ℝ. (4) (7) We will now analyse the behaviour of B 2 2 + B 1 + B 0 without any knowledge or hypothesis on C k ( ) . We compute the discriminant So as we proved earlier that B 2 2 + B 1 + B 0 could not be cancelled on ℝ , we have D.2.2 Analysis of C � k (˛) and C k (˛) Even if, in CB-Boost, ∈ [0, +∞[ , we will analyse these function on ℝ.
If we look closer to C k ( ) , we can see that its limits in ±∞ is 1 − . Therefore, C k ( ) has an asymptotic line in ±∞.
Moreover, thanks to (5) we know that the sign of C � k ( ) only depends on the sign of P( ).
Consequently, we will analyse the sign of P( ) by exhaustion.
• If C 2 > 0 we have P( ) is a positive parabola as represented in the following Fig. 9. Let's analyse the possibilities concerning its roots.
-If P( ) has no real roots, we get a table as represented in Fig. 10. This is impossible, because C k ( ) is supposed to be strictly increasing and continuous.
So P( ) not having real roots is ABSURD. -If P( ) has exactly one real root, then We can see this equality as a second order polynom roots problem, so it can be analysed through this polynom's discriminant, However, we proved in Eq. (9) that it is ABSURD.
So P( ) can not have exactly one real root. -Consequently, P( ) has two real roots: which leads to the table in Fig. 11. Thanks to the result on the asymptotic line, this implies C k ( ) looking like Fig. 12 So + is the global argminimum of C k ( ) . In the next section, we will prove that iy is admissible in CB-Boost 's framework.
• If C 2 < 0 we use similar methods, to prove that P( ) has two real roots, obtaining Figs. 13 and 14. So, in this case − is the global argminimum. Fig. 9 The type of parabola that illustrates P( ) Fig. 10 Variation of C k ( ) depending on the sign of P( ) if it has no real roots

Fig. 11
Variation of C k ( ) depending on the sign of P( ) if it has two real roots and C 2 > 0

Fig. 13
Variation of C k ( ) depending on the sign of P( ) if it has two real roots and C 2 < 0

D.2.3 Possible argminima analysis
Preliminary results Following the previous analysis, we remind Moreover, we will present two results before the proof by exhaustion.
-First of all, let us analyze C k (0) with respect to the asymptotic line 1 −

So
Let us note, that with the same method we can prove -Secondly, we will focus on P and its square root. (12) 14 Shape of C k ( ) , if P( ) has two real roots and C 2 < 0 In order to deduce √ P , we have to know the sign of It can be developed as a second order polynomial expression in (h k ) Its discriminant is which has the same sign as (F k , h k ) 2 − F k , which is negative, as seen earlier, in Eq. 9.
> 0 as its discriminant is negative and its evaluation in 0 is positive. So Let us now pursue with the proof by exhaustion. If . So C k (0) is over the asymptotic line, so, somewhere on the blue side of the function in Fig. 15. So, necessarily, the red part of the abscissa axis is positive. Consequently + > 0.
-Now, let us suppose that C k (0) < 1 − , which is equivalent to C 1 < 0 , thanks to Eq. 13 so + = −C 1 + √ P 2C 2 , with C 2 > 0 , −C 1 > 0 and √ Fig. 15 Analysis of C k ( ) , if P( ) has two real roots and C 2 > 0 Fig. 16 Analysis of C k ( ) , if P( ) has two real roots and C 2 < 0 As a conclusion for C 2 > 0, then, C k (0) is on the blue side of the curve in Fig. 16, so the red side of the abscissa axis is negative. So, − < 0.
Let us keep in mind that C k (0) ≥ 1 − A 2 B 2 ⇒ − < 0 . However, when we use Eq.14, We also suppose that − ≥ 0 , so Which is absurd.
and − < 0 then the lowest admissible C-bound value in CB-Boost is for zero. Conclusion So if C 2 < 0 , the hypothesis does not add value in terms of C-bound so the optimal choice is to weigh it with 0.
On the other hand, if in a direction C 2 > 0 , + is the global argminimum of C k ( ).
On Fig. 17, we draw a graph of this proof. (16)

D.4.1 Proof of the quantification
Let us analyze the C-bound of the vote at the beginning of iteration t + 1, Prior knowledge Fig. 17 This representation of the later proof shows the implications that lead to the result. The implications containing the "ABS" notation represent proofs by contradictions And at the beginning of iteration t, So the numerators and denominators are = 1 − N t +c D t +c � . Yet, to be able to quantify the C-bound 's decrease, we need to focus on C Yet,

So
We subtract So, combining with I t 's expression found in Theorem 3, Similarly, So,

Then
In conclusion

D.4.2 Proof of positiveness
We have established that So, sg(S t ) = sg( F I t − (F I t , h I t ) 2 ) , yet in Appendix D.1, Eq. 9, we had the property that (F I t , h I t ) 2 − F I t < 0 . So F I t − (F I t , h I t ) 2 > 0 , so S t > 0.

E.2 MNist
To be able to analyse CB-Boost 's behaviour on larger data, we used M-Nist (LeCun and Cortes 2010) 7 in which we selected four difficult couple of classes : (0,9), (5,3), (5,6) and (7,9). As it has 784 attributes, we used 1 pair of complementary decision stumps for each attribute for the hypothesis space and 4% of the dataset ( ∼ 471 ex.) to train and the remaining examples ( ∼ 11000 ex.) to test.

E.3 Animal with attributes
Finally, to have a dataset with a large number of attributes, we used Animals with Attributes (AwA) (Lampert et al.2009) 8 by fusing two descriptors (surf-hist and cq-hist) generating 4688 attributes. As each one on its own is barely relevant, we learned 2000 decision trees of depth 3 as the hypothesis space. They where trained on randomly subsampled attributes ( 60% of the original dimension, with replacement). We selected two classes: tiger and wolf, that are very confused and provide some challenge to differentiate (we denote this dataset AwA-TvW). And one half of the dataset is used to train (546 ex.) and the other half to test (546ex.)

F.1 Data noising
In order to noise our datasets, we use a normal distribution, centred in 0 and of variable standard deviation. This distribution is then scaled with the attribute's range, added to the data and capped to the limits of the attribute.
For example, for z a black and white pixel attribute, varying in [0, 255], to generate a noise level of 0.5, a 0-centered normal distribution with standard deviation of 0.5, N(0, 0.5) was used.
For each attribute (column) of each dataset, we used its upper and lower limit to generate an adequate noise.

F.2 MNist noising
The MNist dataset required a supplementary step in the noising process, at it is mostly comprised of black or white pixels. Indeed, this peculiarity made the previously introduced noising process ineffective.Thus, the contrast of each image in the dataset was halved in order for the noise to have a bigger impact on the performances of the studied algorithms. In Fig. 18, the basic, and low contrast images are shown with and without noise, to picture