TY - JOUR
T1 - Semimyopic measurement selection for optimization under uncertainty
AU - Tolpin, David
AU - Shimony, Solomon Eyal
N1 - Funding Information:
Manuscript received August 25, 2011; accepted September 4, 2011. Date of publication October 20, 2011; date of current version March 16, 2012. This work was supported in part by the IMG4 consortium under the MAGNET program of the Israel Ministry of Trade and Industry, by Israel Science Foundation Grant 305/09, and by the Lynne and William Frankel Center for Computer Sciences. This paper was recommended by Editor E. Santos, Jr.
PY - 2012/4/1
Y1 - 2012/4/1
N2 - The following sequential decision problem is considered: given a set of items of unknown utility, an item with as high a utility as possible must be selected ("the selection problem"). Measurements (possibly noisy) of item features prior to selection are allowed at known costs. The goal is to optimize the overall sequential decision process of measurements and selection. Value of information (VOI) is a well-known scheme for selecting measurements, but the intractability of the problem typically leads to using myopic VOI estimates. In the selection problem, myopic VOI frequently badly underestimates the VOI, leading to inferior measurement policies. In this paper, the strict myopic assumption is relaxed into a scheme termed semimyopic, providing a spectrum of methods that can improve the performance of measurement policies. In particular, the efficiently computable method of blinkered VOI is proposed, and theoretical bounds for important special cases are examined. Empirical evaluation of blinkered VOI in the selection problem with normally distributed item values shows that it performs much better than pure myopic VOI.
AB - The following sequential decision problem is considered: given a set of items of unknown utility, an item with as high a utility as possible must be selected ("the selection problem"). Measurements (possibly noisy) of item features prior to selection are allowed at known costs. The goal is to optimize the overall sequential decision process of measurements and selection. Value of information (VOI) is a well-known scheme for selecting measurements, but the intractability of the problem typically leads to using myopic VOI estimates. In the selection problem, myopic VOI frequently badly underestimates the VOI, leading to inferior measurement policies. In this paper, the strict myopic assumption is relaxed into a scheme termed semimyopic, providing a spectrum of methods that can improve the performance of measurement policies. In particular, the efficiently computable method of blinkered VOI is proposed, and theoretical bounds for important special cases are examined. Empirical evaluation of blinkered VOI in the selection problem with normally distributed item values shows that it performs much better than pure myopic VOI.
KW - Computational and artificial intelligence
KW - computational intelligence
KW - greedy algorithms
KW - measurement
KW - myopic
KW - non-myopic
KW - optimization
KW - uncertainty
KW - utility
KW - value of information
UR - http://www.scopus.com/inward/record.url?scp=84859009761&partnerID=8YFLogxK
U2 - 10.1109/TSMCB.2011.2169247
DO - 10.1109/TSMCB.2011.2169247
M3 - Article
C2 - 22027390
AN - SCOPUS:84859009761
SN - 1083-4419
VL - 42
SP - 565
EP - 579
JO - IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
JF - IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
IS - 2
M1 - 6056578
ER -