liveBook · Manning

Heuristic

As explained in Machine Learning Platform Engineering

A heuristic is a rule-based method that produces a practical solution without learning a model from data.

A heuristic is a rule-based method that produces a practical solution without learning a model from data. In an ML project, test whether a simple heuristic is sufficient before committing to the cost and complexity of machine learning. section 1.1.1

Simple heuristics can be efficient, but complex, high-dimensional data with intricate and nonlinear patterns may require an ML model for accurate analysis or prediction. Treat the choice as an explicit problem-formulation decision rather than an automatic appeal to ML. section 1.1.1

Use a heuristic when:

  • A straightforward rule appears likely to solve the operational problem efficiently. section 1.1.1
  • Avoid replacing the rule with ML merely because ML is available; escalate when data complexity demands learned patterns. section 1.1.1

How Machine Learning Platform Engineering covers it

How deep it goes
Defines the trade-off with ML and stops short of specifying heuristic implementation or evaluation procedures.
What it assumes
Assumes recognition of an operational problem and distinguishes simple rules from learned models.
What you can do after
Evaluate whether a practical rule is sufficient before adopting an ML model.
How it connects
Connects heuristics to machine learning, problem formulation, high-dimensional data, and nonlinear pattern analysis.

Also explained in

Compare how 9 books explain heuristic →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Machine Learning Platform Engineering. The section links point to the parts of the book it draws on.