paper-with-me

홈 › Papers

Gaussian mixture models with Wasserstein distance

2018-06-12 · Benoit Gaujac, Ilya Feige, David Barber

Generative models with both discrete and continuous latent variables are highly motivated by the structure of many real-world data sets. They present, however, subtleties in training often manifesting in the discrete latent being under leveraged. In this paper, we show that such models are more amenable to training when using the Optimal Transport framework of Wasserstein Autoencoders. We find our discrete latent variable to be fully leveraged by the model when trained, without any modifications to the objective function or significant fine tuning. Our model generates comparable samples to other approaches while using relatively simple neural networks, since the discrete latent variable carries much of the descriptive burden. Furthermore, the discrete latent provides significant control over generation.

📄 PDF Abstract BibTeX arXiv:1806.04465

Code (0)

등록된 구현이 없습니다.

Tasks

Descriptive

Similar Papers 제목 키워드 기반

A Relaxed Wasserstein Distance Formulation for Mixtures of Radially Contoured Distributions

2025-03-18 · Keyu Chen, Zetian Wang, Yunxin Zhang

Recently, a Wasserstein-type distance for Gaussian mixture models has been proposed. However, that framework can only be generalized to identifiable mixtures of general elliptically contoured distributions whose componen…

Schema matching using Gaussian mixture models with Wasserstein distance

2021-11-28 · Mateusz Przyborowski, Mateusz Pabiś, Andrzej Janusz, Dominik Ślęzak

Gaussian mixture models find their place as a powerful tool, mostly in the clustering problem, but with proper preparation also in feature extraction, pattern recognition, image segmentation and in general machine learni…

ClusteringImage SegmentationSemantic Segmentation

Gromov-Wasserstein-like Distances in the Gaussian Mixture Models Space

2023-10-17 · Antoine Salmona, Julie Delon, Agnès Desolneux

The Gromov-Wasserstein (GW) distance is frequently used in machine learning to compare distributions across distinct metric spaces. Despite its utility, it remains computationally intensive, especially for large-scale pr…

Optimal Transport for Kernel Gaussian Mixture Models

2023-10-28 · Jung Hun Oh, Rena Elkin, Anish Kumar Simhal, Jiening Zhu 외

The Wasserstein distance from optimal mass transport (OMT) is a powerful mathematical tool with numerous applications that provides a natural measure of the distance between two probability distributions. Several methods…

Slicing the Gaussian Mixture Wasserstein Distance

2025-04-11 · Moritz Piening, Robert Beinert

Gaussian mixture models (GMMs) are widely used in machine learning for tasks such as clustering, classification, image reconstruction, and generative modeling. A key challenge in working with GMMs is defining a computati…

ClusteringComputational EfficiencyDomain AdaptationImage Reconstruction