Super-polynomial accuracy of multidimensional randomized nets using the median-of-means
From MaRDI portal
Publication:6562839
Recommendations
- Super-polynomial accuracy of one dimensional randomized nets using the median of means
- A Universal Median Quasi-Monte Carlo Integration
- Scrambled net variance for integrals of smooth functions
- Higher order scrambled digital nets achieve the optimal rate of the root mean square error for smooth integrands
- Scrambling Sobol' and Niederreiter-Xing points
Cites work
- scientific article; zbMATH DE number 5797591 (Why is no real title available?)
- scientific article; zbMATH DE number 3854294 (Why is no real title available?)
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 1222942 (Why is no real title available?)
- scientific article; zbMATH DE number 1894664 (Why is no real title available?)
- scientific article; zbMATH DE number 822320 (Why is no real title available?)
- Analytic combinatorics
- Asymptotische Aussagen über Partitionen
- Bounds on Walsh coefficients by dyadic difference and a new Koksma-Hlawka type inequality for quasi-Monte Carlo integration
- Consistency of randomized integration methods
- Constructing Sobol Sequences with Better Two-Dimensional Projections
- Construction-free median quasi-Monte Carlo rules for function spaces with unspecified smoothness and general weights
- Effective dimension of some weighted pre-Sobolev spaces with dominating mixed partial derivatives
- Extensible Grids: Uniform Sampling on a Space Filling Curve
- Low-discrepancy sequences and global function fields with many rational places
- Meinardus' theorem on weighted partitions: Extensions and a probabilistic proof
- On the \(L_2\)-discrepancy for anchored boxes
- On the asymptotic distribution of scrambled net quadrature.
- Partition of an integer into distinct bounded parts, identities and bounds
- Quasi-Monte Carlo Software
- Quasi-Monte Carlo integration
- Random generation of combinatorial structures from a uniform distribution
- Robust machine learning by median-of-means: theory and practice
- Scrambled net variance for integrals of smooth functions
- Solvable integration problems and optimal sample size selection
- Sub-Gaussian mean estimators
- Super-polynomial accuracy of one dimensional randomized nets using the median of means
- The Mean Square Discrepancy of Scrambled (t,s)-Sequences
- The discrepancy and gain coefficients of scrambled digital nets.
- The nonzero gain coefficients of Sobol's sequences are always powers of two
- Walsh Spaces Containing Smooth Functions and Quasi–Monte Carlo Rules of Arbitrary High Order
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
This page was built for publication: Super-polynomial accuracy of multidimensional randomized nets using the median-of-means
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6562839)
