On characterizing optimal Wasserstein GAN solutions for non-Gaussian data
On characterizing optimal Wasserstein GAN solutions for non-Gaussian data
复制标题
DOI:
10.1109/isit54713.2023.10206785
复制
发表时间:
2023-06
期刊:
影响因子:
--
通讯作者:
Yujia Huang;Shih-Chun Lin;Yu-Chih Huang;Kuan-Hui Lyu;Hsin-Hua Shen;Wan-Yi Lin
中科院分区:
文献类型:
--
作者:
Yujia Huang;Shih-Chun Lin;Yu-Chih Huang;Kuan-Hui Lyu;Hsin-Hua Shen;Wan-Yi Lin
The generative adversarial network (GAN) aims to approximate an unknown distribution via a parameterized neural network (NN). While GANs have been widely applied in reinforcement and semi-supervised learning as well as computer vision tasks, selecting their parameters often needs an exhaustive search and only a few selection methods can be proved to be theoretically optimal. One of the most promising GAN variants is the Wasserstein GAN (WGAN). Prior work on optimal parameters for WGAN is limited to the linear-quadratic-Gaussian (LQG) setting, where the NN is linear and the data is Gaussian. In this paper, we focus on the characterization of optimal WGAN parameters beyond the LQG setting. We derive closed-form optimal parameters for one-dimensional WGANs with non-linear sigmoid and ReLU activation functions. Extensions to high-dimensional WGANs are also discussed. Empirical studies show that our closed-form WGAN parameters have good convergence behavior with data under both Gaussian and Laplace distributions.