A Monte Carlo knowledge gradient method for learning abatement potential of emissions reduction technologies

Proceedings - Winter Simulation Conference

Volumn , Issue , 2009, Pages 1492-1502

  Ryzhov, Ilya O ^a   Powell, Warren B ^a  

^a Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EMISSIONS-REDUCTION TECHNOLOGY; EXPERIMENTAL EVIDENCE; FIELD IMPLEMENTATION; LEARNING POLICY; LEARNING PROBLEM; LOOK-AHEAD; MONTE CARLO; MONTE CARLO SAMPLING; ONLINE LEARNING; OPTIMAL PORTFOLIOS;

EMISSION CONTROL; GAS EMISSIONS; GLOBAL WARMING; GRADIENT METHODS; GREENHOUSE GASES; LEAKAGE (FLUID); MONTE CARLO METHODS;

TECHNOLOGY;

EID: 77951568757     PISSN: 08917736     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WSC.2009.5429301     Document Type: Conference Paper

References (20)

1. Auer, P., N. Cesa-Bianchi, and P. Fischer. 2002. Finite-time analysis of the multiarmed bandit problem. Machine Learning 47:235-256. (Pubitemid 34126111)
2. Chick, S., J. Branke, and C. Schmidt. 2009. Sequential sampling to myopically maximize the expected value of information. Submitted to INFORMS J. on Computing.
3. DeGroot, M. H. 1970. Optimal Statistical Decisions. John Wiley and Sons.
4. Duff, M. 1995. Q-learning for bandit problems. Proceedings of the 12th International Conference on Machine Learning:209-217.
5. Frazier, P., W. Powell, and S. Dayanik. 2008. A knowledge gradient policy for sequential information collection. SIAM Journal on Control and Optimization 47 (5): 2410-2439.
6. Frazier, P., W. Powell, and S. Dayanik. 2009. The knowledge-gradient policy for correlated normal rewards. INFORMS J. on Computing (to appear).
7. Gittins, J. 1989. Multi-armed bandit allocation indices. New York: John Wiley and Sons.
8. Gittins, J. C., and D. M. Jones. 1974. A dynamic allocation index for the sequential design of experiments. In Progress in Statistics, ed. J. Gani, 241-266.
9. Gupta, S., and K. Miescke. 1994. Bayesian look ahead one stage sampling allocations for selecting the largest normal mean. Statistical Papers 35:169-177.
10. Gupta, S., and K. Miescke. 1996. Bayesian look ahead one-stage sampling allocations for selection of the best population. Journal of statistical planning and inference 54 (2): 229-244. (Pubitemid 126161097)
11. Kaelbling, L. P. 1993. Learning in embedded systems. Cambridge, MA: MIT Press.
12. Katehakis, M., and A. Veinott Jr. 1987. The Multi-Armed Bandit Problem: Decomposition and Computation. Mathematics of Operations Research 12 (2): 262-268. (Pubitemid 17603261)
13. Lai, T. L., and H. Robbins. 1985. Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics 6:4-22.
14. McKinsey & Company 2007. Reducing U.S. Greenhouse Gas Emissions: How Much at What Cost? U.S. Greenhouse Gas Abatement Mapping Initiative, Executive Report.
15. Pandey, S., D. Chakrabarti, and D. Agarwal. 2007. Multi-armed bandit problems with dependent arms. Proceedings of the 24th International Conference on Machine Learning:721-728. (Pubitemid 350094044)
16. Powell, W. B. 2007. Approximate dynamic programming: Solving the curses of dimensionality. New York: John Wiley and Sons.
17. Ryzhov, I., and W. Powell. 2009. The knowledge gradient algorithm for online subset selection. In Proceedings of the 2009 IEEE Symposium on Adaptive Dynamic Programming and Reinforcement Learning, Nashville, TN, 137-144.
18. Ryzhov, I., W. Powell, and P. Frazier. 2008. The knowledge gradient algorithm for a general class of online learning problems. Submitted for publication.
19. Vermorel, J., and M. Mohri. 2005. Multi-armed bandit algorithms and empirical evaluation. Proceedings of the 16th European Conference on Machine Learning:437-448.
20. Yao, Y. 2006. Some results on the Gittins index for a normal reward process. In Time Series and Related Topics: In Memory of Ching-Zong Wei, ed. H. Ho, C. Ing, and T. Lai, 284-294. Institute of Mathematical Statistics, Beachwood, OH, USA.