Error-driven learning

Learning that updates expectations or parameters in proportion to a discrepancy between predicted and observed outcomes, so surprising events produce larger representational change.

Version

v2 · 2026-09-19 · History

Domain-specific #

4416

Domain group

Social Sciences

Origin domain

Psychology & Behavioral Sciences

Subdomains

Learning Theory, Prediction Error Updates → Psychology & Behavioral Sciences

Core Idea

Error-driven learning modifies a model from the difference between its current prediction and feedback rather than strengthening every co-occurrence equally. A signed or scalar prediction error is weighted by learning rate and feature responsibility to adjust associations, expectations or network weights, reducing future discrepancy. 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.

The load-bearing residual is not the broad topic of learning theory. It is surprise-scaled updating shared by associative, reinforcement and supervised-learning families while their error definitions differ.

How would you explain it like I'm…

Learning From Oops

You guess how far your ball will roll, then you see where it really stops. If you were way off, you change your guess a lot next time. If you were close, you change it just a little. You learn from how wrong you were.

Learning From Surprises

In error-driven learning, a learner first makes a prediction and then gets feedback about what really happened. The learner measures the gap between the guess and the result. A big surprise causes a big change, and a small one causes a small change. If the guess was already right, almost nothing changes. This is different from simply strengthening every link between things that happen together.

Prediction-Error Updating

Error-driven learning updates a model using the prediction error, which is the difference between what was expected and what the feedback says. It contrasts with simple co-occurrence learning, where every pairing of events strengthens an association by the same amount. The size of each update is scaled by a learning rate and by how responsible each feature was for the prediction. Over time, these updates shrink future errors. Animal conditioning, reinforcement learning, and supervised neural networks all share this surprise-scaled updating, even though they define the error differently. The key test is whether change is actually driven by a computed prediction discrepancy.

 

Error-driven learning describes update rules in which changes to associations, expectations, or weights are governed by a prediction error rather than by raw co-occurrence. A signed or scalar error (outcome minus prediction) is multiplied by a learning rate and distributed across features according to a credit-assignment rule, so that future discrepancy shrinks. This surprise-scaled updating is shared by associative models of conditioning, reinforcement-learning value updates, and gradient-based supervised learning, each with its own error definition. A consequence is that well-predicted outcomes produce little learning. To claim a system is error-driven, one must specify the carrier (what is being updated), the feedback, how error is computed, and how credit is assigned, and show the update actually depends on that error. Mere topical similarity to learning theory is not enough.

Scope of Application

Error-driven learning belongs to learning theory and is useful where the analyst can specify a learner or model, cues or state, a prediction, an observed outcome or target, an error signal, adjustable parameters, and an update rule, then evaluate parameter or association change is explicitly governed by a computed prediction discrepancy under a stated feedback and credit-assignment rule. The scope is broad within that domain but bounded by the need for parameter or association change is explicitly governed by a computed prediction discrepancy under a stated feedback and credit-assignment rule. 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 parameter or association change is explicitly governed by a computed prediction discrepancy under a stated feedback and credit-assignment rule the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Error-driven learning can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

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 Error-driven learning. Error-driven 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

1. Identify the carrier. State what the elements, states, objects, or observations are: a learner or model, cues or state, a prediction, an observed outcome or target, an error signal, adjustable parameters, and an update rule. Reject examples whose alleged carrier belongs to a different problem.
2. Lock the constitutive rule. Express parameter or association change is explicitly governed by a computed prediction discrepancy under a stated feedback and credit-assignment rule independently of one notation or implementation.

Knowledge Transfer

Knowledge transfers strongly among subfields of learning theory because they reuse a learner or model, cues or state, a prediction, an observed outcome or target, an error signal, adjustable parameters, and an update rule, A signed or scalar prediction error is weighted by learning rate and feature responsibility to adjust associations, expectations or network weights, reducing future discrepancy., and type the carrier, state every parameter and convention in the definition, test that parameter or association change is explicitly governed by a computed prediction discrepancy under a stated feedback and credit-assignment rule, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions

Current abstraction Error-driven learning Domain-specific

Parents (1) — outgoing typed relations

• Error-driven learning is a kind of Prediction Error Prime

  The mechanism converts mismatch between expectation and outcome into learning.

Hierarchy path (1) — routes to 1 parentless root

• Error-driven learning → is a kind of Prediction Error → is a kind of Baseline Deviation → presupposes, typical Comparison

Neighborhood in Abstraction Space

Error-driven learning sits in a crowded region of the domain-specific corpus (14^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Machine Learning Models & Representations (25 abstractions)

Nearest neighbors

• Transfer learning — 0.92
• Inert knowledge — 0.91
• Hidden layer — 0.91
• Concept class — 0.91
• Regression analysis — 0.91

Computed from structural-signature embeddings · 2026-10-25