Title: LEVERAGING SIMPLE MODEL PREDICTIONS FOR ENHANCING ITS PERFORMANCE Anonymous authors Paper under double-blind review

Abstract: There has been recent interest in improving performance of simple models for multiple reasons such as interpretability, robust learning from small data, deployment in memory constrained settings as well as environmental considerations. In this paper, we propose a novel method SRatio that can utilize information from high performing complex models (viz. deep neural networks, boosted trees, random forests) to reweight a training dataset for a potentially low performing simple model such as a decision tree or a shallow network enhancing its performance. Our method also leverages the per sample hardness estimate of the simple model which is not the case with the prior works which primarily consider the complex model's confidences/predictions and is thus conceptually novel. Moreover, we generalize and formalize the concept of attaching probes to intermediate layers of a neural network to other commonly used classifiers and incorporate this into our method. The benefit of these contributions is witnessed in the experiments where on 6 UCI datasets and CIFAR-10 we outperform competitors in a majority (16 out of 27) of the cases and tie for best performance in the remaining cases. In fact, in a couple of cases, we even approach the complex model's performance. We also conduct further experiments to validate assertions and intuitively understand why our method works. Theoretically, we motivate our approach by showing that the weighted loss minimized by simple models using our weighting upper bounds the loss of the complex model.

1. INTRODUCTION:

Simple models such as decision trees or rule lists or shallow neural networks still find use in multiple settings where a) (global) interpretability is needed, b) small data sizes are available, or c) memory/computational constraints are prevalent (Dhurandhar et al., 2018b) . In such settings compact or understandable models are often preferred over high performing complex models, where the combination of a human with an interpretable model can have better on-field performance than simply using the best performing black box model (Varshney et al., 2018) . For example, a manufacturing engineer with an interpretable model may be able to obtain precise knowledge of how an out-of-spec product was produced and can potentially go back to fix the process as opposed to having little-to-no knowledge of how the decision was reached. Posthoc local explainability methods (Ribeiro et al., 2016; Bach et al., 2015; Dhurandhar et al., 2018a) can help delve into the local behavior of black box models, however, besides the explanations being only local, there is no guarantee that they are in fact true (Rudin, 2018) . There is also a growing concern of the carbon footprint left behind in training complex deep models (Strubell et al., 2019) , which for some popular architectures is more than that left behind by a car over its entire lifetime.

In this paper, we propose a method, SRatio, which reweights the training set to improve simple models given access to a highly accurate complex model such as a deep neural network, boosted trees, or some other predictive model. Given the applications we are interested in, such as interpretability or deployment of models in resource limited settings, we assume the complexity of the simple models to be predetermined or fixed (viz. decision tree of height ≤ 5). We cannot grow arbitrary size ensembles such as in boosting or bagging (Freund & Schapire, 1997) . Our method applies potentially to any complex-simple model combination which is not the case for some state-of-the-art methods in this space such as Knowledge Distillation (Geoffrey Hinton, 2015) or Profweight (Dhurandhar et al., 2018b) , where the complex model is assumed to be a deep neural network. In addition, we generalize and formalize the concept of probes presented in (Dhurandhar et al., 2018b) and provide examples of what they would correspond to for classifiers other than neural networks. Our method also uses the a priori low performing simple model's confidences to enhance its performance. We believe this to be conceptually novel compared to existing methods which seem to only leverage the complex model (viz. its predictions/confidences). The benefit is seen in experiments where we outperform other competitors in a majority of the cases and are tied with one or more methods for best performance in the remaining cases. In fact, in a couple of cases we even approach the complex model's performance, i.e. a single tree is made to be as accurate as 100 boosted trees. Moreover, we motivate our approach by contrasting it with covariate shift and show that our weighting scheme where we now minimize the weighted loss of the simple model is equivalent to minimizing an upper bound on the loss of the complex model.

2. RELATED WORK:

Knowledge Distillation (Geoffrey Hinton, 2015; Tan et al., 2017; Lopez-Paz et al., 2016) is one of the most popular approaches for building "simpler" neural networks. It typically involves minimizing the cross-entropy loss of a simpler network based on calibrated confidences (Guo et al., 2017) of a more complex network. The simpler networks are usually not that simple in that they are typically of the same (or similar) depth but thinned down (Romero et al., 2015) . This is generally insufficient to meet tight resource constraints (Reagen et al., 2016) . Moreover, the thinning down was shown for convolutional neural networks but it is unclear how one would do the same for modern architectures such as ResNets. The weighting of training inputs approach on the other hand can be more easily applied to different architectures. It also has another advantage in that it can be readily applied to models optimizing losses other than cross-entropy (viz. hinge loss, squared loss) with some interpretation of which inputs are more (or less) important. Some other strategies to improve simple models (Buciluǎ et al., 2006; Ba & Caurana, 2013; Bastani et al., 2017) are also conceptually similar to Distillation, where the actual outputs are replaced by predictions from the complex model.

In Dehghani et al. (2017) , authors use soft targets and their uncertainty estimates to inform a student model on a larger dataset with more noisy labels. Uncertainty estimates are obtained from Gaussian Process Regression done on a dataset that has less noisy labels. In Furlanello et al. (2018) , authors train a student neural network that is identically parameterized to the original one by fitting to soft scores rescaled by temperature. In our problem, the complexity of the student is very different from that of the teacher and we do compare with distillation-like schemes. Frosst & Hinton (2017) define a new class of decision trees called soft decision trees to enable it to fit soft targets (classic distillation) of a neural network. Our methods use existing training algorithms for well-known simple models. Ren et al. (2018) advocate reweighting samples as a way to make deep learning robust by tuning the weights on a validation set through gradient descent. Our problem is about using knowledge from a pre-trained complex model to improve a simple model through weighting samples.

The most relevant work to our current endeavor is ProfWeight (Dhurandhar et al., 2018b) , where they too weight the training inputs. Their method however, requires the complex model to be a neural network and thus does not apply to settings where we have a different complex model. Moreover, their method, like Distillation, takes into account only the complex model's assessment of an example's difficulty.

Curriculum learning (CL) (Bengio et al., 2009) and boosting (Freund & Schapire, 1997) are two other approaches which rely on weighting samples, however, their motivation and setup are significantly different. In both CL and boosting the complexity of the improved learner can increase as they do not have to respect constraints such as interpretability (Dhurandhar et al., 2017; Montavon et al., 2017) or limited memory/power (Reagen et al., 2016; Chen et al., 2016) . In CL, typically, there is no automatic gradation of example difficulty during training. In boosting, the examples are graded with respect to a previous weak learner and not an independent accurate complex model. Also, as we later show, our method does not necessarily up-weight hard examples but rather uses a measure that takes into account hardness as assessed by both the complex and simple models.

3. METHODOLOGY:

In this section, we first provide theoretical and intuitive justification for our approach. This is followed by a description of our method for improving simple models using both the complex and simple model's predictions. The key novelty lies in the use of the simple model's prediction, which also makes the theory non-trivial yet practical. Rather than use the complex model's prediction, we generalize a concept from (Dhurandhar et al., 2018b) where they attached probe functions to each layer of a neural network, obtained predictions using only the first k layers (k being varied up to the total number of layers), and used the mean of the probe predictions rather than the output of only the last layer. They empirically showed the extra information from previous layers to improve upon only using the final layer's output. Our generalization, which we call graded classifiers and formally define below, extracts progressive information from other models (beyond neural networks). The graded classifiers provide better performance than using only the output of complex model, as illustrated by our various experiments in the subsequent section.

3.1. THEORETICAL MOTIVATION:

Our approach in section 3.3 can be motivated by contrasting it with the covariate shift (Agarwal et al., 2011) setting. If X × Y is the input-output space and p(x, y) and q(x, y) are the source and target distributions in the covariate shift setting, then it is assumed that p(y|x) = q(y|x) but p(x) = q(x). One of the standard solutions for such settings is importance sampling where the source data is sampled proportional to q(x) p(x) in order to mimic as closely as possible the target distribution. In our case, the dataset is the same but the classifiers (i.e. complex and simple) are different. We can think of this as a setting where p(x) = q(x) as both the models learn from the same data, however, p(y|x) = q(y|x) where p(y|x) and q(y|x) correspond to the outputs of complex and simple classifiers, respectively. Given that we want the simple model to approach the complex models performance, a natural analog to the importance weights used in covariate shift is to weight samples by p(y|x) q(y|x) which is the essence of our method as described below in section 3.3. Now, let us formally show that the expected cross-entropy loss of a model is no greater than the reweighted version with an additional positive slack term. This implies that training the simple model with this reweighting is a valid and sound procedure of the loss we want to optimize.

Lemma 3.1. Let p θ (y|x) be the softmax scores on a specific model θ from simple model space Θ. Let θ * ∈ Θ be the set of simple model parameters that is obtained from a given learning algorithm for the simple model on a training dataset. Let p c (y|x) be a pre-trained complex classifier whose loss is smaller than θ * on the training distribution. Let β ≥ 1 be a scalar clip level for the ratio p c (y|x)/p θ * (y|x). Then we have:

EQUATION

Proof.

EQUATION

(a) The inequality log(wx) ≤ w log(x) + log(β) holds for all β ≥ w ≥ 1, x > 1 where β ≥ 1 is any arbitrary clip level.

Remark 1: We observe that re-weighing every sample by max(1, min( pc(y|x) p θ * (y|x) , β)) and reoptimizing using the simple model training algorithm is a sound way to optimize the cross-entropy loss of the simple model on the training data set. The reason we believe that optimizing the upper bound could be better is because many simple models such as decision trees are trained using a simple greedy approach. Therefore, reweighting samples based on an accurate complex model could induce the appropriate bias leading to better solutions. Moreover, in equation 2, the second inequality is the main place where there is slack between the upper bound and the quantity we are interested in bounding. This inequality exhibits a smaller slack if w = pc(y|x) p θ * (y|x) is not much smaller than 1 with high probability. This is typical when p c comes from a more complex model that is more accurate than that of θ * .

Remark 2: The upper bound used for the last inequality in the proof leads to a quantification of the bias introduced by weighting for a particular dataset. Note that in practice, we determine the optimal β via cross-validation.

3.2. INTUITIVE JUSTIFICATION:

Intuitively, assuming w ≥ 1 implies that the complex model finds an input easier (i.e. higher score or confidence) to classify in the correct class than does the simple model. Although in practice this may not always be the case, it is not unreasonable to believe that this would occur for most inputs, especially if the complex model is highly accurate.

The motivation for our approach conceptually does not contradict (Dhurandhar et al., 2018b) , where hard samples for a complex model are weighted low. These would still be potentially weighted low as the numerator would be small. However, the main difference would occur in the weighting of the easy examples for the complex model, which rather than being uniformly weighted high, would now be weighted based on the assessment of the simple model. This, we believe, is important information as stressing inputs that are already extremely easy for the simple model to classify will possibly not lead to the best generalization. It is probably more important to stress inputs that are somewhat hard for the simple model but easier for the complex model, as that is likely to be the critical point of information transfer. Even though easier inputs for the complex model are likely to get higher weights, ranking these based on the simple model's assessment is important and not captured in previous approaches. Hence, although our idea may appear to be simple, we believe it is a significant jump conceptually in that it also takes into account the simple model's behavior to improve itself.

Our method described in the next section is a generalization of this idea and the motivation presented in the previous section. If the confidences of the complex model are representative of difficulty then we could leverage them alone. However, many times as seen in previous work (Dhurandhar et al., 2018b) , they may not be representative and hence using confidences of lower layers or simpler forms of the complex classifier can be very helpful.

3.3. METHOD:

We now present our approach SRatio in algorithm 1, which uses the ideas presented in the previous sections and generalizes the method in (Dhurandhar et al., 2018b) to be applicable to complex classifiers other than neural networks.

In previous works (Akshayvarun Subramanya, 2017; Dhurandhar et al., 2018b) , it was seen that sometimes highly accurate models such as deep neural networks may not be good density estimators and hence may not provide an accurate quantification of the relative difficulty of an input. To obtain a better quantification, the idea of attaching probes (viz. linear classifiers) to intermediate layers of a deep neural network and then averaging the confidences was proposed. This, as seen in the previous work, led to significantly better results over the state-of-the-art. Similarly, we generalize our method where rather than taking just the output confidences of the complex model as the numerator, we take an average of the confidences over a gradation of outputs produced by taking appropriate simplifications of the complex model. We formalize this notion of graded outputs as follows:

Definition (δ-graded) Let X × Y denote the input-output space and p(x, y) the joint distribution over this space. Let ζ 1 , ζ 2 , ..., ζ n denote classifiers that output the prediction probabilities for a given input x ∈ X for the most probable (or true) class y ∈ Y determined by p(y|x). We then say that classifiers ζ 1 , ζ 2 , ..., ζ n are δ-graded for some δ ∈ (0, 1] and a (measurable

) set Z ⊆ X if ∀x ∈ Z, ζ 1 (x) ≤ ζ 2 (x) ≤ • • • ≤ ζ n (x), where x∈Z p(x) ≥ δ.

Loosely speaking, the above definition says that a sequence of classifiers is δ-graded if a classifier in the sequence is at least as accurate as the ones preceding it for inputs whose probability measure is at least δ. Thus, a sequence would be 1-graded if the above inequalities were true for the entire input space (i.e. Z = X). Below are some examples of how one could produce δ-graded classifiers for different models in practice.

• Deep Neural Networks: The notion of attaching probes, which are essentially linear classifiers (viz. σ(W x + b)) trained on intermediate layers of a deep neural network (Dhurandhar et al., 2018b; Alain & Bengio, 2016 ) could be seen as a way of creating δ-graded classifiers, where lower layer probes are likely to be less accurate than those above them for most of the samples. Thus the idea of probes as simplifications of the complex model, as used in previous works, are captured by our definition. • Boosted Trees: One natural way here could be to consider the ordering produced by boosting algorithms that grow the tree ensemble and use all trees up to a certain point. For example, if we have an ensemble of 10 trees, then ζ 1 could be the first tree, ζ 2 could be the first two trees and so on where ζ 10 is the entire ensemble. • Random Forests: Here one could order trees based on performance and then do a similar grouping as above where ζ 1 could be the least accurate tree, then ζ 2 could be the ensemble of ζ 1 and the second most inaccurate tree and so on. Of course, for this and boosted trees one could take bigger steps and add more trees to produce the next ζ so that there is a measurable jump in performance from one graded classifier to the next. • Other Models: For non-ensemble models such as generalized linear models one too could form graded classifiers by taking different order Taylor approximations of the functions, or by setting the least important coefficients successively to zero by doing function decompositions based on binary, ternary and higher order interactions (Molnar et al., 2019) , or using feature selection and starting with a model containing the most important feature(s).

Given this, we see in algorithm 1 that we take as input graded classifiers and the learning algorithm for the simple model. Trivially, the graded classifiers can just be the entire complex classifier where we only consider its output confidences. We now take a ratio of the average confidence of the graded classifiers that are at least more accurate than the simple model by γ > 0 and the simple model's confidence. If this ratio is too large (i.e. > β) we set the weight to zero and otherwise the ratio is the 

4. EXPERIMENTS:

In this section, we empirically validate our approach as compared with other state-of-the-art methods used to improve simple models. We experiment on 6 real datasets from UCI (Dheeru & Karra Taniskidou, 2017) : Ionosphere, Ovarian Cancer (OC), Heart Disease (HD), Waveform, Human Activity Recognition (HAR), and Musk. Data characteristics are given in the appendix.

4.1. UCI DATASETS SETUP:

We experiment with two complex models, namely, boosted trees and random forests, each of size 100.

For each of the complex models we see how the different methods perform in enhancing two simple models: a single CART decision tree and a linear SVM classifier. Since ProfWeight is not directly applicable in this setting, we compare with its special case ConfWeight which weighs examples based on the confidence score of the complex model. We also compare with two models that serves as a proxy to Distillation, namely Distill-proxy 1 and Distill-proxy 2 since distillation is mainly designed for cross-entropy loss with soft targets. For Distill-proxy 1, we use the hard targets predicted by the complex models (boosted trees or random forests) as labels for the simple models. For Distill-proxy-2, we use regression versions of trees and SVM for the simple models to fit the soft probabilities of the complex models. For multiclass problems, we train a separate regressor for fitting a soft score for each class and choose the class with the largest soft score. This version performed worse and numbers are relegated to the supplement. We only report numbers for Distill-proxy 1 in the main paper. Datasets are randomly split into 70% train and 30% test. Results for all methods are averaged over 10 random splits and reported in Table 8 with 95% confidence intervals.

For our method, graded classifiers based on the complex models are formed as described before in steps of 10 trees. We have 10 graded classifiers (10 × 10 = 100 trees) for both boosted trees and random forests. The trees in the random forest are ordered based on increasing performance. Optimal values for γ and β are found using 10-fold cross-validation. 

4.2. CIFAR-10 SETUP:

The setup we follow here is very similar to previous works (Dhurandhar et al., 2018b) . The complex model is an 18 unit ResNet with 15 residual (Res) blocks/units. We consider a simple model that consists of 3 Res units, 5 Res units and 7 Res units. Each unit consists of two 3 × 3 convolutional layers with either 64, 128, or 256 filters (the exact architecture is given in the appendix). A 3 × 3 convolutional layer with 16 filters serves an input to the first ResNet block, while an average pooling layer followed by a fully connected layer with 10 logits takes as input the output of the final ResNet block for each of the models.1 

4.3. OBSERVATIONS:

In the experiments on the 6 UCI datasets depicted in Table 8 , we observe that we are consistently the best performer, either tying or superseding other competitors. Given the 24 experiments based on dataset, complex model, and simple model combinations (6 × 2 × 2 = 24), we are the outright best performer in 14 of those cases, while being tied with one or more other methods for best performance in the remaining 10 cases. In fact, in 2 cases where we are outright best performers, dataset=Ionosphere, complex model =boosted trees, simple model = Tree and dataset=Musk, complex model =boosted trees, simple model = Tree, our method enhances the simple model's performance to match (statistically) that of the complex model. We believe this improvement to be significant. In fact, on the Musk dataset, we observe that the simple tree model enhanced using our method, where the complex model is a random forest, supersedes the performance of the other complex model. On the Ovarian Cancer dataset, linear SVM actually seems to perform best, even better than the complex models. A reason for this may be that the dataset is high dimensional with few examples. Due to this, it also seems difficult for any of the methods to boost the simple model's performance.

We now offer an intuition as to why our weighting works. First, we see in figure 1 (left) that our assertion of only a very small fraction of the training set being assigned 0 weights based on parameter β, which upper bounds the weights, is true (< 1% is assigned weight 0). For Ovarian Cancer (OC), SVM was better than the complex models and hence no points had weight 0.

In figure 1 (right), we see the intuitive justification for the learned weights. Given 10 nearest neighbors (NN) of a data point, let ν s and ν d denote the number of those NNs that belong to its class (i.e. same class), and most frequent different class respectively. Then the Y-axis depicts νs νs+ν d × 100. This metric gives a feel for how difficult it is likely to be to correctly classify a point. We thus see that most of the 10 NNs for the 0 weight points lie in a different class and so likely are almost impossible for a simple model to classify correctly. The highest weighted points (i.e. top 5 percentile) have nearest neighbors from the same class almost 50% of the time and are close to the most frequent (different) class. This showcases why the 0 weight points are so difficult for the simple models to classify, while the highest weighted points seem to outline an important decision boundary. With some effort a simple model should be able to classify them correctly and so focusing on them is important. The remaining points (on average) seem to be relatively easy for both complex and simple models.

On the CIFAR-10 dataset, we see that our method outperforms other state-of-the-art methods where the simple model has 3 Res units and 5 Res units. For 7 Res units, we tie with ProfWeight and ConfWeight. Given the motivation of resource limited settings where memory constraints can be stringent (Reagen et al., 2016; Chen et al., 2016) , SM-3 and SM-5 are anyway the more reasonable options. In general, we see from these experiments that the simple model's predictions can be highly informative in improving its own performance.

5. DISCUSSION:

Our approach and results outline an interesting strategy, where even in cases that one might want a simple model, it might be beneficial to build an accurate complex model first and use it to enhance the desired simple model. Such is exactly the situation for the manufacturing engineer described in the introduction that has experience with simple interpretable models that provide him with knowledge that a complex model with better performance cannot offer.

Although our method may appear to be simplistic, we believe it to be a conceptual jump. Our method takes into account the difficulty of a sample not just based on the complex model, but also the simple model which a priori is not obvious and hence possibly ignored by previous methods that may or may not be weighting-based. Moreover, we have empirically shown that our method either outperforms or matches the best solutions across a wide array of datasets for different complex model (viz. boosted trees, random forests and ResNets) and simple model (viz. single decision trees, linear SVM and small ResNets) combinations. In fact, in a couple of cases, a single tree approached the performance of a 100 boosted trees using our method. In addition, we also formalized and generalized the idea behind probes presented in previous work (Dhurandhar et al., 2018b) to classifiers beyond deep neural networks and gave examples of practical instantiations. In the future, we would like to uncover more such methods and study their theoretical underpinnings. We trained with an -2 weight decay rate of 0.0002, sgd optimizer with Nesterov momentum (whose parameter is set to 0.9), 600 epochs and batch size 128. Learning rates are according to the following schedule: 0.1 till 40k training steps, 0.01 between 40k-60k

A EXPERIMENTAL DETAILS:



:

Tensorflow 1.5.0 was used for CIFAR-10 experiments

Code is taken from: https://github.com/tensorflow/models/tree/master/research/resnet.

Figures and Tables:

Our proposed method SRatio. Input: n (graded) classifiers ζ 1 , ..., ζ n , learning algorithm for simple model L S , dataset D S of cardinality N , performance gap parameter γ and maximum allowed ratio parameter β.1) Train simple model on D S , S ← L S (D S , 1 N ) and compute its (average) prediction error S .{Obtain initial simple model where each input is given a unit weight.} 2) Compute (average) prediction errors 1 , ..., n for the n graded classifiers and store the ones that are at least γ more accurate than the simple model i.e. I ← {i ∈ {1, ..., n} | Si ≥ γ} 3) Compute weights for all inputs x as follows: w(x) = i∈I ζi(x) mS(x) , where m is the cardinality of set I and S(x) is the prediction probability/score for the true class of the simple model. 4) Set w(x) ← 0, if w(x) > β. {Ignore extremely hard examples for the simple model.} 5) Retrain the simple model on the dataset D S with the corresponding learned weights w, S w ← L S (D S , w) 6) Return S w

Figure 1: Above (left) we see the % of training set points assigned weight 0 by SRatio at optimal β values for each complex (BT, RF) and simple model (Tree, SVM) combination on the 6 UCI datasets. We see that < 1% of the training set has weights 0 in all cases. Above (right) we analyze why intuitively our reweighting seems to work by considering the % of nearest neighbors that have zero weight, high weight, and in-between weight. Results are averaged over all complex-simple model combinations. Both plots represent averaged values over 10 random train/test splits with 95% confidence intervals.

Below we see the averaged % errors with 95% confidence intervals for the different methods on six real datasets. Boosted Trees and Random Forest (100 trees) are the complex models (CM), while a single decision tree and linear SVM are the simple models (SM). Best simple model results are indicated in bold. * indicates the simple model has approached the complex models performance.

Table content: <table><tr><td/><td>Complex</td><td>CM</td><td>Simple</td><td>SM</td><td colspan="2">Distill-proxy 1 ConfWeight</td><td>SRatio</td></tr><tr><td>Dataset</td><td>Model</td><td>Error</td><td>Model</td><td>Error</td><td>Error (SM)</td><td colspan="2">Error (SM) Error (SM)</td></tr><tr><td/><td/><td/><td>Tree</td><td>10.95</td><td>10.95</td><td>11.42</td><td>8.57  *</td></tr><tr><td/><td>Boosted</td><td>8.10</td><td/><td>±0.4</td><td>±0.4</td><td>±0.8</td><td>±0.5</td></tr><tr><td/><td>Trees</td><td>±0.4</td><td>SVM</td><td>12.38</td><td>11.90</td><td>11.90</td><td>10.47</td></tr><tr><td>Ionosphere</td><td/><td/><td>Tree</td><td>±0.6 10.95</td><td>±0.6 10.95</td><td>±0.6 11.42</td><td>±0.5 10.42</td></tr><tr><td/><td>Random</td><td>6.19</td><td/><td>±0.4</td><td>±0.4</td><td>±0.4</td><td>±0.1</td></tr><tr><td/><td>Forest</td><td>±0.4</td><td>SVM</td><td>12.38</td><td>12.38</td><td>12.38</td><td>11.42</td></tr><tr><td/><td/><td/><td/><td>±0.6</td><td>±0.6</td><td>±0.6</td><td>±0.3</td></tr><tr><td/><td/><td/><td>Tree</td><td>15.62</td><td>15.62</td><td>15.62</td><td>15.62</td></tr><tr><td/><td>Boosted</td><td>4.68</td><td/><td>±0.8</td><td>±0.8</td><td>±1.0</td><td>±0.5</td></tr><tr><td/><td>Trees</td><td>±0.4</td><td>SVM</td><td>1.56</td><td>1.56</td><td>1.56</td><td>1.56</td></tr><tr><td>Ovarian Cancer</td><td/><td/><td>Tree</td><td>±0.4 15.62</td><td>±0.4 15.62</td><td>±0.4 14.06</td><td>±0.4 14.04</td></tr><tr><td/><td>Random</td><td>6.25</td><td/><td>±0.8</td><td>±0.8</td><td>±0.1</td><td>±0.1</td></tr><tr><td/><td>Forest</td><td>±0.8</td><td>SVM</td><td>1.56</td><td>1.56</td><td>1.56</td><td>1.56</td></tr><tr><td/><td/><td/><td/><td>±0.4</td><td>±0.4</td><td>±0.4</td><td>±0.4</td></tr><tr><td/><td/><td/><td>Tree</td><td>23.88</td><td>22.77</td><td>23.33</td><td>22.77</td></tr><tr><td/><td>Boosted</td><td>15.55</td><td/><td>±0.7</td><td>±0.1</td><td>±0.3</td><td>±0.2</td></tr><tr><td/><td>Trees</td><td>±0.6</td><td>SVM</td><td>17.22</td><td>16.67</td><td>17.22</td><td>16.77</td></tr><tr><td>Heart Disease</td><td/><td/><td>Tree</td><td>±0.2 23.88</td><td>±0.3 23.88</td><td>±0.2 25.55</td><td>±0.2 22.77</td></tr><tr><td/><td>Random</td><td>15.88</td><td/><td>±0.7</td><td>±0.7</td><td>±0.5</td><td>±0.3</td></tr><tr><td/><td>Forest</td><td>±0.6</td><td>SVM</td><td>17.22</td><td>17.22</td><td>16.67</td><td>16.67</td></tr><tr><td/><td/><td/><td/><td>±0.2</td><td>±0.2</td><td>±0.3</td><td>±0.2</td></tr><tr><td/><td/><td/><td>Tree</td><td>25.43</td><td>25.06</td><td>25.10</td><td>25.06</td></tr><tr><td/><td>Boosted</td><td>12.96</td><td/><td>±0.2</td><td>±0.1</td><td>±0.1</td><td>±0.1</td></tr><tr><td/><td>Trees</td><td>±0.1</td><td>SVM</td><td>14.70</td><td>15.33</td><td>14.70</td><td>13.72</td></tr><tr><td>Waveform</td><td/><td/><td>Tree</td><td>±0.2 25.43</td><td>±0.0 25.43</td><td>±0.2 25.43</td><td>±0.2 25.06</td></tr><tr><td/><td>Random</td><td>10.90</td><td/><td>±0.2</td><td>±0.2</td><td>±0.2</td><td>±0.1</td></tr><tr><td/><td>Forest</td><td>±0.1</td><td>SVM</td><td>14.70</td><td>14.33</td><td>14.30</td><td>12.72</td></tr><tr><td/><td/><td/><td/><td>±0.2</td><td>±0.0</td><td>±0.2</td><td>±0.5</td></tr><tr><td/><td/><td/><td>Tree</td><td>7.93</td><td>7.93</td><td>7.86</td><td>7.15</td></tr><tr><td/><td>Boosted</td><td>6.32</td><td/><td>±0.2</td><td>±0.1</td><td>±0.2</td><td>±0.1</td></tr><tr><td/><td>Trees</td><td>±0.0</td><td>SVM</td><td>14.56</td><td>15.85</td><td>13.92</td><td>13.92</td></tr><tr><td>Human Activity</td><td/><td/><td/><td>±0.1</td><td>±0.1</td><td>±0.1</td><td>±0.2</td></tr><tr><td>Recognition</td><td/><td/><td>Tree</td><td>7.93</td><td>7.23</td><td>7.21</td><td>6.67</td></tr><tr><td/><td>Random</td><td>2.34</td><td/><td>±0.2</td><td>±0.1</td><td>±0.1</td><td>±0.0</td></tr><tr><td/><td>Forest</td><td>±0.0</td><td>SVM</td><td>14.56</td><td>13.92</td><td>14.24</td><td>13.92</td></tr><tr><td/><td/><td/><td/><td>±0.1</td><td>±0.1</td><td>±0.1</td><td>±0.1</td></tr><tr><td/><td/><td/><td>Tree</td><td>4.49</td><td>6.11</td><td>4.45</td><td>4.06  *</td></tr><tr><td/><td>Boosted</td><td>4.06</td><td/><td>±0.1</td><td>±0.1</td><td>±0.1</td><td>±0.1</td></tr><tr><td/><td>Trees</td><td>±0.1</td><td>SVM</td><td>6.11</td><td>6.29</td><td>6.41</td><td>5.48</td></tr><tr><td>Musk</td><td/><td/><td>Tree</td><td>±0.1 4.49</td><td>±0.1 4.49</td><td>±0.1 4.47</td><td>±0.1 3.89</td></tr><tr><td/><td>Random</td><td>2.45</td><td/><td>±0.1</td><td>±0.1</td><td>±0.1</td><td>±0.1</td></tr><tr><td/><td>Forest</td><td>±0.1</td><td>SVM</td><td>6.11</td><td>6.16</td><td>5.96</td><td>5.53</td></tr><tr><td/><td/><td/><td/><td>±0.1</td><td>±0.1</td><td>±0.1</td><td>±0.1</td></tr></table>

Below we observe the averaged accuracies (%) of simple models SM-3 (3 Res units), SM-5 (5 Res units) and SM-7 (7 Res units) trained with various weighting methods and distillation. The complex model achieved 84.5% accuracy. Statistically significant best results are indicated in bold.We form 18 graded classifiers by training probes which are linear classifiers with softmax activations attached to flattened intermediate representations corresponding to the 18 units of ResNet (15 Res units + 3 others). As done in prior studies, we split the 50000 training samples from the CIFAR-10 dataset into two training sets of 30000 and 20000 samples, which are used to train the complex and simple models, respectively. 500 samples from the CIFAR-10 test set are used for validation and hyperparameter tuning (details in appendix). The remaining 9500 are used to report accuracies of all the models. Distillation (Geoffrey Hinton, 2015) employs cross-entropy loss with soft targets to train the simple model. The soft targets are the softmax outputs of the complex model's last layer rescaled by temperature t = 0.5 which was selected based on cross-validation. For ProfWeight, we report results for the area under the curve (AUC) version as it had the best performance in a majority of the cases in the prior study. Details of β and γ values that we experimented with to obtain the results in Table2are in the appendix.

Table content: <table><tr><td/><td>SM-3</td><td>SM-5</td><td>SM-7</td></tr><tr><td>Standard</td><td>73.15 (± 0.7)</td><td colspan="2">75.78 (±0.5) 78.76 (±0.35)</td></tr><tr><td colspan="4">ConfWeight 76.27 (±0.48) 78.54 (±0.36) 81.46 (±0.50)</td></tr><tr><td colspan="4">Distillation 65.84 (±0.60) 70.09 (±0.19) 73.4 (±0.64)</td></tr><tr><td colspan="4">ProfWeight 76.56 (±0.51) 79.25 (±0.36) 81.34 (±0.49)</td></tr><tr><td>SRatio</td><td colspan="3">77.23 (±0.14) 80.14 (±0.22) 81.89 (±0.28)</td></tr></table>

Dataset characteristics, where N denotes dataset size and d is the dimensionality.

Table content: <table><tr><td>Dataset</td><td>N</td><td>d</td><td colspan="2"># of Classes</td></tr><tr><td>Ionosphere</td><td>351</td><td>34</td><td colspan="2">2</td></tr><tr><td>Ovarian Cancer</td><td>216</td><td>4000</td><td colspan="2">2</td></tr><tr><td>Heart Disease</td><td>303</td><td>13</td><td colspan="2">2</td></tr><tr><td>Waveform</td><td>5000</td><td>40</td><td colspan="2">3</td></tr><tr><td colspan="2">Human Activity 10299</td><td>561</td><td colspan="2">6</td></tr><tr><td>Musk</td><td>6598</td><td>166</td><td colspan="2">2</td></tr><tr><td>CIFAR-10</td><td colspan="2">60000 32 × 32</td><td colspan="2">10</td></tr><tr><td>Units</td><td/><td colspan="2">Description</td></tr><tr><td>Init-conv</td><td/><td colspan="3">[ 3 × 3 conv, 16 ]</td></tr><tr><td>Resunit:1-0</td><td/><td colspan="2">3 × 3 conv, 64 3 × 3 conv, 64</td></tr><tr><td colspan="2">(Resunit:1-x)× 4</td><td colspan="2">3 × 3 conv, 64 3 × 3 conv, 64</td><td>× 4</td></tr><tr><td>(Resunit:2-0)</td><td/><td colspan="2">3 × 3 conv, 128 3 × 3 conv, 128</td></tr><tr><td colspan="2">(Resunit:2-x)× 4</td><td colspan="2">3 × 3 conv, 128 3 × 3 conv, 128</td><td>× 4</td></tr><tr><td>(Resunit:3-0)</td><td/><td colspan="2">3 × 3 conv, 256 3 × 3 conv, 256</td></tr><tr><td colspan="2">(Resunit:3-x)× 4</td><td colspan="2">3 × 3 conv, 256 3 × 3 conv, 256</td><td>× 4</td></tr><tr><td/><td colspan="2">Average Pool</td><td/></tr><tr><td colspan="4">Fully Connected -10 logits</td></tr></table>

18 unit Complex Model with 15 ResNet units.

Table content: <table/>

Residual Network Model used as the complex model for CIFAR-10 experiments in Section 4.2

Table content: <table><tr><td colspan="3">Simple Model IDs Additional Resunits Rel. Size</td></tr><tr><td>SM-3</td><td>None</td><td>≈ 1/5</td></tr><tr><td>SM-5</td><td>(Resunit:1-x)×1</td><td>≈ 1/3</td></tr><tr><td/><td>(Resunit:2-x)×1</td><td/></tr><tr><td>SM-7</td><td>(Resunit:1-x)×2</td><td/></tr><tr><td/><td>(Resunit:2-x)×1</td><td>≈ 1/2</td></tr><tr><td/><td>(Resunit:3-x)×1</td><td/></tr></table>

Additional Resnet units in the Simple Models apart from the commonly shared ones. The last column shows the approximate size of the simple models relative to the complex neural network model in the previous table.

Table content: <table><tr><td>A.1 ADDITIONAL TRAINING DETAILS</td></tr><tr><td>CIFAR-10 Experiments</td></tr><tr><td>Complex Model Training:</td></tr></table>

Peer review (iclr2020):
The paper proposes a means of improving the predictions of a *simple* (low-capacity) model. The idea is to take the predictions of a *complex* (high-capacity) model, and weight the loss in the simple model based on the ratio of complex to simple models* predictions. Intuitively, this seeks to focus on instances which the complex model can fit, but the unweighted simple model cannot. Experiments show the proposed method to have some benefits over existing approaches. The application of importance-weighting to the *model distillation* problem is interesting, and the paper gives a reasonable intuition for why this approach might work. One general comment is that in contrasting their approach to a number of existing approaches, they note that several of them are typically employed with fairly complex simple models (e.g., neural networks). This may be true, but it was not clear that any of them require this to be the case. Surely they can also be used with simple models as ones you consider in the paper? In this case, I would*ve liked more elucidation as to why the proposed method can be expected to offer superior performance. The theoretical justification of the approach is provided by means of Lemmas 3.1 and 3.2, for which I have some comments: - Lemma 3.1: the notation here is a bit imprecise. In general, a loss for example (x, y) takes in a true label y and predicted score z(x). You refer to the loss of a probabilistic prediction p(y | x), but do not refer to the actual label y itself. From the proof, it is implicit that you are considering y to be binary, and the use of a margin loss. This is ok, but for the hinge loss one doesn*t use a probability estimate p(y | x) as input to the loss, but rather, a real-valued score. I think the result itself could be proven by noting that if ? is non-increasing and q < p, then ?(p)/?(q) <= 1 < p/q. - Lemma 3.2: the result is interesting, but it seems that for practical purposes you are only using the first term, since it is the only quantity that depends on ?. Since max(1, .) >= 1 and -log p?(y | x) >= 0, it seems one could trivially bound the LHS by the first term since -log p?(y | x) <= max(1, .) * -log p?(y | x)? Would this not suffice for the purposes of justifying your method? It should also be noted here how the subsequent requirement that the weights be capped (so as to prevent outliers) fits into the analysis. In describing the method itself, the authors introduce a notion of ?-graded subsets. I found this to be a bit difficult to parse, and it was not clear why this notion was needed. It does not seem to feature in the description of Algorithm 1, nor the subsequent discussion. On the other hand, I felt that the meaning and need for parameters ? and ? ought to have been discussed more prominently upfront. The experiments show favourable performance of the proposed method over baselines, including the distillation approach of Hinton. The datasets are mostly small-scale, but this is in keeping with the goal of the paper, viz. addressing scenarios where simple models may be desired. Per earlier comments, I did not have a deep sense of what additional information the proposed method exploits so as to improve performance. I gather that the weighting including the predictions of the simple model is one difference; it might have been nice to give a sense of what fraction of points this amplifies or suppresses, compared to just using the predictions of the complex model. There is a nice illustration in Fig 1 (right) as to the class-labels of the training samples assigned various weights. This shows that points with low weight tend to have low agreement with their neighbours* labels. One question is how using a nearest neighbour probability estimate itself (i.e., using this as the *complex* model) would fare. Minor comments: - the title is a bit confusing. It is not clear what *its* refers to. You are leveraging the predictions of a complex model to enhance those of a simple model? - the text has a number of long sentences that could benefit from rewriting or splitting. - proof of Lemma 3.2, use cdot not *. - proof of Lemma 3.2, ?* should use superscript. - Fig 1, the caption is overlong. Most of this should be in the text. - Fig 1, use crisper fonts for the text.