In the DEAP algorithms (see documentation here), I notice that we need to specify the the number of generations (NGEN). I was advised that convergence has been achieved if the Pareto curve is smooth.
It is possible to monitor for convergence by specifying a "smoothness" value in the stats. However, I'm still confused about how to define "smoothness". For example, consider the Knapsack problem specified here. How do we monitor for smoothness in this example? In general, how can I monitor for convergence in DEAP?