liveBook · Manning

Shortcut rule

As explained in Deep Learning with R, Third Edition

The shortcut rule is the principle that optimizing a system for a single task metric produces task-specific solutions without necessarily producing general intelligence.

The shortcut rule says that optimizing one success metric produces solutions tailored to that goal, often sacrificing qualities the metric does not measure. In AI, high task performance therefore does not necessarily indicate general intelligence. section 19.3.3 section 19.5

The Netflix recommendation challenge

The winning system optimized movie-prediction accuracy, but Netflix did not use it because its complexity and compute demands outweighed its practical value. Accuracy improved while inference cost, maintainability, and explainability suffered. section 19.3.3

Chess is not human intelligence

DeepBlue defeated Garry Kasparov in 1997, yet building a chess champion revealed little about human intelligence. Its success depended on alpha–beta search rather than the broad capabilities researchers had hoped chess would require. section 19.3.3

A single metric can leave important system properties unoptimized:

Figure 19.8 A low-generalization system can achieve arbitrary skill at a fixed task given unlimited task-specific information.
figure

Use the figure to see how unlimited task-specific information can produce arbitrary skill on a fixed task without broad generalization. section 19.3.3

How Deep Learning with R, Third Edition covers it

How deep it goes
Defines the principle and illustrates it through recommendation, chess, and generalization examples without formal derivation.
Examples
Uses the Netflix challenge, Kaggle competitions, DeepBlue, and fixed-task systems to expose metric-driven shortcuts.
What you can do after
Evaluate AI systems by checking whether optimized metrics conceal costs, poor maintainability, limited explainability, or weak generalization.
How it connects
Connects objective design with general intelligence, machine learning, deep learning, program synthesis, and compositional generalization.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Deep Learning with R, Third Edition. The section links point to the parts of the book it draws on.