Question 1

How is a genetic algorithm different from gradient descent?

Accepted Answer

Gradient descent requires the fitness (loss) function to be differentiable and navigates toward local optima by following the gradient direction. It struggles with discontinuous functions, functions with many local minima, and problems where solutions cannot be naturally represented as continuous vectors. Genetic algorithms make no assumptions about the fitness landscape: they can handle discrete representations, discontinuous and noisy functions, and multi-modal landscapes with many local optima. GAs explore many regions of the search space simultaneously through their population, trading the efficiency of gradient descent for greater robustness to complex landscapes.

Question 2

What is the schema theorem and why does it matter?

Accepted Answer

Holland's schema theorem provides a theoretical explanation for why GAs work. A schema is a pattern that matches a subset of chromosomes (e.g., 1**0* matches all 5-bit strings starting with 1 and having 0 in position 4). The theorem states that schemata with above-average fitness, short defining length (bits close together), and low order (few fixed bits) receive exponentially increasing representation over generations. This Building Block Hypothesis suggests GAs implicitly search for and combine short, low-order, high-fitness patterns—the building blocks of good solutions—even though no explicit search for building blocks is coded.

Question 3

What is the exploration-exploitation trade-off in genetic algorithms?

Accepted Answer

Exploration means searching new, unvisited regions of the solution space (maintaining diversity); exploitation means refining the best solutions found so far (converging). High mutation rate and low selection pressure increase exploration; low mutation and high selection pressure increase exploitation. Too much exploitation causes premature convergence—the population converges on a local optimum before the global optimum is found. Too much exploration prevents convergence to any good solution. Adaptive GAs adjust mutation rate based on diversity metrics, and niching techniques (fitness sharing, crowding) maintain multiple diverse subpopulations simultaneously exploring different fitness peaks.

🧬 Genetic Evolution — Natural Selection

What did you find?