liveBook · Manning

Hyperparameter tuning

As explained in Optimization Algorithms: AI techniques for design, planning, and control problems

Parameter tuning is the process of selecting suitable values for an algorithm's configurable parameters before or during execution.

Hyperparameter tuning selects suitable values for an algorithm’s configurable parameters before execution. Parameters may also adapt during execution, helping balance exploration and exploitation. section 6.2.3

Tuning is especially important in metaheuristics, where parameter settings affect solution quality, runtime, cycling, stagnation, and whether a global optimum is found. section 6.2.3

Three tuning modes differ in what controls parameter updates:

  • Deterministic tuning follows a fixed update rule without using search information. section 6.2.3
  • Adaptive tuning uses information from the search to change a control parameter. section 6.2.3
  • Self-adaptive tuning changes the update rule itself. section 6.2.3

Choosing tabu tenure

In tabu search, a tenure that is too short can cause repeated cycling and weak exploration. One that is too long can prohibit useful moves and cause stagnation. Testing values or dynamically controlling tenure helps manage this trade-off. section 6.2.3

Practical tuning commonly involves experimentation, sensitivity analysis, or a dedicated parameter-tuning technique. In particle swarm optimization, swarm size and neighborhood size expose similar trade-offs between exploration, exploitation, convergence speed, and computational complexity. section 9.2.3

Figure 6.6 Effect of tabu tenure

Compare how tabu-tenure choices affect search performance. section 6.2.3

Figure 6.7 Dynamically controlling the tabu tenure

Examine dynamic control of tabu tenure during search. section 6.2.3

How Optimization Algorithms: AI techniques for design, planning, and control problems covers it

How deep it goes
Explains timing, update modes, parameter trade-offs, and sensitivity analysis through tabu search and particle swarm optimization.
Examples
Uses tabu tenure, swarm size, and neighborhood size to illustrate tuning trade-offs.
What you can do after
Apply it via experimentation, sensitivity analysis, or adaptive updates to choose problem-specific algorithm parameters.
How it connects
Connects parameter tuning with tabu search, particle swarm optimization, exploration, exploitation, and sensitivity analysis.

Also explained in

Compare how 18 books explain hyperparameter tuning →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Optimization Algorithms: AI techniques for design, planning, and control problems. The section links point to the parts of the book it draws on.