Calculation of Discrepancy Measures and Applications
From MaRDI portal
Publication:5264200
DOI10.1007/978-3-319-04696-9_10zbMath1358.11087arXiv1405.1653OpenAlexW1845321886MaRDI QIDQ5264200
Carola Doerr, Michael Gnewuch, Magnus Wahlström
Publication date: 24 July 2015
Published in: A Panorama of Discrepancy Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.1653
Irregularities of distribution, discrepancy (11K38) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items
Star discrepancy subset selection: problem formulation and efficient approaches for low dimensions ⋮ Deterministic constructions of high-dimensional sets with small dispersion ⋮ Physics-informed distribution transformers via molecular dynamics and deep neural networks ⋮ Some Results on the Complexity of Numerical Integration ⋮ A Metropolis random walk algorithm to estimate a lower bound of the star discrepancy ⋮ On density extrema for digital discs ⋮ On the expected \(\mathcal{L}_2\)-discrepancy of jittered sampling ⋮ An enumerative formula for the spherical cap discrepancy ⋮ Discrepancy bounds for a class of negatively dependent random points including Latin hypercube samples ⋮ Extremal distributions of discrepancy functions ⋮ A nonlocal functional promoting low-discrepancy point sets ⋮ Secure pseudorandom bit generators and point sets with low star-discrepancy ⋮ Discrepancy of stratified samples from partitions of the unit cube ⋮ On the discrepancy of jittered sampling ⋮ A generalized Faulhaber inequality, improved bracketing covers, and applications to discrepancy ⋮ On the distribution of local extrema in quantum chaos ⋮ Octagonal symmetry in low-discrepancy β-manganese ⋮ New approach to greedy vector quantization ⋮ A Strong Law of Large Numbers for Scrambled Net Integration ⋮ Fast Variable Density 3-D Node Generation ⋮ A random walk algorithm to estimate a lower bound of the star discrepancy
Cites Work
- Evolutionary optimization of low-discrepancy sequences
- ON A WAY OF OBTAINING LOWER ESTIMATES FOR THE ERRORS OF QUADRATURE FORMULAS
- Efficient algorithms for computing the $L_2$-discrepancy
- On tractability of weighted integration over bounded and unbounded regions in ℝ^{𝕤}
- Generalized Halton sequences in 2008
- Irregularities for distribution IX
- Randomized Rounding in the Presence of a Cardinality Constraint
- Quadrature rules and distribution of points on manifolds
- Entropy, Randomization, Derandomization, and Discrepancy
- An Intermediate Bound on the Star Discrepancy
- Random and Deterministic Digit Permutations of the Halton Sequence
- Generating Randomized Roundings with Cardinality Constraints and Derandomizations
- Discrepancy of generalized Hammersley type point sets in Besov spaces of dominating mixed smoothness
- Some applications of multidimensional integration by parts
- Geometric discrepancy. An illustrated guide
- On the complexity of \(k\)-SAT
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Constructing Sobol Sequences with Better Two-Dimensional Projections
- Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension
- Asymptotic behavior of average \(L_p\)-discrepancies
- A note on E. Thiémard's algorithm to compute bounds for the star discrepancy
- Bounds for the weighted \(L^p\) discrepancy and tractability of integration
- Weighted geometric discrepancies and numerical integration on reproducing kernel Hilbert spaces
- Sequences, discrepancies and applications
- Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
- On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
- Good permutations for deterministic scrambled Halton sequences in terms of \(L_2\)-discrepancy
- Scenario reduction in stochastic programming with respect to discrepancy distances
- Strong computational lower bounds via parameterized complexity
- Tractability of multivariate problems. Volume I: Linear information
- Bases in function spaces, sampling, discrepancy, numerical integration
- Tractability of multivariate problems. Volume II: Standard information for functionals.
- The asymptotic behavior of the average \(L^p\)-discrepancies and a randomized discrepancy
- Discrepancy distances and scenario reduction in two-stage stochastic mixed-integer programming
- Construction of minimal bracketing covers for rectangles
- Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems
- A (slightly) faster algorithm for Klee's measure problem
- A method for exact calculation of the stardiscrepancy of plane sets applied to the sequences of Hammersley
- On the discrepancy of convex plane sets
- An improved low-discrepancy sequence for multidimensional quasi-Monte Carlo integration
- The dispersion of the Hammersley sequence in the unit square
- On optimal extreme-discrepancy point sets in the square
- Convergence rates for the isotrope discrepancy
- Average case complexity of multivariate integration for smooth functions
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
- Random and quasi-random point sets
- On the \(L_2\)-discrepancy for anchored boxes
- Numerical integration using sparse grids
- A method for exact calculation of the discrepancy of low-dimensional finite point sets. I
- Explicit cost bounds of algorithms for multivariate tensor product problems
- An algorithm to compute bounds for the star discrepancy
- Optimal volume subintervals with \(k\) points and star discrepancy via integer programming
- Component-by-component constructions achieve the optimal rate of convergence for multivariate integration in weighted Korobov and Sobolev spaces
- Randomized Halton sequences
- Computing bounds for the star discrepancy
- Error reduction techniques in quasi-Monte Carlo integration.
- Which problems have strongly exponential complexity?
- Discrepancy and convex programming
- Liberating the weights
- Computing discrepancies of Smolyak quadrature rules
- A note on optimal point distributions in \([0,1)^{s}\)
- Minimizing the \(L_{2}\) and \(L_{\infty}\) star discrepancies of a single point in the unit hypercube
- Quasi-Monte Carlo methods for integration of functions with dominating mixed smoothness in arbitrary dimension
- Uniform design over general input domains with applications to target region estimation in computer experiments
- Optimized \(U\)-type designs on flexible regions
- Discrepancy with respect to convex polygons
- Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy
- Parametrized complexity theory.
- Monte Carlo and quasi-Monte Carlo sampling
- The extreme and \(L^2\) discrepancies of some plane sets
- La discrépance isotrope et l'intégration numérique
- High dimensional integration of smooth functions over cubes
- Tight lower bounds for certain parameterized NP-hard problems
- Bounds for the average \(L^p\)-extreme and the \(L^\infty\)-extreme discrepancy
- On the optimal Halton sequence
- Bounds and constructions for the star-discrepancy via \(\delta\)-covers
- Component-by-component construction of good lattice rules
- A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
- Discrepancy, Integration and Tractability
- A genetic algorithm approach to estimate lower bounds of the star discrepancy
- Dyadic diaphony
- On the step-by-step construction of quasi--Monte Carlo integration rules that achieve strong tractability error bounds in weighted Sobolev spaces
- The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
- Some upper bounds in the theory of irregularities of distribution
- Average case complexity of multivariate integration
- Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces
- Exponential Squared Integrability of the Discrepancy Function in Two Dimensions
- Implementation of a Component-By-Component Algorithm to Generate Small Low-Discrepancy Samples
- Can the Measure of ∪ n 1 [ a i , b i be Computed in Less Than O(n logn) Steps?]
- Component-by-component construction of low-discrepancy point sets of small size
- Scenario Reduction Techniques in Stochastic Programming
- MONTE CARLO METHODS FOR SOLVING MULTIVARIABLE PROBLEMS
- Discrépance de suites associées à un système de numération (en dimension s)
- Discrépances de suites associées à un système de numération (en dimension un)
- New Upper Bounds in Klee’s Measure Problem
- On Computing the Lattice Rule Criterion R
- On the complexity of computing the measure of ∪[a i ,b i ]
- Quasi-Random Sequences and Their Discrepancies
- A generalized discrepancy and quadrature error bound
- Application of Threshold-Accepting to the Evaluation of the Discrepancy of a Set of Points
- The inverse of the star-discrepancy depends linearly on the dimension
- Uniform Design: Theory and Application
- Good Parameters and Implementations for Combined Multiple Recursive Random Number Generators
