{"type":"ScholarlyArticle","title":"Concentration Tail-Bound Analysis of Coevolutionary and Bandit Learning Algorithms","authors":[{"name":"Per Kristian Lehre","slug":"per-kristian-lehre","given":"Per Kristian","family":"Lehre","affiliation":"University of Birmingham , Birmingham , United Kingdom"},{"name":"Shishen Lin","slug":"shishen-lin","given":"Shishen","family":"Lin","affiliation":"University of Birmingham , Birmingham , United Kingdom"}],"abstract":"Runtime analysis, as a branch of the theory of AI, studies how the number of iterations algorithms take before finding a solution (its runtime) depends on the design of the algorithm and the problem structure. Drift analysis is a state-of-the-art tool for estimating the runtime of randomised algorithms, such as bandit and evolutionary algorithms. Drift refers roughly to the expected progress towards the optimum per iteration. This paper considers the problem of deriving concentration tail-bounds on the runtime of algorithms. It provides a novel drift theorem that gives precise exponential tail-bounds given positive, weak, zero and even negative drift. Previously, such exponential tail bounds were missing in the case of weak, zero, or negative drift. \r\n\r\nOur drift theorem can be used to prove a strong concentration of the runtime/regret of algorithms in AI. For example, we prove that the regret of the RWAB bandit algorithm is highly concentrated, while previous analyses only considered the expected regret. This means that the algorithm obtains the optimum within a given time frame with high probability, i.e. a form of algorithm reliability.\r\n\r\nMoreover, our theorem implies that the time needed by the co-evolutionary algorithm RLS-PD to obtain a Nash equilibrium in a Bilinear max-min-benchmark problem is highly concentrated. However, we also prove that the algorithm forgets the Nash equilibrium, and the time until this occurs is highly concentrated. This highlights a weakness in the RLS-PD which should be addressed by future work.","doi":"10.24963/ijcai.2024/767","url":"https://ijcai.org/proceedings/2024/767","pdf":"https://ijcai.org/proceedings/2024/0767.pdf","markdown":"https://ijcai.org/proceedings/2024/767.md","bibtex":"https://ijcai.org/proceedings/2024/bibtex/767","volume":{"slug":"2024","title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2024","url":"https://ijcai.org/proceedings/2024/","year":2024,"location":"Jeju, Korea","dates":"3-9 August 2024","editors":"Kate Larson","isbn":"978-1-956792-04-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2024"},"section":"Search","track":"Main Track","number":767,"pages":{"first":6940,"last":6948},"keywords":["Search: S: Heuristic search","Search: S: Other","Search: S: Evolutionary computation"],"videos":[],"references":[{"position":1,"raw":"[Popovici et al., 2012] Elena Popovici, Anthony Bucci, R. Paul Wiegand, and Edwin D. De Jong. Coevolutionary Principles. In Grzegorz Rozenberg, Thomas Bäck, and Joost N. Kok, editors, Handbook of Natural Computing, pages 987-1033. Springer Berlin Heidelberg, Berlin, Hei- delberg, 2012.","title":"Coevolutionary Principles","authors":"Elena Popovici, Anthony Bucci, R Paul Wiegand, Edwin D De Jong","year":"2012","venue":"Handbook of Natural Computing","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Al-Dujaili et al., 2018] Abdullah Al-Dujaili, Tom Schmiedlechner, and Erik Hemberg, and Una-May O'Reilly. Towards Distributed Coevolutionary GANs, August 2018. arXiv:1807.08194 [cs.","title":"Abdullah Al-Dujaili, Tom Schmiedlechner, and Erik Hemberg, and Una-May O'Reilly","authors":"Al-Dujaili","year":"2018","venue":"Towards Distributed Coevolutionary GANs","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Auer et al., 2002] Peter Auer, Nicolo Cesa-Bianchi, and Paul Fischer. Finite-time analysis of the multiarmed bandit problem. Machine learning, 47:235-256, 2002.","title":"Finite-time analysis of the multiarmed bandit problem","authors":"Auer","year":"2002","venue":"Machine learning","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Azuma, 1967] Kazuoki Azuma. Weighted sums of certain dependent random variables. Tohoku Mathematical Jour- nal, 19:357-367, 1967.","title":"Weighted sums of certain dependent random variables","authors":"Kazuoki Azuma, Azuma","year":"1967","venue":"Tohoku Mathematical Journal","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Baritompa and Steel, 1996] Bill Baritompa and Mike Steel. Bounds on absorption times of directionally biased ran- dom sequences. Random Structures & Algorithms, 9(3):279-293, 1996.","title":"Bill Baritompa and Mike Steel. Bounds on absorption times of directionally biased random sequences","authors":"Baritompa, Steel","year":"1996","venue":"Random Structures & Algorithms","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bhattacharya and Waymire, 2007] Rabindra Nath Bhat- tacharya and Edward C Waymire. A Basic Course in Probability Theory, volume 69. Springer, 2007.","title":"A Basic Course in Probability Theory","authors":"Rabindra Nath, Bhattacharya, Edward C Waymire","year":"2007","venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Bian et al., 2020] Chao Bian, Chao Feng, Chao Qian, and Yang Yu. An efficient evolutionary algorithm for subset selection with general cost constraints. In AAAI, 2020.","title":"An efficient evolutionary algorithm for subset selection with general cost constraints","authors":"Chao Chao Bian, Feng, Yang Chao Qian, Yu","year":"2020","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Bubeck et al., 2012] Sébastien Bubeck, Nicolo Cesa- Bianchi, et al. Regret analysis of stochastic and nonstochastic multi-armed bandit problems. Foundations and Trends® in Machine Learning, 5(1):1-122, 2012.","title":"Regret analysis of stochastic and nonstochastic multi-armed bandit problems","authors":"Sébastien Bubeck, Nicolo Cesa-Bianchi","year":"2012","venue":"Foundations and Trends® in Machine Learning","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Case and Lehre, 2020] Brendan Case and Per Kristian Lehre. Self-adaptation in nonelitist evolutionary algo- rithms on discrete problems with unknown structure. IEEE Transactions on Evolutionary Computation, 24(4):650- 663, 2020.","title":"Brendan Case and Per Kristian Lehre. Self-adaptation in nonelitist evolutionary algorithms on discrete problems with unknown structure","authors":"Lehre Case","year":"2020","venue":"IEEE Transactions on Evolutionary Computation","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Dang et al., 2021] Duc-Cuong Dang, Anton Eremeev, and Per Kristian Lehre. Escaping local optima with non-elitist evolutionary algorithms. In AAAI, 2021.","title":"Escaping local optima with non-elitist evolutionary algorithms","authors":"Duc-Cuong Dang, Anton Eremeev, Kristian Per, Lehre","year":"2021","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Doerr and Goldberg, 2013] Benjamin Doerr and Leslie Ann Goldberg. Adaptive Drift Analysis. Algorithmica, 65(1):224-250, January 2013.","title":"Adaptive Drift Analysis","authors":"Benjamin Doerr, Leslie, Ann Goldberg","year":"2013","venue":"Algorithmica","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Doerr and Künnemann, 2013] Benjamin Doerr and Marvin Künnemann. How the (1+λ) evolutionary algorithm op- timizes linear functions. In Proceedings of the 15th An- nual Conference on Genetic and Evolutionary Computa- tion, GECCO '13, page 1589-1596, New York, NY, USA, 2013. Association for Computing Machinery.","title":"How the (1+λ) evolutionary algorithm optimizes linear functions","authors":"Benjamin Doerr, Marvin Künnemann","year":"2013","venue":"Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, GECCO '13","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Doerr and Neumann, 2019] Benjamin Doerr and Frank Neumann. Theory of Evolutionary Computation: Recent Developments in Discrete Optimization. Natural Comput- ing Series. Springer Nature, 2019.","title":"Theory of Evolutionary Computation: Recent Developments in Discrete Optimization","authors":"Neumann Doerr, Benjamin Doerr, Frank Neumann","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Doerr and Qu, 2023] Benjamin Doerr and Zhongdi Qu. Runtime analysis for the nsga-ii: Provable speed-ups from crossover. In AAAI, 2023.","title":"Runtime analysis for the nsga-ii: Provable speed-ups from crossover","authors":"Benjamin Doerr, Zhongdi Qu","year":"2023","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Doerr and Zheng, 2020] Benjamin Doerr and Weijie Zheng. Sharp bounds for genetic drift in estimation of distribution algorithms. IEEE Transactions on Evolutionary Compu- tation, 24(6):1140-1149, 2020.","title":"Sharp bounds for genetic drift in estimation of distribution algorithms","authors":"Benjamin Doerr, Weijie Zheng","year":"2020","venue":"IEEE Transactions on Evolutionary Computation","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Doerr et al., 2010] Benjamin Doerr, Daniel Johannsen, and Carola Winzen. Multiplicative drift analysis. In Proceed- ings of the 12th annual conference on Genetic and evolu- tionary computation, pages 1449-1456, 2010.","title":"Multiplicative drift analysis","authors":"Benjamin Doerr, Daniel Johannsen, Carola Winzen","year":"2010","venue":"Proceedings of the 12th annual conference on Genetic and evolutionary computation","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Doerr et al., 2013] Benjamin Doerr, Dirk Styled, and Carsten Witt. When do evolutionary algorithms optimize separable functions in parallel? In Proceedings of the Twelfth Workshop on Foundations of Genetic Algorithms XII, FOGA XII '13, page 51-64, New York, NY, USA, 2013. Association for Computing Machinery.","title":"When do evolutionary algorithms optimize separable functions in parallel?","authors":"Benjamin Doerr, Dirk Styled, Carsten Witt","year":"2013","venue":"Proceedings of the Twelfth Workshop on Foundations of Genetic Algorithms XII, FOGA XII '13","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Doob, 1971] Joseph Leo Doob. What is a Martingale? The American Mathematical Monthly, 78(5):451-463, 1971. Publisher: Mathematical Association of America.","title":"What is a Martingale?","authors":"Joseph Leo, Doob","year":"1971","venue":"The American Mathematical Monthly","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Friedrich et al., 2016] Tobias Friedrich, Timo Kötzing, and Martin S. Krejca. Edas cannot be balanced and stable. In Proceedings of the Genetic and Evolutionary Compu- tation Conference 2016, GECCO '16, page 1139-1146, New York, NY, USA, 2016. Association for Computing Machinery.","title":"Edas cannot be balanced and stable","authors":"Friedrich","year":"2016","venue":"Proceedings of the Genetic and Evolutionary Computation Conference 2016, GECCO '16","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Göbel et al., 2022] Andreas Göbel, Timo Kötzing, and Mar- tin S Krejca. Intuitive analyses via drift theory, 2022.","title":"Intuitive analyses via drift theory","authors":"Andreas Göbel, Timo Kötzing, Martin S Krejca","year":"2022","venue":null,"doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Grimmett and Stirzaker, 2001] Geoffrey Grimmett and David Stirzaker. Probability and Random Processes. Oxford University Press, Oxford ; New York, 3rd ed edition, 2001.","title":"Probability and Random Processes","authors":"Stirzaker Grimmett","year":"2001","venue":null,"doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Hajek, 1982] Bruce Hajek. Hitting-time and occupation- time bounds implied by drift analysis with applications. Advances in Applied probability, 14(3):502-525, 1982.","title":"Hitting-time and occupationtime bounds implied by drift analysis with applications","authors":"Bruce Hajek","year":"1982","venue":"Advances in Applied probability","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[He and Yao, 2001] Jun He and Xin Yao. Drift analysis and average time complexity of evolutionary algorithms. Arti- ficial Intelligence, 127(1):57-85, March 2001.","title":"Jun He and Xin Yao. Drift analysis and average time complexity of evolutionary algorithms","authors":"Yao He","year":"2001","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Hevia Fajardo et al., 2023] Mario Alejandro Hevia Fajardo, Per Kristian Lehre, and Shishen Lin. Runtime analysis of a co-evolutionary algorithm: Overcoming negative drift in maximin-optimisation. In Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO '23, New York, NY, USA, 2023. Association for Computing Machinery.","title":"Runtime analysis of a co-evolutionary algorithm: Overcoming negative drift in maximin-optimisation","authors":"Hevia Fajardo","year":"2023","venue":"Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO '23","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Jansen, 2013] Thomas Jansen. Analyzing Evolutionary Al- gorithms: The Computer Science Perspective. Springer Publishing Company, Incorporated, 2013.","title":"Analyzing Evolutionary Algorithms: The Computer Science Perspective","authors":"Thomas Jansen","year":"2013","venue":null,"doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Johannsen, 2010] Daniel Johannsen. Random combinato- rial structures and randomized search heuristics. PhD the- sis, Saarland University, 2010.","title":"Random combinatorial structures and randomized search heuristics","authors":"Daniel Johannsen","year":"2010","venue":null,"doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Kötzing et al., 2015] Timo Kötzing, Andrei Lissovoi, and Carsten Witt. (1+1) ea on generalized dynamic onemax. In Proceedings of the 2015 ACM Conference on Founda- tions of Genetic Algorithms XIII, FOGA '15, page 40-51, New York, NY, USA, 2015. Association for Computing Machinery.","title":"1+1) ea on generalized dynamic onemax","authors":"Timo Kötzing, Andrei Lissovoi, Carsten Witt","year":"2015","venue":"Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII, FOGA '15","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Kötzing, 2016] Timo Kötzing. Concentration of First Hitting Times Under Additive Drift. Algorithmica, 75(3):490-506, July 2016.","title":"Concentration of First Hitting Times Under Additive Drift","authors":"Timo Kötzing, Kötzing","year":"2016","venue":"Algorithmica","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Larcher et al., 2023] Maxime Larcher, Robert Meier, and Angelika Steger. A simple optimal algorithm for the 2-arm bandit problem. In Symposium on Simplicity in Algorithms (SOSA), pages 365-372. SIAM, 2023.","title":"A simple optimal algorithm for the 2-arm bandit problem","authors":"Maxime Larcher, Robert Meier, Angelika Steger","year":"2023","venue":"Symposium on Simplicity in Algorithms (SOSA)","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Lattimore and Szepesvári, 2020] Tor Lattimore and Csaba Szepesvári. Bandit algorithms. Cambridge University Press, 2020.","title":"Tor Lattimore and Csaba Szepesvári. Bandit algorithms","authors":"Szepesvári Lattimore","year":"2020","venue":null,"doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Lehre and Lin, 2023] Per Kristian Lehre and Shishen Lin. Is CC-(1+1) EA more efficient than (1+1) EA on separa- ble and inseparable problems? In IEEE Congress on Evo- lutionary Computation (CEC), pages 1-8, Chicago, USA, 2023.","title":"Per Kristian Lehre and Shishen Lin. Is CC-(1+1) EA more efficient than (1+1) EA on separable and inseparable problems?","authors":"Lin Lehre","year":"2023","venue":"IEEE Congress on Evolutionary Computation (CEC)","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Lehre and Witt, 2021] Per Kristian Lehre and Carsten Witt. Tail bounds on hitting times of randomized search heuris- tics using variable drift analysis. Combinatorics, Proba- bility and Computing, 30(4):550-569, 2021.","title":"Per Kristian Lehre and Carsten Witt. Tail bounds on hitting times of randomized search heuristics using variable drift analysis","authors":"Witt Lehre","year":"2021","venue":"Combinatorics, Probability and Computing","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Lehre et al., 2023] Per Kristian Lehre, Mario Alejandro Hevia Fajardo, Jamal Toutouh, Erik Hemberg, and Una- May O'Reilly. Analysis of a pairwise dominance coevolu- tionary algorithm and defendit. In Proceedings of the Ge- netic and Evolutionary Computation Conference, GECCO '23, page 1027-1035, New York, NY, USA, 2023. Associ- ation for Computing Machinery.","title":"Analysis of a pairwise dominance coevolutionary algorithm and defendit","authors":"Lehre","year":"2023","venue":"Proceedings of the Genetic and Evolutionary Computation Conference, GECCO '23","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Lehre, 2022] Per Kristian Lehre. Runtime Analysis of Com- petitive co-Evolutionary Algorithms for Maximin Optimi- sation of a Bilinear Function. In Proceedings of the Ge- netic and Evolutionary Computation Conference, GECCO '22, page 1408-1416, 2022.","title":"Per Kristian Lehre. Runtime Analysis of Competitive co-Evolutionary Algorithms for Maximin Optimisation of a Bilinear Function","authors":"Lehre","year":"2022","venue":"Proceedings of the Genetic and Evolutionary Computation Conference","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[McDiarmid, 1989] Colin McDiarmid. On the method of bounded differences, page 148-188. London Mathemat- ical Society Lecture Note Series. Cambridge University Press, 1989.","title":"On the method of bounded differences","authors":"Colin Mcdiarmid","year":"1989","venue":null,"doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[McDiarmid, 1993] Colin McDiarmid. A random recolour- ing method for graphs and hypergraphs. Combinatorics, Probability and Computing, 2(3):363-365, 1993.","title":"A random recolouring method for graphs and hypergraphs","authors":"Colin Mcdiarmid","year":"1993","venue":"Combinatorics, Probability and Computing","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Menshikov et al., 2016] Mikhail Menshikov, Serguei Popov, and Andrew Wade. Non-homogeneous Random Walks: Lyapunov Function Methods for Near-Critical Stochastic Systems. Cambridge Tracts in Mathematics. Cambridge University Press, 2016.","title":"Non-homogeneous Random Walks: Lyapunov Function Methods for Near-Critical Stochastic Systems","authors":"Mikhail Menshikov, Serguei Popov, Andrew Wade","year":"2016","venue":"Cambridge Tracts in Mathematics","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Mitavskiy et al., 2009] Boris Mitavskiy, Jonathan Rowe, and Chris Cannings. Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links. International Journal of Intelligent Computing and Cybernetics, 2(2):243-284, 2009.","title":"Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links","authors":"Boris Mitavskiy, Jonathan Rowe, Chris Cannings","year":"2009","venue":"International Journal of Intelligent Computing and Cybernetics","doi":null,"url":null,"internal_url":null},{"position":39,"raw":"[Mitzenmacher and Upfal, 2005] Michael Mitzenmacher and Eli Upfal. Probability and computing: an introduc- tion to randomized algorithms and probabilistic analysis. Cambridge University Press, New York, 2005.","title":"Probability and computing: an introduction to randomized algorithms and probabilistic analysis","authors":"Michael Mitzenmacher, Eli Upfal","year":"2005","venue":null,"doi":null,"url":null,"internal_url":null},{"position":40,"raw":"[Neumann and Witt, 2010] Frank Neumann and Carsten Witt. Bioinspired Computation in Combinatorial Opti- mization: Algorithms and Their Computational Complex- ity. Natural Computing Series. Springer Berlin Heidel- berg, Berlin, Heidelberg, 2010.","title":"Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity. Natural Computing Series","authors":"Witt Neumann, Frank Neumann, Carsten Witt","year":"2010","venue":null,"doi":null,"url":null,"internal_url":null},{"position":41,"raw":"[Nisan et al., 2007] Noam Nisan, Tim Roughgarden, Eva Tardos, and Vazirani Vijay V. Algorithmic Game Theory. Cambridge University Press, 2007.","title":"Algorithmic Game Theory","authors":"Nisan","year":"2007","venue":null,"doi":null,"url":null,"internal_url":null},{"position":42,"raw":"[Oliveto and Witt, 2012] Pietro S. Oliveto and Carsten Witt. Erratum: Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation, November 2012. arXiv:1211.7184 [cs].","title":"Erratum: Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation","authors":"Pietro S Oliveto, Carsten Witt","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":43,"raw":"[Papadimitriou, 1991] Christos H Papadimitriou. On select- ing a satisfying truth assignment. In Proceedings 32nd Annual Symposium of Foundations of Computer Science, pages 163-169. IEEE Computer Society, 1991.","title":"On selecting a satisfying truth assignment","authors":"Christos H Papadimitriou","year":"1991","venue":"Proceedings 32nd Annual Symposium of Foundations of Computer Science","doi":null,"url":null,"internal_url":null},{"position":44,"raw":"[Shu et al., 2019] Han Shu, Yunhe Wang, Xu Jia, Kai Han, Hanting Chen, Chunjing Xu, Qi Tian, and Chang Xu. Co- evolutionary compression for unpaired image translation. In Proceedings of the IEEE/CVF International Conference on Computer Vision, pages 3235-3244, 2019.","title":"Coevolutionary compression for unpaired image translation","authors":"Han Shu, Yunhe Wang, Xu Jia, Kai Han, Hanting Chen, Chunjing Xu, Qi Tian, Chang Xu","year":"2019","venue":"Proceedings of the IEEE/CVF International Conference on Computer Vision","doi":null,"url":null,"internal_url":null},{"position":45,"raw":"[Sutton and Barto, 2018] Richard S Sutton and Andrew G Barto. Reinforcement learning: An introduction. MIT press, 2018.","title":"Reinforcement learning: An introduction","authors":"S Richard, Andrew G Sutton, Barto","year":"2018","venue":null,"doi":null,"url":null,"internal_url":null},{"position":46,"raw":"[Williams, 1991] David Williams. Probability with martin- gales. Cambridge university press, 1991.","title":"Probability with martingales","authors":"David Williams","year":"1991","venue":null,"doi":null,"url":null,"internal_url":null},{"position":47,"raw":"[Zheng et al., 2022] Weijie Zheng, Yufei Liu, and Benjamin Doerr. A first mathematical runtime analysis of the Non- Dominated Sorting Genetic Algorithm II (NSGA-II). In AAAI, 2022.","title":"A first mathematical runtime analysis of the Non-Dominated Sorting Genetic Algorithm II (NSGA-II)","authors":"Weijie Zheng, Yufei Liu, Benjamin Doerr","year":"2022","venue":null,"doi":null,"url":null,"internal_url":null},{"position":48,"raw":"[Toutouh et al., 2019] Jamal Toutouh, Erik Hemberg, and Una-May O'Reilly. Spatial Evolutionary Generative Adversarial Networks. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 472-480. ACM, Prague Czech Republic, July 2019.","title":"Spatial Evolutionary Generative Adversarial Networks","authors":"Jamal Toutouh, Erik Hemberg, Una-May O' Reilly","year":"2019","venue":"Proceedings of the Genetic and Evolutionary Computation Conference","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}