Pith. sign in

REVIEW 2 cited by

Sliced-Wasserstein Autoencoder: An Embarrassingly Simple Generative Model

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1804.01947 v3 pith:RU4I2BBF submitted 2018-04-05 cs.LG stat.ML

classification cs.LGstat.ML
keywords distributionautoencodersgenerativesliced-wassersteinautoencoderembarrassinglysamplablesimple
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this paper we study generative modeling via autoencoders while using the elegant geometric properties of the optimal transport (OT) problem and the Wasserstein distances. We introduce Sliced-Wasserstein Autoencoders (SWAE), which are generative models that enable one to shape the distribution of the latent space into any samplable probability distribution without the need for training an adversarial network or defining a closed-form for the distribution. In short, we regularize the autoencoder loss with the sliced-Wasserstein distance between the distribution of the encoded training samples and a predefined samplable distribution. We show that the proposed formulation has an efficient numerical solution that provides similar capabilities to Wasserstein Autoencoders (WAE) and Variational Autoencoders (VAE), while benefiting from an embarrassingly simple implementation.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Improving the Generation of VAEs with High Dimensional Latent Spaces by the use of Hyperspherical Coordinates

    cs.LG 2025-07 reject novelty 6.0 of 10

    A VAE trained with a hand-built hyperspherical-coordinate regularizer compresses latent codes into a small region of the sphere and appears to improve decoded sample quality, though the reported generation protocol us...

  2. CARoL: Context-aware Adaptation for Robot Learning

    cs.RO 2025-06 conditional novelty 6.0 of 10

    CARoL measures task similarity by state-transition prediction errors and uses those similarities to weight prior policies, value functions, or actor-critic knowledge when adapting to a new task.

Pith tools