L EARNING S URROGATE L OSSES
Anonymous authors
Paper under double-blind review
A BSTRACT
The minimization of loss functions is the heart and soul of Machine Learning.
In this paper, we propose an off-the-shelf optimization approach that can seamlessly minimize virtually any non-differentiable and non-decomposable loss function (e.g. Miss-classiﬁcation Rate, AUC, F1, Jaccard Index, Mathew Correlation Coefﬁcient, etc.).
Our strategy learns smooth relaxation versions of the true losses by approximating them through a surrogate neural network.
The proposed loss networks are set-wise models which are invariant to the order of mini-batch instances.
Ultimately, the surrogate losses are learned jointly with the prediction model via bilevel optimization.
Empirical results on multiple datasets with diverse real-life loss functions compared with state-of-the-art baselines demonstrate the efﬁciency of learning surrogate losses.
I NTRODUCTION
In reality, a large set of loss functions cannot be directly minimized by gradient-based methods because they are either piece-wise continuous, non-differentiable, or non-decomposable (Zhang et al., 2018).
For example, binary classiﬁcation models are often evaluated using the miss-classiﬁcation rate (MCR), Area under the ROC curve (AUC), F1 measure (F1), Jaccard Similarity Index (JAC), Average
Precision (AP), Equal Error Rate (EER), or the Mathew Correlation Coefﬁcient (MCC).
On the other hand, learning-to-rank models are measured through the Normalized Discounted Cumulative
Gain (NDCG), or the Mean Average Precision (MAP).
To illustrate the point, Figure 1 shows the challenging surfaces of common binary classiﬁcation losses.
Unfortunately, there exists no tractable omni-solver so far, i.e. no off-the-shelf optimization strategy to train prediction models for the aforementioned category of loss functions.
It is worth pointing out that non-gradient-based approaches, such as evolutionary computing, are intractable from a runtime perspective.
While there exists a plethora of methods that tackle various aspects of particular losses, there is no single gradient-based method that can optimize any loss in a seamless manner.
Researchers have so far focused on deriving smooth surrogate relaxations (approximations) to the true loss functions (Berman et al., 2018; Eban et al., 2017), in a way that ﬁrst- and second-order optimization techniques can beneﬁt from the derivative of the surrogates with respect to the parameters of prediction models.
For instance, the widely-applied cross-entropy loss is a surrogate relaxation of the miss-classiﬁcation rate.
However, these explicit relaxations are hand-crafted individually for each loss and do not generalize to other losses.
In this paper, we present the ﬁrst off-the-shelf optimizer for arbitrary loss functions.
In contrast to the related work, this work proposes a new perspective on minimizing loss functions, by deﬁning surrogate losses as meta-level neural networks that approximate the desired true non-differentiable losses.
Our method does not need the gradient information of the true loss with respect to the parameters of the prediction model and treats the loss as a black-box function.
In addition, we introduce a set-based surrogate network that computes the loss over the training set, being invariant to the order of instances, in order to accurately handle non-decomposable losses.
The surrogate learning problem is formalized as a bilevel programming task (Colson et al., 2007;
Franceschi et al., 2018) that is trained through a concurrent optimization algorithm.
This paper shows that universal surrogates, which are trained without paying attention to a speciﬁc dataset, are sub-optimal compared to surrogates learned in a per-dataset manner.
Results on nine datasets demonstrate that learning surrogates produces more accurate prediction models than state-of-the-art baselines with regard to diverse loss functions.
[Figure]
1 ˆ Y
[Figure]
−
[Figure]
ˆ Y j
MCR − 1 ˆ Y i −
AUC − 1 ˆ Y i −
EER − 1 ˆ Y i −
AP − 1 ˆ Y i −
F
R ELATED W ORK
Due to the non-differential and non-continuous nature of most real-life losses, early works deployed the proxies of the miss-classiﬁcation rate (e.g. cross-entropy) as universal proxy losses, despite their sub-optimal performance (Cortes & Mohri, 2004).
Subsequent approaches relied on designing smooth relaxations of the losses.
As an example, the pairwise ranking loss is a common surrogate of the
AUC measure (Gao & Zhou, 2015; Chen et al., 2009).
On the other, hand, the F-measure is another typical loss that cannot be optimized directly due to its non-decomposable nature over instances.
The initial papers tackling F1 focused instead on the empirical utility maximization paradigm (Ye et al., 2012).
Later on, researchers addressed F1 by optimizing the hyper-parameters of standard binary classiﬁers, either the cost-sensitive weights of the classiﬁcation loss (Puthiya Parambath et al., 2014), or the threshold of the estimated target values (Lipton et al., 2014; Koyejo et al., 2014).
Nevertheless, the non-decomposable trait of F1 remains unresolved (Zhang et al., 2018) and recent works have explored directions to improve hyper-parameter tuning with tighter bounds (Bascol et al., 2019).
Instead of relying on explicit surrogates, another research direction handles non-convex losses by means of the direct loss method (Hazan et al., 2010), which minimizes a surrogate loss by embedding the true loss as a correction term.
This method was recently extended to optimize neural networks (Song et al., 2016).
It assumes the loss can be decomposed into per-instance sub-losses and the authors derived an explicit decomposition of the average precision (Song et al., 2016).
Unfortunately, per-instance dis-aggregations are not trivially feasible in other cases (e.g. F1), making the direct loss optimization technique an impractical off-the-shelf option.
Two more recent papers have offered relaxation surrogates for non-decomposable losses, concretely the AUC and the Jaccard Index (known as Intersection over Union in the computer vision community).
The ﬁrst method deﬁnes relaxation forms for the building blocks of a confusion matrix (e.g. true positives, true negatives etc.)
and combines the building block relaxations to create a ﬁnal surrogate for losses like the AUC (Eban et al., 2017).
However, this model does not handle cases where the loss is not expressible into confusion matrix blocks, for instance the Jaccard index.
On the other hand, the second paper proposes the Lovasz soft-max as a smooth approximation to the Jaccard index (Berman et al., 2018), which is based on a generic decomposition of sub-modular (decomposable) losses for sets (Yu & Blaschko, 2015).
Besides that, a stream of recent papers has focused on meta-learning for loss functions.
The ”Learning to Teach” paradigm (Fan et al., 2018) proposes a meta-level teacher/controller that continuously updates the loss function for a prediction model based on its progress.
The work has been recently extended to enable a gradient-based learning of the teacher/controller (Wu et al., 2018).
However, this approach does not extend to non-decomposable loss functions which are deﬁned over the full set of instances.
A parallel stream of research has elaborated the concept of ”Learning to Learn”
(Li & Malik, 2017), or ”Learning to Optimize” (Chen et al., 2017), which proposes to directly learn the amount of update values that are applied to the parameters of the prediction model.
In the proposed framework a controller uses per-parameter learning curves comprised of the loss values and derivatives of the loss with respect to each parameters (Chen et al., 2017).
This method suffers from two drawbacks that prohibit its direct applicability to arbitrary losses: i) for large prediction models it is computationally infeasible to store the learning curve of every parameter, and ii) there is no gradient information for non-differentiable losses.
An alternative approach towards learning loss functions analyzes the usage of discriminative adversarial networks (dos Santos et al., 2017).
The idea focuses on discriminating the probability of a given target variable value into either being an estimated target or the true one, therefore acting as a form of surrogate loss (dos Santos et al., 2017).
Last, but not least, our method shares similarities with the concept of error-critic model for function approximation (Pang & Werbos, 1998).
In contrast to the prior work, we propose the ﬁrst off-the-shelf optimization method that seamlessly minimizes any loss function.
In Section 4.3 we empirically compare the proposed method against multiple state-of-the-art relaxations, with regards to minimizing popular binary classiﬁcation losses, such as
AUC, F1, Jaccard Index and the miss-classiﬁcation rate.
S URROGATE L EARNING
Data mini-batches ( x, y ) :
= { ( x 1 , y 1 ) , . . .
, ( x N , y N ) } of N instances each, with features x ∈ R N × M and ground-truth targets y ∈ Y N , are drawn from a dataset D with a sampling distribution P D ( x, y ) , where typically P is the uniform distribution.
The target domain can be binary y ∈ { 0 , 1 } N , or nominal among C categories y ∈ { 1 , . .
, C } N .
Ultimately, the purpose of a prediction model is to estimate a target variable ˆ y ( x ; α ): R N × M → R N , where the prediction model has parameters α .
The estimations ˆ y ∈ R N need to accurately match the given ground-truth target variable y ∈ Y N with regards to a desired loss function (cid:96) ( y, ˆ y ) :
R N × Y N → R .
Therefore, supervised learning focuses on computing the optimal parameters α ∗ that minimize the following objective.
[Equation]
To minimize the aforementioned objective through ﬁrst- or second-order optimization, it is necessary to deﬁne the gradients ∂(cid:96)∂α .
Unfortunately, in most real-world cases the loss represents step functions that are only piece-wise continuous (MCR, F1, AUC, etc.).
Therefore, the derivatives are either zero, or undeﬁned at the function steps, which prohibits a direct optimization of these losses.
For this reason, a smooth surrogate relaxations of the loss functions is used instead of the true loss.
Arguably the most popular surrogate is cross-entropy, which is a relaxation of the miss-classiﬁcation rate.
Yet, such non-parametric relaxation functions are not trivially derivable when the loss is nondecomposable into per-instance components (e.g. F1, AUC), because such losses are deﬁned as performance measures over an entire set of instances.
Instead of deriving one explicit hand-crafted function ˆ (cid:96) for the surrogate of every loss function (cid:96) , we propose a method that parameterizes and learns the surrogate for any demanded loss function through an off-the-shelve procedure.
Neural networks are a good choice for parametrizing the surrogate loss ˆ (cid:96) given their universal approximation capability (Hornik, 1991).
However, the surrogate loss network must be a permutation-invariant set model, whose output must remain ﬁxed given different orders of instances within a dataset mini-batch, i.e. ˆ (cid:96) ( y 1 , . . .
, y N , ˆ y 1 , . . .
, ˆ y N )
=
ˆ (cid:96) (cid:0) y π (1) , . . .
, y π ( N ) , ˆ y π
, ˆ y π ( N ) (cid:1) for any index permutation π .
Our method uses the KolmogorovArnold representation theorem (Tikhomirov, 1991) and deﬁnes the surrogate loss of Equation 2 as a composition function h of per-instance functions g .
This type of aggregation was recently applied to learning neural networks over sets of instances (Zaheer et al., 2017).
[Equation]
where g : R 2 → R Q , and h : R Q → R are deep forward neural networks.
The ﬁrst function g extracts
Q latent error components for the predictions on each instance (e.g. latent representations of false positive, false negative, etc.)
, while the aggregation produces set-wise performance indicators (e.g. potentially latent representation of the count of true positives, false positives, error rate, etc.).
The function h creates nonlinear combinations of set-wise performance indicators to produce complex latent error metrics such as precision, recall, F1, etc.
It has been proven that with sufﬁcient capacities for g and h , any permutation-invariant set function (hence any loss) can be approximated via the Kolmogorov-Arnold (KA) representation theorem (Za- heer et al., 2017).
In particular, it is worth mentioning that due to being an instance of the KA superposition, the proposed surrogate model of Equation 2 beneﬁts from existing error bound guarantees of such a representation when the functions g and h are deep neural networks (Montanelli &
Yang, 2019).
The remaining sections of this paper detail a novel method for optimizing surrogate losses.
3. U NIVERSAL S URROGATES
The ﬁrst intuition is to learn the weights β of surrogate network (a.k.a.
the functions g and h ) in a universal manner by solving the objective of Equation 3.
In other words, we can attempt to make any surrogate loss ˆ (cid:96) behave as any true loss (cid:96) over the space of all possible batches of randomly-drawn true y and estimated ˆ y targets.
Focusing on binary classiﬁcation losses, we sample the ground truth from a Bernoulli distribution, and respective estimated targets from a Gaussian distribution.
Furthermore, the meta-loss L : R × R → R measures the distance between the true and surrogate losses and is practically implemented as an L 1 norm.
[Equation]
The challenge of learning a universal surrogate is in ensuring that the sampling hyper-parameters ( p, µ, σ ) would lead to drawing ( y, ˆ y ) that match the speciﬁc target distribution of a concrete dataset.
Therefore, we empirically found out that it is sub-optimal to universally relax the whole space of the true loss.
Instead, as future sections will detail, it is more efﬁcient to design a relaxation in a dataset-speciﬁc manner, which smoothens only the speciﬁc regions of the true loss which belong to the respective dataset-speciﬁc distributions of true and estimated target batches.
3. S URROGATE L EARNING AS B ILEVEL P ROGRAMMING
A different approach from the universal surrogate is to associate a surrogate loss to each dataset.
In that manner, the surrogate creates a smooth relaxation only around the dataset-relevant regions of the target ( y, ˆ y ( x ; α )) space.
We propose to jointly optimize the prediction model parameters ( α ) and the surrogate loss parameters ( β ) through the following optimization:
[Equation]
The rationale is that Equation 4 optimizes the prediction model in order to minimize the surrogate loss.
However, the surrogate loss should approximate the true loss, which is ensured by Equation 5.
Such interdependence can be addressed by treating both objectives of Equations 4 and 5 as a concurrent relationship, in a way that we can optimize them jointly and simultaneously.
This dual objective is an instance of a bilevel programming problem (Colson et al., 2007; Franceschi et al., 2018).
Algorithm 1 sketches the minimization procedure of the proposed surrogate learning.
In an alternating fashion, the surrogate minimization is carried out for K α steps (lines 4 − 7 ), while the surrogate loss is updated for K β steps (lines 9 − 12 ).
To illustrate the mechanism, Figureprovides a minimalistic example of optimizing jointly the bilevel programming objectives for training a single-parameter model on a single-feature binary dataset.
The plots show the effect of minimizing the surrogate (magenta), as the parameter α is updated towards the minimum of the surrogate.
At the same time, we observe that the surrogate is updated to match the true miss-classiﬁcation-rate loss (cyan) at the current parameter value.
The model converges close to the optimal true loss after applying the steps of Algorithm 1.
3. N OTE ON CONVERGENCE
It is possible to analyze the convergence of Algorithm 1 following existing proofs for bilevel programming (Revalski & Zhivkov, 1993; Franceschi et al., 2018), since Equations 4-5 can be rewritten
[Figure]
Y =
Y =0 .0 .
4 α 0 .0 .
M C R
Batch:0 .0 .
4 α 0 .0 .
M C R
Batch:ˆ ‘ ‘
Current α 0 .0 .
4 α 0 .0 .
M C R
Batch:
Input : Dataset D , Loss (cid:96) , Training epochs T , Update steps K α , K β , Learning rates η α , η β .
1 Initialize α , β 2 for 1 , . .
, T do α (0) ← α for k = 1 , . . .
, K α do
Sample batch ( x, y ) ∼ P D ( x, y )
α ( k ) ← α ( k − 1)
− η α ( k − 1) ∇ α ˆ (cid:96) (cid:0) y,
ˆ y (cid:0) x ; α ( k − 1) (cid:1) ; β (cid:1) end α ← α
( K α ) , β (0) ← β for k = 1 , . .
, K β do
Sample batch ( x, y ) ∼ P D ( x, y ) β ( k ) ← β ( k − 1) − η β ( k − 1) ∇ β L (cid:16)
[Table] [Table]
in a standard bilevel programming form: min α ∈A ˆ (cid:96) ( α, β ∗ ( α )) , β ∗ ( α ) =
arg min β ( α ) L ( α, β ( α )) .
However, the assumptions of the proofs offered by the related work are violated in the case where both considered models ˆ l, L are deep neural networks (Franceschi et al., 2018).
For example, the assumption necessitating the optimal loss parameters arg min β ( α ) L ( α, β ( α )) to represent a singleton for every α ∈ A would not hold as there exist continuum many global minima.
Nevertheless, we empirically observed that the proposed bilevel optimization problem of Equations 4-5 converges well in practice under the optimization regime of Algorithm 1, visually observable through the exemplifying convergence plots of Section 4.2.
E XPERIMENTS 4. P ROTOCOL
The experiments are focused on a collection of publicly-available binary classiﬁcation datasets, whose statistics are presented in Table 1.
We split the data randomly into 80% training and 20% testing instances.
The prediction model ˆ y has an architecture of [100 , 30 , 10 , 1] neurons with LeakyReLU activation, where batch normalization was applied at each layer.
In addition, after each batch normalization we added a drop-out regularization layer with the drop rate set to 0.2.
The surrogate network component g has [30 , 30] neurons, while h has [10 , 10 , 1] neurons.
We employed the Adam optimizer for training the network, with initial learning rates being η α = η β = 10 − 5 .
[Table]
Furthermore, to improve the convergence stability we clipped the gradients by a norm of 10 − 5 , which is necessary due to the steep curvature of the surrogate losses ˆ (cid:96) , caused by approximating the step-wise true loss surfaces (cid:96) .
Data batches were drawn in a stratiﬁed random fashion (50% positive and 50% negative) with a mini-batch size N = 100 .
The update steps were chosen as K α =and K β =
and Algorithm 1 was run for 300000 iterations.
We conducted experiments with 7 binary classiﬁcation measures, namely AUC, Equal Error Rate (EER), Average Precision (AP),
Miss-classiﬁcation rate (MCR), F1, Mathew Correlation Coefﬁcient (MCC), Jaccard Coefﬁcient (JAC).
All the measures are converted to a loss by a 1 − x conversion, except for EER and MCR.
For the losses that demand converting the predictions ˆ y into binary values (e.g. MCR, F1, MCC), we used a thresholding ˆ y ≥ γ , where γ was optimized for each dataset and loss.
The following results of
Sections 4.2-4.3 present the performance on the test sets.
4. A BLATION OF S URROGATE M ODELS
This section addresses whether the surrogate should be trained in a universal manner (Section 3.1), or whether they should be optimized on a per-dataset basis following the bilevel programming of
Section 3.2.
For this reason, we designed three different modalities for surrogate learning:
• Universal Surrogate (SL-U): Learn the surrogate ˆ (cid:96) using Equation 3 with hyperparameters p = 0 .
5 (due to stratiﬁed sampling), µ = 0 , σ = 1 , and then train only the prediction model f by minimizing ˆ (cid:96) through Equation 4.
• Learned from Scratch (SL-S): Initialize the surrogate network ˆ (cid:96) from scratch (randomly), then optimize both Equations 4-5 using Algorithm 1.
• Reﬁned Surrogate (SL-R): Initialize the surrogate with the universal solution of Equation 3, and then reﬁne the surrogate by optimizing both Equations 4-5 using Algorithm 1.
Table 2 shows the results of the ablation study with the 3 variations of surrogate learning on 7 losses and 9 datasets.
We notice that the universal surrogates (SL-U) are overall sub-optimal with respect to the ones trained in a per-dataset manner (SL-R, SL-S), except for the AUC loss.
In addition, the results indicate that there is not a major difference in terms of accuracy between SL-R and
SL-U.
The reﬁned surrogate improves the convergence of the optimization procedure, as Figure 3 shows.
4. C OMPARISON WITH THE S TATE - OF - THE - ART
In order to demonstrate the usefulness of learning surrogates, we will compare our method against the state-of-the art baselines of four popular loss functions: MCR, AUC, F1 and JAC.
Concretely, cross-entropy is the relaxation of MCR, while Pairwise Ranking (Gao & Zhou, 2015; Chen et al., 2009) and Global Objective (Eban et al., 2017) are the relaxations of AUC.
Furthermore, the Lovasz
Soft-Max is the relaxation of JAC (Berman et al., 2018; Yu & Blaschko, 2015), and the cost-sensitive reduction (Puthiya Parambath et al., 2014) serves as the surrogate of F1.
All the aforementioned baselines, except the cost-sensitive reduction, have no further hyper-parameters and were implemented based on the authors’ codes.
For a ceteris paribus comparison, we used the same capacity prediction
[Table]
R 0.
SL-S 0.
Susy
SL-U 0.
SL-R 0.
SL-S 0.
Ranks
SL-U 1.
SL-R 2.
SL-S 1.
[Figure] [Figure]
6 S
[Figure]
- S
AUC
[Figure]
L ‘ Test
EER ˆ ‘
L ‘ Test
AP ˆ ‘
L ‘ Test
MCC ˆ ‘
L ‘ Test
F ˆ ‘
L ‘ Test
MCR ˆ ‘
L ‘ Test
[Figure]
L ‘
[Figure]
ˆ ‘
L ‘ Test
[Figure]
ˆ ‘
L ‘ Test 5000Epoch
ˆ ‘
L ‘ Test 5000Epoch
ˆ ‘
L ‘ Test 5000Epoch
ˆ ‘
L ‘ Test
[Table]
model for the baselines, the same batch size,
i
[Table]
e. the same protocol as in Section 4.1.
The hyperparameter of the cost-sensitive reduction, namely the positive weight coefﬁcient was tuned among { 0 . 3 , 0 . 9 , 2 . 7 , 8 . 1 , 24 . 3 , 72 . 9 } on a separate validation set.
To ensure that the baselines converged, we trained them for 1 M iterations with a learning rate of 10 − 4 .
Table 3 presents the results over the 9 datasets, where the reﬁned surrogate learning SL-R is compared to the 5 state-of-the-art relaxation methods for 4 losses.
The evidence suggests that surrogate learning yields more accurate prediction models than the state-of-the-art
[Table] [Table]
4. R UNTIME C OMPLEXITY
Denoting the capacities as α ∈ R Q α
[Table]
β ∈ R Q β
[Table]
the runtime complexity of Algorithm 1 is
O ( T × ( K α × ( Q α + Q β ) + K β × Q β )) , while that of gradient descent for minimizing the crossentropy (CE) is O
( T × K α × Q α ) .
The additive complexity comes from ∂ ˆ (cid:96)∂ ˆ y ∂ ˆ y∂α where O (cid:16) ∂ ˆ (cid:96)∂ ˆ y (cid:17) is
O ( Q β ) in the case of surrogate learning.
When deploying on an Intel Xeon E5-2670 server with 40 cores, it took SL-R circa 26 hours and 38 minutes to train the prediction model of Section 4.
with the MCR loss on the Susy dataset for 1M batches.
Under an identical setup, the cross-entropy baseline completed in circa 6 hours and 17 minutes.
C ONCLUSION
The optimization of losses is a major challenge for the machine learning community.
Unfortunately, most classiﬁcation loss functions are only piece-wise continuous, non-differentiable and non-decomposable.
So far, researchers have addressed this bottleneck by designing (hand-crafting) smooth approximative surrogate functions to those losses.
In contrast to the existing work, we propose a new paradigm to optimizing loss functions, by deﬁning the loss itself as a parametric model that is jointly optimized with a prediction model, in a way that the smooth surrogate loss matches the non-differentiable true loss.
The task is formalized as a bilevel programming objective and an alternating optimization algorithm is applied to learn the surrogates.
The empirical results on multiple real-life datasets indicate that learning surrogates is more accurate than hand-crafted explicit relaxations in diverse popular loss functions, such as AUC, F1, or Jaccard Index.