Multilevel Architecture Residual Optimization

About this pattern

This is a generated FPF pattern page projected from the published FPF source. It is canonical FPF content for this ID; it is not a FPF Reference product feature page.

How to use this pattern

Read the ID, status, type, and normativity first. Use the content for exact wording, the relations for adjacent concepts, and citations to keep active work grounded without pasting the whole specification.

Type: Architectural subpattern under C.32 Status: Stable Normativity: Normative unless explicitly marked informative

Use this pattern when a practitioner has a recoverable cross-scope or interlevel architecture residual and needs candidate architecture changes that reduce that residual under a declared evolution window.

Keywords

  • multilevel architecture residual optimization
  • residual-reducing candidate frame
  • declared level
  • declared scope
  • Pareto front
  • stepping stone
  • ideality pressure
  • scale amenability.

Relations

C.32.MLAObuilds onMathematical Lens Use
C.32.MLAOcoordinates withExplore-Exploit Live-Pool Governor
C.32.MLAOcoordinates withDecision Theory (Decsn-CAL)
C.32.MLAOcoordinates withEvidence Graph Referring (C-4)
C.32.MLAOcoordinates withTrust and Assurance Calculus
C.32.MLAObuilds onDecision Theory (Decsn-CAL)
C.32.MLAObuilds onModule Relation Repair
C.32.MLAObuilds onC.30.TFS
C.32.MLAOoutline parentArchitecture Candidate Synthesis
C.32.MLAOexplicit referenceUnified Comparison Mechanism (CPM)
C.32.MLAOexplicit referenceDecision Theory (Decsn-CAL)
C.32.MLAOexplicit referenceMulti‑View Publication Kit
C.32.MLAOexplicit referenceExplore-Exploit Live-Pool Governor
C.32.MLAOexplicit referenceArchitecture Description Adequacy
C.32.MLAOexplicit referenceMathematical Lens Use
C.32.MLAOexplicit referenceArchitecture Candidate Synthesis
C.32.MLAOexplicit referenceTransformation Flow Structure
C.32.MLAOexplicit referenceSystem-Role–Method–Work Alignment
C.32.MLAOexplicit referenceModule Relation Repair
C.32.MLAOexplicit referenceUnified Lexical Rules for FPF
C.32.MLAOexplicit referenceEmergence and MHT Precision Restoration
C.32.MLAOexplicit referenceCross-Scope Architecture Residual Triage
C.32.MLAOexplicit referenceThe Agential Role & Agency Spectrum
C.32.MLAOexplicit referenceU.Work: Dated Performed Work Occurrence
C.32.MLAOexplicit referenceInterlevel Ethical Conflict Structure
C.32.MLAOexplicit referenceEthical Mediation and Decision Use
C.32.MLAOexplicit referenceBitter‑Lesson Preference (BLP)
C.32.MLAOexplicit referenceControl Structure View Adequacy (LCA)

Content

Problem frame

Use this pattern when a practitioner has a recoverable cross-scope or interlevel architecture residual and needs candidate architecture changes that reduce that residual under a declared evolution window.

Primary working reader: an architect or architecture-responsible practitioner who has already recovered a residual and must prepare candidate changes without calling a local improvement a whole-holon optimum.

Typical entry phrases:

"The local architecture improvement made another scope worse."
"The platform helps product teams but grows evidence exceptions."
"Local agent autonomy conflicts with the control or policy scope."
"The method template speeds authoring and slows review."
"A graph, residual vector, or Pareto front can inform comparison only after selected structures, residuals, losses, and the pattern for the next question are declared; it is not the architecture."

First-minute use slice. A regulated product-family team has used [C.30.ILC](/generated/patterns/C.30.ILC) to name a residual: local product variants are quicker to ship, but certification evidence grows at the family scope. Using C.32.MLAO, the practitioner frames three residual-reducing candidate changes: add evidence scope, narrow interface grammar, or accept a bounded exception with a reopen trigger. Each candidate states the residual it reduces and the new burden it creates. The team now has explicit inputs for [A.19.CPM](/generated/patterns/A.19.CPM), [C.11](/generated/patterns/C.11), [A.19.SelectorMechanism](/generated/patterns/A.19.SelectorMechanism), or [G.5](/generated/patterns/G.5) when comparison, local choice, selection, or selected-set result declaration is current.

The primary EntityOfConcern is a residual-reducing candidate frame for one grounded architecture question. In plain working terms, the frame asks where a local architecture improvement moved the cost and which candidate can reduce that moved cost without hiding its new burden. The described holon can be a system, organization-as-system, discipline, AI-agent setup, built asset, episteme, work occurrence, or an instance of another admitted holon kind. Recover source labels such as practice, culture, tradition, style, or method before architecture use. Use [E.10.ROLE](/generated/patterns/E.10.ROLE) for unresolved role wording: it may resolve to a local system-role kind, an assignment occurrence, a participant position in a direct relation, a function claim, an organization or representation position, or ordinary wording. Carry only the recovered object or relation, never a generic role-side structure. Candidate Systems, assignments, Methods, plans, and structures remain modal content until their own facts obtain; a publication family appears only under its applicable pattern. Use [E.17](/generated/patterns/E.17) for a source-backed publication face and source return and [E.24.PUB](/generated/patterns/E.24.PUB) for the publication occurrence and audience availability. C.32.MLAO is not a universal optimizer, adequacy claim, selector, decision, assurance argument, publication pattern, or software-system-only pattern.

What goes wrong if C.32.MLAO is missed: local success is called whole-holon architecture success, or an optimization phrase hides the residual that shifted to another declared holon-level ref or declared scope ref.

What C.32.MLAO buys in practice: the practitioner can prepare residual-reducing architecture candidates for later comparison by naming residual reduced, new burden created, affected scope, preserved structure, lost structure, and source-return condition.

Ordinary working move: name where the local improvement moved the cost, name the selected structure and scope that now carry the residual, then prepare candidate changes that reduce that residual while making the new burden explicit.

Adoption test: after using C.32.MLAO, a reader can see the residual reduced, the new burden, the affected scope, the preserved structure, the lost structure, and the evolution-window stop condition for each candidate.

Use C.32.MLAO only after residual triage. Do not use it to recover the residual itself, justify a mathematical lens, compare or select candidates, choose locally, declare a selected-set result, publish it to an audience, or decide the project architecture.

Common exits by claim kind:

  • [C.30.ILC](/generated/patterns/C.30.ILC) when the residual is not recoverable yet.
  • [C.32.ACS](/generated/patterns/C.32.ACS) when architecture-characteristic criteria rows are missing.
  • [C.32.ACE](/generated/patterns/C.32.ACE) when eval programs or eval results are the current claim.
  • [C.29](/generated/patterns/C.29) when mathematical-lens use is being claimed.
  • [A.19.CPM](/generated/patterns/A.19.CPM) for explicit comparison, [A.19.SelectorMechanism](/generated/patterns/A.19.SelectorMechanism) for set-returning selection, [C.11](/generated/patterns/C.11) for local choice, and [G.5](/generated/patterns/G.5) for selected-set result declaration.
  • [C.18](/generated/patterns/C.18) and [C.19](/generated/patterns/C.19) for archive, front, pool treatment, or stepping-stone retention.
  • [C.30.AD](/generated/patterns/C.30.AD) for architecture-description work, [E.17](/generated/patterns/E.17) for a source-backed publication face and source return, and [E.24.PUB](/generated/patterns/E.24.PUB) for the publication occurrence and audience availability.
  • [C.32.PAD](/generated/patterns/C.32.PAD) for project decision.

The first useful output is MultilevelArchitectureResidualOptimizationFrame@Project. The frame is a working record for residual-reducing candidate framing. It records residual movement and candidate burdens; it is not a universal optimizer, scalar optimum, C.29 lens result, or architecture decision:

For a first pass, fill only the described holon, optimization question and objective basis, residual-triage ref, affected level or scope refs, selected structures, residual-bearing loci, criteria rows, ClaimScope when needed, evolution window, residual-reducing candidates with residual reduced and new burden, pattern for the next question, and stop condition. Add front, archive, NQD, OEE, C.29 lens, ideality, scale-amenability, function-bearer, and architecture-influence-correspondence refs only when that support is current for the candidate being framed.

MultilevelArchitectureResidualOptimizationFrame@Project:
  projectWorkOccurrenceRef?: U.EntityRef constrained to U.Work
  residualOptimizationFrameProjectUseRelationRef?: U.RelationRef defined by the exact synthesis-use or work-use pattern
  describedHolonRef:
  optimizationQuestion:
  objectiveBasisRefs:
  claimScopeRef?: U.ClaimScope
  residualTriageRef:
  declaredHolonLevelRefs?:
  declaredScopeRefs:
  selectedStructureRefs:
  residualBearingLoci:
  candidatePaletteRef:
  architectureCharacteristicCriteriaSetRef?:
  architectureCharacteristicCriteriaRowRefs:
  qBundleRefs?:
  evolutionWindowRef:
  dynamicFrontOrArchiveRef?:
  nqdOrOeeSupportRef?:
  steppingStoneRefs?:
  architectureIdealityPressureRef?:
  scaleAmenabilityPolicyRef?:
  functionBearerFeasibilityRef?:
  architectureInfluenceCorrespondenceRef?: C.32.CONWAY frame or exact pair-row ref
  residualReducingCandidates:
    - candidateRef:
      selectedStructureChanged:
      affectedLevelOrScope:
      affectedArchitectureCharacteristicRefs:
      affectedCriteriaRowRefs?:
      architectureCharacteristicEvalResultRefs?:
      residualReduced:
      newBurden:
      preservedStructure:
      lostOrHiddenStructure:
      sourceReturnCondition:
  comparisonInputRefs?:
  receivingOperationPatternRef?:
  c29LensOutputRef?:
  metaHolonTransitionRef?:
  stopCondition:

Here @Project is a compatibility and retrieval cue only. It establishes no project entity, composite-work identity, context, authority, viewpoint, or parthood. When the frame is genuinely used in one actual project, projectWorkOccurrenceRef identifies the exact composite U.Work and residualOptimizationFrameProjectUseRelationRef identifies the direct relation by which that work uses the frame. The frame, the residual-reducing synthesis work, the candidate architectures, and the project work remain distinct.

Problem

Many architecture problems are residual problems. A local module boundary improves one team and creates integration exceptions elsewhere. A control relation improves response and creates audit or timing burden. A platform improves reuse and creates evidence decay. A method family speeds authoring and harms transfer.

The tempting shortcut is to call the local improvement optimized. C.32.MLAO blocks that shortcut by asking: where did the residual shift, which selected structure carries it, and which candidate change reduces it enough to be worth its new burden?

Forces

ForceTension
Local fitA candidate may help one scope while harming another.
Optimization languageObjective, residual, front, and matrix language sounds decisive before the claim is typed.
Declared-level recognitionLevel and scope words are useful only after they are declared as holon-level refs or scope refs, or restored as stratification terms through C.30.STRAT before selected-structure use.
Candidate actionWhen performing repair work, the practitioner must use the residual triage to prepare candidate changes.
New burdenEvery residual-reducing candidate change creates another cost or loss.

Solution

Build a residual-reducing frame around one recoverable residual.

Work in eight steps:

  1. Start from a C.30.ILC-compatible residual triage.
  2. Name the affected declared holon-level refs or declared scope refs and the selected structures that carry the residual.
  3. Name the architecture-characteristic criteria rows and any Q-Bundle slots that make the residual worth reducing.
  4. Create or reference a C.32 candidate palette.
  5. For each candidate, state the residual it reduces, the selected structure changed, and the criteria rows affected.
  6. State the new burden, loss, exception, or source-return load created by that candidate.
  7. Record the evolution window and any support that only keeps candidate plurality or directionality alive, such as NQD, OEE, an archive or front, stepping-stone retention, ideality, or BLP.
  8. Stop at the frame, or name the pattern for the next question when a later claim is current: use A.19.CPM for explicit comparison, A.19.SelectorMechanism for set-returning selection, G.5 for selected-set result declaration, C.11 for local choice, C.32.PAD for an architecture decision, C.30.AD for architecture-description work, and C.29 for mathematical-lens use. For publication, use E.17 for a source-backed face and return to source, then E.24.PUB for the actual occurrence, form, carrier, audience, bounded use, and availability.

Admit a residual-reducing candidate only when it answers the working questions: which declared holon-level ref or declared scope ref is affected, which selected structure changes, which architecture-characteristic row or Q-Bundle slot is at stake, what residual is reduced, what structure is preserved or lost, and what new burden appears.

Candidate change familyUse whenRepair it provides
splitScopeOne scope carries incompatible tempo, functional demand, constraint, or admissibility condition.Separates the conflict and names coordination cost.
mergeScopeMediation creates more burden than separation saves.Removes unnecessary boundary and names coupling risk.
addMediatorDirect cross-scope dependency is brittle.Adds mediation and names mediator failure mode.
addControlStructureRate, feedback, policy, or supervisor conflict persists.Adds or changes control relations, states timing burden, and names any direct control-responsibility predicate with actual participants; if none is admitted, records the exact missing governor instead of inferring responsibility from the control structure.
addInterfaceGrammarVariation grows through unmanaged interface variants.Names allowed variation, conformance expectation, and exception risk.
repairFunctionBearerGapA residual-reducing functional change has no feasible bearer at the affected declared holon-level ref or scope ref.Adds or changes an admitted bearer, splits the function, changes placement, resource access, or control relations, or rejects the candidate. Any responsibility change uses its direct domain predicate or exact missing governor.
addEvidenceScopeReusable candidate bearer lacks reusable evidence scope.Makes evidence maintenance part of the candidate; claims about the validity or sufficiency of the evidence use belong to A.10 when they are current.
addWorkMethodScopeRepeated work remains bespoke because method structure is missing.Proposes reusable method structure for the repeated work and names review or training burden.
repairArchitectureInfluenceCorrespondenceThe residual is carried by mismatch between one exact typed influence-side architecture source and transformed-side architecture content for the changed referent.Open C.32.CONWAY; keep the changed referent and any actual A.3.4 U.Transformation separate, then prepare candidate alternatives that change the influence-source side, change the transformed side, change both, or keep a bounded mismatch.
acceptBoundedExceptionEliminating the residual costs too much now.Records exception, source-return condition, and reopen trigger.

Comparison-input boundary. C.32.MLAO prepares comparison inputs; it does not run the comparison or choose a candidate. Its output rows are candidate records with residual reduced, new burden, selected structures, preserved structure, lost structure, source-return condition, and optional C.29 lens-output references.

Those references are diagnostic inputs only.

Admitted profiles and a ComparatorSpec belong to the receiving explicit-comparison pattern.

If the current claim is explicit comparison, use A.19.CPM with admitted profiles and a declared ComparatorSpec. If the claim is local choice over an existing option set, use C.11. If the claim is set-returning selection, use A.19.SelectorMechanism. If the claim is selected-set result declaration, use G.5. For publication, use E.17 for a source-backed face and source return and E.24.PUB for the publication occurrence and audience availability.

Lens-output discipline. Graphs, fronts, residual vectors, DSMs, RG-like descriptions, and frustration language are C.29 lens outputs, structural descriptions, or diagnostic signals after their architecture use is typed. The real failure is proxy preference: a candidate is preferred because the output looks better while selected structures, lost structure, architecture characteristics, and pattern for the next question remain unnamed. The repair is to interpret the output over selected structures and state what residual or loss it exposes; any comparison, selection, or choice claim then belongs to its pattern for the next question.

Method, culture, and episteme discipline. For a Method-family, culture, practice, or episteme case, first name the described holon, optimization question and use, selected structures, and the pattern that defines or constrains each load-bearing claim. If a publication family or publication face is in view, decide whether it is the described holon, a selected structure, an architecture description, or an MVPK face before using it. C.32.MLAO defines only the residual-reducing architecture candidate frame; use the applicable patterns for Method, Work, publication, evidence, ethical, and decision claims.

Dynamic candidate discipline. A preferred or retained candidate is bounded by an evolution window, source conditions, and the pattern for the next question that admitted the preference or retention. NQD, OEE, C.18, and C.19 can keep a front, archive, pool, or stepping stone visible; they do not select the architecture and they do not turn a front member into a durable optimum.

Ideality and BLP discipline. TRIZ ideality can suggest residual-reducing candidate changes: remove a support bearer, transfer a useful function onto an existing resource, or generalize a bearer so fewer selected structures carry more useful functions. BLP can prefer a more general scale-amenable bearer only inside its declared scale window and audit boundary. Both lines guide candidate generation; neither removes the need to state new burden, lost structure, and pattern for the next question.

Functional-bearer feasibility discipline. A residual-reducing candidate must name a bearer that could perform the function under the declared module, placement, resource, control, information, and evidence constraints. This is a design-time feasibility claim, not proof that the System, assignment, or Work already exists. An assignment supplies neither capability, functioning, function bearing, nor performance. If no feasible bearer can be proposed, add or change a candidate bearer, split the function, change placement, resource access, or control relations, reduce the demand, or mark the C.32 candidate unfit. Responsibility still needs an admitted direct predicate or the exact missing governor.

Architecture-influence and transformed-side discipline. When a residual is carried by one independently typed architecture-side source constraining architecture content for a changed referent, use C.32.CONWAY. For each actual side, keep the exact C.30 described holon, obtaining ArchitectureRelation, and selected U.Structure together; keep candidate, required, desired, or expected content in an exact C.30 ArchitectureClaim. Keep the changed referent and any actual A.3.4 U.Transformation separate. Then prepare residual-reducing candidates that change the influence-source side, the transformed side, both sides, or a bounded mismatch as comparison inputs or downstream candidate alternatives. Influence, transformation, flow, Work, and module-interface claims belong to their exact relation pattern, A.3.4, E.18, A.15, or A.6.M when current. Structural-similarity claims belong to C.29 only when they are current.

Level, stratification-term, and whole-reidentification discipline. If the case uses level, system level, holon level, layer, tier, or another stratification term, first use E.10.ARCH and C.30.STRAT unless the subject pattern and recovered neighborhood are already named by value. If the case uses BOSC, MHT, MET, MFT, emergence-family, boundary-crossing, or promotion-like wording, first use E.10 and B.2.P to recover the claim kind. Use B.2 only when a whole-reidentification question remains after the existing-whole explanation check; otherwise use the subject pattern for architecture, boundary, capability, function, measurement, publication, work, or lens claims.

Stop condition. Stop after the frame names residual, affected declared holon-level refs or declared scope refs, candidate changes, new burdens, preserved and lost structure, source-return conditions, and patterns for the next questions.

Lowering condition. Keep the frame as C.32.MLAO work only while the residual triage, affected level or scope refs, selected structures, criteria rows, evolution window, residual reduced, new burden, and pattern for the next question remain current. Lower a candidate to a diagnostic note when the residual is not recoverable, the selected structure is unknown or stale, the architecture characteristic is missing, the new burden is not named, or the pattern for the next question cannot use the row. Retire a candidate when its evolution window closes or a stronger residual triage replaces it. Use C.30.ILC when the residual itself is missing, C.32.ACS when criteria rows are missing, C.32.ACE when eval results are needed but not current, C.29 when the current claim is a mathematical-lens claim, and A.19.CPM, A.19.SelectorMechanism, C.11, G.5, or C.32.PAD when the downstream claim is current.

Worked Residual Cases

Grounded working caseResidual-bearing locusResidual-reducing candidatesStop condition
Regulated product family where shared platform reduces engineering work but grows certification exceptionsProduct-variant scope against family evidence scope; module-interface and evidence-scope structuresAdd reusable evidence scope; narrow interface grammar; keep bounded exception for one variantStop before assurance, G.5 selected-set result declaration, publication availability, or decision unless those claims are current.
Clinical triage arrangement where local intake speed increases downstream escalation missesIntake scope against hospital escalation scope; proposed triage Systems, procedure or Method structure, escalation relation, and optional kind or assignment requirements kept distinctPropose a mediator System or relation, split triage scope by patient class, and state any assignment requirement as plan or decision content. Retarget responsibility only through an admitted direct predicate or record the exact missing governor. Only after performance occurs, recover every precise performer's A.13 core and independently admit the Work under A.15.1; add F.6 only when precise assignment-bound attribution is current, and add a Work-to-change relation only when that predicate independently obtains.Stop before ethical mediation or staffing decision unless D.3, D.4, or the receiving staffing-decision pattern is current.
AI-agent review setup where local agent quality improves while policy violations increaseAgent task scope against policy-control scope; control and evidence-refresh structuresAdd supervisor relation; narrow model-interface admissibility; change evidence refresh cadenceStop before safety, gate, release, or causal claims unless their subject patterns are current.
ML inference workflow where the searched functional graph improves quality and exceeds edge-device resource limitsFunctional graph against deployment and resource scopes; module-interface, placement, and resource structuresSplit the function, change deployment placement, add a resource bearer, or reject the candidate for this evolution windowStop before release, benchmark, G.5 result declaration, or publication claims unless the definition and test for each current claim are applied.
Method family where template reuse accelerates authoring and creates review residueAuthoring scope against review scope; method-structure and authored-section structuresSplit method variants; add review-evidence scope; accept bounded local method residueStop before method governance, MVPK publication-face governance, or project decision unless the pattern for the next question is current.
Built-asset maintenance program where digital-twin abstraction hides lower-scope source lossAsset-family scope against maintenance activity scope; reference-designation, information, and maintenance-Method or plan structuresAdd source-return scope; split the information view; retarget maintenance responsibility only through its admitted direct predicate or record the exact missing governor. Introduce actual maintenance Work only through its basis: A.13 first, independent A.15.1 Work admission second, and F.6 afterward only for precise assignment-bound attribution.Stop before built-asset architecture-description, publication-face, or A.10 evidence-use claims unless their subject patterns are current.

Residual And Trade-Off Failure Modes

Failure modeC.32.MLAO repair action
Local improvement shifts the residual elsewhereRecord the scope and selected structure that improved, the scope and selected structure that worsened, and the new burden created.
Universal optimizer is assumedTreat optimization as bounded residual reduction over declared holon-level refs or declared scope refs, with comparison inputs, pattern for the next question, and stop condition.
Proxy result substitutes for comparison or choice claimWhen a score, vector, graph partition, front, DSM, or C.29 lens output is used to prefer a candidate, name the selected structures, preserved structure, lost structure, architecture characteristic, and pattern for the next question.
Level or scale word is not typedRecover level, layer, tier, scope, and scale wording through E.10.ARCH, C.30.STRAT, and C.16.P as applicable; recover BOSC, MHT, MET, MFT, and emergence-family wording through E.10 and B.2.P before declaring holon-level refs, scope refs, scale windows, B.2 whole reidentification, or C.32.MLAO residual claims.
Software-source overfitTreat software examples as domain lineage; admit other holons only after selected structures and affected scopes are recoverable.
Lossless repair is assumedEvery residual-reducing candidate names the new burden it creates.
Front member is treated as durable optimumA front member has archive or front membership under an evolution window; membership does not establish a durable architecture optimum.
Stepping stone is erased too earlyKeep retained stepping stones visible through C.18 or C.19 when they preserve future residual-reduction reach.
Architecture-influence residual is hiddenA residual between one typed influence-side architecture source and transformed-side architecture content must open C.32.CONWAY; keep the changed referent and any actual transformation separate, and prepare influence-source-side, transformed-side, joint, and bounded-mismatch candidates as comparison inputs or downstream candidate alternatives.
Ideality is used as optimumTreat ideality as direction for candidate generation, not as an adequacy claim that a bearer may be removed.
Universal bearer is admitted without scale windowA general bearer still needs declared criteria rows, scale window, safety and admissibility boundaries, and an eval result when the claim depends on a reading.
Functional graph has no feasible bearerA functional architecture that lacks feasible bearers is an unfit candidate, not an optimized architecture.

Conformance Checklist

IDRequirementPurpose
CC-C32.MLAO-1The use starts from a recoverable residual triage.Prevents premature optimization.
CC-C32.MLAO-2Affected declared holon-level refs or declared scope refs and selected structures are named.Keeps multilevel wording reviewable.
CC-C32.MLAO-3Each candidate names residual reduced, architecture characteristic affected, and new burden.Prevents one-sided optimization.
CC-C32.MLAO-4Comparison inputs, comparison results, selection results, and choice results name their pattern for the next question.Keeps C.32.MLAO from performing comparison, selection, or choice locally.
CC-C32.MLAO-5Lens-backed claims use C.29 when mathematical-lens use is being claimed.Keeps mathematical adequacy outside this pattern.
CC-C32.MLAO-6Source-return condition is present when compression hides distinctions.Keeps later source-use or decision-use claims tied to recoverable sources.
CC-C32.MLAO-7Evolution window, dynamic front or archive relation, and any NQD or OEE support are typed as retention or generation support only.Blocks static-optimum and selector overread.
CC-C32.MLAO-8Influence-source and transformed-side architecture content stay distinct through exact C.30 holon, obtaining-ArchitectureRelation, selected-structure, or modal-ArchitectureClaim refs; the changed referent and any actual A.3.4 transformation stay separate; C.32.CONWAY is used when correspondence candidates are being prepared.Preserves kind distinction among architecture content, influence, Work, actual transformation, and structural similarity.

Common repair cues

Anti-patternSymptomRepair
LocalEvalAsWholeArchitectureOne scope improves or one eval result is better, and the whole architecture is called better.Return to residual triage; name improved and harmed scopes, selected structures, criteria rows, and residual-bearing locus before framing residual-reducing candidates.
ProxyResultAsPreferenceRuleA residual vector, score, graph, front, dashboard reading, or lens output is used to prefer a candidate before the selected structures and lost structure are recovered.Recover the selected structures and lost structure, interpret the result as a diagnostic signal or lens output; comparison belongs to A.19.CPM, local choice to C.11, set-returning selection to A.19.SelectorMechanism, and selected-set result declaration to G.5.
ParetoFrontAsDecisionA front is treated as selected architecture.Use G.5 for selected-set result declaration, C.11 for local choice, A.19.SelectorMechanism for set-returning selection, and C.32.PAD for a project architecture decision. For publication, use E.17 for a source-backed face and source return and E.24.PUB for the publication occurrence and audience availability.
StaticOptimumClaimA current residual-reducing candidate is called optimal without an evolution window.Add evolution window, source-return condition, reopen trigger, and the result stating the preference under its applicable pattern.
ArchitectureInfluencePairCollapseThe influence-source and transformed-side architecture content, changed referent, or actual transformation are treated as one object.Open C.32.CONWAY; recover each exact C.30 architecture side, the typed influence relation, the changed referent, any actual A.3.4 transformation, the residual-bearing locus, candidate alternatives, and any C.29 structural-similarity claim before residual framing.
LevelWordsNoLevelsText says level or scope without declared refs.Use C.30.STRAT for stratification-term recovery or B.2.P for whole-reidentification wording, then return to residual triage before candidate framing.
OptimizationNoLossCandidates show only gains.Add new burden, known loss, or bounded exception.
IdealityNoBurdenA candidate removes a bearer or support function but does not name lost function, coupling, evidence, control, or source-return burden.Use C.32 and C.31; name function-bearing transfer, characteristic changes, and BLP scale window or waiver if scale advantage is claimed.
FunctionNoBearerAtScopeA functional change reduces one residual but no admitted bearer can carry it at the affected scope under resource, placement, control, or evidence constraints.Add or change the bearer, split the function, change placement, resource access, or control relations, reduce the demand, or reject the candidate. Any responsibility claim uses its direct predicate or exact missing governor.

Consequences

Positive consequenceCost or trade-off
Residual-reducing architecture candidates are made explicit.The practitioner must name the affected levels or scopes, selected structures, residuals, preserved structure, lost structure, new burdens, and the pattern for the next question for any comparison or choice claim. Use C.30.STRAT or B.2.P first when level wording or whole-reidentification wording is not yet typed.
Optimization language is usable without carrying architecture adequacy.No scalar selector or architecture decision is available by wording alone.
Holonic breadth is preserved.Non-software cases must still recover their selected structures and patterns for the next questions.
Residual triage and candidate framing stay distinct.The team may need both C.30.ILC and C.32.MLAO.
Compressed representations can guide action.Source-return triggers must be visible.

Rationale

C.30.ILC names cross-scope residuals and first architecture repair directions. C.32 creates candidate palettes. C.32.MLAO is needed when the constructive candidate work is specifically about reducing a residual across declared holon-level refs or declared scope refs.

The nontrivial work is to prepare candidate architecture changes for later comparison by naming residual reduced and burden created, not by using an optimizer phrase, scalar output, or locally improved structure as the candidate frame.

This subpattern also keeps multilevel source-side material usable as source cues without ontology transfer: multilevel learning, frustration, RG-like, DSM, and Pareto material may discipline the frame only after the affected declared holon-level refs or declared scope refs, selected structures, preserved structure, lost structure, comparison inputs, pattern for the next question, and stop condition are declared.

SoTA-Echoing

These rows document transfers from source practice into C.32.MLAO. Each row names the part of the residual-reducing frame that uses the source's contribution; none imports its source-domain ontology into FPF.

Source to inspectWhy this source is load-bearing hereTransfer into C.32.MLAOConcrete C.32.MLAO mutationBlocked overread
Current FPF architecture residual, criteria, eval, comparison, and level-recovery line: E.10, E.10.ARCH, C.30.STRAT, B.2.P, B.2, C.30.ILC, C.32.ACS, C.32.ACE, A.19.CPM, A.19.SelectorMechanism, C.11, G.5, C.29, C.31, C.31.ASAP, and architecture source section 15.3Current local law for interlevel and cross-scope architecture residuals. C.32.MLAO starts only after residual triage; use the applicable patterns to recover criteria, eval, stratification terms, whole reidentification, comparison, selection, choice, and selected-set result declaration.Require C.30.STRAT recovery when stratification wording is ambiguous and B.2.P recovery when BOSC, MHT, MET, MFT, or emergence wording is ambiguous. Before residual-reducing candidates enter comparison, selection, choice, or selected-set result declaration, require declared holon-level refs or scope refs, selected structures, criteria rows, residual-bearing loci, preserved and lost structure, eval result refs when used, comparison inputs, and the pattern for the next question.MultilevelArchitectureResidualOptimizationFrame@Project requires residual triage, declared holon-level refs or declared scope refs, selected structures, architecture-characteristic criteria rows, residual-bearing loci, residual-reducing candidates, optional C.29 lens-output ref, comparison input refs, pattern for the next question ref, and stop condition.Same-scope structure conflict, generic complexity wording, untyped criteria, eval-result overread, untyped stratification terms, untyped BOSC or MHT triggers, local comparison work, local selection work, and untyped optimization phrases require the exact subject predicates before C.32.MLAO admits the frame.
Vanchurin, Wolf, Katsnelson, and Koonin, Towards a Theory of Evolution as Multilevel Learning (https://arxiv.org/abs/2110.14602); Wolf, Katsnelson, and Koonin, Physical foundations of biological complexity (https://arxiv.org/abs/1803.09975); Akhtyrchenko, Katsnelson, and Ustyuzhanin, Directing Open-Ended Evolution ... via Multi-Scale Path Divergence, submitted 2026-06-12 (https://arxiv.org/abs/2606.17091)Current source line for multilevel residual and scale-dependent frustration as a mathematical lens. The 2026 MSPD paper is current because it makes scale-dependent frustration explicit and computable while still being a lens over a substrate.Use frustration and multiscale divergence as optional C.29-backed lens outputs for residual-bearing loci across declared holon-level refs or declared scope refs.C.32.MLAO adds c29LensOutputRef?, residual-bearing locus, preserved and lost structure, comparison input refs, and pattern for the next question ref so any comparison has its pattern for the next question named.Source-domain ontology stays outside architecture; a scalar output must be interpreted as pressure, loss, or residual over selected structures before a receiving comparison or choice pattern can use it.
Evolutionary architecture: Ford, Parsons, Kua, and Sadalage, Building Evolutionary Architectures, 2nd ed. (https://www.oreilly.com/library/view/building-evolutionary-architectures/9781492097532/)Current practitioner architecture line for guided incremental change over declared architecture characteristics, affected selected structures, and feedback from source-side fitness functions.Residual-reducing candidates must name the new burden they introduce and the stop or reopen condition; source-side fitness-function practice is restored as ACE eval programs over ACS criteria rows.Candidate-family table includes bounded exception, evidence scope, interface grammar, control structure, and work-method scope; consequences require new burden, source-return triggers, and receiving use for eval results.A local eval improvement needs an architecture interpretation before a comparison, selection, or choice pattern for the next question can use it.
TRIZ ideality and laws of technical-system evolution, read with C.19.1 BLPOlder heuristic line: systems tend toward more useful function with less cost, harm, and support apparatus; BLP supplies FPF scale-amenability discipline for general bearers.Use ideality and scale amenability to generate residual-reducing candidates, not to select them.Frame adds architectureIdealityPressureRef? and scaleAmenabilityPolicyRef?; Solution adds ideality and BLP discipline; anti-pattern table adds IdealityNoBurden.Removing a part, consolidating functions, or choosing a universal bearer is not residual reduction unless selected structures, characteristics, new burden, and scale boundary are declared.
Multi-objective and hardware-aware NAS: Elsken, Metzen, and Hutter 2019 (https://www.jmlr.org/papers/v20/18-598.html); Sukthanker et al., v3 revised 2025-02-04 (https://arxiv.org/abs/2402.18213); Sinha et al. 2024 (https://arxiv.org/abs/2404.12403)Current architecture-search line where functional graph candidates are judged against hardware, latency, cost, and transfer constraints; useful as a general co-design lesson beyond ML.Residual-reducing candidates that change functional structure must also name feasible bearers at affected scopes.Frame adds functionBearerFeasibilityRef?; Solution adds functional-bearer feasibility discipline; candidate-family table adds repairFunctionBearerGap.A functional graph, resource score, or Pareto member is not residual reduction if no admitted bearer can carry the function.
Architecture trade-off practice and Software Architecture: The Hard Parts (https://www.oreilly.com/library/view/software-architecture-the/9781492086888/)Best current practitioner line for no-best-practice architecture decisions and explicit trade-off analysis in hard architecture problems.Frame each candidate as residual reduced plus burden created, not as a universal best answer.Candidate rows require residualReduced, newBurden, preservedStructure, and lostOrHiddenStructure; final choice requires C.11 or C.32.PAD.A trade-off scenario, ranking, or preferred decomposition is not a decision inside C.32.MLAO.
DORA loosely coupled teams, last updated 2025-10-20 (https://dora.dev/capabilities/loosely-coupled-teams/), DORA trunk-based development (https://dora.dev/capabilities/trunk-based-development/), and Team Topologies key concepts (https://teamtopologies.com/key-concepts)Current socio-technical practice for independent change, testing, deployment, small batches, dependency reduction, and fast flow. It is load-bearing because many residuals concern organization relations, proposed Systems or assignments, ordinary work or procedure organization, actual Work, direct responsibility relations, and coordination structures, not only software modules.Admit organization, local-kind, separate System-classification, assignment, responsibility, coordination, Method, plan, and actual-Work residuals only when their selected structures, direct predicates, affected scopes, and modal or actual status are recoverable.Worked cases include clinical triage, AI-agent review, and a Method family; candidate families include mediation, Method or plan scope, interface grammar, and control structure.Organization-design observations enter C.32.MLAO only after mapping to Systems and relations. Assignment supplies no responsibility, capability, function bearing, or Work, and observations supply no module, evidence, assurance, or decision claims.
Design-space and architecture-spread research: Shaw and Petre 2024 (https://arxiv.org/abs/2407.18502); Cortellessa et al. 2024 (https://arxiv.org/abs/2402.19171)Current research showing that useful alternatives need a design-space or architecture-space view, not only objective-space scores.Preserve plural residual-reducing candidates when residuals shift differently across structures or scopes.The frame preserves candidate plurality as C.32 input; use G.5 for selected-set result declaration. Use spread, diversity, or objective-space output only after naming the architecture differences it reveals.Candidate preference still depends on declared architecture characteristics, losses, and a pattern for the next question.
C.18 archive and front stewardship plus C.19 explore-exploit governanceCurrent FPF pattern line for open-ended search, NQD, OEE, archive, front, pool treatment, and stepping-stone retention.Treat NQD and OEE as generation and retention support for residual-reducing candidates, not as architecture selection.Frame fields add dynamicFrontOrArchiveRef?, nqdOrOeeSupportRef?, steppingStoneRefs?, and evolutionWindowRef; Solution adds dynamic optimum discipline.Archive membership, front membership, retained stepping stone, or pool treatment is not architecture adequacy or decision.
Conway's law, mirroring, DORA loosely coupled teams, Team Topologies, and current C.32.CONWAYCurrent practice line for residuals where one typed Work, communication, tool, method, deployment, evidence, selected-structure, or architecture-side source no longer fits the transformed-side architecture content needed for the changed referent.Treat architecture-influence correspondence mismatch as a residual-reducing synthesis problem, not as actor identity, Work attribution, transformation participation, or transformed-side architecture settlement.Frame field architectureInfluenceCorrespondenceRef? points to C.32.CONWAY; candidate-family table adds repairArchitectureInfluenceCorrespondence; Solution keeps the two exact C.30 architecture sides, changed referent, actual transformation when claimed, and influence relation separate while preparing influence-source-side, transformed-side, joint, and bounded-mismatch candidates.A correspondence residual is repaired only after the shifted burden, affected structures, characteristic pressure, exact influence basis, and exception cost are named.

Source-currentness boundary. Use each source row only for the frame field, candidate-family row, discipline paragraph, or boundary named in that row. Recheck the row when a cited paper, book edition, DORA or Team Topologies page, FPF pattern for the next question, project residual, selected structure, criteria row, or evolution window changes. If the source no longer supports the concrete mutation, lower it to background lineage and keep the residual frame only when local residual triage, selected structures, criteria rows, new burden, and pattern for the next question remain recoverable.

Relations

  • Builds on: C.30.ILC for residual triage, C.32 for palettes, C.32.ACS for architecture-characteristic criteria rows, C.32.ACE for eval programs and eval results, C.29 for mathematical-lens use when claimed, A.19.CPM for explicit comparison, A.19.SelectorMechanism for set-returning selection, C.11 for local choice over an existing option set, G.5 for selected-set result declaration, C.19.1 for scale-amenability preference claims, and C.31 or C.31.ASAP for characteristic or scale-preference claims.
  • Uses: E.10.ARCH and C.30.STRAT when stratification terms hide the recovered neighborhood; E.10 and B.2.P when BOSC, emergence-family, MHT, MET, MFT, boundary-crossing, or promotion-like wording hides the claim kind; B.2 when the candidate creates, reidentifies, splits, joins, or changes the relevant whole after existing-whole explanations are insufficient; C.32.CONWAY when residual reduction requires co-synthesis of exact influence-source and transformed-side architecture content; A.6.M, C.30.LCA, C.30.TFS-REL, and method or work patterns when their structures are the affected selected structures.
  • Patterns for the next questions: A.19.CPM for explicit comparison, A.19.SelectorMechanism for set-returning selection, G.5 for selected-set result declaration, C.11 for fixed local choice, C.30.AD for architecture-description work, E.17 for a source-backed publication face and source return, E.24.PUB for the publication occurrence and audience availability, and C.32.PAD for project architecture decisions.
  • P2S docking: C.32.P2S uses MLAO when cross-scope, interlevel, interlayer, or meta-holon residual pressure must become candidate-synthesis and repair content inside the wider architecturing flow.
  • Boundary: Use C.32.MLAO only for residual-reducing architecture candidate frames after residual triage. Use the applicable patterns for mathematical-lens adequacy, evidence, assurance, gate passage, ethical mediation, causal claim adequacy, work authorization, and final selection.

C.32.MLAO governs bounded residual-reducing architecture candidate frames. Upstream residual triage and downstream decision, gate, release, publication, or authority-relation claims use their own patterns.

C.32.MLAO:End


Last Updated: 2026-09-10 — upstream FPF commit a87d0ef4 (github.com/ailev/FPF)