Publications

Publications by categories in reversed chronological order.

* denotes a theory paper (authors are listed in alphabetical order in theory papers, following the tradition of the theory community of computer science).

Conferences (peer reviewed)

2025

  1. Randomised Optimism via Competitive Co-Evolution for Matrix Games with Bandit Feedback
    Shishen Lin
    In Proceedings of the 34th International Joint Conference on Artificial Intelligence (IJCAI), 2025
    *
  2. Towards Runtime Analysis of Population-Based Co-evolutionary Algorithms on Sparse Binary Zero-Sum Game
    Per Kristian Lehre, and Shishen Lin
    In Proceedings of the 39th AAAI Conference on Artificial Intelligence (AAAI), 2025
    *

2024

  1. No Free Lunch Theorem and Black-Box Complexity Analysis for Adversarial Optimisation
    Per Kristian Lehre, and Shishen Lin
    In Proceedings of the 38th Annual Conference on Neural Information Processing Systems (NeurIPS), 2024
    *
  2. Overcoming Binary Adversarial Optimisation with Competitive Coevolution
    Per Kristian Lehre, and Shishen Lin
    In Proceedings of the 18th International Conference on Parallel Problem Solving From Nature (PPSN), 2024
    *
  3. Concentration Tail-Bound Analysis of Coevolutionary and Bandit Learning Algorithms
    Per Kristian Lehre, and Shishen Lin
    In Proceedings of the 33rd International Joint Conference on Artificial Intelligence (IJCAI), 2024
    *

2023

  1. FOGA
    Runtime Analysis of a Co-Evolutionary Algorithm: Overcoming Negative Drift in Maximin-Optimisation
    Mario Alejandro Hevia Fajardo, Per Kristian Lehre, and Shishen Lin
    In Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (FOGA), 2023
    *
  2. GECCO
    Runtime Analysis of a Co-Evolutionary Algorithm: Overcoming Negative Drift in Maximin-Optimisation
    Mario Alejandro Hevia Fajardo, Per Kristian Lehre, and Shishen Lin
    In Proceedings of the Companion Conference on Genetic and Evolutionary Computation (GECCO Companion), 2023
    *
  3. CEC
    Is CC-(1+1) EA more efficient than (1+1) EA on either separable or inseparable problems?
    Per Kristian Lehre, and Shishen Lin
    In Proceedings of the IEEE Congress on Evolutionary Computation (CEC), 2023
    *