Least kth-order and Rényi generative adversarial networks

DOI10.1162/NECO_A_01416MaRDI QIDQ5033529zbMATH OpenOpenAlexFDO

Authors Himesh Bhatia, William Paul, Fady Alajaji, Bahman Gharesifard, Philippe Burlina

Publication date 23 February 2022

Published in Neural Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2006.02479

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• Loss-sensitive generative adversarial networks on Lipschitz densities
• Some theoretical properties of GANs
• Adversarial perturbations of deep neural networks
• Multi-projection of unequal dimension optimal transport theory for generative adversary networks
• A geometric view of optimal transportation and generative model

Cited in

(4)

• Least $k$th-Order and R\'{e}nyi Generative Adversarial Networks
• Fisher information and its extensions based on infinite mixture density functions
• Generalization of cross-entropy loss function for image classification
• Improving the quality of generative models through Smirnov transformation

Describes a project that uses

Uses Software

• MNIST
• TensorFlow
• Wasserstein GAN
• StyleGAN
• InfoGAN

This page was built for publication: Least \(k\)th-order and Rényi generative adversarial networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5033529)