Light at the end of the tunnel: A Monte Carlo approach to computing value of information

12th International Conference on Autonomous Agents and Multiagent Systems 2013, AAMAS 2013

Volumn 1, Issue , 2013, Pages 571-578

  Kamar, Ece ^a   Horvitz, Eric ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

Crowdsourcing systems; Monte Carlo planning; POMDP

Indexed keywords

AUTONOMOUS AGENTS; DATA PROCESSING; MULTI AGENT SYSTEMS;

CROWDSOURCING; EXPECTED VALUE OF INFORMATION; LONG SEQUENCES; MONTE CARLO APPROACH; MONTE CARLO PROCEDURES; POMDP; POTENTIAL OUTCOMES; VALUE OF INFORMATION;

MONTE CARLO METHODS;

EID: 84899436528     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. Galaxy Zoo, 2007, http://zool.galaxyzoo.org/.
2. A. Barto, S. Bradtke, and S. Singh. Learning to act using real-time dynamic programming. Artificial Intelligence, 72(1): 81-138, 1995.
3. M. Bilgic and L. Getoor. Value of information lattice: Exploiting probabilistic independence for effective feature subset acquisition. J AIR, 2011.
4. D. Chickering, D. Heckerman, and C. Meek. A Bayesian approach to learning Bayesian networks with local structure. In UAI, pages 80-89, 1997.
5. S. Dittmer and F. Jensen. Myopic value of information in influence diagrams. In UAI, pages 142-149, 1997.
6. G. Gorry, J. Kassirer, A. Essig, and W. Schwartz. Decision analysis as the basis for computer-aided management of acute renal failure. AIM, 1973.
7. H. Hajishirzi, A. Shirazi, J. Choi, and E. Amir. Greedy algorithms for sequential sensing decisions. In IJCAI, pages 1908-1915, 2009.
8. E. Hansen and S. Zilberstein. Monitoring and control of anytime algorithms: A dynamic programming approach. Artificial Intelligence, 126(1): 139-157, 2001.
9. D. Heckerman, E. Horvitz, and B. Middleton. An approximate nonmyopic computation for value of information. TPAMI, 15(3): 292-298, 1993.
10. D. Heckerman, E. Horvitz, and B. Nathwani. Toward normative expert systems. Part I: The Pathfinder project. Methods of Information in Medicine, 1992.
11. R. Howard. Information value theory. Systems Science and Cybernetics, 2(1): 22-26, 1966.
12. L. Kaelbling, M. Littman, and A. Cassandra. Planning and acting in partially observable stochastic domains. Artificial Intelligence, 101(1): 99-134, 1998.
13. E. Kamar, S. Hacker, and E. Horvitz. Combining human and machine intelligence in a large-scale crowdsourcing system. In AAMAS, 2012.
14. M. Kearns, Y. Mansour, and A. Ng. A sparse sampling algorithm for near-optimal planning in large markov decision processes. In IJCAI, 1999.
15. L. Kocsis and C. Szepesvári. Bandit based Monte-Carlo planning. ECML, pages 282-293, 2006.
16. A. Krause and C. Guestrin. Near-optimal observation selection using submodular functions. In AAAI, 2007.
17. W. Liao and Q. Ji. Efficient non-myopic value-of-information computation for influence diagrams. International Journal of Approximate Reasoning, 49(2): 436-450, 2008.
18. A. Mahajan and D. Teneketzis. Multi-armed bandit problems. Foundations and Applications of Sensor Management, pages 121-151, 2008.
19. G. Peskir and A. Shiryaev. Optimal stopping and free-boundary problems, Volume 10. 2006.
20. S. Reches, M. Kalech, and R. Stern. When to stop? that is the question. In AAAI, 2011.
21. V. Sheng, F. Provost, and P. Ipeirotis. Get another label? Improving data quality and data mining using multiple, noisy labelers. In ACM SIGKDD, 2008.
22. D. Silver and J. Veness. Monte-Carlo planning in large POMDPs. 2010.
23. Y. Zhang. Multi-task active learning with output constraints. In AAAI, 2010.