On the public citation graph

On the Ultimate Convergence Rates for Isotropic Algorithms and the Best Choices Among Various Forms of Isotropy

0 signed · 37 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_3openalex-snapshot
General Lower Bounds for Evolutionary Algorithms
inferredcites →https://doi.org/10.1007/978-1-4757-6568-7openalex-snapshot
Sphere Packings, Lattices and Groups
inferredcites →https://doi.org/10.1007/978-3-662-04378-3openalex-snapshot
The Theory of Evolution Strategies
inferredcites →https://doi.org/10.1007/bfb0040753openalex-snapshot
Evolutionary Programming VII
inferredcites →https://doi.org/10.1007/bfb0040786openalex-snapshot
Resampling and its avoidance in genetic algorithms
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.1017/cbo9780511626371openalex-snapshot
The Discrepancy Method
inferredcites →https://doi.org/10.1090/s0025-5718-1970-0258249-6openalex-snapshot
A Family of Variable-Metric Methods Derived by Variational Means
inferredcites →https://doi.org/10.1090/s0025-5718-1970-0274029-xopenalex-snapshot
Conditioning of Quasi-Newton Methods for Function Minimization
inferredcites →https://doi.org/10.1093/comjnl/13.3.317openalex-snapshot
A new approach to variable metric algorithms
inferredcites →https://doi.org/10.1093/imamat/6.3.222openalex-snapshot
The Convergence of a Class of Double-rank Minimization Algorithms
inferredcites →https://doi.org/10.1109/cec.1999.782001openalex-snapshot
The deterministic genetic algorithm: implementation details and some results
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.1162/106365601750190398openalex-snapshot
Completely Derandomized Self-Adaptation in Evolution Strategies
inferredcites →https://doi.org/10.1162/106365603321828970openalex-snapshot
Reducing the Time Complexity of the Derandomized Evolution Strategy with Covariance Matrix Adaptation (CMA-ES)
inferredcites →https://doi.org/10.1175/1520-0493(1997)125<2460:aoanan>2.0.co;2openalex-snapshot
Application of a New Adjoint Newton Algorithm to the 3D ARPS Storm-Scale Model Using Simulated Data
inferredcites →https://doi.org/10.2307/2323992openalex-snapshot
Sphere Packings, Lattices and Groups.
inferredcites →https://doi.org/10.4064/sm-70-3-231-283openalex-snapshot
The best constants in the Khintchine inequality
inferredcites →https://doi.org/10.5860/choice.40-2215openalex-snapshot
The discrepancy method: randomness and complexity

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/978-3-030-58112-1_11openalex-snapshot
Variance Reduction for Better Sampling in Continuous Domains
inferred← citeshttps://doi.org/10.1007/978-3-319-31471-6_5openalex-snapshot
Quasi-random Numbers Improve the CMA-ES on the BBOB Testbed
inferred← citeshttps://doi.org/10.1007/978-3-642-15844-5_2openalex-snapshot
Mirrored Sampling and Sequential Selection for Evolution Strategies
inferred← citeshttps://doi.org/10.1007/s00453-012-9616-8openalex-snapshot
Black-Box Search by Unbiased Variation
inferred← citeshttps://doi.org/10.1109/cec.2015.7257007openalex-snapshot
Experiments on the CEC 2015 expensive optimization testbed
inferred← citeshttps://doi.org/10.1109/tevc.2015.2444793openalex-snapshot
Average Convergence Rate of Evolutionary Algorithms
inferred← citeshttps://doi.org/10.1145/1276958.1277150openalex-snapshot
DCMA
inferred← citeshttps://doi.org/10.1145/1569901.1569964openalex-snapshot
Why one must use reweighting in estimation of distribution algorithms
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.2001694openalex-snapshot
Mirrored sampling in evolution strategies with weighted recombination
inferred← citeshttps://doi.org/10.1145/3520304.3534069openalex-snapshot
Choosing the right algorithm with hints from complexity theory
inferred← citeshttps://doi.org/10.24963/ijcai.2021/234openalex-snapshot
Choosing the Right Algorithm With Hints From Complexity Theory
inferred← citeshttps://doi.org/10.48550/arxiv.1910.08406openalex-snapshot
Fully Parallel Hyperparameter Search: Reshaped Space-Filling
inferred← citeshttps://doi.org/10.70675/5d43ac4dz7c5az4eaeza410z228ff663c911openalex-snapshot
Studies on Stochastic Optimisation and applications to the Real-World
inferred← citeshttps://doi.org/10.70675/c792c77cz8c7bz4930za4fbz79b40c3d10d1openalex-snapshot
Adversarial attacks : a theoretical journey
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.