Task Decomposition

Task decomposition is the scalable-oversight technique of breaking complex problems into smaller, independently solvable subtasks — making evaluation and verification tractable at each level. Foundation for iterative-amplification and many debate-based approaches.

Core Concept

Mirrors how humans handle complexity through layers of abstraction.

Practical example: summarize a book by first summarizing each chapter, then pages, then paragraphs — until reaching simple-enough levels for direct human evaluation.

Three Properties of Good Decomposition

Recursive Decomposability

Problems can be continuously broken into simpler sub-tasks until reaching components solvable directly.

Independence / Modularity

Sub-tasks can be completed separately without depending on other components. Cross-dependencies break this.

Composability

Individual solutions combine into a coherent answer to the original problem. Without this, local solutions don’t yield global solution.

Not all tasks satisfy all three. Failure modes:

• Cross-dependencies → independence violated
• Holistic-judgment tasks → don’t decompose
• Composability gaps → local correct, global wrong

Why It Matters for Oversight

Task decomposition operationalizes verification-vs-generation hierarchically:

• Each subtask is verified at its own complexity level
• Humans can check each piece even when they couldn’t generate it
• The combined verification provides confidence in the whole

This is necessary because as systems become more capable, providing accurate training signals for subjective tasks becomes difficult. By reducing task complexity through decomposition, humans can more easily evaluate outputs and provide clearer feedback signals.

Factored Cognition

Apply decomposition principles to machine learning itself. Break sophisticated reasoning into “many small and mostly independent tasks” learnable through human demonstrations and feedback.

Key advantages:

• Delegation — multiple agents work independently on assigned subtasks
• Meta-reasoning — the decomposition process itself can be optimized iteratively

Role in Other Scalable Oversight Techniques

Task decomposition is a building block:

• iterative-amplification — IDA’s task decomposition is one of three core amplification methods
• ai-safety-via-debate — debates often involve decomposing claims
• process-oversight — decomposed steps make process supervision tractable
• chain-of-thought-monitoring / cot-monitoring-technique — CoT externalizes the decomposition

Limitations

The Atlas notes important caveats:

• Some tasks don’t decompose — holistic judgment, gestalt perception
• Decomposition itself can be wrong — bad decomposition hides errors at boundaries
• Information loss at boundaries — context that matters across subtasks may be lost
• Aggregation may add errors — small subtask errors compound when combined

These mean task decomposition isn’t universal — it’s a powerful tool when conditions are favorable, but has structural limits.

Connection to Wiki

• scalable-oversight — parent
• verification-vs-generation — foundational principle
• iterative-amplification — uses task decomposition centrally
• ai-safety-via-debate — uses decomposition for argument structure
• process-oversight — adjacent oversight technique
• atlas-ch3-strategies-04-agi-safety-strategies — process-based training context

Related Pages

• scalable-oversight
• verification-vs-generation
• iterative-amplification
• ai-safety-via-debate
• process-oversight
• cot-monitoring-technique
• ai-safety-atlas-textbook
• atlas-ch8-scalable-oversight-02-task-decomposition

Sources cited

Primary URLs harvested from this page’s summary references. Auto-generated by scripts/backfill_citations.py; edit by re-running, not by hand.

• AI Safety Atlas Ch.3 — AGI Safety Strategies — referenced as [[atlas-ch3-strategies-04-agi-safety-strategies]]
• AI Safety Atlas Ch.8 — Task Decomposition — referenced as [[atlas-ch8-scalable-oversight-02-task-decomposition]]