The following pages link to (Q5053236):
Displaying 16 items.
- Generative adversarial networks are special cases of artificial curiosity (1990) and also closely related to predictability minimization (1991) (Q1982402) (← links)
- Generalization error of GAN from the discriminator's perspective (Q2071033) (← links)
- Some theoretical properties of GANs (Q2196234) (← links)
- Embedding decision diagrams into generative adversarial networks (Q2327288) (← links)
- (Q5053325) (← links)
- Interpretable Generative Adversarial Networks With Exponential Function (Q5103679) (← links)
- Approximation bounds for norm constrained neural networks with applications to regression and GANs (Q6038825) (← links)
- Approximating Probability Distributions by Using Wasserstein Generative Adversarial Networks (Q6090834) (← links)
- Sharp convergence rates for empirical optimal transport with smooth costs (Q6126797) (← links)
- Minimax rate of distribution estimation on unknown submanifolds under adversarial losses (Q6177323) (← links)
- Reversible Gromov-Monge sampler for simulation-based inference (Q6536736) (← links)
- Reducing the statistical error of generative adversarial networks using space-filling sampling (Q6548930) (← links)
- Wasserstein upper bounds of \(L^p\)-norms for multivariate densities in Besov spaces (Q6569457) (← links)
- Optimal 1-Wasserstein distance for WGANs (Q6589580) (← links)
- Statistical inference for generative adversarial networks and other minimax problems (Q6608195) (← links)
- Wasserstein generative adversarial networks are minimax optimal distribution estimators (Q6656615) (← links)
