The Bures Metric for Generative Adversarial Networks - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2021

The Bures Metric for Generative Adversarial Networks

Résumé

Generative Adversarial Networks (GANs) are performant generative methods yielding high-quality samples. However, under certain circumstances, the training of GANs can lead to mode collapse or mode dropping. To address this problem, we use the last layer of the discriminator as a feature map to study the distribution of the real and the fake data. During training, we propose to match the real batch diversity to the fake batch diversity by using the Bures distance between covariance matrices in this feature space. The computation of the Bures distance can be conveniently done in either feature space or kernel space in terms of the covariance and kernel matrix respectively. We observe that diversity matching reduces mode collapse substantially and has a positive effect on sample quality. On the practical side, a very simple training procedure is proposed and assessed on several data sets.

Dates et versions

hal-03511345 , version 1 (04-01-2022)

Identifiants

Citer

Hannes de Meulemeester, Joachim Schreurs, Michaël Fanuel, Bart de Moor, Johan Suykens. The Bures Metric for Generative Adversarial Networks. Machine Learning and Knowledge Discovery in Databases. Research Track, 12976, Springer International Publishing, pp.52-66, 2021, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-86520-7_4⟩. ⟨hal-03511345⟩
20 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More