Group-invariant generative adversarial networks (GANs) are a type of GANs in which the generators and discriminators are hardwired with group symmetries. Empirical studies have shown that these networks are capable of learning group-invariant distributions with significantly improved data efficiency. In this study, we aim to rigorously quantify this improvement by analyzing the reduction in sample complexity for group-invariant GANs. Our findings indicate that when learning group-invariant distributions, the number of samples required for group-invariant GANs decreases proportionally with a power of the group size, and this power depends on the intrinsic dimension of the distribution's support. To our knowledge, this work presents the first statistical estimation for group-invariant generative models, specifically for GANs, and it may shed light on the study of other group-invariant generative models.

翻译：群不变生成对抗网络（Group-invariant GANs）是一类将生成器与判别器硬编码为具有群对称性的GANs。实证研究表明，此类网络能够以显著提升的数据效率学习群不变分布。本研究旨在通过分析群不变GANs的样本复杂度降低量，严格量化这一提升。我们的发现表明，在学习群不变分布时，群不变GANs所需样本数量随群大小的幂次成比例减少，且该幂次取决于分布支撑集的固有维度。据我们所知，本文首次提出了针对群不变生成模型的统计估计方法——尤其是针对GANs，这或将为其他群不变生成模型的研究提供启示。