Taylor & Francis Group
Browse

sorry, we can't preview this file

atmopt_0.1.0.tar.gz (7.86 kB)

Analysis-of-Marginal-Tail-Means (ATM): A Robust Method for Discrete Black-Box Optimization

Download (7.86 kB)
Version 3 2019-11-13, 21:24
Version 2 2019-06-25, 16:22
Version 1 2019-03-25, 17:26
dataset
posted on 2019-11-13, 21:24 authored by Simon Mak, C. F. Jeff Wu

We present a new method, called analysis-of-marginal-tail-means (ATM), for effective robust optimization of discrete black-box problems. ATM has important applications in many real-world engineering problems (e.g., manufacturing optimization, product design, and molecular engineering), where the objective to optimize is black-box and expensive, and the design space is inherently discrete. One weakness of existing methods is that they are not robust: these methods perform well under certain assumptions, but yield poor results when such assumptions (which are difficult to verify in black-box problems) are violated. ATM addresses this by combining both rank- and model-based optimization, via the use of marginal tail means. The trade-off between rank- and model-based optimization is tuned by first identifying important main effects and interactions from data, then finding a good compromise which best exploits additive structure. ATM provides improved robust optimization over existing methods, particularly in problems with (i) a large number of factors, (ii) unordered factors, or (iii) experimental noise. We demonstrate the effectiveness of ATM in simulations and in two real-world engineering problems: the first on robust parameter design of a circular piston, and the second on product family design of a thermistor network.

History