Shishen Lin

According to our database, Shishen Lin authored at least 7 papers between 2023 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

Randomised Optimism via Competitive Co-Evolution for Matrix Games with Bandit Feedback.

Shishen Lin

CoRR, May, 2025

Towards Runtime Analysis of Population-Based Co-evolutionary Algorithms on Sparse Binary Zero-Sum Game.

Per Kristian Lehre, Shishen Lin

Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

2024

Overcoming Binary Adversarial Optimisation with Competitive Coevolution.

Per Kristian Lehre, Shishen Lin

Proceedings of the Parallel Problem Solving from Nature - PPSN XVIII, 2024

No Free Lunch Theorem and Black-Box Complexity Analysis for Adversarial Optimisation.

Per Kristian Lehre, Shishen Lin

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Concentration Tail-Bound Analysis of Coevolutionary and Bandit Learning Algorithms.

Per Kristian Lehre, Shishen Lin

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

2023

Runtime Analysis of a Co-Evolutionary Algorithm: Overcoming Negative Drift in Maximin-Optimisation.

Mario Alejandro Hevia Fajardo, Per Kristian Lehre, Shishen Lin

Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2023

Is CC-(1+1) EA More Efficient than (1+1) EA on Separable and Inseparable Problems?

Per Kristian Lehre, Shishen Lin

Proceedings of the IEEE Congress on Evolutionary Computation, 2023