On the Effectiveness of Sampling for Evolutionary Optimization in Noisy Environments
暂无分享,去创建一个
Xin Yao | Yang Yu | Zhi-Hua Zhou | Chao Qian | Yaochu Jin | Ke Tang | Zhi-Hua Zhou | Yaochu Jin | Chao Qian | Yang Yu | X. Yao | K. Tang
[1] Hans-Georg Beyer,et al. A general noise model and its effects on evolution strategy performance , 2006, IEEE Transactions on Evolutionary Computation.
[2] Thomas Jansen,et al. On the analysis of the (1+1) evolutionary algorithm , 2002, Theor. Comput. Sci..
[3] Thomas Bartz-Beielstein,et al. Evolution Strategies and Threshold Selection , 2005, Hybrid Metaheuristics.
[4] Benjamin Doerr,et al. Ants easily solve stochastic shortest path problems , 2012, GECCO '12.
[5] Erick Cantú-Paz,et al. Adaptive Sampling for Noisy Problems , 2004, GECCO.
[6] Yang Yu,et al. On Algorithm-Dependent Boundary Case Identification for Problem Classes , 2012, PPSN.
[7] Jürgen Branke,et al. Evolutionary optimization in uncertain environments-a survey , 2005, IEEE Transactions on Evolutionary Computation.
[8] Thomas Bartz-Beielstein,et al. Particle Swarm Optimization and Sequential Sampling in Noisy Environments , 2007, Metaheuristics.
[9] Leslie Ann Goldberg,et al. Adaptive Drift Analysis , 2011, Algorithmica.
[10] Ameet Talwalkar,et al. Foundations of Machine Learning , 2012, Adaptive computation and machine learning.
[11] Anne Auger,et al. Theory of Randomized Search Heuristics: Foundations and Recent Developments , 2011, Theory of Randomized Search Heuristics.
[12] Adam Prügel-Bennett,et al. Run-Time Analysis of Population-Based Evolutionary Algorithm in Noisy Environments , 2015, FOGA.
[13] Christian Igel,et al. Hoeffding and Bernstein races for selecting policies in evolutionary direct policy search , 2009, ICML '09.
[14] Walter J. Gutjahr,et al. A Converging ACO Algorithm for Stochastic Combinatorial Optimization , 2003, SAGA.
[15] Luca Maria Gambardella,et al. A survey on metaheuristics for stochastic combinatorial optimization , 2009, Natural Computing.
[16] Benjamin W. Wah,et al. Scheduling of Genetic Algorithms in a Noisy Environment , 1994, Evolutionary Computation.
[17] Xiangxiang Zeng,et al. Identification of cytokine via an improved genetic algorithm , 2014, Frontiers of Computer Science.
[18] Duc-Cuong Dang,et al. Runtime Analysis of Non-elitist Populations: From Classical Optimisation to Partial Information , 2016, Algorithmica.
[19] Xin Yao,et al. Drift analysis and average time complexity of evolutionary algorithms , 2001, Artif. Intell..
[20] Jürgen Branke,et al. Efficient fitness estimation in noisy environments , 2001 .
[21] Andrew M. Sutton,et al. The Benefit of Sex in Noisy Evolutionary Search , 2015, ArXiv.
[22] Pietro Simone Oliveto,et al. Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation , 2008, Algorithmica.
[23] Stefan Droste,et al. Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Analysis of the (1+1) EA for a Noisy OneMax , 2004 .
[24] Ingo Wegener,et al. Methods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functions , 2003 .
[25] Jürgen Branke,et al. Selection in the Presence of Noise , 2003, GECCO.
[26] Zhi-Hua Zhou,et al. Analyzing Evolutionary Optimization in Noisy Environments , 2013, Evolutionary Computation.
[27] Xin Yao,et al. Towards an analytic framework for analysing the computation time of evolutionary algorithms , 2003, Artif. Intell..
[28] Dirk Sudholt,et al. First Steps Towards a Runtime Comparison of Natural and Artificial Evolution , 2015, GECCO.
[29] Andrew M. Sutton,et al. Robustness of Ant Colony Optimization to Noise , 2015, Evolutionary Computation.
[30] Dirk V. Arnold,et al. Noisy Optimization With Evolution Strategies , 2002, Genetic Algorithms and Evolutionary Computation.
[31] Kalyanmoy Deb,et al. A comparative study of dynamic resampling strategies for guided Evolutionary Multi-objective Optimization , 2013, 2013 IEEE Congress on Evolutionary Computation.
[32] Pietro Simone Oliveto,et al. Erratum: Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation , 2008, PPSN.
[33] Frank Neumann,et al. Bioinspired computation in combinatorial optimization: algorithms and their computational complexity , 2010, GECCO '12.
[34] Yang Yu,et al. On the Effectiveness of Sampling for Evolutionary Optimization in Noisy Environments , 2014, PPSN.
[35] Zhuhong Zhang,et al. Immune Algorithm with Adaptive Sampling in Noisy Environments and Its Application to Stochastic Optimization Problems , 2007, IEEE Computational Intelligence Magazine.
[36] Giovanni Iacca,et al. Noise analysis compact differential evolution , 2012, Int. J. Syst. Sci..
[37] Xin Yao,et al. A study of drift analysis for estimating computation time of evolutionary algorithms , 2004, Natural Computing.
[38] Duc-Cuong Dang,et al. Efficient Optimisation of Noisy Fitness Functions with Population-based Evolutionary Algorithms , 2015, FOGA.
[39] Olivier Teytaud,et al. Analysis of runtime of optimization algorithms for noisy functions over discrete codomains , 2015, Theor. Comput. Sci..
[40] Timo Kötzing,et al. Optimizing expected path lengths with ant colony optimization using fitness proportional update , 2013, FOGA XII '13.
[41] T. Back,et al. Thresholding-a selection operator for noisy ES , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).
[42] Olivier Teytaud,et al. Bandit-Based Estimation of Distribution Algorithms for Noisy Optimization: Rigorous Runtime Analysis , 2010, LION.
[43] Dirk Sudholt,et al. A Simple Ant Colony Optimizer for Stochastic Shortest Path Problems , 2012, Algorithmica.
[44] Dirk Sudholt,et al. A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms , 2011, IEEE Transactions on Evolutionary Computation.
[45] Jürgen Branke,et al. Sequential Sampling in Noisy Environments , 2004, PPSN.
[46] Walter J. Gutjahr. Runtime Analysis of an Evolutionary Algorithm for Stochastic Multi-Objective Combinatorial Optimization , 2012, Evolutionary Computation.
[47] Robert Ivor John,et al. Evolutionary optimisation of noisy multi-objective problems using confidence-based dynamic resampling , 2010, Eur. J. Oper. Res..
[48] Yang Yu,et al. Switch Analysis for Running Time Analysis of Evolutionary Algorithms , 2015, IEEE Transactions on Evolutionary Computation.
[49] Benjamin Doerr,et al. Multiplicative Drift Analysis , 2010, GECCO '10.
[50] Thomas Bäck,et al. Evolutionary algorithms in theory and practice - evolution strategies, evolutionary programming, genetic algorithms , 1996 .
[51] Hajime Kita,et al. Optimization of noisy fitness functions by means of genetic algorithms using history of search with test of estimation , 2000, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).
[52] Peter Stagge,et al. Averaging Efficiently in the Presence of Noise , 1998, PPSN.
[53] H. Beyer. Evolutionary algorithms in noisy environments : theoretical issues and guidelines for practice , 2000 .
[54] Yang Yu,et al. Variable solution structure can be helpful in evolutionary optimization , 2015, Science China Information Sciences.
[55] Yang Yu,et al. Running time analysis: Convergence-based analysis reduces to switch analysis , 2015, 2015 IEEE Congress on Evolutionary Computation (CEC).
[56] Kwang Ryel Ryu,et al. Accumulative sampling for noisy evolutionary multi-objective optimization , 2011, GECCO '11.
[57] Carsten Witt,et al. Bioinspired Computation in Combinatorial Optimization , 2010, Bioinspired Computation in Combinatorial Optimization.
[58] Yang Yu,et al. A new approach to estimating the expected first hitting time of evolutionary algorithms , 2006, Artif. Intell..
[59] Dirk Sudholt,et al. The choice of the offspring population size in the (1, λ) evolutionary algorithm , 2014, Theor. Comput. Sci..