Enhanced branching Latin hypercube design and its application in automatic algorithm configuration

DOI10.1111/SJOS.12786MaRDI QIDQ6939996zbMATH OpenFDO

Authors Bing Wen, Sumin Wang, Fasheng Sun

Publication date 20 August 2025

Published in Scandinavian Journal of Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/SJOS.12786

zbMATH Keywords

branching factorcomputer experimentnested factororthogonal arraysliced Latin hypercube designspace-filling design

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites work

• A class of mixed orthogonal arrays obtained from projection matrix inequalities
• A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
• A construction method for maximin \(L_1\)-distance Latin hypercube designs
• An approach of constructing mixed-level orthogonal arrays of strength 3
• Complete enumeration of pure-level and mixed-level orthogonal arrays
• Construction of mixed orthogonal arrays with high strength
• Constructions of mixed orthogonal arrays of strength three
• Design for computer experiments with qualitative and quantitative factors
• Exploratory designs for computational experiments
• Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
• scientific article; zbMATH DE number 6276119 (Why is no real title available?)
• Maximum projection designs for computer experiments
• On construction of marginally coupled designs
• On Design Orthogonality, Maximin Distance, and Projection Uniformity for Computer Experiments
• On the construction of nested space-filling designs
• Optimal Experimental Design in the Presence of Nested Factors
• Optimal maximin \(L_{1}\)-distance Latin hypercube designs based on good lattice point designs
• Orthogonal Array-Based Latin Hypercubes
• Orthogonal arrays obtained by repeating-column difference matrices
• Orthogonal arrays. Theory and applications
• Orthogonal designs with branching and nested factors
• Orthogonal-maximin Latin hypercube designs
• Sliced Latin Hypercube Designs
• Strong orthogonal arrays and associated Latin hypercubes for computer experiments
• Strong orthogonal arrays of strength two plus
• Tuning metaheuristics. A machine learning Perspective
• Uniform projection designs

This page was built for publication: Enhanced branching Latin hypercube design and its application in automatic algorithm configuration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6939996)