General characteristics of GAs

• Simple algorithm; elusive heuristic
• Exploration vs. exploitation
• Weak credit assignment
• Not gradient descent (aka hill-climbing)
• General, for any hypothesis space
  • Parameters/weights
  • Rules
  • Computer programs
• Easily parallelizable!