mlsanityData to 7 Oct 2026

BourGAN: Generative Networks with Metric Embeddings

arXiv 1805.07674 ↗First posted 19 May 2018stat.ML cs.LGcited by 22

Not on the map. Why?

Abstract (arXiv)

This paper addresses the mode collapse for generative adversarial networks (GANs). We view modes as a geometric structure of data distribution in a metric space. Under this geometric lens, we embed subsamples of the dataset from an arbitrary metric space into the l2 space, while preserving their pairwise distance distribution. Not only does this metric embedding determine the dimensionality of the latent space automatically, it also enables us to construct a mixture of Gaussians to draw latent space random vectors. We use the Gaussian mixture model in tandem with a simple augmentation of the objective function to train GANs. Every major step of our method is supported by theoretical analysis, and our experiments on real and synthetic data confirm that the generator is able to produce samples spreading over most of the modes while avoiding unwanted samples, outperforming several recent GAN variants on a number of metrics and offering new features.

Key facts. Cited by 22 papers in the map (data through 7 Oct 2026). First posted on arXiv 19 May 2018.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 5; 2022: 4; 2023: 8; 2024: 3; 2025: 2.

22 papers.

Sort:

By area:

  1. 2023A Fast Optimization View: Reformulating Single Layer Attention in LLM Based on Tensor and SVM Trick, and Solving It in Matrix Multiplication Timecited by 30
  2. 2022Sketching for First Order Method: Efficient Algorithm for Low-Bandwidth Channel and Vulnerabilitycited by 25
  3. 2023Complexity Matters: Rethinking the Latent Space for Generative Modelingcited by 19
  4. 2022Dynamic Tensor Product Regressioncited by 17
  5. 2023Efficient SGD Neural Network Training via Sublinear Activated Neuron Identificationcited by 11
  6. 2021Partition-Guided GANscited by 9
  7. 2021Self-Supervised GANs with Label Augmentationcited by 9
  8. 2023Federated Empirical Risk Minimization via Second-Order Methodcited by 9
  9. 2023Is Solving Graph Neural Tangent Kernel Equivalent to Training Graph Neural Network?cited by 8
  10. 2022Generative Trees: Adversarial and Copycatcited by 7
  11. 2022DigGAN: Discriminator gradIent Gap Regularization for GAN Training with Limited Datacited by 7
  12. 2024Fast John Ellipsoid Computation with Differential Privacy Optimizationcited by 7
10 more
  1. 2023Statistically Optimal Generative Modeling with Maximum Deviation from the Empirical Distributioncited by 3
  2. 2025Quantum latent distributions in deep generative modelscited by 3
  3. 2021Fast Graph Neural Tangent Kernel via Kronecker Sketchingcited by 2
  4. 2021Manifold embedding data-driven mechanicscited by 2
  5. 2024Robust training of implicit generative models for multivariate and heavy-tailed distributions with an invariant statistical losscited by 2
  6. 2025StegOT: Trade-offs in Steganography via Optimal Transportcited by 1
  7. 2021Alleviating Mode Collapse in GAN via Diversity Penalty Modulecited by 0
  8. 2023Online Adaptive Mahalanobis Distance Estimationcited by 0
  9. 2023Fast Heavy Inner Product Identification Between Weights and Inputs in Neural Network Trainingcited by 0
  10. 2024Backdoor Attack with Mode Mixture Latent Modificationcited by 0