liveBook · Manning

Deep learning-assisted heuristic tree search

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

A heuristic tree-search method in which deep neural networks decide which branches to explore and how to bound nodes.

Deep learning-assisted heuristic tree search (DLTS) combines a heuristic tree-search algorithm with deep neural networks (DNNs). The networks repeatedly inspect the algorithm’s current state and guide which branches to explore and how to bound nodes. section 11.5

Its defining workflow includes:

  • Representing the current algorithm state, potentially including the problem definition, as model input. section 11.5
  • Reusing the same ML model across repeated combinatorial-optimization decisions. section 11.5
  • Using DNN predictions to select branches and determine node bounds. section 11.5
Figure 11.14 Machine learning (ML) for combinatorial optimization (CO) problems

Maps machine learning methods to combinatorial-optimization problems and situates DLTS within that broader relationship. section 11.5

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

How deep it goes
Defines inputs and search decisions but stops short of training procedures, network architectures, or implementation steps.
What you can do after
Evaluate how DNNs can guide branch exploration and node bounding within heuristic optimization search.
How it connects
Connects heuristic tree search with deep neural networks, machine learning, and combinatorial optimization.

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.