text: **Local search**
  
  Local search uses mathematical optimization to find a solution to a problem. It begins with some form of 
  guess and refines it incrementally.[74] 
  
  Gradient descent is a type of local search that optimizes a set of numerical parameters by incrementally 
  adjusting them to minimize a loss function. Variants of gradient descent are commonly used to train 
  neural networks.[75] 
  
  Another type of local search is evolutionary computation, which aims to iteratively improve a set of 
  candidate solutions by "mutating" and "recombining" them, selecting only the fittest to survive each 
  generation.[76] 