Max-Sliced Wasserstein Distance and its use for GANs
원문 초록
Generative adversarial nets (GANs) and variational auto-encoders have significantly improved our distribution modeling capabilities, showing promise for dataset augmentation, image-to-image translation and feature learning. However, to model high-dimensional distributions, sequential training and stacked architectures are common, increasing the number of tunable hyper-parameters as well as the training time. Nonetheless, the sample complexity of the distance metrics remains one of the factors affecting GAN training. We first show that the recently proposed sliced Wasserstein distance has compelling sample complexity properties when compared to the Wasserstein distance. To further improve the sliced Wasserstein distance we then analyze its `projection complexity' and develop the max-sliced Wasserstein distance which enjoys compelling sample complexity while reducing projection complexity, albeit necessitating a max estimation. We finally illustrate that the proposed distance trains GANs on high-dimensional images up to a resolution of 256x256 easily.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
CycleVAR: Repurposing Autoregressive Model for Unsupervised One-Step Image Translation
Cora: Correspondence-aware image editing using few step diffusion
Unpaired Image-to-Image Translation for Segmentation and Signal Unmixing
Paired and Unpaired Image to Image Translation using Generative Adversarial Networks
Image-to-Image Translation with Diffusion Transformers and CLIP-Based Image Conditioning
CycleDistill: Bootstrapping Machine Translation using LLMs with Cyclical Distillation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.