Answers.Body: <p>The equation most likely comes from one of the following references:</p>
  <blockquote>
  <p>David Warde-Farley and Ian Goodfellow. Adversarial perturbations of deep neural networks. In Tamir Hazan, George Papandreou, and Daniel Tarlow, editors, Perturbations, Optimization, and Statistics, chapter 11. 2016. Book in preparation for MIT Press.</p>
  </blockquote>
  <blockquote>
  <p>C. Szegedy, V. Vanhoucke, S. Ioffe, J. Shlens, and Z. Wojna. <a href="https://arxiv.org/pdf/1512.00567.pdf" rel="nofollow noreferrer">Rethinking the Inception Architecture for Computer Vision</a>. ArXiv e-prints, December 2015.</p>
  </blockquote>
  <p>I was not able to retrieve the book but Szegedy et al. discuss on page 6 (see &quot;Model Regularization via Label Smoothing&quot;).</p>
  <p>Ian Goodfellow discusses this topic on page 31 of his tutorial:</p>
  <blockquote>
  <p>I. Goodfellow. <a href="https://arxiv.org/pdf/1701.00160.pdf" rel="nofollow noreferrer">NIPS 2016 Tutorial: Generative Adversarial Networks</a>. ArXiv e-prints April 2017.</p>
  </blockquote>
  <p>A similar question was asked and answered in the Data Science community: <a href="https://datascience.stackexchange.com/questions/28764/one-sided-label-smoothing-in-gans">https://datascience.stackexchange.com/questions/28764/one-sided-label-smoothing-in-gans</a></p>
  
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2020-12-30T19:45:32.740Z
Answers.Text: Thanks for your answer, but I was expecting someone to explain step by step formulation of this result. Still, I got helpful links
Answers.UserDisplayName: Enes
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2020-12-30T01:54:17.783Z
Answers.LastActivityDate: 2020-12-30T01:54:17.783Z
Answers.UserDisplayName: Brian O'Donnell
Body: <p>I was reading the paper called <a href="https://arxiv.org/pdf/1606.03498.pdf" rel="nofollow noreferrer"><em>Improved Techniques for Training GANs</em></a>. And, in the one-sided label smoothing part, they said that optimum discriminator with label smoothing is</p>
  <p><span class="math-container">$$ D^*(x)=\frac{\alpha \cdot p_{data}(x) + \beta \cdot p_{model}(x)}{p_{data}(x) + p_{model}(x)}$$</span></p>
  <p>I could not understand where this is come from. How did we get this result?</p>
  <p>Note: By the way, I knew how to find optimal discriminator in vanilla GAN i.e.
  <span class="math-container">$$ D^*(x) = \frac{p_{r}(x)}{p_{r}(x) + p_g(x)} $$</span></p>
  
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2021-07-09T22:01:02.843Z
Comments.Text: I did not yet write it down in detail but to my understanding deriving this result should work like deriving the optimal discriminator in the vanilla GAN (which does not use label smoothing). In case of label smoothing your integrands just get constants alpha and beta...
Comments.UserDisplayName: Ggjj11
Tags: <deep-learning><generative-adversarial-networks><generative-model>
Title: Optimum Discriminator for label smoothed GAN
UserDisplayName: Enes
ThreadText: # Optimum Discriminator for label smoothed GAN
  
  (Asked by: username_0 on 2020-12-29)
  
  I was reading the paper called [*Improved Techniques for Training GANs*](https://arxiv.org/pdf/1606.03498.pdf). And, in the one-sided label smoothing part, they said that optimum discriminator with label smoothing is
  
  $$ D^\*(x)=\frac{\alpha \cdot p\_{data}(x) + \beta \cdot p\_{model}(x)}{p\_{data}(x) + p\_{model}(x)}$$
  
  I could not understand where this is come from. How did we get this result?
  
  Note: By the way, I knew how to find optimal discriminator in vanilla GAN i.e.
  $$ D^\*(x) = \frac{p\_{r}(x)}{p\_{r}(x) + p\_g(x)} $$
  
  **Tags:** deep-learning, generative-adversarial-networks, generative-model
  
  > **Comments:**
  > **username_1**: I did not yet write it down in detail but to my understanding deriving this result should work like deriving the optimal discriminator in the vanilla GAN (which does not use label smoothing). In case of label smoothing your integrands just get constants alpha and beta...  
  
  ---
  
  ## 1 answers
  
  ### Answer by username_2 on 2020-12-30. Score: 1
  
  The equation most likely comes from one of the following references:
  
  > David Warde-Farley and Ian Goodfellow. Adversarial perturbations of deep neural networks. In Tamir Hazan, George Papandreou, and Daniel Tarlow, editors, Perturbations, Optimization, and Statistics, chapter 11. 2016. Book in preparation for MIT Press.
  
  > C. Szegedy, V. Vanhoucke, S. Ioffe, J. Shlens, and Z. Wojna. [Rethinking the Inception Architecture for Computer Vision](https://arxiv.org/pdf/1512.00567.pdf). ArXiv e-prints, December 2015.
  
  I was not able to retrieve the book but Szegedy et al. discuss on page 6 (see "Model Regularization via Label Smoothing").
  
  Ian Goodfellow discusses this topic on page 31 of his tutorial:
  
  > I. Goodfellow. [NIPS 2016 Tutorial: Generative Adversarial Networks](https://arxiv.org/pdf/1701.00160.pdf). ArXiv e-prints April 2017.
  
  A similar question was asked and answered in the Data Science community: <https://datascience.stackexchange.com/questions/28764/one-sided-label-smoothing-in-gans>
  
  > **Comments:**
  > **username_0**: Thanks for your answer, but I was expecting someone to explain step by step formulation of this result. Still, I got helpful links  
  
  ---
  
  