Bounds of star discrepancy for HSFC-based sampling

01/22/2023
by   Xiaoda Xu, et al.
0

In this paper, we focus on estimating the probabilistic upper bounds of star discrepancy for Hilbert space filling curve (HSFC) sampling. The main idea is the stratified random sampling method, but the strict condition for sampling number N=m^d of jittered sampling is removed. We inherit the advantages of this sampling and get better results than Monte Carlo (MC) sampling.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/24/2019

On Negatively Dependent Sampling Schemes, Variance Reduction, and Probabilistic Upper Discrepancy Bounds

We study some notions of negative dependence of a sampling scheme that c...
research
02/06/2021

Discrepancy Bounds for a Class of Negatively Dependent Random Points Including Latin Hypercube Samples

We introduce a class of γ-negatively dependent random samples. We prove ...
research
03/02/2022

Star discrepancy for new stratified random sampling I: optimal expected star discrepancy

We introduce a class of convex equivolume partitions. Expected star disc...
research
07/12/2022

Rendering along the Hilbert Curve

Based on the seminal work on Array-RQMC methods and rank-1 lattice seque...
research
04/07/2013

Constructing Low Star Discrepancy Point Sets with Genetic Algorithms

Geometric discrepancies are standard measures to quantify the irregulari...
research
10/04/2021

Expected uniform integration approximation under general equal measure partition

In this paper, we study bounds of expected L_2-discrepancy to give mean ...
research
06/27/2023

Heuristic Approaches to Obtain Low-Discrepancy Point Sets via Subset Selection

Building upon the exact methods presented in our earlier work [J. Comple...

Please sign up or login with your details

Forgot password? Click here to reset