Semimyopic measurement selection for optimization under uncertainty

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 42, Issue 2, 2012, Pages 565-579

  Tolpin, David ^a   Shimony, Solomon Eyal ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Computational and artificial intelligence; computational intelligence; greedy algorithms; measurement; myopic; non myopic; optimization; uncertainty; utility; value of information

Indexed keywords

GREEDY ALGORITHMS; MYOPIC; NON-MYOPIC; UNCERTAINTY; UTILITY; VALUE OF INFORMATION;

ARTIFICIAL INTELLIGENCE; FEATURE EXTRACTION; MEASUREMENTS; NORMAL DISTRIBUTION; OPTIMIZATION;

UNCERTAINTY ANALYSIS;

EID: 84859009761     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCB.2011.2169247     Document Type: Article

References (39)

1. I. Rish, M. Brodie, S. Ma, N. Odintsova, A. Beygelzimer, G. Grabarnik, and K. Hernandez, "Adaptive diagnosis in distributed systems," IEEE Trans. Neural Netw., vol. 16, no. 5, pp. 1088-1109, Sep. 2005.
2. A. Krause, J. Leskovec, C. Guestrin, J. VanBriesen, and C. Faloutsos, "Efficient sensor placement optimization for securing large water distribution networks," J. Water Resour. Plan. Manage., vol. 134, no. 6, pp. 516-526, Nov. 2008.
3. Y. Radovilsky and S. E. Shimony, "Observation subset selection as local compilation of performance profiles," in Proc. UAI, 2008, pp. 460-467.
4. S. Russell and E. Wefald, Do the Right Thing: Studies in Limited Rationality. Cambridge, MA: MIT Press, 1991.
5. A. Krause and C. Guestrin, "Optimal value of information in graphical models," J. Artif. Intell. Res. (JAIR), vol. 35, pp. 557-591, 2009.
6. S. J. Russell and D. Subramanian, "Provably bounded-optimal agents," J. Artif. Intell. Res., vol. 2, pp. 575-609, 1995.
7. S. Zilberstein, "Operational rationality through compilation of anytime algorithms," Ph.D. dissertation, Univ. California Berkeley, Berkeley, CA, 1993.
8. N. V. Sahinidis, "Optimization under uncertainty: State-of-the-art and opportunities," Comput. Chem. Eng., vol. 28, no. 6/7, pp. 971-983, Jun. 2004.
9. C. C. Caramanis and S. Mannor, "A Bayesian approach to data-driven optimization under uncertainty," in Proc. Allerton Conf. Commun., Control, Comput., 2007, pp. 158-164.
10. Z. Artstein and R. J.-B. Wets, "Sensors and information in optimization under stochastic uncertainty," Math. Oper. Res., vol. 18, no. 3, pp. 523-547, Aug. 1993.
11. F. Hutter, H. H. Hoos, K. Leyton-Brown, and T. Stützle, "ParamILS: An automatic algorithm configuration framework," J. Artif. Intell. Res., vol. 36, pp. 267-306, Oct. 2009.
12. F. Hutter, H. H. Hoos, K. Leyton-Brown, and K. P. Murphy, "Timebounded sequential parameter optimization," in Proc. 4th Int. Conf. LION, 2010, pp. 281-298.
13. L. P. Kaelbling, M. L. Littman, and A. R. Cassandra, "Planning and acting in partially observable stochastic domains," Artif. Intell., vol. 101, no. 1/2, pp. 99-134, May 1998.
14. A. R. Cassandra, "Exact and approximate algorithms for partially observable Markov decision processes," Ph.D. dissertation, Brown Univ., Providence, RI, 1998.
15. G. Shani, R. I. Brafman, and S. E. Shimony, "Prioritizing point-based POMDP solvers," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 38, no. 6, pp. 1592-1605, Dec. 2008.
16. A. Krause and C. Guestrin, "Near-optimal observation selection using submodular functions," in Proc. AAAI, 2007, pp. 1650-1654.
17. W. Liao, Q. Ji, and W. A. Wallace, "Approximate nonmyopic sensor selection via submodularity and partitioning," IEEE Trans. Syst., Man, Cybern. A, Syst., Humans, vol. 39, no. 4, pp. 782-794, Jul. 2009.
18. A. X. Zheng, I. Rish, and A. Beygelzimer, "Efficient test selection in active diagnosis via entropy approximation," in Proc. UAI, 2005, pp. 675-682.
19. D. Heckerman, E. Horvitz, and B. Middleton, "An approximate nonmyopic computation for value of information," IEEE Trans. Pattern Anal. Mach. Intell., vol. 15, no. 3, pp. 292-298, Mar. 1993.
20. W. Liao and Q. Ji, "Efficient non-myopic value-of-information computation for influence diagrams," Int. J. Approx. Reason., vol. 49, no. 2, pp. 436-450, Oct. 2008.
21. M. Bilgic and L. Getoor, "VOILA: Efficient feature-value acquisition for classification," in Proc. AAAI, 2007, pp. 1225-1230.
22. D. Feillet, P. Dejax, and M. Gendreau, "Traveling salesman problems with profits," Transp. Sci., vol. 39, no. 2, pp. 188-205, May 2005.
23. A. Meliou, A. Krause, C. Guestrin, and J.M. Hellerstein, "Nonmyopic informative path planning in spatio-temporal models," in Proc. 22nd AAAI, 2007, pp. 602-607.
24. J. Vermorel and M. Mohri, "Multi-armed bandit algorithms and empirical evaluation," in Proc. ECML, 2005, pp. 437-448.
25. R. Kleinberg, A. Slivkins, and E. Upfal, "Multi-armed bandits in metric spaces," in Proc. 40th Annu. ACM STOC, 2008, pp. 681-690.
26. S. Guha and K. Munagala, "Multi-armed bandits with metric switching costs," in Proc. 36th ICALP, 2009, pp. 496-507.
27. S. Bubeck, R. Munos, and G. Stoltz, "Pure exploration in finitely-armed and continuous-armed bandits," Theor. Comput. Sci., vol. 412, no. 19, pp. 1832-1852, Apr. 2011.
28. R. B. Gramacy, H. K. H. Lee, and W. G. Macready, "Parameter space exploration with Gaussian process trees," in Proc. Int. Conf.Mach. Learn., 2004, pp. 353-360.
29. D. J. C. MacKay, Information Theory, Inference, and Learning Algorithms. New York: Cambridge Univ. Press, 2003.
30. K. E. Johns and R. C. Fair, Principles of Economics, 5th ed. Englewood Cliffs, NJ: Prentice-Hall, 1999.
31. J. K. Johansson, "Advertising and the s-curve: A new approach," J. Market. Res., vol. 16, no. 3, pp. 346-354, Aug. 1979.
32. S. Zilberstein, "Resource-bounded sensing and planning in autonomous systems," Auton. Robots, vol. 3, no. 1, pp. 31-48, Mar. 1996.
33. S. J. Russell and P. Norvig, Artificial Intelligence: A Modern Approach. Upper Saddle River, NJ: Pearson Educ., 2003.
34. N. Gershenfeld, The Nature of Mathematical Modeling. New York: Cambridge Univ. Press, 1999.
35. D. H. Ackley, A Connectionist Machine for Genetic Hillclimbing. Norwell, MA: Kluwer, 1987.
36. Wikipedia, Himmelblau's Function-Wikipedia, The Free Encyclopedia, 2009. [Online]. Available: http://en.wikipedia.org/wiki/Himmelblau's-function
37. C. M. Bishop, Pattern Recognition and Machine Learning. NewYork: Springer Science+Business Media, LLC, 2007.
38. J. J. Hull, "A database for handwritten text recognition research," IEEE Trans. Pattern Anal. Mach. Intell., vol. 16, no. 5, pp. 550-554, May 1994.
39. C. Hsu, C. Chang, and C. Lin, "A practical guide to support vector classification," Nat. Taiwan Univ., Taipei, Taiwan, 2003.