hexagan generative adversarial nets for real world
play

HexaGAN: Generative Adversarial Nets for Real World Classification - PowerPoint PPT Presentation

HexaGAN: Generative Adversarial Nets for Real World Classification Uiwon Hwang , Dahuin Jung, and Sungroh Yoon Seoul National University Electrical and Computer Engineering speaker Problem Definition Missing data problem


  1. HexaGAN: Generative Adversarial Nets for Real World Classification ∗ Uiwon Hwang , Dahuin Jung, and Sungroh Yoon Seoul National University Electrical and Computer Engineering ∗ speaker

  2. Problem Definition • Missing data problem • Missing data imputation 𝑦 $ 𝑦 % 𝑦 & 𝑧 𝑦 $ 𝑦 % 𝑦 & 𝑧 • Imputing missing elements in a data level • Class imbalance problem • Class-conditional generation • 𝑧 𝑦 $ 𝑦 % 𝑦 & Imputing the entire elements of a sample 𝑦 $ 𝑦 % 𝑦 & 𝑧 conditioned on a label • Missing label problem • Semi-supervised learning 𝑧 𝑦 $ 𝑦 % 𝑦 & 𝑦 $ 𝑦 % 𝑦 & 𝑧 • Imputing missing class labels using a classifier • Keyword: Imputation

  3. Problem Definition • Missing data problem • Missing data imputation • filling missing elements in a data level • Class imbalance problem • Class-conditional generation • Imputing the entire elements of a sample conditioned on a label • Missing label problem • Semi-supervised learning • Imputing missing class labels using a classifier • Keyword: Imputation

  4. Problem Definition • Missing data problem • Missing data imputation 𝑦 $ 𝑦 % 𝑦 & 𝑧 𝑦 $ 𝑦 % 𝑦 & 𝑧 • filling missing elements in a data level • Class imbalance problem • Class-conditional generation • 𝑧 𝑦 $ 𝑦 % 𝑦 & Imputing the entire elements of a sample 𝑦 $ 𝑦 % 𝑦 & 𝑧 conditioned on a label • Missing label problem • Semi-supervised learning • Imputing missing class labels using a classifier • Keyword: Imputation

  5. Problem Definition • Missing data problem • Missing data imputation • filling missing elements in a data level • Class imbalance problem • Class-conditional generation • Imputing the entire elements of a sample conditioned on a label • Missing label problem • Semi-supervised learning • Imputing missing class labels using a classifier • Keyword: Imputation

  6. Problem Definition • Missing data problem • Missing data imputation • filling missing elements in a data level • Class imbalance problem • Class-conditional generation • Imputing the entire elements of a sample conditioned on a label • Missing label problem • Semi-supervised learning • Imputing missing class labels using a classifier → Keyword: Imputation

  7. Overview of HexaGAN • We propose a generative adversarial network to solve the problems in real world classification simultaneously

  8. Addressing Three Problems • Missing data (element-wise) imputation (to solve the missing data problem) • Components • 𝐹 : transfers both labeled and unlabeled instances into the hidden space • 𝐻 *+ : imputes missing data • 𝐸 *+ - $:/ : distinguishes b/w missing and non-missing elements

  9. Addressing Three Problems • Missing data (element-wise) imputation (to solve the missing data problem) • Components • 𝐹 : transfers both labeled and unlabeled instances into the hidden space • 𝐻 *+ : imputes missing data • 𝐸 *+ - $:/ : distinguishes b/w missing and non-missing elements

  10. Addressing Three Problems • Missing data (element-wise) imputation (to solve the missing data problem) • Components • 𝐹 : transfers both labeled and unlabeled instances into the hidden space • 𝐻 *+ : imputes missing data • 𝐸 *+ - $:/ : distinguishes b/w missing and non-missing elements

  11. Addressing Three Problems • Missing data (element-wise) imputation (to solve the missing data problem) • Components • 𝐹 : transfers both labeled and unlabeled instances into the hidden space • 𝐻 *+ : imputes missing data • 𝐸 *+ - $:/ : distinguishes b/w missing and non-missing elements • A novel element-wise adversarial loss function and gradient penalty • max min 3 45 8 45 •

  12. Addressing Three Problems • Class conditional generation (to solve the class imbalance problem) • Components • 𝐻 93 : creates conditional hidden vectors 𝐢 ; • 𝐸 93 : determines whether a hidden vector is from the dataset or has been created by 𝐻 93 𝐻 *+ generates the entire elements conditioned on the minority class •

  13. Addressing Three Problems • Class conditional generation (to solve the class imbalance problem) • Components • 𝐻 93 : creates conditional hidden vectors 𝐢 ; • 𝐸 93 : determines whether a hidden vector is from the dataset or has been created by 𝐻 93 𝐻 *+ generates the entire elements conditioned on the minority class •

  14. Addressing Three Problems • Class conditional generation (to solve the class imbalance problem) • Components • 𝐻 93 : creates conditional hidden vectors 𝐢 ; • 𝐸 93 : determines whether a hidden vector is from the dataset or has been created by 𝐻 93 𝐻 *+ generates the entire elements conditioned on the minority class • • Losses • WGAN loss + zero-centered gradient penalty • Add Loss of 𝐻 *+ calculated from 𝐲 = ; and the cross entropy of 𝐲 =, 𝐳 ; to 𝐻 93

  15. Addressing Three Problems • Semi-supervised learning (to solve the missing label problem) • Components • 𝐷 : estimates class labels. This also works as the label generator • 𝐸 *+ - /A$ : distinguishes b/w real and pseudo (fake) labels

  16. Addressing Three Problems • Semi-supervised learning (to solve the missing label problem) • Components • 𝐷 : estimates class labels. This also works as the label generator • 𝐸 *+ - /A$ : distinguishes b/w real and pseudo (fake) labels • We adopt the pseudo-labeling technique of TripleGAN (Li et al., NIPS 2017) • The two components are related adversarially • •

  17. Addressing Three Problems • Semi-supervised learning (to solve the missing label problem) • Components • 𝐷 : estimates class labels. This also works as the label generator • 𝐸 *+ - /A$ : distinguishes b/w real and pseudo (fake) labels • We adopt the pseudo-labeling technique of TripleGAN (Li et al., NIPS 2017) • The two components are related adversarially • •

  18. Overview of HexaGAN(revisited) • Not three separate models, this is ONE model dubbed HexaGAN • The six components of HexaGAN interplay to solve the problems effectively

  19. Theorems • Theorem 1: Global optimality of 𝑞 𝑦 𝑛 D = 1 = 𝑞(𝑦|𝑛 D = 0) for HexaGAN A generator distribution 𝑞(𝑦|𝑛 D = 0) is a global optimum for the min-max game of 𝑯 𝑵𝑱 and 𝑬 𝑵𝑱 , • if and only if 𝒒 𝒚 𝒏 𝒋 = 𝟐 = 𝒒(𝒚|𝒏 𝒋 = 𝟏) for all 𝒚 ∈ ℝ / , except possibly on a set of zero Lebesgue measure.

  20. Theorems • Theorem 1: Global optimality of 𝑞 𝑦 𝑛 D = 1 = 𝑞(𝑦|𝑛 D = 0) for HexaGAN A generator distribution 𝑞(𝑦|𝑛 D = 0) is a global optimum for the min-max game of 𝑯 𝑵𝑱 and 𝑬 𝑵𝑱 , • if and only if 𝒒 𝒚 𝒏 𝒋 = 𝟐 = 𝒒(𝒚|𝒏 𝒋 = 𝟏) for all 𝒚 ∈ ℝ / , except possibly on a set of zero Lebesgue measure. • Theorem 2: The adversarial loss for semi-supervised learning is the ODM cost • Output distribution matching (ODM) cost function (Sutskeveret al., ICLR workshop 2016) • the global minimum of the supervised cost function is also a global minimum of the ODM cost function Optimizing the adversarial losses for C and 𝐸 *+ - /A$ imposes an unsupervised constraint on C. • Then, the adversarial losses for semi-supervised learning in HexaGAN satisfy the definition of the ODM cost.

  21. Experimental Results • Missing data imputation • HexaGAN shows good performances on various real world datasets • Medical, financial, vision, …

  22. Conclusions e define the three problems (missing data, class imbalance, and missing label) in real-world classification from the perspective of imputation 𝑫 𝑯 𝑫𝑯 Missing Our framework is simple to use and works automatically when the absence of data and label ( 𝐧 and 𝑛 X ) is Data indicated. 𝑭 HexaGAN 𝑬 𝑵𝑱 We loss function and gradient penalty for element-wise imputation . Our imputation performance produces Real World stable, state-of-the-art results. Classification Missing Class Our method significantly outperforms cascading combinations of the existing state-of-the-art methods. Label 𝑯 𝑵𝑱 Imbalance 𝑬 𝑫𝑯 • For more details, please visit our poster session! • June 11 th (Today) , 6:30 – 9:00 pm, Pacific Ballroom #20

  23. Conclusions e define the three problems (missing data, class imbalance, and missing label) in real-world classification from the perspective of imputation 𝑫 𝑯 𝑫𝑯 Missing Our framework is simple to use and works automatically when the absence of data and label ( 𝐧 and 𝑛 X ) is Data indicated. 𝑭 HexaGAN 𝑬 𝑵𝑱 We loss function and gradient penalty for element-wise imputation . Our imputation performance produces Real World stable, state-of-the-art results. Classification Missing Class Our method significantly outperforms cascading combinations of the existing state-of-the-art methods. Label 𝑯 𝑵𝑱 Imbalance 𝑬 𝑫𝑯 • For more details, please visit our poster session! • June 11 th (Today) , 6:30 – 9:00 pm, Pacific Ballroom #20

Recommend


More recommend