The voting algorithm is robust to various noise models
From MaRDI portal
Recommendations
- The benefits and limitations of voting mechanisms in evolutionary optimisation
- Voting rules as error-correcting codes
- Running time analysis of the \((1+1)\)-EA for OneMax and LeadingOnes under bit-wise noise
- Robustness of populations in stochastic environments
- Run-time analysis of population-based evolutionary algorithm in noisy environments
Cites work
- Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial
- Analysis of runtime of optimization algorithms for noisy functions over discrete codomains
- Black-box search by elimination of fitness functions
- Black-box search by unbiased variation
- Chebyshev-Grüss-type inequalities via discrete oscillations
- Efficient optimisation of noisy fitness functions with population-based evolutionary algorithms
- Good lower and upper bounds on binomial coefficients
- scientific article; zbMATH DE number 98525 (Why is no real title available?)
- On a conjecture concerning the sum of the squared Bernstein polynomials
- On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization
- Robustness of populations in stochastic environments
- Run-time analysis of population-based evolutionary algorithm in noisy environments
- Running time analysis of the \((1+1)\)-EA for OneMax and LeadingOnes under bit-wise noise
- Runtime analysis of non-elitist populations: from classical optimisation to partial information
- The benefits and limitations of voting mechanisms in evolutionary optimisation
This page was built for publication: The voting algorithm is robust to various noise models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2700787)
