AI Foundationsbeginner11 min · 10 steps
Genetic Algorithms: Selection, Crossover, Mutation
Evolve good solutions instead of deriving them: keep a population, favour the fit, recombine and mutate, repeat.
dataheavy work
metrics are illustrativeProblemStep 1 of 10
Some problems give you a score but no slope
Choosing which of 40 items fit in a truck, laying out a timetable, or shaping an antenna: you can score any candidate, but there is no gradient to follow. The space is discrete, full of local optima, and too big to try every option (40 yes/no choices is about 10¹² combinations).
Gradient descent needs a smooth, differentiable loss, so it doesn't apply. We need a method that only asks “how good is this candidate?”
← Previous lessonSearch Algorithms: BFS, DFS, Heuristics and A*Next lesson →Retrieval: Keyword, Semantic, Hybrid and HyDE
Lesson 26 of 34 in AI Foundations