Bounded Approximation¶
Use a simplified approximation when exactness is costly, while bounding the error enough for the decision.
The Diagnostic Story¶
Symptom: The team is either pursuing exactness far beyond what the decision requires, or accepting rough estimates with no idea how rough is too rough. Analysis pipelines grow more elaborate without improving outcomes. When a quick answer would have unblocked progress, the effort is still running. When a fast estimate is used, nobody knows whether the error is a rounding matter or a factor of ten.
Pivot: Define the decision requirement first, then set an acceptable error or uncertainty bound, and choose an approximation method whose validity domain covers the actual use. Communicate the bound as part of the result, and specify the conditions under which an exact analysis must take over.
Resolution: Effort matches decision need: simple questions get fast bounded answers, complex ones get exact analysis only when the extra precision would change what is done. False precision decreases because estimates are framed around defensible bounds, not around the implied authority of a precise-looking number.
Reach for this when you hear…¶
[engineering feasibility] “We don't need to know the mass to five significant figures — we need to know whether it's closer to ten kilograms or a hundred.”
[budget planning] “Nobody is going to change the decision based on whether the estimate is nine million or nine point three million, so let's stop refining and move.”
[ecological modeling] “The exact population count is unknowable, but we can bound it well enough to know whether the species is in trouble or not.”
When This Archetype Applies¶
No catalog groundingNone of the structural conditions is currently represented by an accepted prime or domain-specific abstraction.
Diagnostic problem
A system needs to reason, choose, forecast, design, or allocate under constraints, but exact representation or computation is infeasible relative to the decision need. Without a disciplined approximation, the system either stalls in pursuit of exactness or acts on unbounded guesswork.
What this problem means
The structural problem is a mismatch between the cost of exactness and the decision’s actual need for precision. A system may delay action while pursuing detail that would not change the decision. Or it may move quickly by relying on estimates that no one has bounded, validated, or communicated honestly.
Both failure patterns are common. Analysis paralysis wastes time and opportunity. Unbounded guesswork creates hidden risk. Bounded Approximation works by making precision proportional: enough fidelity for the decision, enough uncertainty expression to avoid overtrust, and enough escalation discipline to prevent approximate reasoning from becoming permanent dogma.
Show the applicability expression
Applicability expression5 distinct conditions
groundedpartly groundedopen
5 conditions, all required.
5Required in every casenumbered 1–5
These hold no matter which pattern applies.
Exactness exceeds deadline · open
Exact calculation, measurement, or modeling would exceed the decision window.
The source archetype describes the situation as follows: Exact calculation, measurement, or modeling would take too long for the decision window. The normalized requirement above isolates the load-bearing portion used in this condition set.
Negative precision value · open
The cost of exactness exceeds the decision value of its additional precision.
The source archetype describes the situation as follows: The cost of exactness exceeds the value of the extra precision. The normalized requirement above isolates the load-bearing portion used in this condition set.
Routine exact-model burden · open
The exact model is computationally expensive or structurally complex for routine use.
The source archetype describes the situation as follows: The exact model is too computationally expensive or structurally complex for routine use. The normalized requirement above isolates the load-bearing portion used in this condition set.
Approximation range bracket · open
Multiple approximate sources disagree but jointly bracket a decision-relevant range.
The source archetype describes the situation as follows: Multiple approximate sources disagree but still bracket a decision-relevant range. The normalized requirement above isolates the load-bearing portion used in this condition set.
Verified error tolerance · open
A purpose-specific error tolerance is known and the cheaper approximation can be shown to remain inside it.
This condition preserves a load-bearing part of the diagnostic problem that was not captured by a source-condition atom. It remains explicit because omitting it would weaken the sufficient condition set.
Other requirements and context (2)
Why these sit outside the expression
Application gate — it governs whether applying the archetype is appropriate or material, rather than defining the structural problem itself.
Goal — a goal states an intended outcome or evaluation criterion, not a pre-existing situation that independently summons the archetype.
Application gateThe system only needs scale, direction, feasibility, ranking, or a safe-enough operating range.
It is especially appropriate when the immediate need is feasibility, scale, ranking, screening, prioritization, or early learning rather than final proof. In this archetype, the relevant application gate is: The system only needs scale, direction, feasibility, ranking, or a safe-enough operating range. It narrows when choosing or applying the archetype is warranted or decision-relevant.
GoalEarly action, learning, or screening matters more than comprehensive certainty.
It is especially appropriate when the immediate need is feasibility, scale, ranking, screening, prioritization, or early learning rather than final proof. In this archetype, the relevant goal is: Early action, learning, or screening matters more than comprehensive certainty. It supplies a criterion for evaluating what the intervention should accomplish or preserve.
Coverage
0 of 5 conditions grounded · 5 open.
Mechanisms / Implementations¶
- Back-of-Envelope Estimate: Produces a rough calculation quickly by using simplifying assumptions, rounded values, and transparent arithmetic to check scale or feasibility.
- Rough Order-of-Magnitude Estimate: Approximates by powers of ten or broad scale classes when exact values are unavailable or unnecessary.
- Surrogate Model: Uses a cheaper model to stand in for a more expensive, slower, or inaccessible model while tracking where the substitute is valid.
- Simplified Simulation: Simulates a reduced version of the system that captures enough behavior to guide the decision.
- Algorithmic Relaxation: Relaxes exact optimization or constraint satisfaction so a usable answer can be produced within time, computation, or information limits.
- Prototype Test: Uses a partial or low-fidelity implementation as an approximation of later system behavior.
- Policy Pilot: Treats a limited rollout as an approximate test of a broader policy or operational intervention.
- Sensitivity Probe: Varies key assumptions or inputs to see whether the approximate conclusion changes materially.
Related Abstractions¶
Abstractions this archetype builds on — directly (a source ingredient) or as a related pattern. Links follow the typed catalog namespace.
Built directly on (3)
- Approximation: Good-enough representation.
- Boundedness: Values remain within limits.
- Uncertainty: Incomplete knowledge.
Also references 12 related abstractions
- Abstraction: Focus on core elements.
- Complexity (Time/Space): Resource scaling with input size.
- Confidence Intervals: Range of plausible values.
- Constraint: Limits possibilities to guide outcomes.
- Optimization: Finds best solution under constraints.
- Parsimony (Occam's Razor): Prefer simplicity.
- Probability: Quantifies uncertainty and likelihoods.
- Representation: Model complex ideas.
- Resource Management: Allocation of finite assets.
- Robustness: Maintain functionality under stress.
Variants¶
Narrower or domain-specific specializations that share this archetype's core structure. Recognized variants are established; candidate variants are provisional.
Order-of-Magnitude Approximation · implementation variant · recognized
Uses broad scale classes or powers of ten when exact values are unnecessary for the decision.
Surrogate Model Approximation · mechanism family variant · recognized
Uses a cheaper or simpler model as a substitute for a costly model, measurement process, or real-world test.
Pilot as Approximation · implementation variant · recognized
Uses a limited trial, prototype, or rollout as an approximate representation of broader deployment behavior.
Algorithmic Relaxation Approximation · implementation variant · recognized
Relaxes exact computation or optimization requirements to produce a good-enough answer under resource limits.
Editorial Notes¶
Problem Classification¶
Classification: Correctness, Conformance & Formal Validity Failure → Computational Decidability & Bounded Approximation
Problem kernel: exact solution is infeasible but approximation lacks a bound
Rationale: The system either waits for unattainable exactness or acts on guesswork because no explicit approximation error and decision boundary are defined.
Independent corroboration: The earliest necessary condition in the frozen evidence is: A system needs to reason, choose, forecast, design, or allocate under constraints, but exact representation or computation is infeasible relative to the decision need. That is a computational decidability and bounded approximation problem because Exact solution or total decision is impossible or infeasible, yet the system lacks an honest decision boundary, separated verification path, or bounded approximation.
Review outcome: Independent reviewer agreement; high confidence.