Research portal

Concept document

Representative adaptive performance

concept/22-representative-adaptive-performance.md

Edition
Site v0.3.0 · continuous main snapshot
Source revision
ec2865b0eac15148675c629981a545632b3571c5
Extent
3,635 words
Public route
https://www.cordana.dev/concept/22-representative-adaptive-performance/
Mapped records40 mapped records

Direct repository links only; no document-level evidence status is implied.

Scope

This chapter turns the sports expertise, adaptive performance, and team coordination audit into a system-wide performance contract. A result is interpretable only when it travels with the information that was available, the actions that were feasible, the history that produced the policy, the opponent and team it faced, the feedback it received, its current resource and damage state, and the selection process that determined which systems were observed.

The contract constrains:

  1. sensing and observation provenance;
  2. routing and allocation under deadlines;
  3. action and closed-loop control;
  4. memory of practice, opponents, damage, and recovery;
  5. curriculum and online adaptation;
  6. assurance, degradation, and staged return;
  7. coordination and communication; and
  8. population-level evaluation and lifecycle accounting.

It connects the sensorimotor grounding chapter, sparse predictive computation, memory and consolidation, system synthesis, and the energy model. Its executable specification is Fixture F-006, with notation and derivations in the mathematical contract.

Biological observation

Perception is coupled to a possible response

Experts can extract predictive information from early opponent kinematics, but the useful cue depends on the task, feature, opponent, prior, viewing window, and response mode (C-926C-930). Predicting a label, moving a joystick, initiating a partial movement, and intercepting a physical event under its real deadline are therefore different experiments. Temporal or spatial occlusion can locate when or where information becomes useful; it does not identify a unique representation.

Training transfers more reliably when relevant information and action coupling are preserved, but “representative” is not synonymous with visually realistic (C-931C-932). Timing, feasible action, opponent response, consequence, and resource state can matter even when surface appearance changes little.

Practice is not one outcome

Practice variability can improve learning when it explores a relevant task dimension at a useful challenge level; the effect is not universal, and larger perturbations do not automatically help (C-933C-936). Accumulated practice correlates with expertise, yet amount, type, opportunity, selection, survival, access, and retrospective classification are entangled (C-937C-939).

This creates three separate questions:

  1. Does performance improve while repetition, instruction, and feedback are present?
  2. Does the change remain after a declared delay without that scaffold?
  3. Does it survive a change in cue, opponent, body, task, rule, deadline, or resource state?

The answers are practice performance, delayed retention, and transfer. They must not be substituted for one another.

Performance follows a frontier, not a single score

Movement speed and accuracy trade off under task-specific conditions, and throughput can appear stable while speed and error move in opposite directions (C-940C-941). Risk, physical work, latency, and recovery add further axes. Optimizing only accuracy can hide slower action; optimizing only latency can hide errors or unsafe events; optimizing only completed work can hide depletion.

Fatigue changes the state from which an action is controlled. Opponent behavior, remaining work, feedback, recovery, and sleep can alter output, but effects remain task- and outcome-specific (C-942C-948). Internal load, external load, readiness, damage, and injury risk are different constructs. A workload ratio or a single measurement cannot certify an individual system's safe capability (C-949C-950).

Recovery and return are staged and reversible

Return to participation, return to the full task, and sustainable recovery of prior performance form a staged continuum. Time and functional evidence can carry nonredundant information, while an apparently high function score can be misleading after early return (C-951C-953). Each promotion exposes the recovering system to more load and therefore creates new evidence. Deterioration must permit regression to a safer stage.

Teams coordinate through information and adjustment

Joint practice can increase predictive knowledge, and shared displays can change later team state. Yet synchrony is only an observable; similar movement can follow common input without reciprocal coordination (C-954C-957). A coordination claim needs perturbation, lagged compensation, reduced task error, turnover, and cross-play. A shared-information claim additionally needs records of messages, observations, beliefs, and their discrepancies.

Deceptive behavior exploits an observer's cue policy. Expertise can reduce some susceptibility without removing it, and confidence may rise while the judgment becomes wrong (C-958C-960). Feedback effects are likewise conditional on content, timing, task, autonomy, and whether the outcome is immediate performance or later learning (C-961C-962).

Selection changes the population it measures

Relative age, maturity, present capability, coaching access, playing time, opponent quality, and later observation are coupled by selection. A talent system can amplify early differences and then mistake the resulting population for evidence that its original ranking was correct (C-963C-965). Excluded systems have missing counterfactual careers precisely because the selection policy withheld the experience needed to produce them.

Finally, metabolic estimates and wearable estimates do not equal complete system energy. Human attention, facilities, sensors, equipment, computation, recovery, failed trials, maintenance, medical or safety work, and displaced opportunity alter the efficiency comparison (C-966C-968). The transferable result is therefore an evaluation contract (C-969).

Proposed AI translation

Carry the state that makes a comparison valid

For agent ii in episode ee, preserve

Ki,e=(Xe,Oi,e,Ai,e,Hi,e,Me,Fi,e,Ri,e,Di,e,Gi,e,Ce,Ue,Be),\mathcal K_{i,e}= (X_e,O_{i,e},A_{i,e},H_{i,e},M_e,F_{i,e},R_{i,e},D_{i,e}, G_{i,e},C_e,U_e,B_e),

where:

  • XeX_e is physical state, task, rules, deadline, consequence, and hidden regime;
  • Oi,eO_{i,e} is information actually received, including source, support, latency in seconds, occlusion, noise, loss, and calibration;
  • Ai,eA_{i,e} is the feasible action set under the current body or actuator, equipment, authority, rate, range, and safety limits;
  • Hi,eH_{i,e} is timestamped practice, feedback, opponent, teammate, damage, exclusion, reward, and opportunity history;
  • MeM_e is opponent and teammate composition, role, policy history, turnover, and communication topology;
  • Fi,eF_{i,e} is feedback identity, information in bits, delay in seconds, and provider;
  • Ri,eR_{i,e} is the resource and fatigue vector in its native units;
  • Di,eD_{i,e} is damage or fault state, diagnostic uncertainty, protected envelope, and return stage;
  • Gi,eG_{i,e} is the selection and opportunity policy;
  • CeC_e is the intervention, paired control, counterfactual seed, and stopping rule;
  • UeU_e is the sampling unit, such as action, episode, agent, dyad, team, site, or cohort; and
  • BeB_e is the complete ceiling in events, bytes, seconds, person-hours, joules, damage, unsafe events, replacements, and opportunity.

For method mm and literal outcome kk, the comparison target is

Qm,k(K)=E ⁣[Ykdo(m),K],Q_{m,k}(\mathcal K)= \mathbb E\!\left[Y_k\mid do(m),\mathcal K\right],

where YkY_k uses the registered unit for outcome kk. If a baseline and a new method receive different observations, actions, histories, opponents, feedback, resources, or selection opportunities, Qm,kQb,kQ_{m,k}-Q_{b,k} does not isolate method mm from baseline bb.

Treat representativeness as an inspectable vector

For training distribution PtrP_{\mathrm{tr}} and target distribution PteP_{\mathrm{te}}, record

drep=(dO,dA,dT,dM,dF,dR,dD,dG),\mathbf d_{\mathrm{rep}}= (d_O,d_A,d_T,d_M,d_F,d_R,d_D,d_G),

where the components compare actual observation OO, feasible action AA, deadline and consequence TT, teammate/opponent state MM, feedback FF, resource state RR, damage and return state DD, and selection policy GG. Each dzd_z is a declared divergence between the corresponding training and target distributions: dimensionless for a statistical divergence or in the declared ground-cost unit for optimal transport. The components remain visible; one weighted “realism” number would conceal which relation transferred.

Keep outcomes separate

OutcomeMinimum evidenceCommon false proxy
anticipationproper score by cue time and opponent; calibration; commitment latencyexpert label or reaction time
physical interceptionsuccess, onset, trajectory, endpoint error, safetyvideo or joystick judgment
cue userandomized removal, neutralization, conflict, or timing interventiongaze or saliency
practiceacquisition curve by attempt and exposure timeend-of-practice score as retained learning
retentiondelayed scaffold-free testimmediate post-practice score
transferfirst target trial and full source-to-target matrixlater target learning
explorationaction and outcome information, feasible coverage, later utility, costraw variance or entropy
adaptabilityperturbation loss, recovery time, overshoot, recurrence, damagestationary accuracy
pacing/readinessoutput trajectory, state calibration, admissible actions, abstentionelapsed workload or one score
staged returnfalse promotion/withholding, dwell, recurrence, rollback, availabilitycalendar time or one test
coordinationperturbation-conditioned compensation, task stability, cross-play, repairsynchrony or proximity
shared informationmessages, observations, predictive beliefs, discrepanciessimilar behavior
deceptionmatched causal contrast, calibration, exploitability, regret, adaptationconfidence or surprise
talent predictionprospective out-of-cohort calibration and counterfactual opportunitycurrent rank or selected-cohort accuracy
complete efficiencyprotected outcomes plus all resource and harm axesdevice energy or success/trial

Separate useful exploration from noise

For action variable AA, reached-outcome variable ZZ, and method mm, measure

Xm=(Hm(A),Hm(Z),Im(A;Z),Km,Qmtr,Cm),\mathcal X_m= \left(H_m(A),H_m(Z),I_m(A;Z),K_m,Q^{\mathrm{tr}}_m,\mathbf C_m\right),

where both entropies HmH_m and mutual information ImI_m are in bits, KmK_m is the dimensionless fraction of the registered feasible region covered, QmtrQ^{\mathrm{tr}}_m is later transfer in the task's literal unit, and Cm\mathbf C_m is the complete cost vector. More action entropy is useful only when it improves outcome information, transfer, or later task value at an acceptable cost.

An adaptive curriculum therefore needs the initial skill and history stratum, the perturbed task dimension, perturbation dose, retry cost, feedback bits, criterion exposure, and delayed tests. This directly constrains Candidate 004 and the memory boundary in the consolidation chapter.

Route and act through resource-qualified state

The runtime policy should expose the state on which pacing and authority depend:

at=πm ⁣(ot,r^t,d^t,st,π^opp,t,b^team,t,ft),a_t=\pi_m\!\left(o_{\le t},\widehat r_t,\widehat d_t,s_t, \widehat\pi_{\mathrm{opp},t},\widehat b_{\mathrm{team},t},f_t\right),

where ata_t is the commanded action or power target in its native unit, oto_{\le t} is causally received observation history, r^t\widehat r_t is the estimated resource/fatigue vector, d^t\widehat d_t the estimated damage state, sts_t remaining work in metres, seconds, events, or joules, π^opp,t\widehat\pi_{\mathrm{opp},t} the opponent-policy estimate, b^team,t\widehat b_{\mathrm{team},t} the teammate-state estimate, and ftf_t available feedback. Every estimate and channel receives a separate ablation.

This state conditions sensing, sparse routing, action authority, memory access, and recovery. It sharpens Candidate 002, Candidate 006, Candidate 007, and Candidate 012.

Compare a frontier, not a winner

For one task, retain

Pm=(Tm,ϵm,pmunsafe,Emlife,Hmhuman),\mathcal P_m=(T_m,\epsilon_m,p^{\mathrm{unsafe}}_m, E^{\mathrm{life}}_m,H^{\mathrm{human}}_m),

where TmT_m is latency in seconds, ϵm\epsilon_m task error in its declared physical or task unit, pmunsafep^{\mathrm{unsafe}}_m dimensionless unsafe-event probability, EmlifeE^{\mathrm{life}}_m lifecycle energy in joules, and HmhumanH^{\mathrm{human}}_m role-stratified effort in person-hours. A method is more efficient only through a preregistered utility or a Pareto improvement with non-inferiority on protected outcomes.

Make readiness an action envelope

At decision time tt, admissible actions are

Atready(α)={aAt:Pr(Zt:t+hZsafea,It)1α},\mathcal A^{\mathrm{ready}}_t(\alpha)= \left\{a\in A_t: \Pr(Z_{t:t+h}\in\mathcal Z_{\mathrm{safe}}\mid a,\mathcal I_t) \ge 1-\alpha\right\},

where AtA_t is the currently feasible action set, Zt:t+hZ_{t:t+h} the multidomain outcome vector over horizon hh in hours, Zsafe\mathcal Z_{\mathrm{safe}} the registered safe envelope, It\mathcal I_t information available at time tt, and α\alpha the dimensionless tolerated risk. An empty envelope triggers abstention or escalation.

Let gt{0,1,2,3,4}g_t\in\{0,1,2,3,4\} denote protected, modified, controlled, full-load, and adversarial operation. Promotion requires the next stage's envelope; a violation requires that gt+1<gtg_{t+1}<g_t remain possible. This turns staged return into a concrete test for Candidate 009 rather than a one-time health classification.

Distinguish coordination from shared input

For agent contributions ui(t)u_i(t) and uj(t)u_j(t), apply perturbation do(ηi)do(\eta_i) to agent ii and estimate

Γij()=Cov ⁣(Δui(t),Δuj(t+)do(ηi),Xt),\Gamma_{ij}(\ell)= \operatorname{Cov}\!\left(\Delta u_i(t),\Delta u_j(t+\ell) \mid do(\eta_i),X_t\right),

where lag \ell is in seconds, XtX_t is task state, uiu_i and uju_j retain their native contribution units, ηi\eta_i is a registered intervention in the unit of ii's action or state, and Γij\Gamma_{ij} has the product unit of the two contributions. A useful response must also reduce error in the protected task variable without increasing risk. Teammate turnover, role reassignment, message ablation, common-input controls, and never-co-trained cross-play separate reciprocal adjustment from synchrony. The nephron-coupling boundary adds the same requirement: coherence alone is not direct coupling, information transfer, or functional benefit (C-1495).

Preserve selection and evaluator lineage

Population evaluation carries the policy that granted training, observation, feedback, compute, role, and survival opportunity. Selected and rejected systems remain in the analysis, with censoring and missing outcomes explicit. Additional opportunity near selection thresholds is randomized when admissible or handled with a declared causal design. This extends Candidate 019 and the observation lineage in Candidate 014.

flowchart TB
    contract["Versioned episode contract<br/>task + observation + feasible action<br/>history + opponent/team + feedback<br/>resource + damage + selection"]
    manip["Sealed representative interventions<br/>cue window · action coupling · consequence<br/>fatigue · return stage · turnover · deception"]
    contract --> policy["Predict · act · query · abstain<br/>pace · coordinate · recover"]
    manip --> policy
    policy --> plant["Embodied task and adversarial environment<br/>real deadlines · realized actions · damage"]
    plant --> firewall["Outcome firewall<br/>anticipation ≠ interception ≠ cue use<br/>practice ≠ retention ≠ transfer<br/>exploration ≠ adaptability<br/>readiness ≠ return ≠ performance<br/>synchrony ≠ coordination ≠ shared information"]
    firewall --> compare{"Equal-budget comparison<br/>first trial + learning curve<br/>held-out opponent/team/task/state"}
    nulls["Mature null stack<br/>RL/POMDP · system ID · curriculum<br/>robust/adaptive control · VOI<br/>readiness/survival models · MARL/comms<br/>imitation/opponent + causal selection"] --> compare
    ledger["Complete ledger<br/>events · bytes · seconds · person-hours<br/>operational + embodied joules · harms"] --> compare
    compare --> keep["Retain literal residual<br/>only on protected outcomes"]
    compare --> retire["Retire mechanism claim<br/>preserve measurement contract"]
    keep --> history["Version history and future qualification"]
    retire --> history
    history --> contract

Editable source: representative-resource-qualified-performance.mmd.

Efficiency mechanism

The contract can improve efficiency through five measurable effects:

  1. Less proxy optimization. Coupled perception/action tests prevent spending training and inference resources on a symbolic score that does not improve the physical or operational task.
  2. Higher-value variation. History-qualified curricula direct perturbations toward task-relevant uncertainty instead of buying undirected entropy.
  3. Resource-aware allocation. Routing, sensing, and authority respond to remaining work, fatigue, damage, opponent state, and recovery rather than treating every episode as fresh.
  4. Reversible exposure. Staged return seeks a better availability--recurrence frontier than either permanent exclusion or an immediate full-load restart.
  5. Complete comparison. Population selection, human effort, failure, recovery, and embodied resources are charged before a claimed saving is accepted.

Lifecycle energy for method mm is

Emlife=Emtrain+Eminfer+Emsense+Emact+Emcomm+Emfacility+Emrecover+Emmaint+Ememb,E^{\mathrm{life}}_m= E^{\mathrm{train}}_m+E^{\mathrm{infer}}_m+E^{\mathrm{sense}}_m+ E^{\mathrm{act}}_m+E^{\mathrm{comm}}_m+E^{\mathrm{facility}}_m+ E^{\mathrm{recover}}_m+E^{\mathrm{maint}}_m+E^{\mathrm{emb}}_m,

where every term is in joules under one declared service interval. The terms are training, inference, sensing, actuation, communication, facility, recovery, maintenance, and amortized embodied energy. Human design, demonstration, coaching, labeling, tuning, monitoring, repair, safety, and medical effort are reported separately in person-hours. A lower device-energy reading does not establish a lifecycle saving.

Evidence status

ComponentEvidence boundaryArchitectural status
early cue use and anticipationtask-, cue-, opponent-, and response-specific human studies; C-926C-930established scoped observations; transferable artificial mechanism unassigned
representative information/action couplingtransfer studies distinguish action coupling from visual similarity; C-931C-932plausible evaluation constraint
variability and practicebenefits depend on task dimension, dose, history, and outcome; C-933C-939established heterogeneity; adaptive curriculum residual speculative
speed--accuracy frontierscoped task relations; C-940C-941established need for multi-axis reporting
fatigue, pacing, load, and readinessoutcome-specific interventions and measurement critiques; C-942C-950resource state is necessary metadata; learned controller untested
staged returnstaged clinical framework and nonredundant criteria; C-951C-953plausible assurance translation; ordinary staged rollout remains the null
coordination and shared informationpractice, shared display, synchrony, and coordination studies; C-954C-957perturbation and cross-play are evaluation requirements
deception and feedbackbounded effects under declared tasks; C-958C-962adversarial calibration requirement
selection bias and talent predictionrelative-age, maturity, and prospective-validity evidence; C-963C-965prospective causal evaluation requirement
complete efficiencysystem-boundary and measurement evidence; C-966C-969required accounting contract; net advantage unknown

The proposed composition remains a benchmark target until it beats the complete ordinary stack in F-006. A complete stack includes calibrated prediction and retrieval; model-free and model-based RL; POMDP/MPC; system identification; domain randomization and curriculum; robust/adaptive control; value of information and selective prediction; workload, readiness, survival, canary, and rollback models; multi-agent control and explicit communication; imitation and opponent models; and causal selection models.

Speculative extensions

Resource-conditioned sparse routing

Routing could condition on expected remaining work, resource uncertainty, damage, and safe fallback rather than only token or task features. It must beat a conventional estimator plus constrained control at equal sensing, compute, reserve, and failure allowance.

Retention-aware curriculum control

A curriculum controller could value a perturbation by delayed retention and held-out transfer rather than practice loss. It must beat fixed augmentation, domain randomization, active learning, Bayesian experimental design, novelty, quality-diversity search, and automatic curriculum at equal attempt, perturbation, feedback, evaluator, time, and energy budgets.

Deception-calibrated opponent memory

Opponent memory could retain policy versions, cue conflicts, confidence, change points, and abstention value. It must improve calibration and adaptation on new deceptive opponents beyond Bayesian opponent models, fictitious play, self-play, recurrent policies, retrieval, and conformal abstention.

Turnover-resilient communication

Teams could compress communication after shared practice while retaining typed repair, acknowledgements, and belief discrepancy when membership changes. Lower message volume counts only if cross-play, repair latency, task quality, and safety survive.

Counterfactual development policies

Population management could compare selection with broad-development or threshold-lottery policies and explicitly model opportunity-mediated outcomes. It must predict later capability in new cohorts and recover false negatives without hiding attrition or development cost.

Failure modes

FailureObservable signatureRejection or containment rule
symbolic proxy winlabel accuracy rises while interception, deadline, or safety does notrequire coupled action and protected physical outcomes
realism scalartransfer is attributed to a surface label without factorial manipulationpublish the representative-distance vector and causal source--target matrix
practice/learning substitutionend-of-practice score is reported as retention or transferfreeze delayed tests and first target trial before updates
useless variabilityaction entropy rises without outcome information or later utilityretire the schedule or use the simpler fixed/null curriculum
state-blind pacingpolicy depends on elapsed work and fails unseen resource pathwayscompare with calibrated state estimation and constrained control
single-score readinessone sensor or aggregate certifies broad capabilityuse action-specific calibrated envelopes with abstention
irreversible promotiona damaged system cannot regress after deteriorationrequire monitored stage rollback and recurrence accounting
synchrony attributioncommon-input correlation is called coordinationperturb one agent; require reciprocal compensation and lower task error
brittle team conventionco-trained teams work but turnover and cross-play failretain typed protocol, repair, and never-co-trained evaluation
deception overconfidenceconfidence rises as calibration, regret, or safety worsensadd genuine/deceptive causal controls and calibrated abstention
selection self-fulfillmentselected systems receive more opportunity and later validate the selectorfollow rejected units and estimate opportunity-mediated effects prospectively
survivor-only evaluationdropout, failure, exclusion, or missing follow-up disappearsretain every assigned unit, censoring event, and stopping decision
budget leakagehuman work, failed trials, recovery, facility, or embodied energy is omittedwithhold efficiency claim until the complete ledger closes
vocabulary-only residualordinary control, curriculum, or inference matches the resultkeep the conventional mechanism and retire the added label

Measurable predictions

F-006 contains the full protocols and hard retirement rules. The chapter-level commitments are:

IDIntervention and comparatorMeasurementsPrediction and failure boundary
RAP-01cue-window/channel interventions versus calibrated sequence prediction, retrieval, Bayesian cue model, and POMDPbits/event, calibration, commitment ms, endpoint m, unsafe events, J/eventresidual must transfer to held-out deceptive opponents and full interception; a symbolic-only gain fails
RAP-02factorial information/action/deadline/consequence/resource changes versus domain randomization, system ID, robust optimization, curriculum, and equal-sample fine-tuningcomplete source--target matrix, regret, calibration, adaptation samples, safety, lifecycle costa named factor must predict held-out transfer beyond distribution distance; “more realistic” alone fails
RAP-03history-qualified adaptive variability versus fixed schedules, augmentation, uncertainty-directed curriculum, and random searchpractice curve, delayed retention, first-trial near/far transfer, information, failures, J/runimprove transfer at equal criterion exposure and perturbation dose; entropy without utility fails
RAP-04resource-aware pacing versus state-space readiness, system ID, MPC, robust/adaptive control, risk-sensitive RL, and fixed reservetask value, output trajectory, state error, admissibility, recovery, recurrence, unsafe events, Jimprove the frontier under unseen resource pathways; equality retains the ordinary estimator/controller
RAP-05reversible staged gate versus time-only, single-score, survival, canary, runtime-assurance, and hand-authored staged rolloutfalse promotion/withholding, dwell h, recurrence, rollback, availability, review person-hours, Jimprove risk--availability on new fault classes and safely regress after deterioration
RAP-06perturbation and turnover test versus centralized/decentralized control, shared display, protocol, MARL, and common-input controllertask error, lagged compensation, belief bits/event, messages, repair s, cross-play, Jrequire useful reciprocal compensation and never-co-trained cross-play; synchrony alone fails
RAP-07deceptive-policy changes versus Bayesian opponent model, fictitious play, imitation, self-play, retrieval, robust and conformal predictionopponent bits/action, calibration, exploitability, regret, abstention, adaptation simprove calibrated adaptation at equal interactions, memory, search, and latency
RAP-08prospective selection policy versus adjusted regression, causal selection, survival, threshold lottery, and broad developmentnew-cohort calibration, capability, false-negative recovery, opportunity h, attrition, harm, person-hours, Jimprove sustainable capability without manufacturing validity through unequal opportunity
RAP-09complete F-006 composition versus the strongest compatible conventional stackall protected outcomes, events, steps, bytes, seconds, person-hours, lifecycle J, damage, withheld opportunityrequire non-inferiority on protected outcomes and a preregistered Pareto resource gain across tasks, histories, opponents, states, sites, models, and hardware

Mechanism ablations are selective: removing actual-channel state should damage cue interventions; removing resource state should damage pacing and recovery; removing reversible stages should damage recurrence or availability; removing team-belief state should damage turnover and cross-play; removing selection lineage should damage prospective calibration. If every ablation merely reduces capacity and degrades every outcome, the proposed modules have not isolated their claimed roles.