Reducing the statistical error of generative adversarial networks using space-filling sampling
From MaRDI portal
Publication:6548930
Cites work
- scientific article; zbMATH DE number 775913 (Why is no real title available?)
- scientific article; zbMATH DE number 7626743 (Why is no real title available?)
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- A general theory for orthogonal array based Latin hypercube sampling
- A kernel two-sample test
- A method of constructing maximin distance designs
- A study of orthogonal array-based designs under a broad class of space-filling criteria
- Estimating Divergence Functionals and the Likelihood Ratio by Convex Risk Minimization
- Integral Probability Metrics and Their Generating Classes of Functions
- Latin hypercube designs based on strong orthogonal arrays and kriging modelling to improve the payload distribution of trains
- Lattice sampling revisited: Monte Carlo variance of means over randomized orthogonal arrays
- Orthogonal Array-Based Latin Hypercubes
- Sliced Latin Hypercube Designs
- Space-filling fractional factorial designs
- Space-filling properties of good lattice point sets
This page was built for publication: Reducing the statistical error of generative adversarial networks using space-filling sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6548930)