Differential Evolution › Practical Implications

DE is a candidate when continuous decisions can be scored but derivatives are unavailable or inconvenient, provided a population fits the evaluation budget. The example here uses finite deterministic values and box constraints. An application with solver failures, non-box feasibility conditions, or expensive evaluations needs explicit handling of those cases and a comparison with simpler methods.

Before choosing parameters, make the representation and evaluation protocol explicit:

1. Choose meaningful bounds and units. Normalizing variables can simplify tolerance choices and baseline step sizes, even though matched diagonal scaling does not inherently change differential mutation and coordinate crossover.
2. Validate any reparametrization in the original decision space. For strictly positive variables, use log coordinates with the inverse map $x_j=\exp(z_j)$. For a positive simplex vector of dimension $d\ge1$, softmax uses $x_j=\exp(z_j)/\sum_{k=1}^{d}\exp(z_k)$. For finite real $z$, these softmax entries are positive and sum to one in exact arithmetic. Both maps can exclude boundary solutions with zero coordinates. They do not automatically supply a bounded transformed search domain.
3. Disclose warm starts. Prior fits or grid searches can inform initialization, but their evaluation cost and the remaining random population must be stated rather than treated as free knowledge.

Inspect the incumbent trace together with population spread, repeated candidates, and bound hits. A flat objective trace with large spread does not establish duplicate collapse; separated regions may simply have similar costs. A small spread can indicate lost exploration, but neither diagnostic alone identifies a unique remedy. Test restarts or different settings under a reported additional budget.

The two-dimensional example does not establish a high-dimensional population-size rule or a cutoff beyond which another optimizer wins. More variables change coverage, coordinate interactions, and evaluation cost. Reassess population size and budget on the application. Methods that learn search-distribution covariance are a possible later extension; a full CMA-ES derivation is outside this chapter.

With noisy evaluations, a trial can win because its observation was lucky. The stored best observation can improve while the true expected objective does not. Repeated comparisons, larger simulation averages, or an improvement margin can change that risk, but they offer no automatic guarantee. Common random numbers reduce comparison variance when they induce positive covariance between competing estimates. Re-evaluating both target and trial on paired draws, and every additional simulation replicate, has a cost that must be reported and budgeted.

A matched candidate-evaluation budget controls one source of comparison differences. Also report preprocessing, initialization, runtime, feasibility, objective noise, tuning effort, and stopping rules when they matter. Count finite-difference, repair, restart, and polishing evaluations; repeat across seeds; and include simple baselines. A good result on one seed or one objective does not establish general superiority.