"KGAN: How to Break The Minimax Game in GAN."

Trung Le, Tu Dinh Nguyen, Dinh Q. Phung (2017)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2025-05-14

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-1711-01744
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1711-01744
Trung Le, Tu Dinh Nguyen, Dinh Q. Phung:
KGAN: How to Break The Minimax Game in GAN. CoRR abs/1711.01744 (2017)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.