On the public citation graph

General Lower Bounds for Evolutionary Algorithms

0 signed · 72 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/11740698_26openalex-snapshot
Algorithms (X, sigma, eta): Quasi-random Mutations for Evolution Strategies
inferredcites →https://doi.org/10.1007/11844297_4openalex-snapshot
On the Ultimate Convergence Rates for Isotropic Algorithms and the Best Choices Among Various Forms of Isotropy
inferredcites →https://doi.org/10.1007/978-1-4612-0711-5openalex-snapshot
A Probabilistic Theory of Pattern Recognition
inferredcites →https://doi.org/10.1007/s00224-004-1177-zopenalex-snapshot
Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization
inferredcites →https://doi.org/10.1016/0016-0032(58)90688-4openalex-snapshot
An introduction to probability theory and its applications
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.1093/comjnl/7.4.308openalex-snapshot
A Simplex Method for Function Minimization
inferredcites →https://doi.org/10.1145/1068009.1068124openalex-snapshot
Not all linear functions are equally difficult for the compact genetic algorithm
inferredcites →https://doi.org/10.1145/1068009.1068153openalex-snapshot
Rigorous runtime analysis of a (μ+1)ES for the sphere function
inferredcites →https://doi.org/10.1145/321062.321069openalex-snapshot
`` Direct Search'' Solution of Numerical and Statistical Problems
inferredcites →https://doi.org/10.2307/2314609openalex-snapshot
An Introduction to Probability Theory and Its Applications.

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_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-1-4419-1665-5_19openalex-snapshot
Stochastic Search in Metaheuristics
inferred← citeshttps://doi.org/10.1007/978-3-030-29414-4_3openalex-snapshot
Complexity Theory for Discrete Black-Box Optimization Heuristics
inferred← citeshttps://doi.org/10.1007/978-3-030-58112-1_41openalex-snapshot
The Hessian Estimation Evolution Strategy
inferred← citeshttps://doi.org/10.1007/978-3-031-14714-2_6openalex-snapshot
Adaptive Function Value Warping for Surrogate Model Assisted Evolutionary Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-10762-2_88openalex-snapshot
Unbiased Black-Box Complexity of Parallel Search
inferred← citeshttps://doi.org/10.1007/978-3-319-45823-6_18openalex-snapshot
An Active-Set Evolution Strategy for Optimization with Known Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-91086-4_16openalex-snapshot
Stochastic Search in Metaheuristics
inferred← citeshttps://doi.org/10.1007/978-3-319-99253-2_2openalex-snapshot
Design of a Surrogate Model Assisted (1 + 1)-ES
inferred← citeshttps://doi.org/10.1007/978-3-319-99259-4_33openalex-snapshot
Challenges in High-Dimensional Reinforcement Learning with Evolution Strategies
inferred← citeshttps://doi.org/10.1007/978-3-540-79305-2openalex-snapshot
Artificial Evolution
inferred← citeshttps://doi.org/10.1007/978-3-540-79305-2_17openalex-snapshot
Conditioning, Halting Criteria and Choosing λ
inferred← citeshttps://doi.org/10.1007/978-3-540-79305-2_18openalex-snapshot
Log-Linear Convergence and Optimal Bounds for the (1 + 1)-ES
inferred← citeshttps://doi.org/10.1007/978-3-540-87700-4_11openalex-snapshot
Lower Bounds for Evolution Strategies Using VC-Dimension
inferred← citeshttps://doi.org/10.1007/978-3-540-87993-0_18openalex-snapshot
An Evolutionary Perspective on Approximate RDF Query Answering
inferred← citeshttps://doi.org/10.1007/978-3-642-15844-5_26openalex-snapshot
Log(λ) Modifications for Optimal Parallelism
inferred← citeshttps://doi.org/10.1007/978-3-642-33206-7_2openalex-snapshot
Convergence Rates of Evolutionary Algorithms and Parallel Evolutionary Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-33206-7_8openalex-snapshot
Principled Design of Continuous Stochastic Search: From Theory to Practice
inferred← citeshttps://doi.org/10.1007/978-3-662-43505-2_44openalex-snapshot
Evolution Strategies
inferred← citeshttps://doi.org/10.1007/s00453-010-9391-3openalex-snapshot
Lower Bounds for Comparison Based Evolution Strategies Using VC-dimension and Sign Patterns
inferred← citeshttps://doi.org/10.1007/s00453-010-9403-3openalex-snapshot
Log-Linear Convergence and Divergence of the Scale-Invariant (1+1)-ES in Noisy Environments
inferred← citeshttps://doi.org/10.1007/s00453-012-9616-8openalex-snapshot
Black-Box Search by Unbiased Variation
inferred← citeshttps://doi.org/10.1007/s00453-012-9684-9openalex-snapshot
Ranking-Based Black-Box Complexity
inferred← citeshttps://doi.org/10.1007/s00453-016-0168-1openalex-snapshot
OneMax in Black-Box Models with Several Restrictions
inferred← citeshttps://doi.org/10.1007/s00453-022-00957-5openalex-snapshot
Fast Mutation in Crossover-Based Algorithms
inferred← citeshttps://doi.org/10.1007/s00707-022-03406-0openalex-snapshot
A single-domain spectral solver for spatially nonsmooth differential equations of quasistatic solid mechanics in polar coordinates
inferred← citeshttps://doi.org/10.1007/s10898-022-01249-6openalex-snapshot
Global linear convergence of evolution strategies with recombination on scaling-invariant functions
inferred← citeshttps://doi.org/10.1016/j.ins.2020.12.076openalex-snapshot
Average convergence rate of evolutionary algorithms in continuous optimization
inferred← citeshttps://doi.org/10.1016/j.jtbi.2015.07.011openalex-snapshot
Toward a unifying framework for evolutionary processes
inferred← citeshttps://doi.org/10.1016/j.swevo.2020.100694openalex-snapshot
Evolution strategies for continuous optimization: A survey of the state-of-the-art
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.05.015openalex-snapshot
Quality gain analysis of the weighted recombination evolution strategy on general convex quadratic functions
inferred← citeshttps://doi.org/10.1109/cec.2007.4424857openalex-snapshot
On the adaptation of noise level for stochastic optimization
inferred← citeshttps://doi.org/10.1109/tevc.2019.2954234openalex-snapshot
Parallel Black-Box Complexity With Tail Bounds
inferred← citeshttps://doi.org/10.1137/20m1373815openalex-snapshot
Global Linear Convergence of Evolution Strategies on More than Smooth Strongly Convex Functions
inferred← citeshttps://doi.org/10.1145/1569901.1570255openalex-snapshot
Optimal robust expensive optimization is tractable
inferred← citeshttps://doi.org/10.1145/1830483.1830747openalex-snapshot
Black-box search by unbiased variation
inferred← citeshttps://doi.org/10.1145/1967654.1967666openalex-snapshot
Analyzing the impact of mirrored sampling and sequential selection in elitist evolution strategies
inferred← citeshttps://doi.org/10.1145/2001576.2001685openalex-snapshot
Comparison-based complexity of multiobjective optimization
inferred← citeshttps://doi.org/10.1145/2330163.2330211openalex-snapshot
Natural evolution strategies converge on sphere functions
inferred← citeshttps://doi.org/10.1145/2460239.2460256openalex-snapshot
Noisy optimization complexity under locality assumption
inferred← citeshttps://doi.org/10.1145/2576768.2598341openalex-snapshot
Unbiased black-box complexities of jump functions
inferred← citeshttps://doi.org/10.1145/2725494.2725499openalex-snapshot
Parallel Evolutionary Algorithms Performing Pairwise Comparisons
inferred← citeshttps://doi.org/10.1145/2739480.2754654openalex-snapshot
Elitist Black-Box Models
inferred← citeshttps://doi.org/10.1145/2739480.2754678openalex-snapshot
OneMax in Black-Box Models with Several Restrictions
inferred← citeshttps://doi.org/10.1145/2739480.2754684openalex-snapshot
Optimal Parameter Choices Through Self-Adjustment
inferred← citeshttps://doi.org/10.1145/3040718.3040720openalex-snapshot
Quality Gain Analysis of the Weighted Recombination Evolution Strategy on General Convex Quadratic Functions
inferred← citeshttps://doi.org/10.1145/3071178.3071294openalex-snapshot
Reconsidering constraint release for active-set evolution strategies
inferred← citeshttps://doi.org/10.1145/3377930.3390172openalex-snapshot
Fast mutation in crossover-based algorithms
inferred← citeshttps://doi.org/10.11509/isciesci.60.7_292openalex-snapshot
Evolution Strategies による連続最適化
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.2007.15.4.475openalex-snapshot
On the Hardness of Offline Multi-objective Optimization
inferred← citeshttps://doi.org/10.1162/evco_a_00158openalex-snapshot
Unbiased Black-Box Complexities of Jump Functions
inferred← citeshttps://doi.org/10.1162/evco_a_00195openalex-snapshot
Introducing Elitist Black-Box Models: When Does Elitist Behavior Weaken the Performance of Evolutionary Algorithms?
inferred← citeshttps://doi.org/10.21203/rs.3.rs-1973394/v1openalex-snapshot
A Scalable Derivative-free Exploration Approach for Reinforcement Learning
inferred← citeshttps://doi.org/10.21203/rs.3.rs-1973394/v2openalex-snapshot
A Scalable Derivative-free Exploration Approach for Reinforcement Learning
inferred← citeshttps://doi.org/10.48550/arxiv.1403.7806openalex-snapshot
Unbiased Black-Box Complexities of Jump Functions
inferred← citeshttps://doi.org/10.48550/arxiv.1504.03212openalex-snapshot
Optimal Parameter Choices Through Self-Adjustment: Applying the 1/5-th Rule in Discrete Settings
inferred← citeshttps://doi.org/10.70675/07e01361z9f00z4669z8a3dzc0b46338a7d6openalex-snapshot
Design of multiobjective optimization algorithms and theoretical analysis of evolution strategies
inferred← citeshttps://doi.org/10.70675/40b6ab5az6c45z4e4az8ef4z7853ec7a70ddopenalex-snapshot
Hybridization of dynamic optimization methodologies
inferred← citeshttps://doi.org/10.70675/6a5ac9fbz2f6bz4cf0za654z74be7c72df96openalex-snapshot
Contributions to Convergence Analysis of Noisy Optimization Algorithms
inferred← citeshttps://doi.org/10.70675/dde92a8az2fb7z495azad36zdad6f06e1e80openalex-snapshot
Markov chain Analysis of Evolution Strategies
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.