On the public citation graph

Algorithms (X, sigma, eta): Quasi-random Mutations for Evolution Strategies

0 signed · 45 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-45356-3_11openalex-snapshot
Perturbation Theory for Evolutionary Algorithms: Towards an Estimation of Convergence Speed
inferredcites →https://doi.org/10.1007/3-540-61108-8_29openalex-snapshot
An asymptotic theory for genetic algorithms
inferredcites →https://doi.org/10.1007/978-1-4612-4170-6openalex-snapshot
Curves and Fractal Dimension
inferredcites →https://doi.org/10.1007/978-1-4899-3095-8openalex-snapshot
Number-theoretic Methods in Statistics
inferredcites →https://doi.org/10.1007/978-3-662-04378-3openalex-snapshot
The Theory of Evolution Strategies
inferredcites →https://doi.org/10.1016/0378-4754(82)90117-3openalex-snapshot
Numerical optimization of computer models
inferredcites →https://doi.org/10.1016/j.tcs.2004.11.017openalex-snapshot
Convergence results for the (1,λ) -SA-ES using the theory of ϕ -irreducible Markov chains
inferredcites →https://doi.org/10.1016/s0304-3975(01)00182-7openalex-snapshot
On the analysis of the (1+1) evolutionary algorithm
inferredcites →https://doi.org/10.1057/jors.1982.238openalex-snapshot
Numerical Optimization of Computer Models
inferredcites →https://doi.org/10.1090/crmm/009openalex-snapshot
Wavelets, Vibrations and Scalings
inferredcites →https://doi.org/10.1109/4235.728208openalex-snapshot
Holder functions and deception of genetic algorithms
inferredcites →https://doi.org/10.1109/72.265964openalex-snapshot
Convergence analysis of canonical genetic algorithms
inferredcites →https://doi.org/10.1109/icec.1994.350041openalex-snapshot
Convergence of non-elitist strategies
inferredcites →https://doi.org/10.1137/1.9781611970081openalex-snapshot
Random Number Generation and Quasi-Monte Carlo Methods
inferredcites →https://doi.org/10.1162/106365601750190398openalex-snapshot
Completely Derandomized Self-Adaptation in Evolution Strategies
inferredcites →https://doi.org/10.1162/evco.1996.4.2.195openalex-snapshot
How Mutation and Selection Solve Long-Path Problems in Polynomial Expected Time
inferredcites →https://doi.org/10.1162/evco.1999.7.2.173openalex-snapshot
Rigorous Hitting Times for Binary Mutations
inferredcites →https://doi.org/10.1287/opre.48.6.939.12393openalex-snapshot
Global Stochastic Optimization with Low-Dispersion Point Sets
inferredcites →https://doi.org/10.2307/1909768openalex-snapshot
Maximization by Quadratic Hill-Climbing
inferredcites →https://doi.org/10.2307/2290359openalex-snapshot
Random Number Generation and Quasi-Monte Carlo Methods.
inferredcites →https://doi.org/10.2307/2983421openalex-snapshot
Number-Theoretic Methods in Statistics.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11844297_3openalex-snapshot
General Lower Bounds for Evolutionary Algorithms
inferred← citeshttps://doi.org/10.1007/11844297_4openalex-snapshot
On the Ultimate Convergence Rates for Isotropic Algorithms and the Best Choices Among Various Forms of Isotropy
inferred← citeshttps://doi.org/10.1007/978-3-319-11683-9_2openalex-snapshot
Log-log Convergence for Noisy Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-99253-2_5openalex-snapshot
Towards an Adaptive CMA-ES Configurator
inferred← citeshttps://doi.org/10.1007/978-3-642-35533-2_4openalex-snapshot
A Rigorous Runtime Analysis for Quasi-Random Restarts and Decreasing Stepsize
inferred← citeshttps://doi.org/10.1007/978-3-662-45523-4_49openalex-snapshot
Noisy Optimization: Convergence with a Fixed Number of Resamplings
inferred← citeshttps://doi.org/10.1109/ssci.2016.7850138openalex-snapshot
Evolving the structure of Evolution Strategies
inferred← citeshttps://doi.org/10.1145/1276958.1277150openalex-snapshot
DCMA
inferred← citeshttps://doi.org/10.1145/2133390.2133393openalex-snapshot
Evolutionary optimization of low-discrepancy sequences
inferred← citeshttps://doi.org/10.1145/2725494.2725499openalex-snapshot
Parallel Evolutionary Algorithms Performing Pairwise Comparisons
inferred← citeshttps://doi.org/10.1145/2725494.2725500openalex-snapshot
Evolution Strategies with Additive Noise
inferred← citeshttps://doi.org/10.1145/2908961.2909060openalex-snapshot
QR Mutations Improve Many Evolution Strategies
inferred← citeshttps://doi.org/10.1145/3071178.3071205openalex-snapshot
Algorithm configuration data mining for CMA evolution strategies
inferred← citeshttps://doi.org/10.1145/3205455.3205532openalex-snapshot
Discrepancy-based evolutionary diversity optimization
inferred← citeshttps://doi.org/10.1145/3321707.3321803openalex-snapshot
Online selection of CMA-ES variants
inferred← citeshttps://doi.org/10.1145/3377930.3389831openalex-snapshot
Integrated vs. sequential approaches for selecting and tuning CMA-ES variants
inferred← citeshttps://doi.org/10.1145/3449726.3463167openalex-snapshot
Tuning as a means of assessing the benefits of new ideas in interplay with existing algorithmic modules
inferred← citeshttps://doi.org/10.1162/evco.2007.15.4.411openalex-snapshot
Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime
inferred← citeshttps://doi.org/10.1162/evco_a_00325openalex-snapshot
Evolutionary Algorithms for Parameter Optimization—Thirty Years Later
inferred← citeshttps://doi.org/10.48550/arxiv.1912.05899openalex-snapshot
Sequential vs. Integrated Algorithm Selection and Configuration: A Case Study for the Modular CMA-ES
inferred← citeshttps://doi.org/10.70675/51dc2660zd1cdz445bzb3abz8bba778dc25fopenalex-snapshot
Uncertainties in Optimization
inferred← citeshttps://doi.org/10.70675/608cd64fz6bdez4428zb3eczdb2d8b8ed277openalex-snapshot
Portfolio Methods in Uncertain Contexts
inferred← citeshttps://doi.org/10.70675/6395ff2az760fz4ac2za2dezc0f4b98f9890openalex-snapshot
Landscape-Aware Selection of Metaheuristics for the Optimization of Radar Networks
inferred← citeshttps://doi.org/10.70675/903277a0za4f9z4f32z8ab6zdb11b19f660dopenalex-snapshot
Towards Online Landscape-Aware Algorithm Selection in Numerical Black-Box Optimization
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.