liveBook · Manning

Variable interaction

As explained in Advanced Algorithms and Data Structures

Variable interaction is the dependence in an optimization problem whereby the value or constraints of one variable are affected by another variable.

Variable interaction is the dependence between optimization variables: changing one variable can alter another variable’s value or constraints. This dependence is also described as epistasis. section 18.1.10

House design

In a house-energy optimization problem, floor area and room count affect the amount of wood required for flooring. Changing the house size therefore forces a change in another variable when floor thickness stays fixed. section 18.1.10

Interaction changes both the optimization landscape and the choice of search method:

  • Low interaction produces a smoother landscape; 0-1 knapsack is given as an example. section 18.1.10
  • High interaction makes the landscape wavier and makes local exploration and fine-tuning harder; house design illustrates this case. section 18.1.10
  • Use gradient descent for low epistasis, simulated annealing or random search for high epistasis, and genetic algorithms across medium-to-high epistasis. section 18.1.10

How Advanced Algorithms and Data Structures covers it

How deep it goes
Explains dependencies, landscape effects, and algorithm implications through concrete optimization examples.
Examples
Uses house design, 0-1 knapsack, and the traveling-salesperson problem to contrast interaction levels.
What you can do after
Evaluate variable interaction and choose search methods suited to the resulting optimization landscape.
How it connects
Connects variable interaction with epistasis, objective functions, optimization landscapes, and search algorithms.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Advanced Algorithms and Data Structures. The section links point to the parts of the book it draws on.