English

Gromov-Wasserstein Autoencoders

Machine Learning 2023-02-27 v2 Computer Vision and Pattern Recognition

Abstract

Variational Autoencoder (VAE)-based generative models offer flexible representation learning by incorporating meta-priors, general premises considered beneficial for downstream tasks. However, the incorporated meta-priors often involve ad-hoc model deviations from the original likelihood architecture, causing undesirable changes in their training. In this paper, we propose a novel representation learning method, Gromov-Wasserstein Autoencoders (GWAE), which directly matches the latent and data distributions using the variational autoencoding scheme. Instead of likelihood-based objectives, GWAE models minimize the Gromov-Wasserstein (GW) metric between the trainable prior and given data distributions. The GW metric measures the distance structure-oriented discrepancy between distributions even with different dimensionalities, which provides a direct measure between the latent and data spaces. By restricting the prior family, we can introduce meta-priors into the latent space without changing their objective. The empirical comparisons with VAE-based models show that GWAE models work in two prominent meta-priors, disentanglement and clustering, with their GW objective unchanged.

Keywords

Cite

@article{arxiv.2209.07007,
  title  = {Gromov-Wasserstein Autoencoders},
  author = {Nao Nakagawa and Ren Togo and Takahiro Ogawa and Miki Haseyama},
  journal= {arXiv preprint arXiv:2209.07007},
  year   = {2023}
}

Comments

38 pages, 9 tables, 13 figures; accepted at ICLR2023

R2 v1 2026-06-28T01:19:51.641Z