Star discrepancy subset selection: problem formulation and efficient approaches for low dimensions (Q2121499): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 247 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: rhalton / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: sobol.cc / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4220854895 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2101.07881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic discrepancy bound for Monte Carlo point sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the small ball inequality in all dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci sets and symmetrization in discrepancy theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved low-discrepancy sequence for multidimensional quasi-Monte Carlo integration / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for exact calculation of the discrepancy of low-dimensional finite point sets. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3160669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the discrepancy of a random point set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Lower Bounds for the Discrepancy of Latin Hypercube Samples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculation of Discrepancy Measures and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrépance de suites associées à un système de numération (en dimension s) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrepancy bounds for a class of negatively dependent random points including Latin hypercube samples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting / rank
 
Normal rank
Property / cites work
 
Property / cites work: MONTE CARLO METHODS FOR SOLVING MULTIVARIABLE PROBLEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inverse of the star-discrepancy depends linearly on the dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering numbers, Vapnik-Červonenkis classes and bounds for the star-discrepancy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Sobol Sequences with Better Two-Dimensional Projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrepancy and convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The design and analysis of computer experiments. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irregularities of distribution, VII / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distribution of points in a cube and the approximate evaluation of integrals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Good permutations for deterministic scrambled Halton sequences in terms of \(L_2\)-discrepancy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On optimal extreme-discrepancy point sets in the square / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:04, 28 July 2024

scientific article
Language Label Description Also known as
English
Star discrepancy subset selection: problem formulation and efficient approaches for low dimensions
scientific article

    Statements

    Star discrepancy subset selection: problem formulation and efficient approaches for low dimensions (English)
    0 references
    0 references
    0 references
    0 references
    4 April 2022
    0 references
    This article studies the ``star discrepancy subset selection problem'', which can be formulated easily. Given a set of \(n\) points in the \(d\)-dimensional unit cube, find a subset of \(m\) points (where \(m\le n\)) with minimal star discrepancy. The authors show that this selection problem is in fact NP-hard, and introduce algorithmic methods to tackle the selection problem. In particular, a so-called mixed integer linear programming formulation, and a combinatorial branch-and-bound algorithm are studied, and are compared to random subset selection and a greedy construction. The performance of these methods and the discrepancy values of the output sets are analyzed for dimensions two and three, by considering numerical experiments. The results suggest that a suitably selected subset can have a much lower star discrepancy than, e.g., low-discrepancy point sets or points obtained by Latin Hypercube Sampling.
    0 references
    0 references
    computational geometry
    0 references
    discrepancy
    0 references
    subset selection
    0 references
    mixed-integer linear programming
    0 references
    branch and bound
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references