Abstract
We consider noisy optimization and some traditional variance reduction techniques aimed at improving the convergence rate, namely (i) common random numbers (CRN), which is relevant for population-based noisy optimization and (ii) stratified sampling, which is relevant for most noisy optimization problems. We present artificial models of noise for which common random numbers are very efficient, and artificial models of noise for which common random numbers are detrimental. We then experiment on a desperately expensive unit commitment problem. As expected, stratified sampling is never detrimental. Nonetheless, in practice, common random numbers provided, by far, most of the improvement.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bellman, R.: Dynamic Programming. Princeton Univ, Press (1957)
Billingsley, P.: Probability and Measure. John Wiley and Sons, New York (1986)
Cranley, R., Patterson, T.: Randomization of number theoretic methods for multiple integration. SIAM J. Numer. Anal. 13(6), 904–914 (1976)
Defourny, B.: Machine learning solution methods for multistage stochastic programming. Ph.D. thesis, Institut Montefiore, Université de Liège (2010)
Dowell, M., Jarratt, P.: The “pegasus” method for computing the root of an equation. BIT Numer. Math. 12(4), 503–508 (1972). http://dx.org/10.1007/BF01932959
Dupacov, J., Gröwe-Kuska, N., Römisch, W.: Scenario reduction in stochastic programming: an approach using probability metrics. Math. Programm. 95, 3 (2003). No. 20 in Stochastic Programming E-Print Series, Institut fr Mathematik. Springer, Berlin (2000). http://edoc.hu-berlin.de/docviews/abstract.php?id=26613
Hamzaçebi, C., Kutay, F.: Continuous functions minimization by dynamic random search technique. Appl. Math. Model. 31(10), 2189–2198 (2007)
Huang, S.-C., Coulom, R., Lin, S.-S.: Monte-carlo simulation balancing in practice. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2010. LNCS, vol. 6515, pp. 81–92. Springer, Heidelberg (2011)
Kleinman, N.L., Spall, J.C., Naiman, D.Q.: Simulation-based optimization with stochastic approximation using common random numbers. Manag. Sci. 45(11), 1570–1578 (1999). http://pubsonline.informs.org//abs/10.1287/mnsc.45.11.1570
Kozak, M.: Optimal stratification using random search method in agricultural surveys. Stat. Trans. 6(5), 797–806 (2004). http://www.researchgate.net/publication/229051808_Optimal_stratification_using_random_search_method_in_agricultural_surveys/file/d912f5062bc010dd58.pdf
Lavallée, P., Hidiroglou, M.: On the stratification of skewed populations. Surv. Method. 14(1), 33–43 (1988). http://www.amstat.org/sections/srms/Proceedings/papers/1987_142.pdf
Linderoth, J., Shapiro, A., Wright, S.: The empirical behavior of sampling methods for stochastic programming. Ann. OR 142(1), 215–241 (2006). http://dblp.uni-trier.de/db/journals/anor/anor142.html#LinderothSW06
Mascagni, M., Chi, H.: On the scrambled halton sequence. Monte-Carlo Methods Appl. 10(3), 435–442 (2004)
de Matos, V., Philpott, A., Finardi, E.: Improving the performance of stochastic dual dynamic programming. Applications - OR and Management Sciences (Scheduling) (2012). http://www.optimization-online.org/DB_FILE/2012/07/3529.pdf
Morokoff, W.J.: Generating quasi-random paths for stochastic processes. 40(4), 765–788. http://epubs.siam.org/sam-bin/dbq/article/31795
Niederreiter, H.: Random number generation and quasi-monte carlo methods (1992)
Pereira, M.V.F., Pinto, L.: Multi-stage stochastic optimization applied to energy planning. Math. Program. 52(2), 359–375. http://dx.org/10.1007/BF01582895
Sethi, V.: A note on optimum stratification of populations for estimating the population means. Aust. J. Stat. 5(1), 20–33 (1963)
Shapiro, A., Tekaya, W., da Costa, J.P., Soares, M.P.: Risk neutral and risk averse stochastic dual dynamic programming method. Eur. J. Oper. Res. 224(2), 375–391 (2013)
Storn, R., Price, K.: Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11(4), 341–359 (1997)
Strens, M., Lx, H.G., Moore, A., Brodley, E., Danyluk, A.: Policy search using paired comparisons. J. Mach. Learn. Res. 3, 921–950 (2002)
Strens, M., Moore, A.: Direct policy search using paired statistical tests. In: Proceedings of the 18th International Conference on Machine Learning, pp. 545–552. Morgan Kaufmann, San Francisco (2001)
Takagi, H., Pallez, D.: Paired comparison-based interactive differential evolution. In: World Congress on Nature & Biologically Inspired Computing, NaBIC 2009, pp. 475–480. IEEE (2009)
Wang, X., Hickernell, F.: Randomized halton sequences. Math. Comput. Model. 32, 887–899 (2000)
Zabinsky, Z.B.: Random Search Algorithms: Encyclopedia of Operations Research and Management Science. Wiley, New York (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Christophe, JJ., Decock, J., Liu, J., Teytaud, O. (2016). Variance Reduction in Population-Based Optimization: Application to Unit Commitment. In: Bonnevay, S., Legrand, P., Monmarché, N., Lutton, E., Schoenauer, M. (eds) Artificial Evolution. EA 2015. Lecture Notes in Computer Science(), vol 9554. Springer, Cham. https://doi.org/10.1007/978-3-319-31471-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-31471-6_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-31470-9
Online ISBN: 978-3-319-31471-6
eBook Packages: Computer ScienceComputer Science (R0)