Lazy learning¶
A machine-learning strategy that postpones generalization from stored training examples until a prediction query arrives.
Core Idea¶
Nearest-neighbor and case-based learners shift computation and model choice to query time, enabling rapid updates but increasing storage and latency and making distance and local neighborhood choices constitutive. The system retains labeled cases, retrieves those relevant to a new query and constructs a local prediction or explanation only for that query. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.
Scope of Application¶
Lazy learning belongs to machine learning and is useful where the analyst can specify the typed machine learning carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the task and data, stored representation, similarity or retrieval rule, query-time neighborhood and weighting, prediction rule, update policy, indexing, latency and memory, validation split and calibration are explicit. The scope is broad within that domain but bounded by the need for the task and data, stored representation, similarity or retrieval rule, query-time neighborhood and weighting, prediction rule, update policy, indexing, latency and memory, validation split and calibration are explicit. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.
Clarity¶
The abstraction clarifies a crowded vocabulary by making the task and data, stored representation, similarity or retrieval rule, query-time neighborhood and weighting, prediction rule, update policy, indexing, latency and memory, validation split and calibration are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.
Manages Complexity¶
Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Lazy learning. Lazy learning compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.
Abstract Reasoning¶
- Identify the carrier. State what the elements, states, objects, or observations are: the typed machine learning carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the task and data, stored representation, similarity or retrieval rule, query-time neighborhood and weighting, prediction rule, update policy, indexing, latency and memory, validation split and calibration are explicit independently of one notation or implementation.
Knowledge Transfer¶
Knowledge transfers strongly among subfields of machine learning because they reuse the typed machine learning carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, The system retains labeled cases, retrieves those relevant to a new query and constructs a local prediction or explanation only for that query., and type the carrier, state every parameter and convention in the definition, test that the task and data, stored representation, similarity or retrieval rule, query-time neighborhood and weighting, prediction rule, update policy, indexing, latency and memory, validation split and calibration are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.
Relationships to Other Abstractions¶
Current abstraction Lazy learning Domain-specific
Parents (1) — more general patterns this builds on
-
Lazy learning is a kind of Lazy Evaluation Prime
The proposed strict upward parent is
prime:lazy_evaluation.
Hierarchy paths (2) — routes to 2 parentless roots
- Lazy learning → Lazy Evaluation → Postponement → Optionality → Reversibility and Irreversibility
- Lazy learning → Lazy Evaluation → Postponement → Optionality → Uncertainty
Neighborhood in Abstraction Space¶
Lazy learning sits in a crowded region of the domain-specific corpus (15th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Machine Learning & Statistical Estimation (24 abstractions)
Nearest neighbors
- Neural Turing machine — 0.94
- Ensemble learning — 0.93
- Out-of-bag error — 0.92
- Neural scaling law — 0.92
- Decision tree pruning — 0.91
Computed from structural-signature embeddings · 2026-09-08