Leverage Score Sampling for Complete Mode Coverage in Generative Adversarial Networks
Not on the map. Why?
Abstract (arXiv)
Commonly, machine learning models minimize an empirical expectation. As a result, the trained models typically perform well for the majority of the data but the performance may deteriorate in less dense regions of the dataset. This issue also arises in generative modeling. A generative model may overlook underrepresented modes that are less frequent in the empirical data distribution. This problem is known as complete mode coverage. We propose a sampling procedure based on ridge leverage scores which significantly improves mode coverage when compared to standard methods and can easily be combined with any GAN. Ridge leverage scores are computed by using an explicit feature map, associated with the next-to-last layer of a GAN discriminator or of a pre-trained network, or by using an implicit feature map corresponding to a Gaussian kernel. Multiple evaluations against recent approaches of complete mode coverage show a clear improvement when using the proposed sampling strategy.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 21 of its 28 references that are in the map. First posted on arXiv 6 Apr 2021.
Builds on
21 of 28 references.
References · 21
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,841
- 2019Does Learning Require Memorization? A Short Tale about a Long Tailcited by 452
- 2018Assessing Generative Models via Precision and Recallcited by 401
- 2020Differentiable Augmentation for Data-Efficient GAN Trainingcited by 361
- 2016Unrolled Generative Adversarial Networkscited by 208
- 2020Sample-Efficient Optimization in the Latent Space of Deep Generative Models via Weighted Retrainingcited by 121
- 2017PacGAN: The power of two samples in generative adversarial networkscited by 104
- 2020Inclusive GAN: Improving Data and Minority Coverage in Generative Modelscited by 44
- 2018On Fast Leverage Score Sampling and Optimal Learningcited by 40
- 2019Small-GAN: Speeding Up GAN Training Using Core-setscited by 40
9 more
- 2019Adaptive Sampling for Stochastic Risk-Averse Learningcited by 39
- 2013A Statistical Perspective on Algorithmic Leveragingcited by 38
- 2017AdaGAN: Boosting Generative Modelscited by 34
- 2014Deep Fried Convnetscited by 21
- 2018Active Mini-Batch Sampling using Repulsive Point Processescited by 19
- 2015Isometric sketching of any set via the Restricted Isometry Propertycited by 7
- 2017Determinantal Point Processes for Mini-Batch Diversificationcited by 7
- 2018Importance Weighted Generative Networkscited by 7
- 2019Rethinking Generative Mode Coverage: A Pointwise Guaranteed Approachcited by 3
Built on by
Citing papers per year: 2026: 2.
2 papers.