{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:05:53Z","timestamp":1725537953722},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642049439"},{"type":"electronic","value":"9783642049446"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04944-6_6","type":"book-chapter","created":{"date-parts":[[2009,9,15]],"date-time":"2009-09-15T22:09:36Z","timestamp":1253052576000},"page":"61-73","source":"Crossref","is-referenced-by-count":2,"title":["Bounds for Multistage Stochastic Programs Using Supervised Learning Strategies"],"prefix":"10.1007","author":[{"given":"Boris","family":"Defourny","sequence":"first","affiliation":[]},{"given":"Damien","family":"Ernst","sequence":"additional","affiliation":[]},{"given":"Louis","family":"Wehenkel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","first-page":"277","volume":"75","author":"K. Frauendorfer","year":"1996","unstructured":"Frauendorfer, K.: Barycentric scenario trees in convex multistage stochastic programming. Mathematical Programming\u00a075, 277\u2013294 (1996)","journal-title":"Mathematical Programming"},{"key":"6_CR2","first-page":"153","volume":"84","author":"M. Dempster","year":"1998","unstructured":"Dempster, M.: Sequential importance sampling algorithms for dynamic stochastic programming. Annals of Operations Research\u00a084, 153\u2013184 (1998)","journal-title":"Annals of Operations Research"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1019206915174","volume":"100","author":"J. Dupacova","year":"2000","unstructured":"Dupacova, J., Consigli, G., Wallace, S.: Scenarios for multistage stochastic programs. Annals of Operations Research\u00a0100, 25\u201353 (2000)","journal-title":"Annals of Operations Research"},{"issue":"2","key":"6_CR4","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1287\/mnsc.47.2.295.9834","volume":"47","author":"K. H\u00f8yland","year":"2001","unstructured":"H\u00f8yland, K., Wallace, S.: Generating scenario trees for multistage decision problems. Management Science\u00a047(2), 295\u2013307 (2001)","journal-title":"Management Science"},{"key":"6_CR5","series-title":"Handbooks in Operations Research and Management Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/S0927-0507(03)10006-0","volume-title":"Stochastic Programming","author":"A. Shapiro","year":"2003","unstructured":"Shapiro, A.: Monte Carlo sampling methods. In: Ruszczy\u0144ski, A., Shapiro, A. (eds.) Stochastic Programming. Handbooks in Operations Research and Management Science, vol.\u00a010, pp. 353\u2013425. Elsevier, Amsterdam (2003)"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1287\/moor.1050.0146","volume":"30","author":"M. Casey","year":"2005","unstructured":"Casey, M., Sen, S.: The scenario generation algorithm for multistage stochastic linear programming. Mathematics of Operations Research\u00a030, 615\u2013631 (2005)","journal-title":"Mathematics of Operations Research"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10479-006-0140-6","volume":"152","author":"R. Hochreiter","year":"2007","unstructured":"Hochreiter, R., Pflug, G.: Financial scenario generation for stochastic multi-stage decision processes as facility location problems. Annals of Operations Research\u00a0152, 257\u2013272 (2007)","journal-title":"Annals of Operations Research"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s10107-007-0113-9","volume":"116","author":"T. Pennanen","year":"2009","unstructured":"Pennanen, T.: Epi-convergent discretizations of multistage stochastic programs via integration quadratures. Mathematical Programming\u00a0116, 461\u2013479 (2009)","journal-title":"Mathematical Programming"},{"issue":"2","key":"6_CR9","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10107-007-0197-2","volume":"118","author":"H. Heitsch","year":"2009","unstructured":"Heitsch, H., R\u00f6misch, W.: Scenario tree modeling for multistage stochastic programs. Mathematical Programming\u00a0118(2), 371\u2013406 (2009)","journal-title":"Mathematical Programming"},{"issue":"1","key":"6_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.orl.2005.02.003","volume":"34","author":"A. Shapiro","year":"2006","unstructured":"Shapiro, A.: On complexity of multistage stochastic programs. Operations Research Letters\u00a034(1), 1\u20138 (2006)","journal-title":"Operations Research Letters"},{"issue":"1","key":"6_CR11","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s001860300280","volume":"58","author":"A. Shapiro","year":"2003","unstructured":"Shapiro, A.: Inference of statistical bounds for multistage stochastic programming problems. Mathematical Methods of Operations Research\u00a058(1), 57\u201368 (2003)","journal-title":"Mathematical Methods of Operations Research"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/0377-2217(94)00038-E","volume":"85","author":"B. Golub","year":"1995","unstructured":"Golub, B., Holmer, M., McKendall, R., Pohlman, L., Zenios, S.: A stochastic programming model for money management. European Journal of Operational Research\u00a085, 282\u2013296 (1995)","journal-title":"European Journal of Operational Research"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0377-2217(00)00261-7","volume":"134","author":"R. Kouwenberg","year":"2001","unstructured":"Kouwenberg, R.: Scenario generation and stochastic programming models for asset liability management. European Journal of Operational Research\u00a0134, 279\u2013292 (2001)","journal-title":"European Journal of Operational Research"},{"key":"6_CR14","first-page":"185","volume":"44","author":"P. Hilli","year":"2008","unstructured":"Hilli, P., Pennanen, T.: Numerical study of discretizations of multistage stochastic programs. Kybernetika\u00a044, 185\u2013204 (2008)","journal-title":"Kybernetika"},{"key":"6_CR15","volume-title":"Probability and Measure","author":"P. Billingsley","year":"1995","unstructured":"Billingsley, P.: Probability and Measure, 3rd edn. Wiley, Chichester (1995)","edition":"3"},{"key":"6_CR16","volume-title":"Statistical Learning Theory","author":"V. Vapnik","year":"1998","unstructured":"Vapnik, V.: Statistical Learning Theory. Wiley, Chichester (1998)"},{"key":"6_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-84858-7","volume-title":"The Elements of Statistical Learning: Data Mining, Inference, and Prediction","author":"T. Hastie","year":"2009","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning: Data Mining, Inference, and Prediction, 2nd edn. Springer, Heidelberg (2009)","edition":"2"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1080\/00401706.1979.10489751","volume":"21","author":"G. Wahba","year":"1979","unstructured":"Wahba, G., Golub, G., Heath, M.: Generalized cross-validation as a method for choosing a good ridge parameter. Technometrics\u00a021, 215\u2013223 (1979)","journal-title":"Technometrics"},{"key":"6_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-4541-9","volume-title":"An introduction to the bootstrap","author":"B. Efron","year":"1993","unstructured":"Efron, B., Tibshirani, R.: An introduction to the bootstrap. Chapman and Hall, London (1993)"},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"1569","DOI":"10.1016\/j.automatica.2008.02.001","volume":"44","author":"J. Th\u00e9ni\u00e9","year":"2008","unstructured":"Th\u00e9ni\u00e9, J., Vial, J.P.: Step decision rules for multistage stochastic programming: A heuristic approach. Automatica\u00a044, 1569\u20131584 (2008)","journal-title":"Automatica"},{"key":"6_CR21","unstructured":"K\u00fcchler, C., Vigerske, S.: Numerical evaluation of approximation methods in stochastic programming (2008) (submitted)"},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/TIT.1968.1054098","volume":"14","author":"T. Cover","year":"1968","unstructured":"Cover, T.: Estimation by the nearest neighbor rule. IEEE Transactions on Information Theory\u00a014, 50\u201355 (1968)","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR23","unstructured":"Akaike, H.: Information theory and an extension of the maximum likelihood principle. In: Proceedings of the Second International Symposium on Information Theory, pp. 267\u2013281 (1973)"},{"key":"6_CR24","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1214\/aos\/1176344136","volume":"6","author":"G. Schwartz","year":"1978","unstructured":"Schwartz, G.: Estimating the dimension of a model. Annals of Statistics\u00a06, 461\u2013464 (1978)","journal-title":"Annals of Statistics"},{"key":"6_CR25","doi-asserted-by":"publisher","first-page":"1080","DOI":"10.1214\/aos\/1176350051","volume":"14","author":"J. Rissanen","year":"1986","unstructured":"Rissanen, J.: Stochastic complexity and modeling. Annals of Statistics\u00a014, 1080\u20131100 (1986)","journal-title":"Annals of Statistics"},{"key":"6_CR26","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1111\/j.1467-9868.2008.00668.x","volume":"71","author":"G. James","year":"2009","unstructured":"James, G., Radchenko, P., Lv, J.: DASSO: connections between the Dantzig selector and Lasso. Journal of the Royal Statistical Society: Series B\u00a071, 127\u2013142 (2009)","journal-title":"Journal of the Royal Statistical Society: Series B"},{"key":"6_CR27","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1023\/A:1013943418833","volume":"48","author":"O. Chapelle","year":"2002","unstructured":"Chapelle, O., Vapnik, V., Bengio, Y.: Model selection for small sample regression. Machine Learning\u00a048, 315\u2013333 (2002)","journal-title":"Machine Learning"},{"key":"6_CR28","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1214\/aos\/1176349519","volume":"13","author":"P. Huber","year":"1985","unstructured":"Huber, P.: Projection pursuit. Annals of Statistics\u00a013, 435\u2013475 (1985)","journal-title":"Annals of Statistics"},{"key":"6_CR29","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1214\/aos\/1176347115","volume":"17","author":"A. Buja","year":"1989","unstructured":"Buja, A., Hastie, T., Tibshirani, R.: Linear smoothers and additive models. Annals of Statistics\u00a017, 453\u2013510 (1989)","journal-title":"Annals of Statistics"},{"key":"6_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1214\/aos\/1176347963","volume":"19","author":"J. Friedman","year":"1991","unstructured":"Friedman, J.: Multivariate adaptive regression splines (with discussion). Annals of Statistics\u00a019, 1\u2013141 (1991)","journal-title":"Annals of Statistics"},{"key":"6_CR31","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1162\/neco.1995.7.2.219","volume":"7","author":"F. Girosi","year":"1995","unstructured":"Girosi, F., Jones, M., Poggio, T.: Regularization theory and neural networks architectures. Neural Computation\u00a07, 219\u2013269 (1995)","journal-title":"Neural Computation"},{"key":"6_CR32","unstructured":"Williams, C., Rasmussen, C.: Gaussian processes for regression. In: Advances in Neural Information Processing Systems 8 (NIPS 1995), pp. 514\u2013520 (1996)"},{"key":"6_CR33","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/S0893-6080(98)00032-X","volume":"11","author":"A. Smola","year":"1998","unstructured":"Smola, A., Sch\u00f6lkopf, B., M\u00fcller, K.R.: The connection between regularization operators and support vector kernels. Neural Networks\u00a011, 637\u2013649 (1998)","journal-title":"Neural Networks"},{"key":"6_CR34","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316887","volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"M. Puterman","year":"1994","unstructured":"Puterman, M.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, Chichester (1994)"},{"key":"6_CR35","volume-title":"Neuro-Dynamic Programming","author":"D. Bertsekas","year":"1996","unstructured":"Bertsekas, D., Tsitsiklis, J.: Neuro-Dynamic Programming. Athena Scientific, Belmont (1996)"},{"key":"6_CR36","volume-title":"Reinforcement Learning, an introduction","author":"R. Sutton","year":"1998","unstructured":"Sutton, R., Barto, A.: Reinforcement Learning, an introduction. MIT Press, Cambridge (1998)"},{"key":"6_CR37","unstructured":"Bagnell, D., Kakade, S., Ng, A., Schneider, J.: Policy search by dynamic programming. In: Advances in Neural Information Processing Systems 16 (NIPS 2003), pp. 831\u2013838 (2004)"},{"key":"6_CR38","unstructured":"Lagoudakis, M., Parr, R.: Reinforcement learning as classification: leveraging modern classifiers. In: Proceedings of the Twentieth International Conference on Machine Learning (ICML 2003), pp. 424\u2013431 (2003)"},{"key":"6_CR39","first-page":"503","volume":"6","author":"D. Ernst","year":"2005","unstructured":"Ernst, D., Geurts, P., Wehenkel, L.: Tree-based batch mode reinforcement learning. Journal of Machine Learning Research\u00a06, 503\u2013556 (2005)","journal-title":"Journal of Machine Learning Research"},{"key":"6_CR40","doi-asserted-by":"crossref","unstructured":"Langford, J., Zadrozny, B.: Relating reinforcement learning performance to classification performance. In: Proceedings of the Twenty-Second International Conference on Machine Learning (ICML 2005), pp. 473\u2013480 (2005)","DOI":"10.1145\/1102351.1102411"},{"key":"6_CR41","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1613\/jair.1700","volume":"25","author":"A. Fern","year":"2006","unstructured":"Fern, A., Yoon, S., Givan, R.: Approximate policy iteration with a policy language bias: solving relational Markov Decision Processes. Journal of Artificial Intelligence Research\u00a025, 85\u2013118 (2006)","journal-title":"Journal of Artificial Intelligence Research"}],"container-title":["Lecture Notes in Computer Science","Stochastic Algorithms: Foundations and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04944-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T18:45:37Z","timestamp":1552157137000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04944-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642049439","9783642049446"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04944-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}