D-GAN: D IVERGENT GENERATIVE ADVERSARIAL APPROACH FOR POSITIVE - UNLABELED LEARNING AND COUNTER - EXAMPLES GENERATION
Anonymous authors
Paper under double-blind review
A BSTRACT
Positive Unlabeled (PU) learning consists in learning to distinguish samples of our class of interest, the positive class, from the counter-examples, the negative class, by using positive labeled and unlabeled samples during the training.
Recent approaches exploit the GANs abilities to address the PU learning problem by generating relevant counter-examples.
In this paper, we propose a new GAN-based PU learning approach named Divergent-GAN (D-GAN).
The key idea is to incorporate a standard Positive Unlabeled learning risk inside the GAN discriminator loss function.
In this way, the discriminator can ask the generator to converge towards the unlabeled samples distribution while diverging from the positive samples distribution.
This enables the generator convergence towards the unlabeled counterexamples distribution without using prior knowledge, while keeping the standard adversarial GAN architecture.
In addition, we discuss normalization techniques in the context of the proposed framework.
Experimental results show that the proposed approach overcomes previous GAN-based PU learning methods issues, and it outperforms two-stage state of the art PU learning performances in terms of stability and prediction on both simple and complex image datasets.
I NTRODUCTION
Nowadays, the number of available labeled datasets dedicated to perception applications has considerably augmented (Russakovsky et al., 2015), (Yu et al., 2015), (Cordts et al., 2016).
However, when the learning methods trained on these datasets are applied on real data, their performances are likely to deteriorate.
Consequently, it is necessary to use a dataset specialized for the given target application.
It turns out that it can be easy to get unlabeled data in some domains like autonomous driving.
Positive Unlabeled (PU) learning enables to use these unlabeled data such that they are combined with labeled samples of our class of interest: the positive class.
The interest is that unlabeled data can contain relevant counter-examples: the negative samples.
The difﬁculty is that unlabeled data can also contain a fraction π p of unlabeled positive samples.
(Sansone et al., 2018) enumerates several learning problems which can be addressed in this way like the information retrieval and the
One-vs-Rest task.
Several PU learning methods exist and some of them are adapted for image classiﬁcation.
They are generally classiﬁed into these two categories: - censoring PU learning, formalized by Elkan & Noto (2008) and recently improved by Northcutt et al.
(2017); - case-control PU learning, introduced by Ward et al.
(2009), formalized by du Plessis et al.
and then consecutively improved by
Du Plessis et al.
(2015) and Kiryo et al.
However we focus our attention in this article on the recently proposed GAN-based PU approaches.
So we classify PU learning approaches into the two following groups suggested by Kiryo et al.
(2017): one-stage and two-stage PU methods.
Onestage ones such as the unbiased PU method (uPU) (Du Plessis et al., 2015) and the non-negative
PU method (nnPU) (Kiryo et al., 2017) consist in training a classiﬁer directly with the PU dataset.
These methods have the advantage to need only one training of the classiﬁer.
But they require dataset prior knowledge and consequently uPU and nnPU need to be combined with an approach estimating the prior knowledge (Jain et al., 2016), (Ramaswamy et al., 2016), (Christoffel et al., 2016).
On the other hand, two-stage PU methods prepare during the ﬁrst stage a PN dataset.
For example,
Rank Pruning method (RP) (Northcutt et al., 2017) realizes several consecutive trainings of a binary classiﬁer.
After each training, only the samples considered as the most conﬁdent are kept in order to substitute the unlabeled samples for the next training of the same classiﬁer.
RP achieves two-stage state of the art performances without prior knowledge, but with a high training computational cost and is limited in its prediction performances on complex image datasets like CIFAR-10.
Recently, a new subcategory of two-stage PU methods appeared: GAN-based PU methods.
They address the PU learning challenge by producing, thanks to an adversarial training (Goodfellow et al., 2014), relevant generated samples from a PU dataset during the ﬁrst step.
Then they are used to train a standard Positive Negative (PN) classiﬁer during the second step.
Existing GAN-based PU methods PGAN (Chiaroni et al., 2018) and GenPU (Hou et al., 2018) are presented and their issues are discussed in the next section 2.
This article addresses these issues with a new GAN-based PU learning approach: the Divergent-GAN.
Our contributions are the following:
• we propose to incorporate a PU learning risk inside the standard GAN (Goodfellow et al., 2014) discriminator loss function.
The intuition behind is to ask the generative model to solve the PU learning problem formulated in the discriminator loss function.
In this way the generator learns the distribution of the samples which are both unlabeled and not positive: the negative ones included in the unlabeled dataset; • (side contribution) we highlight a Batch Normalization (BN) (Ioffe & Szegedy, 2015) critical issue: A learning model which manipulates different minibatches distributions should not use BN.
Alternative normalization techniques are discussed (section 3.2) and experimented (section 4.1) in the context of the proposed framework which manages positive, unlabeled and generated minibatches.
Thanks to this new framework, we address the previous GAN-based PU methods main issues: It reduces the overﬁtting problem of the PGAN method, and it learns the counter-examples distribution included in the unlabeled dataset without using prior knowledge while keeping a standard
GAN architecture.
Consequently, the D-GAN outperforms two-stage state of the art PU learning performances on simple MNIST and complex CIFAR-10 image datasets.
From a practical point of view, several previous PU methods beneﬁts are combined in the proposed framework as listed in the table 1 of the next section.
The D-GAN code is available at 1 .
The article is structured as follow.
Section 2 presents GAN-based PU learning approaches.
Sectiondescribes the proposed method.
Section 4 presents the D-GAN ability to generate relevant counterexamples on the celebA dataset, its prediction performances, and learning stability for the PU learning task compared to state of the art PU learning methods on MNIST and CIFAR-10 datasets.
Then, we ﬁnish by a conclusion where we also discuss perspectives.
R ELATED WORK
GAN-based PU learning approaches are a recent subcategory of two-stage PU methods.
Both existing are PGAN (Chiaroni et al., 2018) and GenPU (Hou et al., 2018) .
The interest of using GANs is double: GANs enable relevant data augmentation and they use high-level feature metrics to evaluate generated samples quality, thanks to the use of a discriminator.
The generate samples considered as replace the unlabeled ones by learning on these latter (Chiaroni et al., 2018), or on both unlabeled and positive labeled ones as (Hou et al., 2018) during the ﬁrst step.
Both methods (Hou et al., 2018) and (Chiaroni et al., 2018) exploit GANs (Goodfellow et al., 2014) beneﬁts, but they are not suitable under the same datasets conditions and the reasonings are different:
• GenPU method is based on the original GAN convergence (Goodfellow et al., 2014), such that: π · p G P +(1 − π ) · p G N −→ p U , with p G P the distribution of positive samples generated by the generator G P , p G N the distribution of the negative samples generated by G N , and p U the distribution of real unlabeled samples.
The same idea can
be expressed by using one single generator G N such that we replace the generated positive samples by the positive labeled samples initially present in a PU dataset.
Training adversarially ﬁve learning models to address standard PU learning challenge is not necessary.
In practice, GenPU seems to be the most interesting PU method on simple datasets when we own few positive labeled
samples, and it generates relevant counter-examples.
However, GenPU uses prior knowledge while its training optimization functions need three additional hyper-parameters.
Its architecture composed of ﬁve learning models, instead of two for the standard GANs, is more computational demanding.
• PGAN is trained to converge towards the unlabeled dataset distribution during the ﬁrst step.
The PGAN exploits GANs imperfections such that the generated distribution at the adversarial equilibrium is still separable from the unlabeled samples distribution by a classiﬁer.
The PGAN does not use a PU learning risk to train its GAN part.
Positive-GAN (PGAN) method presents a relatively steadier behaviour than RP and better results on the complex RGB image dataset CIFAR-10, in terms of prediction performances, and without prior knowledge for varying π P fractions.
However, it is less suitable for relatively simpler datasets like MNIST.
The generated samples are all considered as negative samples by the classiﬁer.
But this is true only if the generated samples distribution converges close enough towards the unlabeled samples distribution, while not matching with it.
In other words, if the GAN works as expected theoretically by Goodfellow et al.
(2014), then the PGAN will fall back into the initial PU learning problem.
However, it provides a practical framework based on standard GAN architecture and it is suitable for complex datasets, contrary to previous methods.
As far as the classiﬁcation step is concerned, it only needs a standard GAN model, such as (Goodfellow et al., 2014) or (Arjovsky et al., 2017), composed of one generator and one discriminator.
The proposed approach merges the advandages of previously cited methods to address the standard
PU learning task with a different reasoning presented in the next section.
[Table]
M ETHOD
This section starts by discussing some particularities of a standard PU learning risk (equation 1).
Then we incorporate this risk into a generic GAN framework in order to guide the generator convergence towards the distribution of the negative samples included in the unlabeled dataset.
In addition, we discuss normalization techniques in the context of this framework which manipulates three different types of minibatches: positive, unlabeled and generated ones.
3. A DIVERGENT APPROACH FROM THE DISCRIMINATOR POINT OF VIEW
The D-GAN intuition can be expressed as follow.
The discriminator D addresses to the generator
G the riddle: Show me what IS unlabeled AND NOT positive.
It turns out that negative samples included in the unlabeled dataset are both unlabeled and not positive.
Consequently G addresses this riddle by learning to show the negative samples distribution to D .
The Positive Unlabeled (PU) learning problem consists in trying to distinguish positive samples from negative samples by using a PU dataset.
We start by detailing the expected PU functionality that we want to incorporate into the GAN discriminator loss function.
Let X ∈ R
m be the input random variable and Y ∈ { 0 , 1 } its associated label.
X can be a positive X P , negative X N or unlabeled
X U sample which respectively follow the distributions p P = p ( X | Y = 0) , p N = p ( X | Y = 1) and p U
=
(1 − π P ) · p N + π P · p P , with π P ∈ (0 , 1) the unknown prior which represents the fraction of unlabeled positive samples included in the unlabeled dataset.
Let D : R m → [0 , 1] be the decision function which is then considered as the discriminator network of the proposed framework.
We have l (ˆ y, y ) such that l : [0 , 1] ×
[0 , 1] → R is the arbitrary cost function with the predicted output ˆ y of
D for a given sample and the corresponding label y as inputs.
D is trained with a PU risk R PU to predict the label value 1 for the unlabeled samples, and the label value 0 for the positive labeled ones.
Given the composition of the unlabeled dataset, we develop R PU ( D ) such that:
[Equation]
We notice that negative samples are associated exclusively to the label value 1 for any π P value.
Labeled and unlabeled positive samples follow the same distribution p P .
So p P is associated to both contradictory labels 0 and 1 .
Consequently, as discussed in annexe section 6.1, we assume it is equivalent to associate the positive distribution p P with a uniﬁed intermediate label value δ ∈ (0 , 1) .
So if we train D with the risk R PU , then D prediction concerning the unlabeled positive samples is shifted away from the label value 1.
Thus D predicts the label value 1 exclusively for the negative samples.
Next, let us consider the decision function D as the discriminator of a generative adversarial network.
We propose to incorporate the risk R PU into the value function of the original GAN model (Goodfellow et al., 2014) by adding the loss function term E x P ∼ p P [ log (1 − D ( x P ))] .
Consequently, the loss function L D of D to minimize is:
[Equation]
with z the input random vector of the generative model G such that G ( z ) is a generated sample.
z can follow a uniform or normal distribution.
The equation 2 is justiﬁed intuitively as follow.
Instead of asking to G to converge towards the distribution p U , we want that G learns to converge towards the distribution p N of negative samples.
Thus we propose to replace the standard GAN task show me what is unlabeled by the task show me what is both unlabeled and not positive .
This results in addressing directly the risk R PU to D such that L D is as follow:
[Equation]
with 0 the label associated to the samples G ( z ) generated by G .
Let the cost function l used in the proposed D-GAN framework be the binary cross-entropy H such that l = − H .
So:
[Equation]
We recall that the binary cross-entropy H is deﬁned as below:
[Equation]
with Y the label associated to the D input X .
Thus H ( D ( X ) , 1) = − log ( D ( X )) and
H ( D ( X ) , 0)
= − log (1 − D ( X )) .
Consequently, L D can be developed as in the equation 2.
This shows the incorporation of R PU risk (equation 1) inside the D-GAN discriminator loss function (equation 2).
On the other hand, the role of G during the adversarial training is to generate samples considered by D as 1 .
So, as suggested by Goodfellow et al.
(2014) in practice, the training loss function L G of G to minimize is such that L G ( G, D ) =
E z ∼ p
z [ log ( D ( G ( z )))] .
We recall that exclusively the negative samples are considered as 1 by D thanks to the R PU risk, as shown previously.
Consequently this justiﬁes intuitively the G convergence towards the negative samples distribution p N .
The corresponding implementation algorithm 1 of this ﬁrst stage is presented in annexe 6.
Once the D-GAN training is ﬁnished, we can start the second step which consists in using a classiﬁer
C to distinguish fake generated samples x FN =
G ( z ) , which are ideally equivalent to the real negative samples, from real positive labeled samples as illustrated in ﬁgure 1.
The divergent GAN behaviour is only possible if the discriminator D is able to distinguish positive and negative samples.
Nonetheless, in the worst-case scenario where the discriminator is not able to sufﬁciently encode the complexity of the boundary between positive and negative samples, the D-GAN will behave lik the
PGAN, which seems to be the best solution in this situation.
This is observed experimentally in the table 3 on the CIFAR-10 dataset.
3. W ITHOUT DISCRIMINATOR BATCH NORMALIZATION
Nowadays, Batch Normalization (BN) (Ioffe & Szegedy, 2015), is considered as a relevant regularization technique commonly used in deep neural networks architectures.
Its utility for GANs training has been highlighted by (Radford et al., 2015) for the DCGAN architecture in order to stabilize the adversarial training.
Other variants like the Wasserstein-GAN (Arjovsky et al., 2017) or the LossSensitive GAN (Qi, 2017) conﬁrmed its interest.
As developped in (Ioffe & Szegedy, 2015), BN addresses issues like vanishing, exploding gradient problems, and the risk of getting stuck in a poor local minima.
BN suggests to reduce the internal covariate shift problem of the learning model.
In this way, a higher learning rate can be used and it can improve signiﬁcantly the training speed.
But BN regularizes the model, such that a training sample from a given minibatch is considered in conjunction with other examples of this minibatch.
This is the consequence of estimating the mean and variance normalization parameters one time per minibatch, and then applying them on each minibatch sample.
It turns out that it does not allow to link labeled positive samples to the unlabeled positive samples and to produce a gap between positive and negative samples, when positive samples x P and unlabeled samples x U are not in the same training minibatch.
To counter this problem, we could imagine to apply BN on a uniﬁed minibatch which contains a fraction of each distribution x P , x U and x F .
But the BN effect is inﬂuenced a lot by the content of the minibatch on which it is applied.
So the fraction π P of positive samples included in x U will affect the batchnorm effect.
As illustrated experimentally in ﬁgure 4, with BN, we observe that the classiﬁer only learns to distinguish minibatches of positive samples from minibatches of unlabeled samples.
On the contrary, without the use of BN, both distributions appear in the unlabeled minibatch from the discriminator output point of view.
In other words, the negative samples can be distinguished from the positive samples without BN.
However, BN beneﬁts in a more traditional training are not negligible, so we suggest to use another type of normalization which could replace BN role in a PU learning task.
Layer Normalization (LN) (Ba et al., 2016), is a frequently used technique with sequential networks as it can be applied for each sequential sample separately.
With LN the normalization for a given sample is computed on its resulting output feature map layers and the mean and variance are computed separately for each sample of a minibatch.
For this reason, we propose to apply LNs instead of BNs inside our discriminative model D .
As we can observe in ﬁgure 4, it allows the discriminator to keep the behaviour that interests us which is the ability to distinguish unlabeled negative samples to unlabeled positive samples.
Additional qualitative experiments in annexe section 6 show that the LN can substitute BN inside the discriminative model structure to generate acceptable images.
The next section presents experimental results which demonstrate the good performance of the proposed approach.
E XPERIMENTAL R ESULTS
This section demonstrates experimentally the D-GAN abilities on simple and complex datasets:
We present qualitative results for the counter-example generation, the discriminator normalization effect, and quantitative results for the PU learning image classiﬁcation task.
Experimental settings are as follow.
Minibatches of labeled positive samples, unlabeled samples, and generated samples have the same size.
The convolutional classiﬁer C used 2 in the subsection 4.
is described in the PGAN article (Chiaroni et al., 2018) experiments.
C is always trained duringepochs.
We use the DCGAN (Radford et al., 2015) architecture for all the comparative experiments except for celebA and CIFAR-10 datasets where we respectively adapt the LS-GAN (Qi, 2017) and WGAN-GP (Gulrajani et al., 2017) variants to the D-GAN framework.
The D-GAN uses LN instead of BN concerning D .
Concerning the PU dataset initialization from a standard PN dataset, ρ is the fraction of the positive labeled samples of the initial PN dataset that we unlabel such that they are included into the unlabeled dataset.
π P is the fraction that represents these unlabeled positive samples among the unlabeled dataset.
From a qualitative point of view, and on the contrary to the PGAN model, the D-GAN generates samples which are only similar to the counter-examples for diverse data types, as illustrated in ﬁgure 3 for a 2D point cloud dataset and in ﬁgure 2 for a real images dataset.
In order to enable the proposed approach reproducibility, a D-GAN implemented version corresponding to the ﬁgure 2 results is available 3 and is applied on the LSGAN model (Qi, 2017).
Our code includes also the method implementation, proposed by Chiaroni et al.
(2018), to establish a PU training dataset from a fully labeled dataset.
(Qi, 2017) and by replacing BN with LN.
The PU training dataset uses the celebA dataset images with settings ρ = 0 .
5 , π P = 0 .
3 and ”Male” the positive class chosen arbitrarily.
The images size is cropped to 64*64*3.
All generated samples are qualitatively relevant fake counter-examples.
[Figure] [Figure]
[Figure] [Figure]
4. N ORMALIZATION EFFECTS ON THE D ISCRIMINATOR
We compare in the ﬁgure 4 the ability of D to distinguish the positive from the negative samples distribution when it is trained on a PU dataset with BN, LN layers or without any normalization technique.
Smaller is surface intersection between the discriminator output histogram distribution predictions on positive and negative samples included in the unlabeled dataset, better it is.
[Figure]
We observe that
) does not enable to distinguish positive from negative samples when the discriminator is trained on a PU dataset.
On the contrary, LN (ﬁgure 4(c)) enables it for the reasons speciﬁed in the subsection 3.2.
Thus with LN in D , G can converge exclusively towards the unlabeled negative samples distribution p N , as expected.
4. D IVERGENT -GAN FOR P OSITIVE U NLABELED LEARNING
We compare the D-GAN accuracy prediction to GenPU on the table 2 for the simple One vs. One task with few positive labeled samples.
The GenPU method presents better results for fewer labeled positive samples.
The D-GAN presents Accuracy performances better than the GenPU method for one hundred of positive labeled samples after 40 epochs training iterations for the D-GAN counterexamples generation step.
Moreover, it is interesting to observe that the proposed approach globally slightly outperforms nnPU and uPU methods without using prior knowledge.
is number of positive samples, and
U is unlabeled which positive and negative samples.
GenPU, uPU and nnPU results come from (Hou et al., 2018).
[Table]
Concerning the relatively more challenging One vs. Rest task, the D-GAN globally outperforms the PGAN and RP methods in terms of F1-Score predictions performances on the table 3 both on
MNIST and CIFAR-10 datasets.
Moreover, the D-GAN demonstrates a steadier behaviour than PGAN against the overﬁtting problem as illustrated in ﬁgure 5(b).
In ﬁgure 5(a), without BN or LN, the D-GAN method gets a faster and better Accuracy prediction performance than the PGAN when both are trained under the same conditions.
In ﬁgure 5(b), the
D-GAN with LN follows the learning training rythm of the PGAN with BN.
The D-GAN also has a steadier behaviour once the Accuracy progression is ﬁnished: it reduces the PGAN ﬁrst step overﬁtting problem.
[Table]
[Figure]
C ONCLUSION
To conclude, we have incorporated into the discriminator D loss function a standard PU risk to address the PU learning challenge.
In this way, the proposed model generates relevant counterexamples from a PU dataset without prior knowledge.
It outperforms two-stage state of the art
PU learning performances by addressing previous GAN-based PU methods issues: -It reduces the overﬁtting PGAN
ﬁrst stage problem.
-It addresses the GenPU mode collapse issue by keeping the practical standard GANs architecture such that it is easily adaptable to conventional GANs variants.
A side contribution of this article is to identify a discriminator batch-normalization critical issue appearing when the discriminator manipulates multiple minibatches distributions.
Nonetheless, we strongly believe that its stability and prediction performances still have the potential to be improved by taking the best of the representation learning and PU learning domains.
For example, recent promising GAN training approaches (Karras et al., 2018) not mandatorily using BN should be suitable to extend the proposed approach for large-scaled image datasets.
In addition, premices of
Noisy labeled learning results presented in annexe section 6.3 could extend the proposed approach to a uniﬁed generative framework which could output relevant generated labeled samples even from a weak, noisy labeled or incremental dataset with varying fractions of unlabeled positive samples.
A NNEXE
The algorithm 1 is the implementation of the proposed approach.
It includes the option for the noisy labeled learning task.
The table 4 details for each class the average F1-Score results presented in Table 3.
The ﬁgure 9 presents the same minibatch generated as in the ﬁgure 2, but in a larger size.
6. A N EXPERIMENTAL ANALYSIS OF THE RISK R PU
If D does not overﬁt labeled and unlabeled positive samples, let δ ∈ (0 , 1) be the label associated to all positive samples such that we propose the Positive Negative risk R PN
( D, δ )
=
R PU ( D ) .
δ represents the intermediate label value equivalent of associating, in the risk R PU , both contradictory labels 0 and 1 respectively to labeled and unlabeled positive samples.
We develop the risk R PN as follow:
[Equation]
As illustrated in ﬁgure 6, in practice we can train D with the risk R PU to output a value
ˆ y close to δ when the input is a positive sample, and close to 1 when the input is a negative sample.
We can observe that the global minimum of the approximated risk ˆ
R PN
( D, δ ) corresponds to the global maximum of the distribution predicted by D in output for positive unlabeled samples.
Moreover, the distribution of the negative samples is centered on the label associated to the unlabeled samples during the training, which coincides also with the equation 6 formulation.
This illustrates experimentally that D predicts the label value 1 exclusively for the negative samples.
6. N EEDING PRIOR KNOWLEDGE MAY NOT BE SUITABLE FOR INCREMENTAL APPLICATIONS
In the context of real learning applications like incremental learning (Craye et al., 2018), (Hadsell et al., 2009), the fraction π P of unlabeled positive samples can vary continuously at each new incremental unlabeled minibatch of samples to process.
However, existing PU learning methods using prior knowledge, like uPU and nnPU implicitly do the assumption that the prior knowledge holds the same during all the training.
A PU learning method which does not need prior knowledge as the
D-GAN proposed approach could be extended to such real applications.
Set of positive samples (a)
Set of unlabeled samples with =0.
(b) 0.
1.0 Discriminator prediction output for the p
y
( y U ) curve, and value for R PU 0.
pd f a n d l o ss e rr o r
Link between and the discriminator PU training p
y
( y U )
R PU (c) 0.
1.0 Discriminator prediction output for the p
y
( y U ) curve, and value for R PU 0.
pd f a n d l o ss e rr o r
Link between and the discriminator PU training p
y
( y U )
R PU (d) of positive and negative labeled samples, once D is trained with R PU risk.
(d) shows the same curves as in (c) but by giving in input a concatenation of an unlabeled minibatch with a positive labeled minibatch.
Unlabeled and labeled positive samples provide a uniﬁed prediction output distribution.
6. A N EXTENSION TO NOISY LABELED LEARNING AND FEW LABELED DATA RESSOURCES
If a generative model in an adversarial training only converges towards the subdivision of a distribution which is considered as the closest to a given label from the discriminator point of view, then we can extend the proposed approach to the noisy labeled learning task.
More precisely, the D-GAN architecture can be modiﬁed to include a generative model G P trained to generate fake positive samples.
This is achieved by adding the loss function term logD ( G P ( z )) in the minimax value function.
Furthermore, this extension also allows to manage problems where we only have few labeled positive samples.
The positive generator G P will converge towards the distribution considered as the most positive, the closest to zero in our case, which includes also the unlabeled positive samples perceived by the discriminator at the same location that the labeled ones as illustrated in ﬁgure 6 (d).
We argue that it is indirectly the same phenomenon that allows the GenPU (Hou et al., 2018) to get relatively good accuracy predictions with few labeled positive samples.
Because the discriminator task becomes more difﬁcult, the weight α is applied on the unlabeled loss function log ( D ( x U )) and on the positive one log (1 − D ( x P )) .
It ensures the guidelines that both generators G and G P have to follow.
The boolean variable noisyLabelsMode of the algorithm 1 is set to True to activate this functionality.
The ﬁgure 7 shows the results obtained on clusters of 2D point clouds with the D-GAN, when its noisy labeled mode is activated.
[Figure]
and (d) are respectively sets of real noisy labeled positive (20 percents of noise), real noisy labeled negative (20 percents of noise), fake generated positive and fake generated negative samples.
D , G and G P have a multilayer-perceptron structure.
The generated samples only follow the ditribution of the well-labeled samples of the input sets.
[Figure]
Initialize noisyLabelsMode = false .
Initialize α = 2 .
for number of training iterations do for k steps do
Sample minibatch of m noise samples { z (1) , ..., z ( m ) } from noise prior p G ( z ) .
Sample minibatch of m unlabeled examples { x (1) U , ..., x ( m ) U } from data distribution p U .
Sample minibatch of m positive labeled examples { x (1) P , ..., x ( m ) P } from data distribution p P .
Update the discriminator D by descending its stochastic gradient: if noisyLabelsMode is false then ∇ θ D 1 m m (cid:88) i =
logD ( x ( i ) U )
+ log [1 − D ( G ( z ( i ) ))]
+ log [1 − D ( x ( i ) p )] else ∇ θ D 1 m m (cid:88) i =
α · (cid:0) logD ( x ( i ) U ) + log [1 − D ( x ( i ) p )] (cid:1)
+ log [1 − D ( G ( z ( i ) ))]
+ logD ( G P
( z ( i ) )) end if end for
Sample minibatch of m noise samples { z (1) , ..., z ( m ) } from noise prior p G ( z ) .
Update the generator G by descending its stochastic gradient: ∇ θ G 1 m m (cid:88) i = log
[ D ( G ( z ( i ) ))] if noisyLabelsMode is true then
Update the generator G P by descending its stochastic gradient: ∇ θ GP 1 m m (cid:88) i = log [1 − D ( G P ( z ( i ) ))
] end if end for
The gradient-based updates can use any standard gradient-based learning rule.
We use Adam in our experiments.
on MNIST and CIFAR-10 in a
One vs. Rest mode with 20 classiﬁer epochs
[Table]
[Table]
[Table]
[Table]
[Table]
[Table]
[Table]
[Table]
[Table]
[Table]
[Table]
[Table]
[Table]
[Table]
[Table]
[Table]
[Table]
[Table]
[Table]
[Table] [Table] [Table] [Table]
[Table]
[Table]
[Table]
[Table]
[Table]
[Table]
[Table]
[Table]
AVG
MNIST
[Table] [Table]
[Table] [Table]
[Table] [Table]
[Table] [Table]
[Table] [Table]
[Table] [Table]
Plane 0.
0.731 0.718 Auto 0.
0.734 0.783 Bird 0.
[Table]
Dog
[Table]
The LSGAN-GP code is available at: https : //github.com/maple − research − lab/lsgan − gp − alt .