Link to current text
CMP.6:8 - Common Anti-Patterns and How to Avoid Them
| Misstep exposed by the method | Consequence and repair |
| Turn an improving direction into an arbitrary finite step | The quadratic example can oscillate or diverge. Derive step extent or supply an adaptive rule with stated conditions. |
| Stop solely because successive values barely change | A tiny step can hide a large unresolved error. Connect the stopping quantity to the result by a bound. |
| Demand zero full gradient at a constrained optimum | The interval example is optimal with a nonzero derivative. Use feasible variations or the appropriate projected condition. |
| Infer global optimality from a local stop | The neighborhood may miss a better distant candidate. Derive a global comparison or retain the local conclusion. |
| Treat finite termination as a useful runtime bound | The finite state space or potential may be enormous. Account for encoded magnitude and work per step. |