Reducing the statistical error of generative adversarial networks using space-filling sampling
From MaRDI portal
Publication:6548930
DOI10.1002/STA4.655MaRDI QIDQ6548930FDOQ6548930
Authors: Sumin Wang, Yuyou Gao, Yong-Dao Zhou, Bin Pan, Xia Xu, Li Tao
Publication date: 3 June 2024
Published in: Stat (Search for Journal in Brave)
error analysisspace-filling designgenerative learningstatistical errorsdistribution matchingrepresentative samples
Cites Work
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- Integral Probability Metrics and Their Generating Classes of Functions
- A kernel two-sample test
- Orthogonal Array-Based Latin Hypercubes
- Estimating Divergence Functionals and the Likelihood Ratio by Convex Risk Minimization
- Space-filling fractional factorial designs
- Title not available (Why is that?)
- Sliced Latin Hypercube Designs
- Lattice sampling revisited: Monte Carlo variance of means over randomized orthogonal arrays
- Space-filling properties of good lattice point sets
- A study of orthogonal array-based designs under a broad class of space-filling criteria
- A general theory for orthogonal array based Latin hypercube sampling
- Title not available (Why is that?)
- A method of constructing maximin distance designs
- Latin hypercube designs based on strong orthogonal arrays and kriging modelling to improve the payload distribution of trains
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)