Research portal

Mathematical note

Representative adaptive-performance contract

math/representative-adaptive-performance.md

Edition
Site v0.3.0 · continuous main snapshot
Source revision
ec2865b0eac15148675c629981a545632b3571c5
Extent
2,095 words
Public route
https://www.cordana.dev/math/representative-adaptive-performance/
Mapped records12 mapped records

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

This note formalizes Fixture F-006 from the sports expertise, adaptive performance, and team coordination audit. It supplies a comparison contract for Candidate 002, Candidate 004, Candidate 006, Candidate 007, Candidate 009, Candidate 012, Candidate 014, and Candidate 019. It creates no new candidate.

Versioned episode state

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 the physical state, rules, task geometry, deadline, consequence, and hidden regime of episode ee;
  • Oi,eO_{i,e} is the information actually received by agent ii, including source, support, latency in seconds, occlusion, noise, loss, and calibration;
  • Ai,eA_{i,e} is the feasible action set under the current body, actuator, equipment, authority, rate, range, and safety constraints;
  • Hi,eH_{i,e} is the timestamped acquisition and selection history: practice, feedback, opponents, teammates, injury or faults, prior exclusions, and opportunities that were offered or withheld;
  • MeM_e is the teammate and opponent roster, role assignment, policy history, turnover event, and communication topology;
  • Fi,eF_{i,e} is the feedback channel, its delay in seconds, its information in bits, and the party choosing when it is supplied;
  • Ri,eR_{i,e} is the resource and fatigue state, with each component stored in its native unit rather than collapsed into a readiness score;
  • Di,eD_{i,e} is the damage or fault state, diagnostic uncertainty, protected capability envelope, and current return stage;
  • Gi,eG_{i,e} is the selection and opportunity policy that determines access to training, roles, observation, intervention, and later outcome measurement;
  • CeC_e is the randomized intervention, control, counterfactual pair, and stopping rule;
  • UeU_e is the sampling unit, such as action, possession, episode, agent, dyad, team, site, season, or cohort; and
  • BeB_e is the complete resource ceiling: events, bytes, seconds, person-hours, joules, damage, unsafe events, replacements, and opportunity.

The comparison estimand for method mm and literal outcome kk 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 is measured in the registered unit for outcome kk. A contrast Qm,kQb,kQ_{m,k}-Q_{b,k} against baseline bb is uninterpretable when any element of K\mathcal K differs without a registered intervention or adjustment.

Outcome firewall

No scalar “performance” score may replace the following vector:

Y=(Yant,Yint,Ycue,Yprac,Yret,Ytr,Yexp,Yadapt,Ypace,Yready,Yreturn,Yteam,Ydec,Ytal,C).\mathbf Y= (Y^{\mathrm{ant}},Y^{\mathrm{int}},Y^{\mathrm{cue}},Y^{\mathrm{prac}}, Y^{\mathrm{ret}},Y^{\mathrm{tr}},Y^{\mathrm{exp}},Y^{\mathrm{adapt}}, Y^{\mathrm{pace}},Y^{\mathrm{ready}},Y^{\mathrm{return}}, Y^{\mathrm{team}},Y^{\mathrm{dec}},Y^{\mathrm{tal}},\mathbf C).

The components and their units are:

SymbolOutcomeRequired literal measurement and unit
YantY^{\mathrm{ant}}anticipationproper predictive score in bits per event, calibration error dimensionless, commitment latency in milliseconds
YintY^{\mathrm{int}}physical interceptionsuccess probability dimensionless, endpoint error in metres, movement onset in milliseconds, unsafe-event probability dimensionless
YcueY^{\mathrm{cue}}cue usecausal score change under a declared cue intervention, in bits per event or the registered task unit
YpracY^{\mathrm{prac}}practice performanceliteral task quality by attempt number and exposure time in seconds
YretY^{\mathrm{ret}}delayed retentiontask quality after a delay Δtret\Delta t_{\mathrm{ret}} in hours or days without the training scaffold
YtrY^{\mathrm{tr}}transfersource-to-target task quality and gap in the literal task unit
YexpY^{\mathrm{exp}}explorationaction and outcome entropy in bits, action--outcome information in bits, coverage dimensionless, and later utility
YadaptY^{\mathrm{adapt}}adaptability and recoveryperturbation loss, time to regain the envelope in seconds, overshoot, recurrence probability, and residual damage
YpaceY^{\mathrm{pace}}pacingpower in watts or action intensity in its declared unit as a time series, plus terminal task quality
YreadyY^{\mathrm{ready}}fatigue and readinesstask-specific capacity change, state-estimation error, calibrated admissibility, abstention, and recovery time
YreturnY^{\mathrm{return}}staged returnfalse promotion, false withholding, stage dwell time in hours, recurrence, rollback, availability, and collateral loss
YteamY^{\mathrm{team}}coordination and shared informationteam task quality, task-variable variance, compensation lag in seconds, belief log loss in bits per event, messages, bytes, cross-play, and repair latency
YdecY^{\mathrm{dec}}deception and opponent adaptationopponent log loss in bits per action, calibration, exploitability, regret, abstention utility, and adaptation time
YtalY^{\mathrm{tal}}talent predictionprospective calibration, false-negative recovery, later capability, attrition, opportunity received, and subgroup error
C\mathbf Ccomplete efficiencyevents, bytes, wall-seconds, person-hours, joules, equipment, damage, unsafe events, replacements, and opportunity cost as separate axes

Representative distance is a vector

Let PtrP_{\mathrm{tr}} and PteP_{\mathrm{te}} be the training and target distributions. Register

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 dOd_O compares received information, dAd_A feasible actions, dTd_T deadline and consequence, dMd_M teammate/opponent composition and policy, dFd_F feedback, dRd_R resource state, dDd_D damage/return state, and dGd_G selection/opportunity policy. Each dzd_z is a declared divergence between the corresponding marginals or conditionals under PtrP_{\mathrm{tr}} and PteP_{\mathrm{te}}. It is dimensionless for a statistical divergence and has the registered ground-cost unit for optimal transport. No unreported weighted sum is a valid “representativeness” score.

For source stratum ss and target stratum tt, preserve the transfer matrix

Qm,sttr=E[Ytrdo(m),s,t],Gm,st=Qm,sstrQm,sttr,Q^{\mathrm{tr}}_{m,s\rightarrow t} =\mathbb E[Y^{\mathrm{tr}}\mid do(m),s,t], \qquad G_{m,s\rightarrow t} =Q^{\mathrm{tr}}_{m,s\rightarrow s}-Q^{\mathrm{tr}}_{m,s\rightarrow t},

where both QtrQ^{\mathrm{tr}} and the transfer gap GG use the registered task unit. Report GG separately by cue, feasible action, opponent, feedback, resource, damage, and selection-policy changes.

Anticipation, interception, and cue use

For NN independent events, outcome yny_n, actual observation history on,τo_{n,\le\tau} available by occlusion time τ\tau in seconds, and predictive distribution pmp_m, define

Lm(τ)=1Nn=1Nlog2pm(ynon,τ),L_m(\tau)=-\frac{1}{N}\sum_{n=1}^{N} \log_2 p_m(y_n\mid o_{n,\le\tau}),

where LmL_m is log loss in bits per event. For information channel cc, the registered causal cue value is

Vm,c(τ)=Lm,c(τ)Lm,all(τ),V_{m,c}(\tau)=L_{m,-c}(\tau)-L_{m,\mathrm{all}}(\tau),

also in bits per event. Here Lm,cL_{m,-c} is measured under removal or neutralization of channel cc, not inferred from gaze or saliency. Predictive regulation must additionally retain false-alarm action, reserve debit, recovery, and cumulative exposure instead of treating cue value as the whole outcome (C-1494).

Physical coupling is reported separately as

Im=(phit,eend,tmove,punsafe),I_m=(p_{\mathrm{hit}},e_{\mathrm{end}},t_{\mathrm{move}},p_{\mathrm{unsafe}}),

where phitp_{\mathrm{hit}} is dimensionless interception success, eende_{\mathrm{end}} is endpoint error in metres, tmovet_{\mathrm{move}} is movement onset in milliseconds, and punsafep_{\mathrm{unsafe}} is dimensionless unsafe-event probability. Label or joystick accuracy cannot substitute for ImI_m.

Practice, retention, transfer, and exploration

Let qm(n,t)q_m(n,t) be literal task quality after attempt nn and exposure time tt in seconds. Keep three estimands:

Qmprac(n)=qm(n,tn),Qmret(Δt)=qm(nlast,tlast+Δt),Qm,sttr=qm on target t,Q^{\mathrm{prac}}_m(n)=q_m(n,t_n), \qquad Q^{\mathrm{ret}}_m(\Delta t)=q_m(n_{\mathrm{last}},t_{\mathrm{last}}+\Delta t), \qquad Q^{\mathrm{tr}}_{m,s\rightarrow t}=q_m\text{ on target }t,

where Δt\Delta t is the scaffold-free retention delay in hours or days. The first target trial Qm,sttr,1Q^{\mathrm{tr},1}_{m,s\rightarrow t} is frozen before any target update; later adaptation is a separate curve.

For action variable AA and reached-outcome variable ZZ, exploration is

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,C_m\right),

where both entropies and mutual information are in bits, KmK_m is coverage of the registered feasible region as a dimensionless fraction, QmtrQ^{\mathrm{tr}}_m is later transfer in its task unit, and CmC_m is the separate cost vector. Higher action entropy without outcome information or later utility is not useful exploration.

After a perturbation at time t0t_0, define recovery time

Tmrec=inf{tt0: qm(u)Aq for every u[t,t+h]},T^{\mathrm{rec}}_m= \inf\left\{t-t_0:\ q_m(u)\in\mathcal A_q \text{ for every }u\in[t,t+h]\right\},

where TmrecT^{\mathrm{rec}}_m and the stability horizon hh are in seconds, qm(u)q_m(u) is task quality in its registered unit, and Aq\mathcal A_q is the preregistered admissible quality envelope. Overshoot, recurrence, and damage are additional axes rather than hidden inside TmrecT^{\mathrm{rec}}_m.

Resource state, pacing, and readiness

Let external power P(t)P(t) be in watts over event duration TT in seconds. The external work is

Eext=0TP(t)dt,E_{\mathrm{ext}}=\int_0^T P(t)\,dt,

where EextE_{\mathrm{ext}} is in joules. Metabolic, device, facility, embodied, and lifecycle energy use different boundaries and remain separate ledger rows.

A resource-qualified controller has the form

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 is the estimated damage state, sts_t is remaining work in metres, seconds, events, or joules, π^opp,t\widehat\pi_{\mathrm{opp},t} is the opponent-policy estimate, b^team,t\widehat b_{\mathrm{team},t} is the teammate-state estimate, and ftf_t is available feedback. Each estimate and channel receives its own ablation.

Readiness is a calibrated action envelope rather than a score:

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 feasible action set, Zt:t+hZ_{t:t+h} is the multidomain outcome vector over horizon hh in hours, Zsafe\mathcal Z_{\mathrm{safe}} is the registered safe envelope, It\mathcal I_t is information available at decision time, and α\alpha is the dimensionless tolerated risk. Empty envelopes require abstention or escalation.

Staged and reversible return

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 is admissible only if

gt+1=gt+1andPr(Zt:t+hAgt+1It)1αgt+1,g_{t+1}=g_t+1 \quad\text{and}\quad \Pr(Z_{t:t+h}\in\mathcal A_{g_t+1}\mid\mathcal I_t) \ge 1-\alpha_{g_t+1},

where Ag\mathcal A_g is the multidomain admissible envelope for stage gg, hh is the follow-up horizon in hours or days, and αg\alpha_g is its dimensionless risk tolerance. If the current envelope is violated, the gate must allow

gt+1<gt.g_{t+1}<g_t.

Report false promotion, false withholding, dwell time in hours, recurrence, rollback count, availability, damage, and human adjudication hours separately.

Team coordination and shared information

For task variable z(t)z(t) and agent contribution ui(t)u_i(t), perturb agent ii by do(ηi)do(\eta_i) 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 \ell is lag in seconds and XtX_t is task state. Compensation requires both a registered response in Γij\Gamma_{ij} and reduced task-variable error. Here uiu_i and uju_j are recorded in their native contribution units, ηi\eta_i is a registered perturbation in the unit of agent ii's action or state, and Γij\Gamma_{ij} has the product unit of the two contributions; correlation or synchrony without intervention is insufficient. Common-drive and edge-intervention controls are therefore mandatory before mapped synchrony can be credited with useful coordination (C-1495).

For teammate jj's future action or intent bj,nb_{j,n} and agent ii's predictive belief pip_i, shared-information quality is

Lij=1Nn=1Nlog2pi(bj,nhi,n),L_{i\rightarrow j}=-\frac{1}{N}\sum_{n=1}^{N} \log_2 p_i(b_{j,n}\mid h_{i,n}),

where LijL_{i\rightarrow j} is in bits per event, hi,nh_{i,n} is information actually available to ii, and NN is the number of independent team events. Report it under message ablation, teammate turnover, role reassignment, and never-co-trained cross-play alongside messages, bytes, latency, repair, and task quality.

Deception and opponent adaptation

For opponent action anoppa^{\mathrm{opp}}_n, available history hnh_n, and estimate π^m\widehat\pi_m, define

Lmopp=1Nn=1Nlog2π^m(anopphn),L^{\mathrm{opp}}_m=-\frac{1}{N}\sum_{n=1}^{N} \log_2\widehat\pi_m(a^{\mathrm{opp}}_n\mid h_n),

in bits per opponent action. For matched genuine and deceptive interventions,

Δm,kdec=Qm,k ⁣(do(deceptive))Qm,k ⁣(do(genuine)),\Delta^{\mathrm{dec}}_{m,k}= Q_{m,k}\!\left(do(\mathrm{deceptive})\right)- Q_{m,k}\!\left(do(\mathrm{genuine})\right),

where kk names a literal outcome and the difference retains its unit. Report calibration, confidence, exploitability, regret, abstention utility, and adaptation time separately under known, held-out, changing, and colluding opponents.

Selection, opportunity, and prospective prediction

Let Si{0,1}S_i\in\{0,1\} denote selection, ZiZ_i preselection evidence, Oi+O^{+}_i postdecision opportunity in hours or task exposures, and YifutureY^{\mathrm{future}}_i later capability in its task unit. The prospective selection-policy estimand is

Δsel(z)=E ⁣[Yifuturedo(Si=1),Zi=z]E ⁣[Yifuturedo(Si=0),Zi=z].\Delta^{\mathrm{sel}}(z)= \mathbb E\!\left[Y^{\mathrm{future}}_i\mid do(S_i=1),Z_i=z\right] -\mathbb E\!\left[Y^{\mathrm{future}}_i\mid do(S_i=0),Z_i=z\right].

It cannot be estimated by comparing selected survivors with excluded agents when selection changes Oi+O^{+}_i, coaching, opponents, follow-up, attrition, or injury exposure. Report prospective calibration in new cohorts, selection and opportunity rates, false-negative recovery, attrition, censoring, subgroup error, later capability, and complete development cost.

Complete efficiency and equal budgets

For method mm, retain lifecycle energy

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 EE term is in joules under one declared service interval. The terms denote training, inference, sensing, actuation, communication, facility, recovery, maintenance, and amortized embodied energy, respectively.

Human effort is

Hmhuman=Hmdesign+Hmcoach+Hmdemo+Hmlabel+Hmtune+Hmmonitor+Hmrepair+Hmmedical,H^{\mathrm{human}}_m= H^{\mathrm{design}}_m+H^{\mathrm{coach}}_m+H^{\mathrm{demo}}_m+ H^{\mathrm{label}}_m+H^{\mathrm{tune}}_m+H^{\mathrm{monitor}}_m+ H^{\mathrm{repair}}_m+H^{\mathrm{medical}}_m,

where each term is in person-hours and roles are reported separately. The complete cost vector is

Cm=(Nevent,Nstep,Nquery,Nbyte,Twall,Hhuman,Elife,Nunsafe,Dharm,Copp),\mathbf C_m= (N_{\mathrm{event}},N_{\mathrm{step}},N_{\mathrm{query}},N_{\mathrm{byte}}, T_{\mathrm{wall}},H^{\mathrm{human}},E^{\mathrm{life}},N_{\mathrm{unsafe}}, D_{\mathrm{harm}},C_{\mathrm{opp}}),

where the four NN terms count events, environment or optimization steps, queries, and bytes; TwallT_{\mathrm{wall}} is wall time in seconds; HhumanH^{\mathrm{human}} is person-hours; ElifeE^{\mathrm{life}} is joules; NunsafeN_{\mathrm{unsafe}} counts unsafe events; DharmD_{\mathrm{harm}} is damage in a registered physical or severity unit; and CoppC_{\mathrm{opp}} is withheld opportunity in task exposures or person-hours.

Method mm is feasible only if

CmB,\mathbf C_m\preceq\mathbf B,

where B\mathbf B is the preregistered componentwise ceiling with the same units. A complete efficiency claim requires non-inferiority on every protected outcome and a Pareto improvement on at least one preregistered resource axis. An over-budget run is infeasible, not a score to normalize afterward.

Confirmatory contrast and retirement

Let b(t)b^*(t) be the strongest mature baseline for track tt, selected on development data before confirmatory outcomes open. For protected outcome set Pt\mathcal P_t, retain a residual only when

Pr ⁣(Qm,kQb(t),k>δt,k for every kPt)1αt,\Pr\!\left( Q_{m,k}-Q_{b^*(t),k}>\delta_{t,k} \text{ for every }k\in\mathcal P_t \right)\ge 1-\alpha_t,

where δt,k\delta_{t,k} is the preregistered improvement or non-inferiority margin in the unit of outcome kk, and αt\alpha_t is the dimensionless error budget. The contrast must survive actual-channel, feasible-action, history, opponent/team, feedback, resource, damage, selection, and complete-cost ablations on held-out task, model, site, and hardware strata. Otherwise retire the mechanism claim while preserving the measurement contract.