Name
Abstract | ||
|---|---|---|
We investigate the problem of detecting a point set's deviation from uniformity in the unit hypercube. High uniformity is for example desirable in Monte Carlo methods for numerical integration, but also for obtaining a good worst-case bound in global optimization. In high dimensions, many points are required to get reliable results, so the point sets are preferably generated by fast methods such as quasirandom sequences. Unfortunately, assessing their uniformity often requires quadratic time. So, we present several numerical summary characteristics of point sets that can be computed in linear time. They do not measure uniformity directly, but by comparing them to reference values for the uniform distribution, deviations from uniformity can be quickly detected. The necessary reference values are also derived here, if possible exactly, else approximately. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.15388/Informatica.2016.88 | INFORMATICA |
Keywords | Field | DocType |
uniformity, measure, linear time, hypercube | Mathematical optimization,Time complexity,Hypercube,Mathematics,Estimator | Journal |
Volume | Issue | ISSN |
27 | 2 | 0868-4952 |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Günter Rudolph | 1 | 219 | 48.59 |
| Simon Wessing | 2 | 87 | 8.05 |