Higher order scrambled digital nets achieve the optimal rate of the root
mean square error for smooth integrands

v1v2v3v4 (latest)

Higher order scrambled digital nets achieve the optimal rate of the root mean square error for smooth integrands

6 July 2010

ArXiv (abs)PDF HTML

Papers citing "Higher order scrambled digital nets achieve the optimal rate of the root mean square error for smooth integrands"

10 / 10 papers shown

Title
Towards a Unified Quadrature Framework for Large-Scale Kernel Machines Fanghui Liu Xiaolin Huang Yudong Chen Johan A. K. Suykens 90 4 0 03 Nov 2020
On dropping the first Sobol' point Art B. Owen 84 30 0 18 Aug 2020
Effectively Unbiased FID and Inception Score and where to find them Min Jin Chong David A. Forsyth EGVM 109 205 0 16 Nov 2019
Unreasonable effectiveness of Monte Carlo Art B. Owen 41 1 0 18 Jan 2019
Quasi Markov Chain Monte Carlo Methods Tobias Schwedes B. Calderhead 66 6 0 29 Jun 2018
Convergence Analysis of Deterministic Kernel-Based Quadrature Rules in Misspecified Settings Motonobu Kanagawa Bharath K. Sriperumbudur Kenji Fukumizu 111 45 0 01 Sep 2017
A randomized Halton algorithm in R Art B. Owen 41 29 0 09 Jun 2017
Convergence guarantees for kernel-based quadrature rules in misspecified settings Motonobu Kanagawa Bharath K. Sriperumbudur Kenji Fukumizu 193 52 0 24 May 2016
Transformations and Hardy-Krause variation Kinjal Basu Art B. Owen 56 24 0 09 Dec 2015
Control Functionals for Quasi-Monte Carlo Integration Chris J. Oates Mark Girolami 208 27 0 14 Jan 2015