Efficient computing budget allocation for finding simplest good designs

Qing-Shan Jia, Enlu Zhou and Chun-Hung Chen

IISE Transactions, 2013, vol. 45, issue 7, 736-750

Abstract: In many applications some designs are easier to implement, require less training data and shorter training time, and consume less storage than others. Such designs are called simple designs and are usually preferred over complex ones when they all have good performance. Despite the abundant existing studies on how to find good designs in simulation-based optimization, there exist few studies on finding simplest good designs. This article considers this important problem and the following contributions are made to the subject. First, lower bounds are provided for the probabilities of correctly selecting the m simplest designs with top performance and selecting the best m such simplest good designs, respectively. Second, two efficient computing budget allocation methods are developed to find m simplest good designs and to find the best m such designs, respectively, and their asymptotic optimalities have been shown. Third, the performance of the two methods is compared with equal allocations over six academic examples and a smoke detection problem in a wireless sensor network.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/0740817X.2012.705454 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:uiiexx:v:45:y:2013:i:7:p:736-750

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uiie20

DOI: 10.1080/0740817X.2012.705454

Access Statistics for this article

IISE Transactions is currently edited by Jianjun Shi

More articles in IISE Transactions from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().