Deep Generative Sampling in the Dual Divergence Space: A Data-efficient & Interpretative Approach for Generative AI
Not on the map. Why?
Abstract (arXiv)
Building on the remarkable achievements in generative sampling of natural images, we propose an innovative challenge, potentially overly ambitious, which involves generating samples of entire multivariate time series that resemble images. However, the statistical challenge lies in the small sample size, sometimes consisting of a few hundred subjects. This issue is especially problematic for deep generative models that follow the conventional approach of generating samples from a canonical distribution and then decoding or denoising them to match the true data distribution. In contrast, our method is grounded in information theory and aims to implicitly characterize the distribution of images, particularly the (global and local) dependency structure between pixels. We achieve this by empirically estimating its KL-divergence in the dual form with respect to the respective marginal distribution. This enables us to perform generative sampling directly in the optimized 1-D dual divergence space. Specifically, in the dual space, training samples representing the data distribution are embedded in the form of various clusters between two end points. In theory, any sample embedded between those two end points is in-distribution w.r.t. the data distribution. Our key idea for generating novel samples of images is to interpolate between the clusters via a walk as per gradients of the dual function w.r.t. the data dimensions. In addition to the data efficiency gained from direct sampling, we propose an algorithm that offers a significant reduction in sample complexity for estimating the divergence of the data distribution with respect to the marginal distribution. We provide strong theoretical guarantees along with an extensive empirical evaluation using many real-world datasets from diverse domains, establishing the superiority of our approach w.r.t. state-of-the-art deep learning methods.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 16 of its 30 references that are in the map. First posted on arXiv 10 Apr 2024.
Builds on
16 of 30 references.
References · 16
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2020Denoising Diffusion Probabilistic Modelscited by 20,851
- 2020Denoising Diffusion Implicit Modelscited by 9,655
- 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 8,964
- 2021Improved Denoising Diffusion Probabilistic Modelscited by 3,736
- 2017Improved Training of Wasserstein GANscited by 2,223
- 2017Masked Autoregressive Flow for Density Estimationcited by 680
- 2018MINE: Mutual Information Neural Estimationcited by 680
- 2016f-GAN: Training Generative Neural Samplers using Variational Divergence Minimizationcited by 504
- 2019Understanding the Limitations of Variational Mutual Information Estimatorscited by 140
- 2016Resnet in Resnet: Generalizing Residual Architecturescited by 110
- 2017Continuous-Time Flows for Efficient Inference and Density Estimationcited by 21
4 more
- 2021Nested Variational Inferencecited by 14
- 2023Denoising Diffusion Probabilistic Models for Generation of Realistic Fully-Annotated Microscopy Image Data Setscited by 13
- 2017f-GANs in an Information Geometric Nutshellcited by 9
- 2018Primal-Dual Wasserstein GANcited by 4
Built on by
Not cited yet.