Denis Antipov

Orcid: 0000-0001-7906-096X

Affiliations:
  • University of Adelaide, Australia
  • ITMO University, St. Petersburg, Russia


According to our database1, Denis Antipov authored at least 26 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Lazy Parameter Tuning and Control: Choosing All Parameters Randomly from a Power-Law Distribution.
Algorithmica, February, 2024

2023
Larger Offspring Populations Help the (1 + (λ, λ)) Genetic Algorithm to Overcome the Noise.
CoRR, 2023

Larger Offspring Populations Help the (1 + (λ, λlambda)) Genetic Algorithm to Overcome the Noise.
Proceedings of the Genetic and Evolutionary Computation Conference, 2023

Rigorous Runtime Analysis of Diversity Optimization with GSEMO on OneMinMax.
Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2023

2022
A Rigorous Runtime Analysis of the (1 + (λ , λ )) GA on Jump Functions.
Algorithmica, 2022

Fast Mutation in Crossover-Based Algorithms.
Algorithmica, 2022

Coevolutionary Pareto diversity optimization.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022

Precise runtime analysis for plateau functions: (hot-off-the-press track at GECCO 2022).
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9, 2022

2021
Precise Runtime Analysis for Plateau Functions.
ACM Trans. Evol. Learn. Optim., 2021

A Tight Runtime Analysis for the (μ + λ ) EA.
Algorithmica, 2021

The lower bounds on the runtime of the (1 + (λ, λ)) GA on the minimum spanning tree problem.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

The effect of non-symmetric fitness: the analysis of crossover-based algorithms on RealJump functions.
Proceedings of the FOGA '21: Foundations of Genetic Algorithms XVI, 2021

2020
Methods for Ti­ght Analysis of Popu­lation-based Evolutionary Algorithms. (Méthodes d'analyse précise des algorithmes évolutifs basés sur la population / Методы точного анализа популяционных эволюционных алгоритмов).
PhD thesis, 2020

The (1 + (λ, λ)) GA Is Even Faster on Multimodal Problems.
CoRR, 2020

Runtime Analysis of a Heavy-Tailed (1+(λ , λ )) Genetic Algorithm on Jump Functions.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020

First Steps Towards a Runtime Analysis When Starting with a Good Solution.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020

The (1 + (<i>λ, λ</i>)) GA is even faster on multimodal problems.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

2019
The Efficiency Threshold for the Offspring Population Size of the (μ, λ) EA.
CoRR, 2019

Theoretical and empirical study of the (1 + (λ, λ)) EA on the leadingones problem.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

The efficiency threshold for the offspring population size of the (<i>µ, λ</i>) EA.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019

A tight runtime analysis for the (1 + (λ, λ)) GA on leadingones.
Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2019

2018
Precise Runtime Analysis for Plateaus.
Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

A tight runtime analysis for the (μ + λ) EA.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

Runtime analysis of a population-based evolutionary algorithm with auxiliary objectives selected by reinforcement learning.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018

2017
Runtime Analysis of Random Local Search on JUMP function with Reinforcement Based Selection of Auxiliary Objectives.
Proceedings of the 2017 IEEE Congress on Evolutionary Computation, 2017

2015
Runtime Analysis of (1+1) Evolutionary Algorithm Controlled with Q-learning Using Greedy Exploration Strategy on OneMax+ZeroMax Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2015


  Loading...