Shishen Lin

12 papers A* 4A 1B 1Journal 3Unranked 3
YearRankTypeTitle / Venue / Authors
2025 — conf
Hot off the Press: No Free Lunch Theorem and Black-Box Complexity Analysis for Adversarial Optimisation.
GECCO Companion
Per Kristian Lehre, Shishen Lin
2025 A* conf
Randomised Optimism via Competitive Co-Evolution for Matrix Games with Bandit Feedback.
IJCAI
Shishen Lin
2025 J jnl
Randomised Optimism via Competitive Co-Evolution for Matrix Games with Bandit Feedback.
CoRR
Shishen Lin
2025 A* conf
Towards Runtime Analysis of Population-Based Co-evolutionary Algorithms on Sparse Binary Zero-Sum Game.
AAAI
Per Kristian Lehre, Shishen Lin
2024 A* conf
Concentration Tail-Bound Analysis of Coevolutionary and Bandit Learning Algorithms.
IJCAI
Per Kristian Lehre, Shishen Lin
2024 J jnl
Concentration Tail-Bound Analysis of Coevolutionary and Bandit Learning Algorithms.
CoRR
Per Kristian Lehre, Shishen Lin
2024 A* conf
No Free Lunch Theorem and Black-Box Complexity Analysis for Adversarial Optimisation.
NeurIPS
Per Kristian Lehre, Shishen Lin
2024 — conf
Overcoming Binary Adversarial Optimisation with Competitive Coevolution.
PPSN (3)
Per Kristian Lehre, Shishen Lin
2024 J jnl
Overcoming Binary Adversarial Optimisation with Competitive Coevolution.
CoRR
Per Kristian Lehre, Shishen Lin
2023 B conf
Is CC-(1+1) EA More Efficient than (1+1) EA on Separable and Inseparable Problems?
CEC
Per Kristian Lehre, Shishen Lin
2023 A conf
Runtime Analysis of a Co-Evolutionary Algorithm: Overcoming Negative Drift in Maximin-Optimisation.
FOGA
Mario Alejandro Hevia Fajardo, Per Kristian Lehre, Shishen Lin
2023 — conf
Runtime Analysis of a Co-Evolutionary Algorithm: Overcoming Negative Drift in Maximin-Optimisation.
GECCO Companion
Mario Alejandro Hevia Fajardo, Per Kristian Lehre, Shishen Lin