paper-with-me

홈 › Papers

The Partition Principle Revisited: Non-Equal Volume Designs Achieve Minimal Expected Star Discrepancy

2026-02-27 · Xiaoda Xu arxiv

We study the expected star discrepancy under a newly designed class of non-equal volume partitions. The main contributions are twofold. First, we establish a strong partition principle for the star discrepancy, showing that our newly designed non-equal volume partitions yield stratified sampling point sets with lower expected star discrepancy than classical jittered sampling. Specifically, we prove that $\mathbb{E}(D^{*}_{N}(Z)) < \mathbb{E}(D^{*}_{N}(Y))$, where $Y$ and $Z$ represent jittered sampling and our non-equal volume partition sampling, respectively. Second, we derive explicit upper bounds for the expected star discrepancy under our non-equal volume partition models, which improve upon existing bounds for jittered sampling. Our results provide a theoretical foundation for using non-equal volume partitions in high-dimensional numerical integration.

📄 PDF Abstract BibTeX arXiv:2603.00202

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

A Ptolemaic Partitioning Mechanism

2022-08-19 · Richard Connor

For many years, exact metric search relied upon the property of triangle inequality to give a lower bound on uncalculated distances. Two exclusion mechanisms derive from this property, generally known as pivot exclusion …

NeRF Revisited: Fixing Quadrature Instability in Volume Rendering

2023-10-31 · NeurIPS 2023 11 · Mikaela Angelina Uy, Kiyohiro Nakayama, Guandao Yang, Rahul Krishna Thomas 외

Neural radiance fields (NeRF) rely on volume rendering to synthesize novel views. Volume rendering requires evaluating an integral along each ray, which is numerically approximated with a finite sum that corresponds to t…

NeRF

Geometric Near-neighbor Access Tree (GNAT) revisited

2016-05-20 · Fredriksson Kimmo

Geometric Near-neighbor Access Tree (GNAT) is a metric space indexing method based on hierarchical hyperplane partitioning of the space. While GNAT is very efficient in proximity searching, it has a bad reputation of bei…

Comparison-Based Indexing From First Principles

2019-08-17 · Magnus Lie Hetland

Basic assumptions about comparison-based indexing are laid down and a general design space is derived from these. An index structure spanning this design space (the sprawl) is described, along with an associated family o…

Conditional independence structures over four discrete random variables revisited: conditional Ingleton inequalities

2020-12-07 · Milan Studeny

The paper deals with conditional linear information inequalities valid for entropy functions induced by discrete random variables. Specifically, the so-called conditional Ingleton inequalities are in the center of intere…

valid