Learning Kernel Stein Discrepancy for Training Energy-Based Models
-
Published:2023-11-14
Issue:22
Volume:13
Page:12293
-
ISSN:2076-3417
-
Container-title:Applied Sciences
-
language:en
-
Short-container-title:Applied Sciences
Author:
Niu Lu12, Li Shaobo13ORCID, Li Zhenping12ORCID
Affiliation:
1. Chengdu Institute of Computer Applications, Chinese Academy of Sciences, Chengdu 610041, China 2. School of Computer Science and Technology, University of Chinese Academy of Sciences, Beijing 100049, China 3. State Key Laboratory of Public Big Data, Guizhou University, Guiyang 550025, China
Abstract
The primary challenge in unsupervised learning is training unnormalized density models and then generating similar samples. Few traditional unnormalized models know what the quality of the trained model is, as most models are evaluated by downstream tasks and often involve complex sampling processes. Kernel Stein Discrepancy (KSD), a goodness-of-fit test method, can measure the discrepancy between the generated samples and the theoretical distribution; therefore, it can be employed to measure the quality of trained models. We first demonstrate that, under certain constraints, KSD is equal to Maximum Mean Discrepancy (MMD), a two-sample test method. PT KSD GAN (Kernel Stein Discrepancy Generative Adversarial Network with a Pulling-Away Term) is produced to compel generated samples to approximate the theoretical distribution. The generator, functioning as an implicit generative model, employs KSD as loss to avoid tedious sampling processes. In contrast, the discriminator is trained to identify the data manifold, also known as an explicit energy-based model. To demonstrate the effectiveness of our approach, we undertook experiments on two-dimensional toy datasets. Our results highlight that our generator adeptly captures the accurate density distribution, while the discriminator proficiently recognizes the unnormalized approximate distribution shape. When applied to linear Independent Component Analysis datasets, the log likelihoods of PT KSD GAN improve by about 5‰ over existing methods when the data dimension is less than 30. Furthermore, our tests on image datasets reveal that the PT KSD GAN excels in navigating high-dimensional challenges, yielding authentically genuine samples.
Funder
the National Natural Science Foundation of China
Subject
Fluid Flow and Transfer Processes,Computer Science Applications,Process Chemistry and Technology,General Engineering,Instrumentation,General Materials Science
Reference40 articles.
1. Wasserman, L. (2004). All of Statistics: A Concise Course in Statistical Inference, Springer. 2. Wu, S. (2023). Score-Based Approach to Analysis of Unnormalized Models and Applications. [Doctoral Dissertation, Duke University]. 3. Wu, S., Diao, E., Ding, J., Banerjee, T., and Tarokh, V. (August, January 31). Robust quickest change detection for unnormalized models. Proceedings of the Thirty-Ninth Conference on Uncertainty in Artificial Intelligence, PMLR, Pittsburgh, PA, USA. 4. An introduction to MCMC for machine learning;Andrieu;Mach. Learn.,2003 5. Wang, D., and Liu, Q. (2016). Learning to draw samples: With application to amortized mle for generative adversarial learning. arXiv.
|
|