Learning theory
Type: types/tag-readme.md
This tag gathers theory of how systems learn, verify, and improve: accumulation and generalization, continual learning after deployment, verification and error correction, memory architecture, and self-improvement. The anchor is the theory builder: a system that states its theories in localized units, acts on what they say, criticizes them, and lets the result shape the next round, with whether it learns left as the hypothesis under test. Its members span notes and external system analyses, and apply to any system that adapts through retained artifacts, not only to KBs. Deploy-time learning covers what deployment reveals beyond design and testing and how people or systems respond. Nearby but different: self-improving-systems holds systems that make operative changes to their own organization, while this tag covers learning in general, whether or not the learner revises itself.
Work also qualifies when it substantively meets the inclusion condition of a declared child: deploy-time-learning, constraining, discovery, artifact-analysis, agent-memory, llm-reliability, or self-improving-systems. Their definitions, mechanisms, and boundary analyses belong here without a separate claim of learning or retained improvement. This is inclusion in a subject area, not evidence that the system under discussion learns.
Accumulation — adding knowledge to the store — is the most basic learning operation, with explanatory-reach as its key property: facts sit at the low end, theories at the high end. Accumulated knowledge is transformed by constraining and by working use-shaped artifacts out from it (theory and methodology form a two-layer execution system); the conjecture phase of the discovery lifecycle posits the high-explanatory-reach theories that are accumulation's most valuable items, and recognition is the expensive step in getting there.
Major child areas
These child tags route major parts of the area. A few fundamentals carry only the parent tag: Learning is not only about generality (Simon's definition of learning), LLM learning phases fall between human learning modes, and in-context learning presupposes context engineering. Outside the notes collection, trace-learning techniques in related systems compares the external systems that learn from their own traces.
- deploy-time-learning — what use reveals beyond design and testing, and the maintenance and learning responses
- constraining — narrowing the interpretation space, from conventions to deterministic code; codification, relaxing, and the decision heuristics
- discovery — positing a general concept and recognizing particulars as its instances; explanatory-reach as what it produces
- artifact-analysis — the four-field vocabulary (substrate, form, lineage, authority) for retained behavior-shaping artifacts
- agent-memory — memory architecture: spaces, contamination, policy learnability, and the crosscutting decomposition
- llm-reliability — oracle theory, error correction, and the deviation taxonomy; the area applies verification concepts to LLM output deviations
- self-improving-systems — systems that make operative, evidence-responsive changes to their own organization, from gradient learners to theory builders; its children cover the theory builder, the improvement loop, reflection, warranted autonomy, and continual learning
Start here
- Theory builder — localized theories that are consumed and criticized for what they say, with the result of criticism shaping the next conjecture; whether a builder learns is tested, not assumed. The research companion states the program's conjectures about builders
- Retained system-definition artifacts enable persistent deployment-time adaptation — persistent cross-session adaptation through retained behavior-shaping artifacts, without weight updates
- Learning is not only about generality — accumulation with explanatory-reach as its key property; Simon's definition grounds the decomposition
- Agentic systems interpret underspecified instructions — the underspecification foundation: spec-to-program projection and the constrain/relax cycle
- The verifiability gradient — the ladder deploy-time artifacts sit on
- Constraining and extraction can trade generality for reliability, speed, or cost — how the two transforming mechanisms relate
- Recognition, not linking, is the hard problem in knowledge systems — where connecting knowledge actually costs, and how naming amortizes it
Related Tags
- evaluation — where learning claims meet oracles, warrant, and experiment design
- document-system — the type ladder (text→note→structured-claim) instantiates the constraining gradient for documents
- context-engineering — where in-context learning meets the system layer that selects and organizes knowledge
Other tagged notes
- A bare writing prompt does not determine its intended contribution - Separates the contribution a bare writing prompt leaves underdetermined from empirical claims about how experts and LLMs supply the missing purpose.
- A benchmark that holds the client fixed exports the least-warrantable decisions by design - A fixed-client benchmark measures worker capability; it leaves broader closure untested when the client supplies internal production decisions, while ordinary user requirements and acceptance may remain external
- A better-factory claim compares operative states under an antecedent assessment relation - The improvement claim's relata are predecessor and operative-successor states and its relation is declared before the development it judges; evaluator location is a separate declaration from the learner boundary
- A checked outcome licenses retaining an episode, not abstracting its explanation - One result-only check can warrant retaining an episode as evidence, but abstracting its explanation also needs evidence about a faithful producing process and an explicit scope boundary
- A claim without external assessment carries three obligations - Without external assessment a claim needs its own contradiction-and-support rule, a comparison level for objective change, and a performance measure it does not grade itself, plus attribution when it asserts a cause
- A claim's warrant does not determine its fit in a working theory - Independent warrant and fit in a working theory answer different questions: a warranted claim may fit poorly, while apparent fit may be produced by an unwarranted or already-assumed claim
- A complete theory path does not establish improved capacity - Mediation, empirical contact, response to criticism, and recurrent mediation support different claims; none alone establishes improved capacity, and retained addressable theory is one realization
- A consumption channel delivers force without the history that earned it - A consumption path can promote content into a higher-force role without checking whether an authorization covers that content, version, and use
- A failure explanation becomes search control only when it changes a later branch decision - An explanation of a failed branch becomes operative search control only when its retention changes a later choice about scope, priority, probing, continuation, or abandonment
- A fixed-model house must retain missing procedures for theory use - With models pinned, newly acquired theory-use procedures must persist outside their parameters; existing general machinery may already supply them, while code can make specified steps cheaper and more reliable
- A goal-holding interpreter fails soft, and its workarounds tax a bounded budget - A procedure compiles its goal away, so a blocked step fails loud and hard; an interpreter holds the goal and re-routes, so failures are absorbed as a per-encounter tax on bounded capacity — silent, accumulating, and softly saturating
- A hand-crafted bootstrap fits the Bitter Lesson only if learning can outgrow it - A hand-crafted starting state fits the Bitter Lesson only if scalable learning displaces the task- and family-specific production knowledge it supplies as claimed reach widens
- A method's ceiling bounds the method, not the transfer it already made - Separates envelope expansion, where a responsibility leaves the residual human work, from performance gains inside a fixed envelope, so a bounded method reaching its ceiling does not retract the transfer it already made
- A methodology governs its own extension only as far as it settles the meta-decisions it raises - A retained methodology governs the consequential extension decisions it supplies or imports; actor competence can carry the process further without making those choices settled by the method
- A proposal-selection improvement loop requires search, evaluation, and operative retention - A proposal-selection improvement loop — candidates generated, evaluated with possible non-adoption, and accepted changes made operative — requires search, reject-capable evaluation, and operative retention
- A proximate target is checked for achievement, not for warrant - Between an improvement objective and its oracles sits a target level — a property pursued because it is held to serve the objective — whose linking claim no check in the loop evaluates
- A repeatable operative path keeps a redesign class open to revision - Operationalizes repeatable operative revision for a named redesign class as a causal path through representation, evidence-bearing determination, admission, installation, dependence, and continuity
- A retained instruction preserves what testing selected - Explains why an instruction generated from model weights can still add KB value: testing selects a procedure under a criterion and retention makes that choice reusable.
- A retained-theory intervention isolates one surface, not the whole program theory - An intervention on retained theory estimates that surface's causal contribution under matched conditions; influence, explanatory guidance, acquisition, and whole-system theory possession remain different claims
- A retrieval miss is a local reflective-path failure - A missed relevant artifact leaves its represented aspect inert for the affected task and discovery route, while other loading paths and reflective aspects can remain causally connected
- A search controller is tested by what it brings to stronger evaluation - A search controller should be evaluated by the branches and probes it routes into stronger evaluation, not by treating every provisional judgment as an acceptance claim
- A theory builder becomes a software house when new domains require production-machinery changes - A persistent automated theory builder for external users becomes a software house when genuinely new domains require it to revise the software that performs theory production rather than only the theories produced
- A theory's prototype standing is its revision cost: external binding plus lost investment - A theory's prototype standing is its expected revision cost — external binding plus the investment a revision discards — so natural-language versus symbolic form determines neither component and acceptance status is a separate axis
- A vibe-noting trace shows persistence enables revision, not certification - Evidence from one Commonplace note history: persistence enabled later semantic development while review exposed omitted risks, attribution drift, a link error, and an unresolved authority boundary
- Abstract an experience into a lesson only when you can state where the lesson stops - Abstract an episode into a lesson only when you can state its boundary, else preserve the instance; an over-generalized lesson is one that drops the condition clause
- Accumulation counts dependence through the retained result, not through the evidence it caused - Cumulativity counts dependence through the retained result only; counting the evidence channel that result caused would make it coextensive with operativity
- Activate Behavior-Changing Memory Before The Mistake - Behavior-changing memory must activate before relevant actions rather than waiting for explicit retrospective search
- Active work state is not retrospective memory or chat history - Active work state needs current pointers, evidence gates, and closure; treating it as retrospective memory or chat history preserves the wrong state
- Ad hoc explanation can be rational when error is cheap and local - Explains why a disposable local guess can rationally select the next probe when error is cheap and contained, while retained explanations need reach checks
- Ad hoc prompts extend the system without schema changes - Any system with an LLM agent layer can absorb new requirements through natural language prompts without changing the deterministic base
- Adaptation signals choose pressure; artifact analysis chooses the retained surface - Maps agentic-adaptation signals onto artifact-analysis axes so KB learning records which retained surface changes, what authority it gains, and how to review it
- Addressable theory - Definition — an addressable theory is a theory formulated in language whose assumptions, scope, and parts can be inspected and revised individually; a graded structural property, separate from tentative status
- Agent memory is a crosscutting concern, not a separable niche - Memory decomposes into storage (solved), retrieval/activation (context engineering), and learning (learning theory) — treating it as a standalone category hides that the hard problems are at the intersections
- Agent memory needs discoverable, loadable, composable, trusted knowledge under bounded context - Distinguishes four use-time requirements for remembered knowledge—discoverability, loadability, composability, and calibrated trust—from system-level activation.
- Agent Memory Requirements - Navigation hub for concrete agent-memory requirements extracted from the memory-system design synthesis
- Agent memory systems comparison table - Generated comparison table for code-reviewed agent memory systems: one-line summaries plus storage, read-back, targeting, trace-learning, and enforcement.
- Agent orchestration needs coordination guarantees, not just coordination channels - Coordination channels say how bounded contexts interact, but the missing discriminator is which guarantee prevents contamination, inconsistency, amplification, or liability diffusion across the composed system
- Agno AgentOS - Whole-system analysis of Agno AgentOS as an open-source execution and control plane, distinguishing its runtime loops from the companion coding-agent and Studio builder loops
- AI Agents in Depth - Whole-book comparison of AI Agents in Depth with Commonplace, separating broad architectural convergence from differences in memory admission, epistemic warrant, governance, and orchestration
- Alexander's patterns connect to knowledge system design at multiple levels - Maps Alexander's Context/Problem/Forces/Solution pattern to typed document contracts and his generative process to incremental codification, while marking the looser 'centers' analogy
- Always-loaded context mechanisms in agent harnesses - Survey of always-loaded context mechanisms across agent harnesses — system prompt files, capability descriptions, memory, and configuration injection — cataloguing what each carries, how write policies differ, and where the gaps are
- An accepted edit verifies the change, not the rule - Human acceptance of an edit is a strong oracle for 'this change was wanted here' but a weak oracle for 'this generalizes' — mining rules from accepted edits inherits instance-level verification while the generalization step stays oracle-poor
- An action model matters only through its consumption path - Agentic action can be direct or model-mediated; a retained action model matters only when its consumption path affects intervention selection
- An addressable theory can coordinate heterogeneous factory development - Tentative natural-language project theory may provide an addressable way to coordinate heterogeneous factory development while search, testing, and backtracking construct and revise it
- An agentic substrate becomes a software factory through family-specific production machinery - Maps the bounded-call agentic substrate to Greenfield's software-factory ontology without calling every generic harness or generated program a factory
- An omitted improvement-loop function and a frozen one need different repairs - Five proposal-selection systems expose frozen functions, while a direct-update contrast shows why absence of a gate is not omission; HyperAgents supplies a preliminary partial unfreezing
- An optimal long-run learning strategy invests in its own machinery - A machinery improvement is paid for once and reused by every later learning episode, so over a long horizon its return can exceed immediate learning; where it does, an optimal strategy diverts effort to the machinery.
- Answerability - Definition — an artifact is answerable when its collection contract can name what it answers to, the correctness or currency property asserted, and the discrepancy that triggers correction
- Artifact classification separates content kind, lineage, and authority - Use this note to classify retained KB artifacts without conflating content kind, production lineage, or path-relative behavioral authority with the collection's local writing contract.
- Attempted recovery identifies informational gaps, not provenance or authority - Recovery failure shows content is missing from the tested source; causal provenance and live authority require independent evidence, and only pairs with unique content on both sides are bidirectionally irrecoverable
- Autogenesis - Autogenesis as a code-grounded self-evolving agent framework: protocol resources, orchestration, versioned mutation, rollback, and the gaps between its paper artifact and current rewrite
- Automated synthesis is missing good oracles - Generating synthesis candidates (cross-note connections, novel combinations) is easy — LLMs do it readily. The hard part is evaluating whether a candidate is genuine insight or noise.
- Automating KB learning is an open problem - The KB already learns through manual improvement; automating judgment-heavy mutations needs oracles for connections, groupings, and synthesis we cannot yet manufacture
- Axes of artifact analysis - Artifact analysis records retained behavior-shaping artifacts by storage substrate, representational form, lineage, and behavioral authority so review evidence, invalidation, and rollback follow how artifacts actually act
- Backtracking keeps lightweight search control provisional - Backtracking preserves the provisional status of a heuristic branch choice by restoring an earlier usable state and redirecting search after contrary evidence
- beads_rust - beads_rust as a local active-work and coordination substrate: transactional CLI claims and workflow gates, explicit external execution and Git boundaries, and weaker parity across MCP, inherited-context, and shipped instruction paths
- Behavior-determining organization - Definition — retained structure inside a declared system boundary that shapes later operation; a work product belongs when the system also retains and consumes it in that role
- Behavioral authority - Definition - behavioral authority records who consumes a retained artifact, through which channel, and with what force
- Bidirectional codification as a comparative test - Proposal: promote bidirectional codification from design guidance to a comparative conjecture, tested by evolving the same task stream under natural-language-only, symbolic-only, one-way promotion, and bidirectional codify-and-relax regimes
- Bottom-up structure inference needs capture at the decision surface, not the state - Bottom-up inference of entities and relations from traces needs decision-shaped capture at the decision surface: the 'why' is cheap to record there and hard-to-impossible to recover from state later
- Brainstorming: how explanatory-reach informs KB design - Deutsch's reach, registered here as explanatory-reach, applied to KB notes — a maintenance risk signal, not a retrieval signal, because high-explanatory-reach revisions break downstream reasoning silently
- Brainstorming: how to test whether pairwise comparison can harden soft oracles - Staged test plan for whether pairwise comparison improves soft-oracle properties (discrimination, stability, calibration) in LLM evaluation loops
- Brainstorming: maintainability oracles for agentic development - Explores candidate signals, calibration experiments, authority levels, and workflow placements for evaluating maintainability in agent-generated code
- Broad software demands create pressure for agentic factory development - Broad software demands make exhaustive predefinition of useful family-specific production machinery practically implausible, motivating agentic factory development without ruling out a fixed universal substrate in principle
- Candidacy evidence licenses escalation to assessment, not acceptance - Separates candidacy evidence, which routes a hypothesis to costly assessment, from verdict evidence, which decides it; pricing and source-grounding cases provide two worked witnesses
- Canonical files may defer a shared schema while database authority remains a separate commitment - Canonical files can defer a centralized schema while meanings remain unsettled; a database becomes canonical only when an explicit authority decision and operative write path commit resolutions the files no longer determine.
- Causal and proof obligations are two formal routes to assessing explanatory-reach - Causal and proof obligations demonstrate two ways formal symbolic systems can assess explanatory-reach inside a warranted model
- Changing requirements conflate genuine change with disambiguation failure - Separates world change from late discovery that downstream work chose the wrong interpretation of an underspecified requirement; short iterations mainly limit propagation of the latter
- Choosing what to learn requires both validity and learning-value gates - Separates two promotion checks for learning loops: whether a candidate is trustworthy enough to learn from, and whether learning it would improve the current system.
- Citing retained theory at the decision point is a mediation trace - A decision record that cites the theory it followed supplies cheap, checkable evidence that the theory was consumed — necessary for a record-based mediation claim, but short of showing correct or load-bearing use
- Code complements the weight–prompt pair with independently executed symbolic operations - A model-mediated operation is instantiated by weights plus prompt; code complements that pair by defining operations whose consequences a symbolic runtime executes without reinterpreting the prompt
- Codification - Definition — codification is the symbolic region of constraining: a rule or operation is committed to an artifact with formal semantics or, more generally, fixed rules that determine what behavior is permitted
- Codification and relaxing navigate the bitter lesson boundary - Since you can't identify which side of the bitter lesson boundary you're on until scale tests it, practical systems must codify and relax — with spec mining avoiding the vision-feature failure mode
- Codify-versus-LLM decision heuristics - Specification, checking, permitted interpretations, and repeated-use cost inform which operations to codify; none alone makes code or model interpretation universally preferable
- Commitment, not derivation, creates new ground truth - Derivation — claims recoverable from the source, nothing added — leaves the source as ground truth; what adds unentailed resolutions becomes ground truth at commit, repaired by supersession
- Commonplace as a reflective self-improving system - Commonplace witnesses that a human-inclusive KB can be reflectively self-improving on one pathway despite uneven coverage and human-gated design judgment
- Competing causal theories can guide distinguishing experiments - Why observationally equivalent mechanisms can tell a theory builder what to test next: a noisy binary example separates evidence acquisition from choosing or verifying an explanation.
- Compound Engineering plugin - Compound Engineering's compounding claim separated into product change, project-knowledge retention, and the narrower reflective pathway that can revise project operating instructions but not the installed harness itself
- Compounding is tested in later improvement, not by the accepting metric - Compounding evidence must come from later improvement episodes through displaced productivity measures and causal traces, not from the metric that accepted the earlier change
- Computationally directed self-improvement is a fixed-boundary reallocation ending in contraction - The progress question for self-improving systems is not category membership but which decision-bearing functions humans still supply; the endpoint test is whether the boundary can be contracted to exclude them
- Constraining during deployment is continuous learning - Continuous learning can happen outside of weights; constraining is one symbolic-artifact form where prompts, schemas, tools, and tests accumulate durable adaptive capacity during deployment
- Context contamination operates below an agent's compliance reasoning - A controlled test found fine-grained stance drift despite explicit detection and refusal; exclusion guarantees non-exposure, while instruction-level mitigation remains an empirical question
- Continual learning requires governing behaviour-changing writes, not just storing content - For deployed systems, persistence is insufficient; continual learning must select, validate, authorize, and coordinate behaviour-changing updates across the representational forms a system can change
- Cost-sensitive formalisms for tentative theory search - Exploratory map of backtracking, learning, and complexity models that expose budgets relevant to search guided by tentative theories
- Create Memory Directly - Direct memory creation preserves live understanding by writing useful artifacts before later trace extraction loses structure
- Derivation and inheritance give starting warrant; discriminating evidence or proof earns scope - For reusable decompositions, derivation and inheritance supply conditional or transferred starting warrant, while evidence or proof earns only the scope it covers
- Designing a Memory System for LLM-Based Agents - Derives agent-memory design pressures and links to a requirements inventory for agents designing or evaluating memory systems
- Diagnostic richness constrains outer-loop learning quality - Outer-loop learning depends on inspectable failure evidence, not only on the oracle used to select winning candidates
- Discarding all experience-dependent state prevents cross-run accumulation - Discarding an intermediate artifact loses that artifact's reuse path, not all learning; cross-run accumulation fails only when no experience-dependent state survives to affect later work
- Discarding software requires preserving the operational knowledge later work needs - Regeneration must preserve or recover the commitments later operation depends on; reuse, reconstruction cost, and failure consequences matter more than code size or explanatory-reach alone
- Disconnected witnesses do not establish a full causal path through theory - Evidence of recurrent learning through theory must identify the joins of one causal path; connected use and criticism still need separate evidence of improved capacity
- Distinct residue classes require distinct functions in a self-improving architecture - Different reasons for an untransferred decision identify different missing functions; a single process can supply several, and the current carrier split is not a permanent requirement
- Edge ownership selects the key; choosing files or a database requires a workload comparison - Distinguishes the complete edge key required by relation-owned mutable state from the workload-specific choice between edge files and a database.
- Elicitation requires maintained question-generation systems - Four elicitation strategies ordered by user expertise required, composable into review architectures with maintenance loops that prevent ossification
- Enforcement without structured recovery is incomplete - The enforcement gradient covers detection and blocking but has no recovery column — recovery strategies (corrective → fallback → escalation) are the missing layer, and oracle strength determines which are viable at each level
- Epiplexity by example: what entropy and complexity miss - ELI5 explanation of epiplexity through encrypted messages, shuffled textbooks, CSPRNGs, and chess notation — contrasting surprise, shortest description, and observer-relative usable structure
- Error correction works with above-chance oracles and decorrelated checks - Error correction for LLM output is viable whenever the oracle has discriminative power (TPR > FPR) and checks are decorrelated — amplification cost scales with 1/(TPR-FPR)² and independence of errors
- Error messages that teach are a constraining technique - In agent systems the error channel is an instruction channel — making errors teach the fix is nearly free and eliminates the agent's need to diagnose, an orthogonal axis to enforcement strength
- Evaluate Memory By Effects, Not By Existence - Memory should be evaluated by downstream effects on tasks, artifacts, answers, behavior, context efficiency, and lineage alignment
- Evaluation automation is phase-gated by comprehension - Optimization loops need diagnostic error analysis and demonstrated judge discrimination before automation can improve behavior rather than just score
- Evidence bearing on an improvement objective - Definition — evidence bears on an improvement objective when it carries information about the criterion: gradients, rewards, errors, viability signals, tests, judgments; no evaluator required
- Exact implementation does not validate a requirement against its objective - An artifact can exactly implement a requirement while the requirement remains a conjectured proxy for a declared objective; assess each named path separately, and attribute failure to the link without erasing local correctness
- Execution indeterminism is a property of the sampling process - The same prompt can produce different outputs across runs due to token sampling — this is a property of the execution engine, theoretically eliminable but practically ubiquitous, and often confused with the deeper issue of underspecification
- Exo - Exo as a running reflective self-improvement harness: a protected Rust substrate under a fully rewritable executor, allowlisted host control, and a rewind that preserves the record of what was tried
- Explicit retention provides direct targets for selective revision - Explicit artifacts give a learner direct targets for inspecting and revising commitments; durability, writability, and effective addressability still depend on the boundary and available operations
- Factory construction is not evidence of production-knowledge acquisition - Recursive software-factory construction is prior art, but the demonstrated constructors receive the family definitions, metamodels, mappings, and expertise that determine the produced factory
- Factory development - Definition — factory development constructs or revises reusable family-level production machinery rather than one product's lifecycle state
- Factory learning is experience-responsive retention that improves the factory - Experience-responsive retention: production experience determines a retained change to reusable family machinery that later production depends on; factory-level learning is retention that improves the factory relative to a declared objective
- Factory-learning mechanisms should be compared on the same causal job - Compares factory-learning mechanisms on their shared causal job — experience-responsive retention — while separating update mechanisms from the project-theory function needed for open-ended coherent modification
- False-positive generation is filtered; false-positive acceptance becomes operative - False-positive generation faces evaluation before retention, while false-positive acceptance becomes operative and can compound
- Feedback-trained memory management is oracle-dependent even when its operations are hand-designed - Fixed and merely runtime-responsive memory rules need no training oracle; outcome-driven updates do, while noisy rankings weaken learning and misaligned ones teach the wrong ordering
- First-principles analysis maps a design space before selecting within it - Why deriving independent choice dimensions from boundary constraints exposes rival designs that inherited solution categories hide
- Flat memory predicts specific cross-contamination failures that are empirically testable - Flat memory predicts three cross-contamination failures — search pollution, identity scatter, insight trapping — testable via an observation protocol against real agent systems
- Generation confidence does not by itself certify soundness - Distinguishes next-token probability from factual truth and inferential validity: confidence can support correctness decisions only after task-specific validation, and high-assurance acceptance still needs a separate check
- Gödel machines are a proof-governed case of reflective self-modification - A Gödel machine admits self-rewrites through proof under its current formalization; this restricts admission without establishing how many useful changes are reachable or how reliably they are found
- Holding a program theory means sustaining coherent search under delayed feedback - Holding a program's theory is tested by whether a partial, tentative account of what the program is for keeps modification search, backtracking, and recovery coherent until delayed evidence arrives, not by whether the first change is right
- Import External Knowledge Into Internal Form - Agent memory systems need import paths when authoritative project knowledge already exists outside the memory substrate
- Improvements can accumulate without compounding - Improvements accumulate when later improvement consumes or preserves retained results; compounding requires an earlier benefit to counterfactually improve a later episode, directly or through reinvested savings
- Improvements outside the admitted formal language need a pre-formal stage somewhere - An improvement whose concepts have no expression in a loop's admitted formal language is reached only through a pre-formal stage, inside the loop or fixed at design time in the choice of language; translation relocates that stage
- Increasing computational autonomy relocates human effort to the frontier instead of reducing it - In an open-ended system, increasing computational autonomy need not cut total human hours — attention moves to the frontier — so measure improvements per human judgment, not human time
- Information value is observer-relative - Information value is observer-relative: prior knowledge, tools, compute, and goals determine extractable structure, grounding use-shaped reshaping and discovery.
- Inspectable artifact, not supervision, defeats the blackbox problem - Chollet frames agentic coding as ML producing blackbox codebases — codification counters this not by requiring human review but by choosing readable artifacts (code, prompts, schemas) that any agent can inspect, diff, test, and verify
- Instantiation alone cannot model agent learning across sessions - The class/instance analogy captures session startup but omits the retained update relation that can revise later agent definitions and reusable-content placement
- Keep Lineage And Compiled Views From Drifting - Generated cues, prompt files, indexes, and assistant-specific views need lineage and authority rules so they do not drift into independent behavior-shaping force
- Knowledge artifact - Definition - a knowledge artifact is a retained artifact consumed as evidence, reference, context, explanation, or advice
- Knowledge storage does not imply contextual activation - Separates knowledge that exists, knowledge loaded into context (read-back), and knowledge that actually changes behavior (activation); explains why retrieval and long context do not guarantee activation
- Known-target discovery benchmarks show reachability, not discovery closure - Distinguishes backcast and reinvention benchmarks from autonomous discovery: they show that target insights are reachable from supplied ingredients, not that a system can select and verify new discoveries prospectively.
- Learning inside a fixed decomposition inherits its mistakes - Why optimization cannot repair consequential distinctions, responses, or mappings outside the effective update space of a fixed task decomposition
- Legal drafting solves the same problem as context engineering - Legal drafting parallels context engineering because both write ambiguous natural-language specifications for judgment-based interpreters, but law develops constraining more than codification
- Lightweight search control allocates further search without licensing adoption - A search judgment is lightweight when its authority stops at allocating further investigation, probing, continuation, suspension, or abandonment rather than licensing an operative change
- Lineage - Definition - lineage records the source dependencies needed to invalidate, regenerate, retire, or review retained behavior-shaping artifacts
- LLM debugging separates specification gaps, instruction violations, and run-to-run variation - Choose a debugging move by checking intent against the specification, output against the specification, and variation across repeated runs; failure frequency alone cannot identify the defect
- LLM generation can hide a relaxed goal where human writing exposes a stall - An LLM can ship fluent output after silently relaxing an unmet goal, while human composition may expose the same gap as a stall; a conjectural mechanism for why readers inherit the check
- LLM output deviation requires three-way diagnosis because remedies target different relations - For a fixed assembled input, whether V exceeds I, whether D escapes V, and how D's spread affects realization are three diagnostic questions with different primary repair surfaces
- LLM-executed methodologies are metacircular interpreters, not compilers - Self-hosting LLM methodologies are closer to metacircular interpreters than compilers: agents re-interpret natural-language rules each session, while stable paths codify into validators and commands
- LLM↔code boundaries are natural checkpoints - LLM↔code boundaries expose concrete inputs and outputs for inspection and replay; deterministic execution preserves rather than corrects a wrongly interpreted argument
- Local materialization should outperform distant natural-language declarations - Predicts that, for distant or non-obvious uses of a natural-language declaration, generated local materialization will outperform declaration-only presentation without creating a second maintenance authority
- Localized retention pays when sparse changes have bounded impact in a matching decomposition - Addressable retention localizes a sparse change when units match its decomposition; total adaptation stays local only when the affected units also have a small, explicit impact closure
- Machinery persists by warrant, not position, in a reflective loop - Reflection makes selected production machinery challengeable, but placement alone neither warrants nor requires revision; fixed general machinery may persist when its role and scope are earned
- Make Authority Explicit - Memory architecture must state who can read, write, promote, activate, enforce, revise, and retire memory across risk levels
- Measuring autonomy well enough to see it improve is an open problem - Autonomy is reported per function rather than scored as a percentage, but that profile does not yet support comparison across systems or time
- Mechanistic constraints make Popperian KB recommendations actionable - Bounded context and underspecification don't just permit conjecture-and-refutation — they require it; derives three concrete practices (falsifier blocks, contradiction-first connection, rejected-interpretation capture) from KB mechanics.
- Memory design adds operational axes to artifact analysis - Memory design needs operational policy axes (capture, derivation, activation, authority assignment, lifecycle, evaluation) on top of substrate, form, lineage, and behavioral authority
- Memory-backed personalization can look like model improvement - Distinguishes user-specific gains supplied by retained intent from gains in the model that interprets the assembled context.
- Methodological and computational closure track different changes - Methodological closure tracks what a retained method settles; computational closure tracks the absence of human decisions during the assessed operation, without requiring every judgment to have explicit criteria
- Methodology enforcement is constraining - Explains why enforcement strength is a partial order over activation and response semantics, rather than a fixed instruction-to-skill-to-hook-to-script ladder
- Minimum viable vocabulary is the naming set that most reduces extraction cost for a bounded observer - Defines minimum viable vocabulary as the names that most reduce a bounded observer's extraction cost, connecting conceptual thresholds to an information-theoretic optimization
- Missing rationale does not exclude a theory builder; weight-only retention excludes one across runs - The August 2026 Prime Agent, Recuris, and Apodex reports: retained rules without a recorded rationale leave theory-builder membership open, while Apodex carries only weights across runs, where no unit says anything, so no builder spans its runs
- Model-resolved indirection adds interpretation work to LLM execution - A reference adds model-side interpretation only when the model must resolve it; upstream literalization is worthwhile when binding, token, authority, and regeneration costs favor it
- Moving the interpretation–enforcement boundary requires cross-form coverage - Moving responsibility between model-interpreted rules and formal enforcement crosses natural-language and symbolic forms, so governing the transfer requires coverage of both and their mapping
- Natural-language meaning is coordination among learned approximations, not approximation of a target - Untested hypothesis extending Lampinen's learned-approximation mechanism to natural language: no external semantics exists to approximate, so meaning is coordination held by weak checks; recasts constraining and deviation diagnosis
- Natural-language project state may specialize weight-resident search heuristics - The natural-language part of project state may specialize general search heuristics already represented in an LLM's weights by supplying current intent, theory, branch history, and constraints
- Naur's compiler case tests one historically bounded documentation-and-consumption system - Naur's compiler transfer failure rules out more documentation of the same kind, but tested one historically bounded package and consumption process rather than every possible rationale, indexing, retrieval, and activation system
- Naur's human-only conclusion needs more than the absence of explicit criteria - Naur's human-only conclusion needs a further premise connecting unformulated judgment to computational inability; this reading preserves his functional tests without claiming that learned criteria are inexpressible
- Opacity is a scale threshold, not a class property - Opacity is not a representational form; any representation becomes practically opaque at sufficient scale, though distributed-parametric artifacts cross that threshold earliest.
- Open-domain memory retention needs a declared output spec - Explains why an input stream alone can't answer 'what to store' in open-domain memory design; a declared output spec supplies the missing inclusion criterion.
- Open-ended construction builds an object and a theory of it - Proposes that construction which must discover and revise an object's organization produces project-specific understanding beyond the object, using programs and theories as its two main cases
- Open-ended improvement must allocate search before decisive evaluation is available - Open-ended improvement must choose which questions, candidates, experiments, or proof paths to develop before decisive evidence about them is available; even a Gödel machine's proof gate retains this prior search problem
- Open-ended theory learning and factory learning close the same reflective loop - In Commonplace's arrangement, theory learning and software-factory learning require one connected reflective path; proof-governed switching alone does not settle criticism
- Operational signals that a component is a relaxing candidate - Operational signals for when a component likely encodes a brittle proxy theory rather than an exact specification and should be relaxed instead of codified harder
- Operative change - Definition — a change is operative when it affects the system's subsequent operation over the relevant, declared horizon through a behavioral-authority path; operativity does not require permanence
- Operative part - Definition - an operative part is the behavior-affecting content, structure, parameterization, or mechanism within a retained artifact or consumption path
- Oracle accumulation improves selection for later candidates in its maintained domain - A failure retained as a lesson helps tasks that retrieve it; retained as a maintained check it improves selection for later candidates in its domain and amortizes validation
- Oracle strength spectrum - Exploratory framework — oracle strength, how cheaply correctness can be verified, as the gradient underlying the exact-spec/proxy-theory distinction, with an oracle-hardening pipeline
- Orchestration strategies and run-state have opposite persistence economics - Separates ephemeral task-specific run state from reusable selection strategies inside host schedulers; RLM-style execution discards both and therefore loses the valuable reusable half
- Out-of-spec output is a failure of the interpreter, not the spec - Interpreter failure is output that a spec's public meaning rules out; the fault attaches to the interpreter's role, so repair uses detection and correction rather than narrowing an already sufficient spec
- Parametric reproduction alone cannot replace an authoritative record - Reproducing a record's content does not transfer its authority. Replacement requires a governed artifact with stable identity, integrity, contestability, and attribution; mutable records also require currentness and addressable revision.
- Preferential codification concentrates less predictable work at the agent boundary - Explains the negative-selection mechanism by which preferential codification changes the composition of work retained at an agent boundary
- Preserve Evidence Without Making History The Next Context - Trace retention should preserve evidence for audit and extraction without making raw history the agent's default context
- Process structure and output structure are independent levers - Distinguishes constraints on reasoning steps from constraints on result shape and identifies the evidence needed to separate their effects
- Progressive constraining commits only after patterns stabilize - Constraining via LLM code generation freezes a single projection of the spec in one shot, but progressive constraining observes behavior across many runs and commits only the interpretations that consistently emerge
- Project-theory possession requires comparing new demands with existing organization - For open-ended modification, project-theory possession includes relating a new demand to existing responsibilities before parallel structure becomes the default; an explicit assimilation branch may counter additive coding-agent patches
- Promote Only When Future Value Exceeds Maintenance Cost - Candidate memory should become durable only when future retrieval or activation value exceeds review and maintenance cost
- Promotion selects for unreliable activation, and the regress ends only at an external trigger - Recasts promotion from 'the consumer lacks this' to 'the consumer will not apply this unprompted', and requires delivery to have a root firing event independent of that prior activation
- Psychology-to-agent transfer needs per-principle failure-mode testing - Brainstorming a methodology for evaluating cognitive-science-to-agent transfer — assembled from three existing KB notes and tested against Youssef's five psychology principles as worked examples
- Raw accumulation does not create usable memory - Accumulation preserves material, but usable agent memory requires ingress work that adds handles, scope, relationships, provenance, trust signals, and lifecycle pressure.
- Reach-assessment - Definition — judging whether a commitment's claimed explanatory-reach is genuine across natural-language, symbolic, and distributed-parametric forms
- Real self-improving systems occupy combinations no single rung captures - Casebook of thirteen placements on selected pathway-profile fields — Homeostat to Commonplace — reflection, cumulativity, allocation, and evidential limit in combinations no rung expresses
- Reasoning production is not reasoning evaluation - Review and critique systems need independent process-validity checks because a model can substitute answer reconstruction for reasoning evaluation
- Reflection buys addressability - Self-improvement can accumulate without reflection — parametric learners do — but non-reflective retention gives only indirect handles; reflective retention makes the changed object addressable
- Reflection makes retained lessons second-order: a lesson can reject or rescope a prior commitment - Reflection lets a retained lesson target a prior commitment explicitly — rejecting, revising, or rescoping it — while non-reflective correction acts indirectly through the substrate
- Reflective coverage is graded across representational forms - Reflective coverage is stated per represented form and operation profile; control of an external dependency does not make that dependency part of the system's reflective coverage
- Reflective system - Definition — a system is reflective relative to selected aspects when an internal process uses a causally connected self-representation of them in its operation
- Reliability dimensions map to oracle-hardening stages - The four reliability dimensions from Rabanser et al. (consistency, robustness, predictability, safety) each harden a different oracle question — mapping empirical agent evaluation onto the oracle-strength spectrum
- Representational form - Definition - representational form classifies how content is encoded and consumed: natural-language, symbolic, distributed-parametric, or mixed
- Retained artifact - Definition - a retained artifact is retained state that a later agentic loop can consume in a behavior-shaping way, regardless of storage substrate
- Retained theories may improve sample efficiency under structured shifts - Conjecture: retained theories may reduce target observations under structured shifts; a useful theory's reuse benefit is separate from selecting it by estimated explanatory-reach
- Retaining episode evidence keeps a distilled rule open to re-examination - Keeping relevant episode evidence and its relation to a distilled rule preserves a route for re-examining that rule; reconstruction, comparative value, and correct generalization still require testing
- Retire, Redact, Supersede, And Relax Memory - Memory systems need lifecycle operations for redaction, decay, supersession, retirement, relaxation, and temporal validity
- Reverse compression is when LLM output expands without adding information - LLMs can inflate compact seeds into verbose artifacts without adding extractable structure; a KB resists this only when links make additional structure accessible
- Review automation should target verifiable subroles before reviewer identity - Scholarly-review automation should decompose reviewer work into separately verifiable subroles before giving an AI system reviewer-level authority
- Review framework and comparison matrix: design and decisions - Design rationale for the agent-memory-systems review framework and comparison matrix: extractable lead tokens, one-hot columns, and write/read lifecycle split.
- Revising an improvement objective is licensed from outside it or is not improvement - Objective change is improvement only against a level outside both objectives; proxy revision, re-indexing, and surfaced under-specification subtract most apparent cases
- Revision guided by rationale needs faithfulness, not just legibility - When revision of an addressable theory relies on rationale to locate a failed premise, misleading rationale can direct repair to the wrong part; rationale is one optional repair aid
- RLM, λ-RLM, Tendril, and llm-do separate restriction from persistence - RLM variants, Tendril, and llm-do show that control-language restriction and artifact persistence are separate questions, including where cited RLM sources leave post-return lifecycle unspecified
- Rule-based context selection needs a pre-existing signal - A rule-based selector can target one case only when a rule-ready signal already distinguishes it; otherwise the system must wait, load broadly, or infer relevance from task and candidate content
- Scaling absorbs scaffolding at fixed task difficulty, not at the deployment frontier - Stronger models shrink the scaffolding a fixed task needs; durable deployment-specific structure recurs at the frontier only while assigned difficulty keeps pace with capability and some reliability function stays advantageous to externalize
- Scheduler-LLM separation exploits an error-correction asymmetry - Symbolic bookkeeping eliminates underspecification, indeterminism, and bias relative to the implemented transition function; semantic work faces all three. Mixing forces exact state onto an expensive substrate; codification renegotiates the boundary
- Selecting an LLM output fixes a result, not its interpretation - Selecting one LLM output for operative reuse creates a stable artifact-testing target without resolving ambiguity inside the text, so generator and artifact tests answer different questions
- Self-improvement is relative to a declared objective - The improvement objective is a declared parameter alongside boundary and horizon, carrying two separable conditions — indexed by the analyst, antecedent in the pathway — whose failures differ in kind
- Self-improving system - Definition — operative, evidence-responsive change to a system's own behavior-determining organization, read against a declared boundary, horizon, and improvement objective
- Serve Multiple Consumers, Not One Retrieval Interface - Memory systems need multiple surfaces because acting, scheduling, review, learning, governance, and active work consume memory differently
- Seven documentation cases left routing and synthesis - A seven-artifact Commonplace sweep found that direct source access removed exact-fact prose while discovery maps and cross-component boundaries survived; it does not establish a universal documentation ratio
- Short composable notes maximize combinatorial discovery - The library's purpose is to produce notes that can be co-loaded for combinatorial discovery — short atomic notes are a consequence of this goal; longer synthesized artifacts belong in workshops or derived instructions
- Silent disambiguation is the semantic analogue of tool fallback - When an agent silently resolves unacknowledged material ambiguity in a spec, final success hides that the contract failed to determine the path — an extension of the tool-fallback observability problem
- Six Commonplace paths establish broad addressability, not completeness - A six-path Commonplace audit establishes broad path-relative addressability without establishing completeness, while exposing separate admission and model-realization gaps in the broader revision affordance
- Six reported self-improvement paths expose bounded redesign surfaces within supplied methods - Comparative evidence separates operative redesign, revision of governing machinery, and contributions to later improvement from declared editability across six reported self-improvement paths including HyperAgents
- Software factory - Definition — in the Greenfield lineage, a software factory is a configured family-specific software-production environment
- Software house - Definition — a software house is the complete persistent system responsible for developing and evolving software for external users
- Spec mining is codification's operational mechanism - Operationalizes codification by extracting deterministic verifiers from observed stochastic behavior — the mechanism that converts blurry-zone components into calculators
- Specification strategy should follow where understanding lives - Among durable artifacts, spec-first, bidirectional spec, and spec mining fit different phases: when understanding is available upfront, discovered during execution, or only visible after observation
- Specification-level separation recovers scoping before it recovers error correction - OpenProse-like DSLs expose control flow and discretion boundaries while leaving scheduling and validation on the LLM substrate, creating an intermediate regime between flat prompting and symbolic scheduling
- Stale self-description conceals its own staleness - What artifact drift adds when it is reflexive: the process that would detect it consults the artifact that drifted, the trigger has no edit event to hook, and synchronization load scales with autonomy
- Storage substrate - Definition - storage substrate records where retained state persists, as an operational field distinct from form, lineage, and authority
- Superseded choices need a historical witness; refuted beliefs lose subject-matter standing - Retention after supersession follows remaining truth role rather than maintenance operation: preserve a witness to the choice event, while a refuted belief loses subject-matter standing
- Synthesis is not error correction - Synthesis propagates errors by merging all agent outputs; voting corrects errors by discarding minorities — Kim et al.'s 17.2× amplification is a synthesis failure, not evidence against multi-agent coordination
- System use is an initial selection environment when theory fit lacks a fixed oracle - When no complete fixed oracle decides whether a claim belongs in a working theory, distributed consequences of live system use can provide an initial selection environment
- System use provides evidence of theory fit and causal usefulness, not independent warrant - Consequences of using a claim in a live system can test its integration and causal usefulness, but independent factual, formal, source, or scope evidence is still needed for its warrant
- System-definition artifact - Definition - a system-definition artifact is a retained artifact consumed with instruction, enforcement, routing, validation, configuration, evaluation, or learning force
- System-definition artifacts are crystallized reasoning under context scarcity - Separates heuristic rules that substitute for unavailable read-time reasoning from authority-bearing constraints and symbolic codification, which remain useful even with abundant context
- Systematic prompt variation serves verification and diagnosis, not explanatory-reach testing - Controlled prompt variation either decorrelates checks or measures brittleness under fixed task semantics; Deutsch's variation test instead changes the explanation to test mechanism and explanatory-reach
- Task families and product families classify different things - Task families group obligations or evaluations; software product families group products through declared commonality, variability, and reusable production scope
- Technical constraints turn KB objective-function choice from philosophy into engineering - Three technical constraints and the codification lever make KB objective-function choice testable engineering, not philosophy; goals set the loss, local contracts specialize it, and oracle strength differs by objective
- Tentative theory - Definition — a tentative theory is a theory proposed as a solution to a problem, which stays open to criticism and revision however well it has survived; Popper's term with nothing added, a status of every theory
- The 2026-08-30 Commonplace revision used retained theory to guide computational search - A 2026-08-30 Commonplace revision shows retained project theory guiding computational search while the operator supplied decisive global-fit selection
- The adaptation survey corroborates memory requirements but misses artifact governance - The agentic-adaptation survey supports the memory requirements map by treating memory and skills as adaptive tools, but it needs substrate, form, lineage, and authority governance to become design guidance
- The augmentation-automation boundary is discrimination not accuracy - Crossing from augmentation to automation requires per-instance discrimination, not aggregate accuracy — discrimination is empirically stagnant, so scaling capability alone cannot cross the boundary
- The Bitter Lesson defense portfolio has one load-bearing member for the form-only rebuttal - The production-method versus representational-form distinction answers only a narrow weights-only inference; theory-guided bootstrapping is a provisional first strategy under incomplete global evaluation, not a defense of continuing hand production
- The bitter lesson selects against unearned reach, not against structure - The lesson selects against claims whose reach was asserted rather than earned by a refuting test, not against structure or origin — theory search in readable forms is its own method; earned reach protects the claim, not its carrier
- The bitter lesson selects production methods, not representational forms - The lesson's axis is production method — hand-crafted versus search-and-learning — not representational form. Learned localized forms are therefore a coherent scaling hypothesis, with cross-artifact credit assignment as the decisive open problem
- The boundary of automation is the boundary of verification - Synthesis — oracle theory, labor economics, frontier-lab capability predictions, and supply-chain integrity evidence converge on verification cost as the primary structural determinant of automation
- The declared Commonplace frame - The declared boundary under which Commonplace's self-improvement, reflectivity, and allocation attributions are assessed — what is inside, what is outside, and how to cite or depart from it
- The deployed system, not the model alone, is the unit of learning - Because prompts, retrieval, tools, and runtime policy jointly determine deployed behavior, model-only learning leaves consequential system choices fixed
- The four-field record exposes an efficiency, security, and sovereignty risk triad - The four artifact-analysis fields exist to surface three architectural review concerns over retained behavior — efficiency, security, and sovereignty — with sovereignty (owner control to inspect, regenerate, delete, roll back) as the new axis
- The readable-artifact loop is the tractable unit for continual learning - Identifies the natural-language-plus-symbolic pair as the tractable first loop for representational-form coevolution because it shares context, operates at current tempos, and already has a codification boundary
- The self-improving-system definition classifies its boundary cases without ad hoc exceptions - Ten boundary cases run against the self-improving-system definition — each classifies by the stated criteria alone; the stress they apply falls on boundary declaration, not on the membership clauses
- The tag-readme change as an observed causal-connection trace - One bounded Commonplace trace establishes that operative self-representation can exert causal force in both directions; it does not establish system-wide reflective coverage
- Theory building and capacity building make the same kind of fallible commitment - Theory building and capacity building both retain resolutions their evidence does not entail; an explanatory commitment stays answerable to the object it describes while a constructive commitment changes the object, so retraction differs in kind
- Theory building has distinct epistemic, structural, and implementation precedents - Conjecture and criticism, causal self-representation, and persistent artifact editing supply different precedents for a theory builder's operations; similarity on one does not establish the others
- Theory warrant should be tracked at the finest granularity evidence licenses - Treat support for a theory as warrant for only the most specific claim, conjunction, model, and scope the evidence identifies; do not distribute joint warrant beyond what it entails without additional attribution
- Three-space agent memory echoes Tulving's taxonomy but the analogy may be decorative - The value of separating knowledge, self, and operational memory is that each has a different lifecycle — accumulation, slow evolution, and high churn; whether the Tulving mapping adds explanatory power beyond different retention policies is open
- Tool usefulness, computational autonomy, warrant, and system power are separate dimensions - Tool usefulness, computational autonomy, warrant, and system power move independently in a human-agent system, so a progress claim has to say which one moved and autonomy gains do not license power claims
- Topology, isolation, and verification form a causal chain for reliable agent scaling - Topology, isolation, and verification may form a strict dependency chain rather than independent design choices — tested against the simpler account that good decomposition implies the other two
- Trace-extracted memory earns authority per operation, not at capture - Trace memories begin as records; verification, abstraction, and consultation earn authority under progressively harder oracles, while unverified stores accumulate guesses presented as knowledge
- Traditional software can bracket executor conformance; LLM systems cannot - Wrongness is a relation to a norm, never intrinsic to a computation; classical stacks bracket the executor-conformance norm so every failure resolves to the spec, and LLM systems cannot, which is what generates the three-source deviation taxonomy
- Treat continual learning as representational-form coevolution - Behaviour change spans distributed-parametric, natural-language, and symbolic forms, so the question is how their improvement loops relate — not which is the real locus of learning
- Underspecification and indeterminism complicate programming for prompts in distinct ways - Indeterminism doubles test runs (statistical testing over distributions); underspecification doubles test targets (spec analysis for ambiguity). Conflating the two leads to misdiagnosis
- Unified calling conventions enable bidirectional refactoring between neural and symbolic - When agents and tools share a calling convention, components can move between neural and symbolic without changing call sites — llm-do demonstrates this with name-based dispatch over a hybrid VM
- Unit testing LLM instructions requires mocking the tool boundary - Skills are programs whose I/O boundary is tool calls — mocking that boundary creates controlled environments for testing whether instructions produce correct behavior, complementing text artifact testing with instruction-level regression detection
- Universal software factory needs a declared universality axis - Universal software factory is ambiguous unless the universality axis, covered class, supplied inputs, adequacy relation, and resource bounds are declared
- Use tests a decomposition locally; retained rationale is what makes transfer testable - Running a decomposition confirms only that it sufficed here; because many force-sets fit the same split, rationale retained at design time is what gives a transfer claim an antecedent to test
- Use Trace Extraction As Meta-Learning - Trace extraction is an after-the-fact learning path that must respect signal quality, review, and readable-artifact versus distributed-parametric learning boundaries
- Verification needs a typed target before it needs an oracle - A check's warrant depends on a declared target class, so an unverifiable heterogeneous layer is usually blocked by missing artifact classification, not oracle difficulty — ontology precedes oracle
- Warranted autonomy is bounded by oracle domain - Bare autonomy is free, but warranted evaluation autonomy extends only to the candidates an oracle can assess with the required confidence
- Warranted reader update is the objective of substantive writing - Defines epistemic interestingness as a relevant, warranted change relative to an intended reader's prior, making contribution selection—not accumulated inputs—the purpose of multistage writing.
- Warranted transfer out of the human cut leaves people the hardest-to-warrant decisions - When a system preferentially transfers decisions whose premises, criteria, and checks are available, the remaining human decisions become harder to warrant per decision; this predicts a residue composition, not structural computational openness
- Weakly discriminated qualities tend to be underselected - Statistical conjecture: under named proposal-selection conditions, unequal oracle discrimination yields unequal enrichment; absolute degradation needs an additional directional mechanism
- What the matrix shows across 148 agent memory systems - 148 code-grounded reviews: files/repo storage leads; trace-learning and push read-back travel together; push is rarely behavior-tested; full lifecycle curation is rare.
- Where change candidates come from in Commonplace - Surveys how problem-noticing and candidate-drafting happen in Commonplace beyond a maintainer's own judgment — skills, ephemeral reports, mechanical checks, freshness tracking, agent initiative
- World models assess explanatory-reach through action-conditioned prediction - Learned world models can assess explanatory-reach when action-conditioned predictions are tested across the interventions or shifts a commitment claims
- Writing styles are strategies for managing underspecification - Maps descriptive, prescriptive, prohibitive, explanatory, and conditional context-file styles to distinct ways of narrowing agent interpretation, each trading constraint against generality