$$ \newcommand{\AbsoluteConicImageEntry}{B} \newcommand{\AbsoluteConicImageMatrix}{\mathbf{B}} \newcommand{\AbsoluteConicVector}{\mathbf{b}} \newcommand{\AcceleratedEpisodeTime}{T'} \newcommand{\AcceleratedFractionSpeedup}{G} \newcommand{\AccelerationNoiseDensityMatrix}{\mathbf{Q}_c} \newcommand{\AccelerationNoiseSpectralDensity}{q_c} \newcommand{\AccelerationWhiteNoise}{w} \newcommand{\AcceleratorBatchTime}{T_{\text{GPU}}} \newcommand{\AcceleratorConsumptionRate}{R_{\text{accel}}} \newcommand{\AcceleratorCount}{N_{\text{GPU}}} \newcommand{\AcceleratorDataConsumptionRate}{R_{\text{consumption}}} \newcommand{\AcceleratorGain}{G_{\text{accel}}} \newcommand{\AcceleratorHourlyPrice}{R_{\text{GPU/hr}}} \newcommand{\AcceleratorMemoryBandwidth}{\text{BW}_{\text{accelerator}}} \newcommand{\AcceleratorRailVoltage}{V_{\text{rail}}} \newcommand{\AcceleratorSecondsPerQuery}{S_{\text{GPU/query}}} \newcommand{\AcceleratorSupplyCurrent}{i} \newcommand{\AcceleratorTargetQueryRate}{R_{\text{GPU,target}}} \newcommand{\AcceleratorsPerNode}{G_{\text{node}}} \newcommand{\AccelerometerBias}{b_a} \newcommand{\AcceptanceFraction}{\alpha} \newcommand{\AcceptanceIntervalLowerLimit}{L} \newcommand{\AcceptanceIntervalUpperLimit}{U} \newcommand{\AcceptanceProbability}{p_{\text{acc}}} \newcommand{\AcceptedInfluences}{\text{Inf}} \newcommand{\AcceptedInputSet}{\mathcal{A}_{\tau}} \newcommand{\AcceptedLabelCount}{d} \newcommand{\AcceptedOutcomePayoff}{V} \newcommand{\AcceptedSampleCount}{X} \newcommand{\AcceptedTaskMeanCost}{C_{\text{succ}}} \newcommand{\AcceptedTasks}{N_{\text{acc}}} \newcommand{\AcceptingStateSet}{F} \newcommand{\AccessAttemptTime}{t} \newcommand{\AccountQueryDistribution}{p_{\text{user}}} \newcommand{\AccumulatedProcessNoiseCovariance}{\mathbf{Q}_d} \newcommand{\AccumulatedSyncTime}{T_{\text{sync}}} \newcommand{\AccumulatedUpdateTime}{T_{\text{effective}}} \newcommand{\AccumulationStepCount}{k} \newcommand{\AccuracyAfterDeployment}{\text{Accuracy}} \newcommand{\AccuracyDecayRate}{\gamma} \newcommand{\AccuracyPayoffPerQuery}{V} \newcommand{\AchievedBrakingDeceleration}{a} \newcommand{\AchievedKernelBandwidth}{\text{BW}_{\text{effective}}} \newcommand{\AcquisitionEpoch}{t_{\text{acq}}} \newcommand{\ActVariationalObjective}{\mathcal{L}_{\text{ACT}}} \newcommand{\ActionBinCount}{B} \newcommand{\ActionChunk}{\mathbf{A}} \newcommand{\ActionChunkHorizon}{H} \newcommand{\ActionChunkIndex}{k} \newcommand{\ActionDimension}{d_a} \newcommand{\ActionExecutionRate}{f_{\text{exec}}} \newcommand{\ActionFilterCutoffFrequency}{f_{\text{cutoff}}} \newcommand{\ActionLowerBound}{\mathbf{a}_{\min}} \newcommand{\ActionMagnitudeBound}{a_{\max}} \newcommand{\ActionRangeMaximum}{a_{\max}} \newcommand{\ActionRangeMinimum}{a_{\min}} \newcommand{\ActionRecoverableFraction}{\rho_{a}} \newcommand{\ActionResidualVector}{\mathbf{r}} \newcommand{\ActionSpace}{\mathcal{A}} \newcommand{\ActionTokenPrefix}{a_{<j}} \newcommand{\ActionUpperBound}{\mathbf{a}_{\max}} \newcommand{\ActivationCheckpointCount}{n_{\text{ckpt}}} \newcommand{\ActivationFunction}{f} \newcommand{\ActivationInput}{x} \newcommand{\ActivationLipschitzBound}{L_{\phi}} \newcommand{\ActivationMatrix}{\mathbf{A}} \newcommand{\ActivationMemory}{M_{\text{activations}}} \newcommand{\ActivationPayloadSize}{M_{\text{act}}} \newcommand{\ActivationStagingTime}{t_{\text{activate}}} \newcommand{\ActivationVector}{\mathbf{a}} \newcommand{\ActiveContactIndex}{k} \newcommand{\ActiveControlTorque}{\mathbf{u}_{\text{active}}} \newcommand{\ActiveInferencePower}{P_{\text{active}}} \newcommand{\ActiveLeaseCount}{N_{\text{active}}} \newcommand{\ActiveMotionDuration}{T_{\text{motion}}} \newcommand{\ActiveParameterCount}{P_{\text{model}}} \newcommand{\ActivePrefillRequestSet}{\mathcal{P}_{\text{active}}} \newcommand{\ActiveSchemaSet}{\mathcal{S}} \newcommand{\ActiveTargetTokenCount}{N_{\text{active}}} \newcommand{\ActorAccelerationBound}{a_{k,\max}} \newcommand{\ActorBodyRadius}{r} \newcommand{\ActorUpdateDelayCount}{d} \newcommand{\ActuatedJointAccelerations}{\ddot{\mathbf{q}}_j} \newcommand{\ActuatedJointBiasForces}{\mathbf{h}_j} \newcommand{\ActuatedJointCoordinates}{\mathbf{q}_j} \newcommand{\ActuationSelectionBaseBlock}{\mathbf{S}_b} \newcommand{\ActuationSelectionMatrix}{\mathbf{S}} \newcommand{\ActuatorAxisCount}{N_{\text{axes}}} \newcommand{\ActuatorBiasEffort}{u_{\text{bias}}} \newcommand{\ActuatorCyclePeriod}{t_{\text{cycle}}} \newcommand{\ActuatorDutyCycle}{D_{\text{cycle}}} \newcommand{\ActuatorEffort}{u} \newcommand{\ActuatorOffTime}{t_{\text{off}}} \newcommand{\ActuatorOnTime}{t_{\text{on}}} \newcommand{\ActuatorResponseTime}{T_{\text{act}}} \newcommand{\ActuatorTorqueLowerBound}{\mathbf{u}_{\min}} \newcommand{\ActuatorTorqueUpperBound}{\mathbf{u}_{\max}} \newcommand{\AdamFirstMoment}{m} \newcommand{\AdamMomentDecayRate}{\beta} \newcommand{\AdamSecondMoment}{v} \newcommand{\AdaptationEnergyAllowance}{E_{\text{slack}}} \newcommand{\AdaptationInvestmentCost}{C_{\text{invest}}} \newcommand{\AdaptationLatencyIncrease}{\Delta L_{\text{lat,fg}}^{\text{wc}}} \newcommand{\AdaptationModule}{g_{\psi}} \newcommand{\AdaptationPeakMemory}{M_{\text{peak}}} \newcommand{\AdaptationPowerIncrement}{P_{\text{update}}} \newcommand{\AdaptationWindowEnergy}{E_{\text{update}}} \newcommand{\AdaptedHiddenActivation}{\mathbf{h}'} \newcommand{\AdaptedTaskCost}{C_{\text{task, adapt}}} \newcommand{\AdaptedWeightMatrix}{\mathbf{W}_{\text{adapted}}} \newcommand{\AdapterActivationFunction}{\sigma} \newcommand{\AdapterAssignmentVector}{\mathbf{m}} \newcommand{\AdapterDownProjectionMatrix}{\mathbf{A}} \newcommand{\AdapterIndex}{k} \newcommand{\AdapterInitializationStandardDeviation}{\sigma} \newcommand{\AdapterRank}{r} \newcommand{\AdapterScalingFactor}{\gamma} \newcommand{\AdapterUpProjectionMatrix}{\mathbf{B}} \newcommand{\AdjacentNeighboringDataset}{X'} \newcommand{\AdjacentQueryResult}{v'} \newcommand{\AdminLeaseTime}{T_{\text{admin}}} \newcommand{\AdmissibleBacklogCount}{n} \newcommand{\AdmissibleControlSet}{\mathcal{U}_{\text{adm}}} \newcommand{\AdmissibleDisturbanceSet}{\mathcal{W}} \newcommand{\AdmissionCheckCount}{n_{\text{chk}}} \newcommand{\AdmissionCheckIndex}{i} \newcommand{\AdmissionDecisionEvent}{e_{\text{auth}}} \newcommand{\AdmissionInclusivePrebrakeDelay}{T_{\text{true}}} \newcommand{\AdmissionRouteYield}{Y} \newcommand{\AdmittedAttemptCap}{N} \newcommand{\AdmittedCommand}{u} \newcommand{\AdmittedContactForce}{F^*} \newcommand{\AdmittedControlCommand}{\mathbf{u}} \newcommand{\AdmittedSpeedCommand}{v^*} \newcommand{\AdmittedTargetPosition}{\hat{\mathbf{p}}_{\text{target}}} \newcommand{\AdmittedWorkUnitCount}{m} \newcommand{\AdvantageStabilizer}{\epsilon_{\text{stab}}} \newcommand{\AdversarialDisturbance}{\mathbf{d}} \newcommand{\AdversarialExample}{x_{\text{adv}}} \newcommand{\AdversarialInputLength}{n} \newcommand{\AdversarialPenaltyWeight}{\lambda_{\text{adv}}} \newcommand{\AdversarialPerturbation}{\boldsymbol{\delta}_{\text{adv}}} \newcommand{\AdversarialPerturbationBudget}{\epsilon_{\text{adv}}} \newcommand{\AdversaryLoss}{\mathcal{L}_{\text{adv}}} \newcommand{\AffordanceFrame}{\mathcal{F}_{\text{affordance}}} \newcommand{\AffordanceSuccessEstimate}{V_{\text{policy}}} \newcommand{\AgeBlindTravel}{\Delta x_{\text{blind}}} \newcommand{\AgeCheckInstant}{t_{\text{curr}}} \newcommand{\AggregateServerPower}{P_{\text{servers}}} \newcommand{\AggregateSlotWork}{W} \newcommand{\AggregatedRecoveryDataset}{\mathcal{D}} \newcommand{\AggregatedSurrogateLoss}{\epsilon_N} \newcommand{\AggregationLearnedPolicy}{\hat{\pi}} \newcommand{\AggregationLearnerStateDistribution}{d_{\hat{\pi}_i}} \newcommand{\AggregationRoundCount}{N} \newcommand{\AggregationRoundIndex}{i} \newcommand{\AggregationRoundTrajectorySet}{\mathcal{T}} \newcommand{\AiStandaloneSensitivity}{S_{\text{AI}}} \newcommand{\AisleTravelSpeed}{v_{\text{aisle}}} \newcommand{\AisleWidth}{w} \newcommand{\AlertCheckCount}{N_{\text{tests}}} \newcommand{\AlertFalsePositiveRate}{\alpha_{\text{fp}}} \newcommand{\AlgorithmTaxonomyAxis}{\mathsf{Algorithm}} \newcommand{\AliasedVibrationFrequency}{f_{\text{alias}}} \newcommand{\AliasingHarmonicIndex}{k} \newcommand{\AllGatherCompletionTime}{T_{\text{allgather}}} \newcommand{\AllOnesVector}{\mathbf{1}} \newcommand{\AllReduceCompletionTime}{T_{\text{allreduce}}} \newcommand{\AllReduceMinimumBandwidthTime}{T_{\text{bandwidth}}^{\text{min}}} \newcommand{\AllRunsPassEstimate}{\widehat{r}} \newcommand{\AllToAllCompletionTime}{T_{\text{alltoall}}} \newcommand{\AllToAllExchangeTime}{T} \newcommand{\AllocatedBlockCount}{N_{\text{blocks}}} \newcommand{\AllocatedHazardRate}{\lambda_{\text{alloc}}} \newcommand{\AllocatedWallTime}{T_{\text{wall}}} \newcommand{\AllowableCollisionEnergy}{E_{k, \text{allow}}} \newcommand{\AllowableRailDroop}{\Delta V_{\text{droop, max}}} \newcommand{\AllowableRailExcursion}{\Delta V_{\max}} \newcommand{\AllowableWindingTemperatureRise}{\Delta T_{\max}} \newcommand{\AllowedTokenSet}{\mathcal{V}_{\text{allow}}} \newcommand{\AllowedViolationFraction}{V^{\text{allow}}} \newcommand{\AlphabetByte}{b} \newcommand{\AlternateModelInput}{x'} \newcommand{\AmbientDimension}{D} \newcommand{\AmbientTemperature}{T_{\text{amb}}} \newcommand{\AmortizedTurnCost}{\bar{C}_{\text{turn}}} \newcommand{\AngularAcceleration}{\boldsymbol{\alpha}} \newcommand{\AngularClearance}{\theta_{\text{clear}}} \newcommand{\AngularClearanceRate}{\dot{\theta}_{\text{clear}}} \newcommand{\AngularFrequency}{\omega} \newcommand{\AngularSpeed}{\omega} \newcommand{\AngularVelocity}{\boldsymbol{\omega}} \newcommand{\AngularVelocityDerivative}{\dot{\boldsymbol{\omega}}} \newcommand{\AnnualQueryVolume}{Q_{\text{annual}}} \newcommand{\AnonymitySetSize}{k_{\text{anon}}} \newcommand{\AntiWindupTrackingTimeConstant}{T_t} \newcommand{\AntialiasingFilterVariance}{s} \newcommand{\ApiAccount}{u} \newcommand{\ApparentContrast}{C} \newcommand{\AppearanceRealityGap}{\Delta_{\text{vis}}} \newcommand{\AppliedForce}{F} \newcommand{\AppliedLoadCycleCount}{n} \newcommand{\ApproachChannelCount}{K_a} \newcommand{\ApproachDirection}{\hat{\mathbf{a}}_{\text{approach}}} \newcommand{\ApproachPosition}{x} \newcommand{\ApproachPredicate}{P_{\text{approach}}} \newcommand{\ApproachSpeed}{v_{\text{app}}} \newcommand{\ApprovalCatchFraction}{q} \newcommand{\ApprovalHeldTrajectories}{N_{\text{held}}} \newcommand{\ApproximatingDistribution}{q} \newcommand{\ArbitrationFieldBitCount}{B_{\text{arb},i}} \newcommand{\ArcObstacleDistance}{d_{\text{arc}}} \newcommand{\ArchitectureResourceCost}{C} \newcommand{\ArchitectureSearchSpace}{\mathcal{A}} \newcommand{\ArcsineEffectSize}{h} \newcommand{\ArgumentLegConfidence}{r} \newcommand{\ArgumentLegCount}{m} \newcommand{\ArithmeticIntensity}{I} \newcommand{\ArmStoppingDeceleration}{a_{\text{arm}}} \newcommand{\ArmSuccessProbability}{p} \newcommand{\ArmingSettleDuration}{t_{\text{settle}}} \newcommand{\ArrivalOffsetTravel}{\Delta x} \newcommand{\ArrivalRate}{\lambda_{\text{arr}}} \newcommand{\ArrivalStampOffset}{\Delta t_{\text{recv}}} \newcommand{\ArrivalTimestamp}{t_{\text{recv}}} \newcommand{\ArtifactVersion}{v} \newcommand{\AssessedContactForceLimit}{F_{\text{limit}}} \newcommand{\AssignedJobGpu}{g} \newcommand{\AssociationCostEntry}{c} \newcommand{\AssuranceClaim}{C} \newcommand{\AsymptoticTightBound}{\Theta} \newcommand{\AtmosphericExtinctionCoefficient}{\beta_{\text{atm}}} \newcommand{\AttackStepsPgd}{K_{\text{PGD}}} \newcommand{\AttackedTrialCount}{n} \newcommand{\AttainableComputeRate}{R_{\text{attain}}} \newcommand{\AttemptCleanupCost}{C_{\text{cleanup}}} \newcommand{\AttemptCost}{C_{\text{attempt}}} \newcommand{\AttemptCycleDuration}{t_{\text{cyc}}} \newcommand{\AttemptDuration}{t_{\text{att}}} \newcommand{\AttemptGenerationTime}{T_{\text{gen}}} \newcommand{\AttemptPassProbability}{p} \newcommand{\AttemptRuntimeOverheadCost}{C_{\text{runtime}}} \newcommand{\AttemptVerificationCost}{C_{\text{verify}}} \newcommand{\AttentionHeadCount}{N_{\text{heads}}} \newcommand{\AttentionHeadDimension}{d_{\text{head}}} \newcommand{\AttentionHeadIndex}{i} \newcommand{\AttentionHeadOutput}{\mathbf{O}} \newcommand{\AttentionKeyMatrix}{\mathbf{K}} \newcommand{\AttentionOutputMatrix}{\mathbf{O}} \newcommand{\AttentionOutputProjectionMatrix}{\mathbf{W}_{O}} \newcommand{\AttentionQueryMatrix}{\mathbf{Q}} \newcommand{\AttentionScoreEntry}{S_{ij}} \newcommand{\AttentionScoreMatrix}{\mathbf{S}} \newcommand{\AttentionScoreRow}{\mathbf{S}_{i, \cdot}} \newcommand{\AttentionScoreSummand}{S_{ik}} \newcommand{\AttentionScoreTile}{\mathbf{S}_{ij}} \newcommand{\AttentionValuesMatrix}{\mathbf{V}} \newcommand{\AttentionValuesProjectionMatrix}{\mathbf{W}_{V}} \newcommand{\AttentionValuesSourceMatrix}{\mathbf{X}_{V}} \newcommand{\AttentionValuesVector}{\mathbf{v}} \newcommand{\AttentionWeightEntry}{A_{ij}} \newcommand{\AttentionWeightMatrix}{\mathbf{A}} \newcommand{\AttentionWeightVector}{\mathbf{a}} \newcommand{\AttitudeError}{\theta_{\text{att}}} \newcommand{\AttributionFeatureCount}{n_{\text{feat}}} \newcommand{\AuditGroupRecordCount}{n_{\text{records}}} \newcommand{\AuthorityExposureLevel}{A} \newcommand{\AutocorrelationLagIndex}{k} \newcommand{\AutoencoderReconstructionError}{\mathcal{L}_{\text{rec}}} \newcommand{\AutomatedResetTime}{t_{\text{reset,auto}}} \newcommand{\AutomatonStateSet}{Q} \newcommand{\AutomatonTransitionFunction}{\delta} \newcommand{\AutonomousExecutionComputeCost}{C_{\text{compute}}} \newcommand{\AutoscalingDecisionTime}{T_{\text{decide}}} \newcommand{\AutoscalingDetectionTime}{T_{\text{detect}}} \newcommand{\AutoscalingResponseTime}{T_{\text{response}}} \newcommand{\AvailabilityObjective}{S_{\text{availability}}} \newcommand{\AvailableBrakingDistance}{D_{\text{avail}}} \newcommand{\AvailableDeceleration}{a} \newcommand{\AvailableObservations}{\mathcal{O}_{\text{avail}}} \newcommand{\AverageCopperLossPower}{\bar{P}_{\text{loss}}} \newcommand{\AverageOnlineRegret}{\gamma_N} \newcommand{\AveragePower}{P_{\text{avg}}} \newcommand{\AverageStateVisitationDistribution}{\bar{d}} \newcommand{\AxiBurstLength}{A_{\text{len}}} \newcommand{\AxisGridPointCount}{N} \newcommand{\AzimuthAngle}{\theta_{\text{az}}} \newcommand{\BackEmfVoltage}{e_{\text{bemf}}} \newcommand{\BacklashAngle}{\theta_{\text{backlash}}} \newcommand{\BackwardEulerEigenvalue}{\lambda_{\text{BE}}} \newcommand{\BackwardEulerTransitionMatrix}{\mathbf{A}_{\text{BE}}} \newcommand{\BackwardPassTime}{T_{\text{backward}}} \newcommand{\BackwardReachableTube}{\mathcal{R}} \newcommand{\BalanceDivergenceTime}{\tau_{\text{fall}}} \newcommand{\BallRadius}{r} \newcommand{\BallVolume}{V_D} \newcommand{\Bandwidth}{\text{BW}} \newcommand{\BankConflictPenalty}{\Delta t_{\text{conflict}}} \newcommand{\BarrierConstraintBound}{b_{\text{cbf}}} \newcommand{\BarrierConstraintCount}{K_b} \newcommand{\BarrierConstraintNormal}{\mathbf{a}_{\text{cbf}}} \newcommand{\BarrierFunction}{h} \newcommand{\BarrierFunctionRate}{\dot{h}} \newcommand{\BarrierHalfSpaceControlSet}{\mathcal{U}_{\text{safe}}} \newcommand{\BarrierMargin}{\delta} \newcommand{\BarrierNormalizationScale}{h_{\text{scale}}} \newcommand{\BarrierProjectionLagrangian}{L_{\text{Lag}}} \newcommand{\BarrierProjectionMultiplier}{\lambda} \newcommand{\BarrierRelativeDegree}{r} \newcommand{\BaseAbscissaVelocity}{\dot{x}} \newcommand{\BaseAccelerationCommand}{a} \newcommand{\BaseBatchSize}{B_{\text{base}}} \newcommand{\BaseCameraRotation}{\mathbf{R}_{\text{base}}^{\text{cam}}} \newcommand{\BaseCameraTransform}{\mathbf{T}_{\text{base}}^{\text{cam}}} \newcommand{\BaseCameraTranslation}{\mathbf{t}_{\text{base}}^{\text{cam}}} \newcommand{\BaseFlangeTransform}{\mathbf{T}_{\text{base}}^{\text{flange}}} \newcommand{\BaseForwardSpeed}{v} \newcommand{\BaseFramePoint}{\mathbf{p}_{\text{base}}} \newcommand{\BaseHeadingRate}{\dot{\theta}_{\text{head}}} \newcommand{\BaseJointInertiaCoupling}{\mathbf{M}_{bj}} \newcommand{\BaseLateralPosition}{y_{\text{base}}} \newcommand{\BaseLateralVelocity}{\dot{y}} \newcommand{\BaseLayerCount}{N_{L,0}} \newcommand{\BaseLearningRate}{\eta_{\text{base}}} \newcommand{\BaseLongitudinalPosition}{x_{\text{base}}} \newcommand{\BaseLongitudinalVelocity}{\dot{x}} \newcommand{\BaseOdometrySpeed}{v} \newcommand{\BaseOrdinateVelocity}{\dot{y}} \newcommand{\BasePosition}{\mathbf{p}_{\text{base}}} \newcommand{\BasePromptLength}{S_{\text{base}}} \newcommand{\BaseStoppingDistance}{d_{\text{base}}} \newcommand{\BaseToCameraTransform}{\mathbf{T}_{\text{cam} \leftarrow \text{base}}} \newcommand{\BaseTrainingComputeCost}{C_{\text{compute}}} \newcommand{\BaseTrajectoryTokenCount}{N_{\text{base}}} \newcommand{\BaseTravelDistance}{d} \newcommand{\BaseTravelSpeed}{v_{\text{base}}} \newcommand{\BaseWidthMultiplier}{w_{\text{mult},0}} \newcommand{\BaseWorkerCount}{N_{\text{base}}} \newcommand{\BaseWristTransform}{\mathbf{T}_{\text{base} \leftarrow \text{wrist}}} \newcommand{\BaseYawRateBias}{\omega_{\text{bias}}} \newcommand{\BaselineAcceptanceEstimate}{\hat{p}_{\text{base}}} \newcommand{\BaselineAnnualOperationsCost}{C_{\text{current}}} \newcommand{\BaselineControllerAction}{\mathbf{a}_t^{\text{base}}} \newcommand{\BaselineConversionRate}{p_0} \newcommand{\BaselineFeatureMean}{\mu_{\text{base}}} \newcommand{\BaselineFeatureStandardDeviation}{\sigma_{\text{base}}} \newcommand{\BaselineIntervalLowerLimit}{l_{\text{base}}} \newcommand{\BaselineIntervalUpperLimit}{u_{\text{base}}} \newcommand{\BaselineLowerLimitDistance}{\delta^-_{\text{base}}} \newcommand{\BaselineOnlyAcceptedTaskCount}{b} \newcommand{\BaselineOnlyCorrectCount}{n_{\text{base}}} \newcommand{\BaselinePolicyAcceptanceProbability}{p_{X}} \newcommand{\BaselinePolicyCost}{C_{X}} \newcommand{\BaselineStateDistribution}{d^{\pi_{\text{base}}}} \newcommand{\BaselineTaskCost}{C_{\text{task, base}}} \newcommand{\BaselineToolCallDistribution}{p_{b}} \newcommand{\BaselineTrackingError}{e_{\text{track}}} \newcommand{\BaselineTrainingDuration}{T_{\text{hours}}} \newcommand{\BaselineTrajectoryGoodput}{\mathcal{G}_{b}} \newcommand{\BaselineUpperLimitDistance}{\delta^+_{\text{base}}} \newcommand{\BatchArrivalRate}{\lambda_{\text{batch}}} \newcommand{\BatchAxisLabel}{b} \newcommand{\BatchBufferMemory}{M_{\text{batch}}} \newcommand{\BatchCostPerAcceptedTask}{C_{\text{eff,batch}}} \newcommand{\BatchDataVolume}{D_{\text{vol}}^{(\text{batch})}} \newcommand{\BatchExampleIndex}{n} \newcommand{\BatchFetchTime}{T_{\text{fetch}}} \newcommand{\BatchFillArrivalCount}{k} \newcommand{\BatchFixedOverheadTime}{T_{\text{fixed}}} \newcommand{\BatchFlushStartTime}{t_{\text{start}}} \newcommand{\BatchFormationDelay}{L_{\text{lat,form}}} \newcommand{\BatchIndex}{k} \newcommand{\BatchLabelComponent}{y_{ij}} \newcommand{\BatchLatencyEnvelope}{L_{\text{lat,envelope}}} \newcommand{\BatchLoss}{\mathcal{L}_{\text{batch}}} \newcommand{\BatchMaxOutputLength}{S_{\text{max}}} \newcommand{\BatchMaximumDeviationMultiple}{k} \newcommand{\BatchMeanOutputLength}{\bar{S}} \newcommand{\BatchNormMean}{\mu_{\mathcal{B}}} \newcommand{\BatchNormOutput}{y} \newcommand{\BatchNormRunningMean}{\boldsymbol{\mu}_{\mathcal{B}}} \newcommand{\BatchNormRunningStandardDeviation}{\boldsymbol{\sigma}_{\mathcal{B}}} \newcommand{\BatchNormStandardDeviation}{\sigma_{\mathcal{B}}} \newcommand{\BatchOperations}{O_{\text{batch}}} \newcommand{\BatchPredictedProbability}{\hat{y}_{ij}} \newcommand{\BatchProcessingTime}{T_{\text{process}}} \newcommand{\BatchRolloutCount}{N_{\text{batch}}} \newcommand{\BatchScalingFactor}{k} \newcommand{\BatchServiceTime}{T_{\text{svc}}} \newcommand{\BatchSize}{B} \newcommand{\BatchTransferTime}{T_{\text{transfer}}} \newcommand{\BatchedDecodeStepTime}{t_{\text{step}}} \newcommand{\BatchedEventIndex}{i} \newcommand{\BatchedRequestLatency}{L_{\text{lat,batch}}} \newcommand{\BatchingLatencyBudget}{L_{\text{lat,budget}}} \newcommand{\BatchingQueueWait}{L_{\text{lat,wait}}} \newcommand{\BatchingWindow}{T_{\text{window}}} \newcommand{\BatteryCellResistance}{R_{\text{cell}}} \newcommand{\BeamDivergenceAngle}{\delta\theta_{\text{div}}} \newcommand{\BeamWidth}{W} \newcommand{\BearingRay}{\mathbf{r}} \newcommand{\BeatFrequency}{f_b} \newcommand{\BehaviorCloningHorizon}{S} \newcommand{\BehaviorCloningLoss}{\mathcal{L}_{\text{BC}}} \newcommand{\BehaviorDistribution}{b} \newcommand{\BehaviorPolicyVersion}{\text{ver}_b} \newcommand{\BeliefErrorBound}{E} \newcommand{\BeliefInvalidationHorizon}{T_{\text{inv}}} \newcommand{\BeliefState}{b} \newcommand{\BellmanBackupTarget}{y} \newcommand{\BellmanErrorLoss}{\mathcal{L}_{\text{Bellman}}} \newcommand{\BelowThresholdIndicator}{\mathbf{1}_{\{|(\mathbf{W}_{\text{sparse}})_{ij}| \leq \delta_{\text{prune}}\}}} \newcommand{\BestEffortWireBitCount}{B_{\text{BE,wire}}} \newcommand{\BetterArmSuccessProbability}{p_{\text{high}}} \newcommand{\BetweenTaskStandardDeviation}{\sigma_{\text{task}}} \newcommand{\BevPillarFeature}{\mathbf{V}_{\text{BEV}}} \newcommand{\BevPillarXIndex}{X} \newcommand{\BevPillarYIndex}{Y} \newcommand{\BiasFeedbackFactor}{\alpha_{\text{fb}}} \newcommand{\BiasVector}{\mathbf{b}} \newcommand{\BilledAllocationTime}{T_{\text{total}}} \newcommand{\BinaryActivationVector}{\mathbf{a}} \newcommand{\BinaryClassifier}{h} \newcommand{\BinaryWeightVector}{\mathbf{w}} \newcommand{\BinomialSuccessCount}{X} \newcommand{\BipedTiltAcceleration}{\ddot{\theta}_{\text{tilt}}} \newcommand{\BisectionBandwidth}{\text{BW}_{\text{bisect}}} \newcommand{\BitFlippedFloatNumber}{x_{\text{corrupt}}} \newcommand{\BitTime}{T_{\text{bit}}} \newcommand{\BlackoutClockConversionError}{\Delta t_{\text{one-sigma scenario}}} \newcommand{\BlendDeadline}{t_{\text{blend}}} \newcommand{\BlendedCommandJerk}{j_{\text{cmd}}} \newcommand{\BlendedControlCommand}{\mathbf{u}_{\text{blend}}} \newcommand{\BlendedInputTokenPrice}{c_{\text{in}}} \newcommand{\BlendingTransitionWindow}{\tau_{\text{blend}}} \newcommand{\BlindTravelDistance}{d_{\text{blind}}} \newcommand{\BlockCheckTime}{T_{\text{ver}}} \newcommand{\BlockCoordinateX}{b_x} \newcommand{\BlockCoordinateY}{b_y} \newcommand{\BlockCoordinateZ}{b_z} \newcommand{\BlockEdgeVoxelCount}{n_{\text{blk}}} \newcommand{\BlockMaximum}{M} \newcommand{\BlockMaximumLevel}{z} \newcommand{\BlockMaximumLimitDistribution}{G} \newcommand{\BlockMaximumNormalizingScale}{a} \newcommand{\BlockMaximumNormalizingShift}{b} \newcommand{\BlockMetadataSize}{s_{\text{meta}}} \newcommand{\BlockQuantizationScale}{s_b} \newcommand{\BlockRangeMaximum}{x_{\max,i}} \newcommand{\BlockRangeMinimum}{x_{\min,i}} \newcommand{\BlockSampleCount}{n} \newcommand{\BlockedWorkerCount}{N_{\text{blocked}}} \newcommand{\BlockingCallTimeout}{T_{\text{out}}} \newcommand{\BlockingTaskIndex}{k} \newcommand{\BodyAcceleration}{\dot{v}} \newcommand{\BodyDisplacement}{x} \newcommand{\BodyEndEffectorTransform}{\mathbf{T}_{BE}} \newcommand{\BodyFramePoint}{\mathbf{p}_{\text{body}}} \newcommand{\BodyFramePointCovariance}{\boldsymbol{\Sigma}_{\text{body}}} \newcommand{\BodyLidarTransform}{\mathbf{T}_{bl}} \newcommand{\BodyReferenceFrame}{\mathcal{F}_B} \newcommand{\BodyRegionMass}{m_H} \newcommand{\BodySpeed}{v} \newcommand{\BoltzmannConstant}{k_B} \newcommand{\BoltzmannStateEnergy}{E} \newcommand{\BoltzmannTemperature}{T} \newcommand{\BootstrapQuantileFunction}{Q} \newcommand{\BootstrapReplicateCount}{B_{\text{boot}}} \newcommand{\BootstrapReplicateIndex}{r} \newcommand{\BottomedOutContactStiffness}{k_{\infty}} \newcommand{\BouligandContingentCone}{T_{\mathcal{C}}} \newcommand{\BoundaryConditionVector}{\mathbf{b}} \newcommand{\BoundaryLayerTime}{t_{\text{fast}}} \newcommand{\BoundedRegimeTimestamp}{t_{\text{bounded}}} \newcommand{\BoxMaximumHorizontalCoordinate}{x_{\text{max}}} \newcommand{\BoxMaximumVerticalCoordinate}{y_{\text{max}}} \newcommand{\BoxMinimumHorizontalCoordinate}{x_{\text{min}}} \newcommand{\BoxMinimumVerticalCoordinate}{y_{\text{min}}} \newcommand{\BrakeChopperResistance}{R_{\text{brake}}} \newcommand{\BrakeCommandForce}{F_{\text{cmd}}} \newcommand{\BrakeResistorPulseEnergy}{E_{\text{pulse}}} \newcommand{\BrakingDistance}{d_{\text{brake}}} \newcommand{\BrakingForce}{F_{\text{brake}}} \newcommand{\BrakingOnsetContactForce}{F_{\text{cmd}}} \newcommand{\BrakingWork}{W_{\text{brake}}} \newcommand{\BreadthCriticalPathLatency}{T^{\text{breadth}}} \newcommand{\BreadthPeakKvCacheMemory}{M_{\text{KV}}^{\text{breadth}}} \newcommand{\BreakEvenAcceptanceProbability}{p'} \newcommand{\BreakEvenBrakingDeceleration}{a} \newcommand{\BreakEvenParseFailureRate}{p_{\text{break}}} \newcommand{\BreakEvenTaskCount}{N^*} \newcommand{\BreakEvenUtilization}{u^*} \newcommand{\BreakerCooldownInterval}{T_{\text{cool}}} \newcommand{\BreakerFailureFraction}{r} \newcommand{\BreakerMinimumSampleCount}{n_{\min}} \newcommand{\BreakerOutcomeIndex}{i} \newcommand{\BreakerOutcomeWindow}{W} \newcommand{\BreakerTripThreshold}{r_{\text{trip}}} \newcommand{\BridgeTraceResistance}{R_{\text{trace}}} \newcommand{\BroadcastColumnElement}{A} \newcommand{\BroadcastColumnTensor}{\mathbf{A}} \newcommand{\BroadcastCompletionTime}{T_{\text{broadcast}}} \newcommand{\BroadcastRowElement}{b} \newcommand{\BroadcastRowTensor}{\mathbf{B}} \newcommand{\BroadcastTableSize}{s_{\text{table}}} \newcommand{\BspLearningRate}{\eta_{\text{BSP}}} \newcommand{\BsplineBasisFunction}{B} \newcommand{\BudgetEvaluationTime}{\tau} \newcommand{\BudgetFreeBalance}{F} \newcommand{\BudgetNodeIndex}{k} \newcommand{\BudgetReservedFunds}{R} \newcommand{\BudgetSettledCharges}{E} \newcommand{\BudgetedAcceptanceProbability}{q_{\pi}} \newcommand{\BufferDependencyEdgeSet}{E} \newcommand{\BufferDependencyGraph}{G} \newcommand{\BufferDependencyVertexSet}{V} \newcommand{\BufferIndex}{i} \newcommand{\BulkDecouplingCapacitance}{C_{\text{bulk}}} \newcommand{\BumplessTransferBlend}{\alpha} \newcommand{\BumplessTransferBlendAcceleration}{\ddot{\alpha}} \newcommand{\BumplessTransferBlendRate}{\dot{\alpha}} \newcommand{\BumplessTransferBlendSlope}{\alpha'} \newcommand{\BumplessTransferProgress}{\hat{t}} \newcommand{\BumplessTransferStartInstant}{t_{\text{start}}} \newcommand{\BurstArrivalCount}{N_{\text{burst}}} \newcommand{\BurstSurvivalTime}{t_{\text{limit}}} \newcommand{\BusBitRate}{R_{\text{bit}}} \newcommand{\BusCapacitorEnergy}{E_C} \newcommand{\BusCapacitorVoltage}{V_C} \newcommand{\BusSerializationTime}{t_{\text{bus}}} \newcommand{\ButterflyAllReduceTime}{T_{\text{butterfly}}} \newcommand{\ByteAlphabet}{\Sigma} \newcommand{\ByteString}{u} \newcommand{\ByzantineClientCount}{f} \newcommand{\ByzantineFaultCount}{f} \newcommand{\CableFlexCycleCount}{n_{\text{cable}}} \newcommand{\CableRatedFatigueLife}{L_{\text{cable}}} \newcommand{\CacheMissStallFraction}{f} \newcommand{\CachedInputTokenCount}{n_{\text{cache}}} \newcommand{\CachedInputTokenPrice}{c_{\text{cache}}} \newcommand{\CalibratedAcceptanceEstimate}{\hat{p}} \newcommand{\CalibrationBinCount}{N_{\text{bins}}} \newcommand{\CalibrationBinExampleSet}{B_m} \newcommand{\CalibrationBinIndex}{m} \newcommand{\CalibrationConstraintMatrix}{\mathbf{V}} \newcommand{\CalibrationDataDistribution}{p_{\text{cal}}} \newcommand{\CalibrationDataset}{\mathcal{C}_{\text{cal}}} \newcommand{\CalibrationExampleCount}{n_{\text{cal}}} \newcommand{\CalibrationModelPoint}{\mathbf{M}} \newcommand{\CalibrationPoseIndex}{k} \newcommand{\CalibrationRotationAxisCount}{N} \newcommand{\CalibrationSceneIndex}{j} \newcommand{\CalibrationTemperature}{T_{\text{cal}}} \newcommand{\CalibrationViewCount}{N} \newcommand{\CallLatency}{T_{\text{call}}} \newcommand{\CallPostprocessingTime}{T_{\text{post}}} \newcommand{\CallPreparationTime}{T_{\text{prep}}} \newcommand{\CallTailProbability}{p_{\text{tail}}} \newcommand{\CallUsefulWorkTime}{W} \newcommand{\CameraCenterArcPosition}{x_{\text{rot}}} \newcommand{\CameraExtrinsicRotation}{\mathbf{R}_{bc}} \newcommand{\CameraExtrinsicTransform}{\mathbf{T}_{bc}} \newcommand{\CameraExtrinsicTranslation}{\mathbf{p}_{bc}} \newcommand{\CameraFrameDepth}{Z_c} \newcommand{\CameraFrameHorizontalCoordinate}{X_c} \newcommand{\CameraFramePeriod}{T_{\text{sample}}} \newcommand{\CameraFramePoint}{\mathbf{p}_c} \newcommand{\CameraFramePointCovariance}{\boldsymbol{\Sigma}_c} \newcommand{\CameraFrameVerticalCoordinate}{Y_c} \newcommand{\CameraIdentifierEmbedding}{\mathbf{e}_{\text{cam}}} \newcommand{\CameraImage}{\mathbf{I}} \newcommand{\CameraImuTimeOffset}{\Delta t_{\text{imu}}} \newcommand{\CameraIntrinsicCalibrationMatrix}{\mathbf{K}} \newcommand{\CameraIntrinsicInverseTranspose}{\mathbf{K}^{-\top}} \newcommand{\CameraLateralStandardDeviation}{\sigma_{x_c}} \newcommand{\CameraMountTiltAngle}{\theta_{\text{ext}}} \newcommand{\CameraObjectTransform}{\mathbf{T}_{\text{camera}}^{\text{object}}} \newcommand{\CameraOpticalCenter}{\mathbf{o}} \newcommand{\CameraReferenceFrame}{\mathcal{F}_{\text{cam}}} \newcommand{\CameraRotationColumn}{\mathbf{r}} \newcommand{\CameraSampleTimestamp}{t_{\text{cam}}} \newcommand{\CameraSkewCoefficient}{\gamma} \newcommand{\CameraTargetTransform}{\mathbf{T}_{\text{cam}}^{\text{target}}} \newcommand{\CameraToWorldRotation}{\mathbf{R}_{WC}} \newcommand{\CameraToWorldTransform}{\mathbf{T}_{WC}} \newcommand{\CameraToWorldTranslation}{\mathbf{t}_{WC}} \newcommand{\CampaignActiveTime}{T_{\text{active}}} \newcommand{\CanHighLineVoltage}{V_{\text{CANH}}} \newcommand{\CanLowLineVoltage}{V_{\text{CANL}}} \newcommand{\CanaryAllocationFraction}{\rho} \newcommand{\CanaryInterventionRate}{\lambda_{\text{canary}}} \newcommand{\CanaryLabelDelay}{t_{\text{label}}} \newcommand{\CanarySpeedBound}{v_{\text{canary}}} \newcommand{\CanaryStageDuration}{T_{\text{stage}}} \newcommand{\CanaryTrafficFraction}{p_{\text{stage}}} \newcommand{\CandidateAcceptanceEstimate}{\hat{p}_{\text{cand}}} \newcommand{\CandidateActionVector}{\hat{\mathbf{a}}} \newcommand{\CandidateArchitecture}{a} \newcommand{\CandidateAvailabilityEstimate}{\widehat{q}} \newcommand{\CandidateAvailabilityProbability}{q} \newcommand{\CandidateCheckingCost}{v} \newcommand{\CandidateClientCount}{K_{\text{candidates}}} \newcommand{\CandidateControlCommand}{\mathbf{u}^{\text{cand}}} \newcommand{\CandidateControlCommandDerivative}{\dot{\mathbf{u}}^{\text{cand}}} \newcommand{\CandidateDefectRate}{\epsilon} \newcommand{\CandidateGenerationCost}{g} \newcommand{\CandidateIndex}{i} \newcommand{\CandidateIntervalLowerLimit}{l_{\text{cand}}} \newcommand{\CandidateIntervalUpperLimit}{u_{\text{cand}}} \newcommand{\CandidateLowerLimitDistance}{\delta^-_{\text{cand}}} \newcommand{\CandidateOnlyAcceptedTaskCount}{c} \newcommand{\CandidatePolicyAcceptanceProbability}{p_{Y}} \newcommand{\CandidatePolicyAction}{\mathbf{a}_t^{\text{cand}}} \newcommand{\CandidatePolicyCost}{C_{Y}} \newcommand{\CandidatePoolSize}{N} \newcommand{\CandidateProposal}{p} \newcommand{\CandidateRoutingPolicy}{Y} \newcommand{\CandidateScoreVector}{\mathbf{c}} \newcommand{\CandidateScoringCost}{c_{\text{infer}}} \newcommand{\CandidateScoringError}{\epsilon} \newcommand{\CandidateSkill}{a} \newcommand{\CandidateSpeedCommand}{v_{\text{cand}}} \newcommand{\CandidateTailCompletionTime}{\widehat{T}_{c,0.99}} \newcommand{\CandidateToolCallDistribution}{p_{c}} \newcommand{\CandidateTrackingErrorStandardDeviation}{\sigma_{\text{track}}} \newcommand{\CandidateTrajectoryGoodput}{\mathcal{G}_{c}} \newcommand{\CandidateUpperLimitDistance}{\delta^+_{\text{cand}}} \newcommand{\CandidateUtility}{U} \newcommand{\CandidateUtilityMean}{\mu} \newcommand{\CandidateUtilityStandardDeviation}{\sigma_{U}} \newcommand{\CandidateViolationCount}{V_{c}} \newcommand{\CandidateWinCount}{j} \newcommand{\CapabilityGrant}{\Gamma} \newcommand{\CaptureAgeEmbedding}{\mathbf{e}_{\Delta t}} \newcommand{\CaptureSampleIndex}{t_0} \newcommand{\CaptureSampleKalmanGain}{\mathbf{G}_{t_0}} \newcommand{\CaptureSampleMeasurementMatrix}{\mathbf{H}_{t_0}} \newcommand{\CaptureSamplePredictedCovariance}{\mathbf{P}_{t_0|t_0-1}} \newcommand{\CaptureSamplePredictedEstimate}{\hat{\mathbf{x}}_{t_0|t_0-1}} \newcommand{\CaptureSampleUpdatedCovariance}{\mathbf{P}_{t_0|t_0}} \newcommand{\CaptureSampleUpdatedEstimate}{\hat{\mathbf{x}}_{t_0|t_0}} \newcommand{\CaptureTimestamp}{t_{\text{capture}}} \newcommand{\CapturedSensorObservation}{\mathbf{z}_{t_0}} \newcommand{\CartesianAcceleration}{\ddot{\mathbf{p}}} \newcommand{\CartesianPosition}{\mathbf{p}} \newcommand{\CartesianXCoordinate}{x} \newcommand{\CartesianYCoordinate}{y} \newcommand{\CartesianZCoordinate}{z} \newcommand{\CascadeEscalationProbability}{p_{\text{escalate}}} \newcommand{\CascadeGateCost}{g} \newcommand{\CascadeGateDuration}{v} \newcommand{\CascadeInferenceEnergy}{E_{\text{cascade}}} \newcommand{\CascadeTaskCost}{C_{\text{cascade}}} \newcommand{\CascadeTaskDuration}{T_{\text{cascade}}} \newcommand{\CascadeTierCost}{c^{\text{tier}}} \newcommand{\CascadeTierDuration}{t} \newcommand{\CascadeTierIndex}{j} \newcommand{\CascadedBarrierCertificate}{\psi} \newcommand{\CascadedBarrierClassKFunction}{\alpha} \newcommand{\CascadedBarrierDerivative}{\dot{\psi}} \newcommand{\CaseAmbientThermalResistance}{R_{\text{th,case-amb}}} \newcommand{\CaseTemperature}{T_{\text{case}}} \newcommand{\CaseThermalCapacitance}{C_{\text{case}}} \newcommand{\CaseThermalTimeConstant}{\tau_{\text{th,case}}} \newcommand{\CatalogDefinitionTokens}{S_{\text{catalog}}} \newcommand{\CatalogStagingCallCount}{N} \newcommand{\CategoryRecordCount}{n} \newcommand{\CausalInterventionMask}{\mathcal{M}} \newcommand{\CausalMediator}{M} \newcommand{\CausalTokenPosition}{s} \newcommand{\CbsRuntimeBudget}{Q} \newcommand{\CellOccupancyProbability}{p} \newcommand{\CenterCount}{k} \newcommand{\CentralizedTrainingEnergy}{E_{\text{centralized}}} \newcommand{\CentroidalAngularMomentum}{\mathbf{h}_{\text{ang}}} \newcommand{\CentroidalAngularMomentumDerivative}{\dot{\mathbf{h}}_{\text{ang}}} \newcommand{\CentroidalLinearMomentum}{\mathbf{h}_{\text{lin}}} \newcommand{\CentroidalLinearMomentumDerivative}{\dot{\mathbf{h}}_{\text{lin}}} \newcommand{\CentroidalMomentum}{\mathbf{h}_G} \newcommand{\CentroidalMomentumMatrix}{\mathbf{A}_G} \newcommand{\CentroidalMomentumMatrixDerivative}{\dot{\mathbf{A}}_G} \newcommand{\CentroidalMomentumRate}{\dot{\mathbf{h}}_G} \newcommand{\CertifiedCommandWindow}{\mathbf{u}^*_{t:t+H-1}} \newcommand{\CertifiedControlAction}{\mathbf{u}^*} \newcommand{\CertifiedJointTorque}{u^*} \newcommand{\CertifiedRadius}{R} \newcommand{\ChainRuleInput}{x} \newcommand{\ChainRuleIntermediate}{u} \newcommand{\ChainRuleOutput}{v} \newcommand{\ChainedOperationCount}{n_{\text{ops}}} \newcommand{\ChanceAnnotatorAgreement}{p_e} \newcommand{\ChannelAuthorityState}{S} \newcommand{\ChannelCommand}{u} \newcommand{\ChannelStoredEnergy}{E_{\text{channel}}} \newcommand{\CharacteristicPolynomial}{p} \newcommand{\CharacteristicPolynomialCoefficient}{c} \newcommand{\ChassisThermalResistance}{R_{\text{th,chassis}}} \newcommand{\CheapConfigurationAttemptCost}{c_{\text{small}}} \newcommand{\CheapConfigurationPassProbability}{p_{\text{small}}} \newcommand{\CheckIntervalStepCount}{m} \newcommand{\CheckPassProbability}{p^{\text{chk}}} \newcommand{\CheckSlotTime}{T} \newcommand{\CheckWindowTurnCount}{w} \newcommand{\CheckedSignal}{x} \newcommand{\CheckedSignalLimit}{L_{\text{limit}}} \newcommand{\CheckpointAttemptDuration}{T_{\text{att}}} \newcommand{\CheckpointExtraPauseTime}{T_{\text{pause}}} \newcommand{\CheckpointInterval}{T_{\text{ckpt}}} \newcommand{\CheckpointLoadTime}{T_{\text{load}}} \newcommand{\CheckpointLogPosition}{j_{\text{ckpt}}} \newcommand{\CheckpointOrdinalIndex}{m} \newcommand{\CheckpointOverheadFraction}{f_{\text{ckpt}}} \newcommand{\CheckpointOverheadRatio}{w} \newcommand{\CheckpointRecoveryOverheadTime}{T_{\text{overhead}}} \newcommand{\CheckpointRestoreTime}{T_{\text{restore}}} \newcommand{\CheckpointStride}{k} \newcommand{\CheckpointSuffixReadTime}{T_{\text{read}}} \newcommand{\CheckpointWasteFraction}{W} \newcommand{\CheckpointWriteTime}{T_{\text{write}}} \newcommand{\ChildBatchSize}{n_{\text{batch}}} \newcommand{\ChildBudgetAllocation}{C_{\max,C}} \newcommand{\ChildCapabilityGrant}{\Gamma_{\text{child}}} \newcommand{\ChildFreeBalance}{F_{C}} \newcommand{\ChildPruningProbability}{p_{\text{prune}}} \newcommand{\ChildReservedFunds}{R_{C}} \newcommand{\ChildSettledCharges}{E_{C}} \newcommand{\ChinchillaIrreducibleLoss}{E} \newcommand{\ChirpDuration}{T_c} \newcommand{\ChirpSlope}{S} \newcommand{\ChopperClampVoltage}{V_{\text{clamp}}} \newcommand{\ChopperTurnOffVoltage}{V_{\text{clamp,off}}} \newcommand{\ChopperTurnOnVoltage}{V_{\text{clamp,on}}} \newcommand{\ChunkActionDimension}{d_{\text{chunk}}} \newcommand{\ChunkEnsemblingWeight}{w} \newcommand{\ChunkExecutionHorizon}{H_{\text{exec}}} \newcommand{\ChunkImitationLoss}{\mathcal{L}_{\text{chunk}}} \newcommand{\ChunkLease}{T_{\text{lease}}} \newcommand{\ChunkLeaseTime}{T_{\text{lease}}} \newcommand{\ChunkReactionLatency}{T_{\text{reaction}}} \newcommand{\ChunkRenewalPeriod}{T_{\text{chunk}}} \newcommand{\ChunkRenewalRate}{f_{\text{replan}}} \newcommand{\ChunkStepIndex}{i} \newcommand{\ClampedControlCommand}{\mathbf{u}_{\text{clip}}} \newcommand{\ClassCount}{K} \newcommand{\ClassIndex}{j} \newcommand{\ClassKFunction}{\kappa} \newcommand{\ClassKFunctionSet}{\mathcal{K}} \newcommand{\ClassProbabilityVector}{\mathbf{p}} \newcommand{\ClassificationThreshold}{\gamma_{\text{cls}}} \newcommand{\CleanLabelSampleCount}{D_{\text{clean}}} \newcommand{\CleanTrainingDataset}{\mathcal{S}} \newcommand{\CleanupGraphEdgeSet}{E} \newcommand{\CleanupGraphVertexSet}{V} \newcommand{\ClearDistance}{D_{\text{clear}}} \newcommand{\ClearanceAcceleration}{\ddot{D}_{\text{clear}}} \newcommand{\ClearanceAllowance}{C} \newcommand{\ClearanceExhaustionTime}{t_{\text{impact}}} \newcommand{\ClearanceInset}{C_{\text{inset}}} \newcommand{\ClearanceQueryTime}{t_{\text{query}}} \newcommand{\ClearanceRate}{\dot{D}_{\text{clear}}} \newcommand{\ClearanceSpeedClamp}{v_{\text{clamp}}} \newcommand{\ClearanceTimeBudget}{T_{\text{total}}} \newcommand{\ClfClassKFunction}{\alpha_V} \newcommand{\ClfDescentControlSet}{\mathcal{U}_{\text{CLF}}} \newcommand{\ClientGradientVector}{\mathbf{g}} \newcommand{\ClientIndex}{k} \newcommand{\ClientLocalDataset}{\mathcal{D}} \newcommand{\ClientLocalTrainingEnergy}{E_{\text{client}}} \newcommand{\ClientMaskVector}{\mathbf{r}} \newcommand{\ClientObjectiveWeight}{w} \newcommand{\ClientSampleCount}{n} \newcommand{\ClientUpdateUploadEnergy}{E_{\text{upload}}} \newcommand{\ClippedSurrogateObjective}{\mathcal{M}} \newcommand{\ClippingRangeLowerBound}{\alpha} \newcommand{\ClippingRangeUpperBound}{\beta} \newcommand{\ClockConversionBound}{\epsilon_{\text{sync}}} \newcommand{\ClockConversionIntercept}{b_{\text{clk}}} \newcommand{\ClockConversionSlope}{a} \newcommand{\ClockFrequency}{f} \newcommand{\ClockOffset}{\theta_{\text{offset}}} \newcommand{\ClockPeriod}{T_{\text{clk}}} \newcommand{\ClockSynchronizationSkew}{\delta_{\text{skew}}} \newcommand{\ClosedLoopTrajectoryDensity}{p_{\text{cl}}} \newcommand{\ClosingSpeedBound}{v_{\text{close}}} \newcommand{\CloudInferenceEnergy}{E_{\text{cloud}}} \newcommand{\CloudOffloadEnergy}{E_{\text{transmit}}} \newcommand{\CloudTrainingRunEnergy}{E_{\text{cloud,train}}} \newcommand{\ClusterAvailability}{A_{\text{cluster}}} \newcommand{\ClusterCount}{k} \newcommand{\ClusterHeadroom}{N} \newcommand{\ClusterNodeCount}{N_{\text{nodes}}} \newcommand{\ClusterPower}{P_{\text{cluster}}} \newcommand{\CoarseCellCount}{C} \newcommand{\CodecDecodeTime}{T_{\text{decode}}} \newcommand{\CodecEncodeTime}{T_{\text{encode}}} \newcommand{\CodecOverheadTime}{T_{\text{overhead}}} \newcommand{\CognitivePolicyAction}{\mathbf{a}} \newcommand{\CoherencyCoefficient}{\kappa_{\text{coh}}} \newcommand{\ColdCopperLossPower}{P_0} \newcommand{\ColdResetCycleTime}{T_{\text{cycle,cold}}} \newcommand{\CollaborativeContactForce}{F_{\text{contact}}} \newcommand{\CollectedPhotocharge}{Q} \newcommand{\CollectionCohortCost}{C_{\text{cohort}}} \newcommand{\CollectionStateVisitationDistribution}{p^{\pi_{\text{col}}}} \newcommand{\CollectiveCallStartupLatency}{\alpha_{\text{eff}}} \newcommand{\CollectiveInputTensor}{\mathbf{X}} \newcommand{\CollectivePayloadSize}{M} \newcommand{\CollectiveTensorSize}{M_{\text{coll}}} \newcommand{\CollisionHullCount}{N_{\text{hulls}}} \newcommand{\CollocationDefect}{\Delta} \newcommand{\ColumnAccessLatency}{t_{\text{CL}}} \newcommand{\ColumnModeComponentVector}{\mathbf{b}_s} \newcommand{\ColumnModeFactorMatrix}{\mathbf{B}} \newcommand{\ColumnModeFactorSlice}{\mathbf{b}} \newcommand{\ColumnParallelWeightMatrix}{\mathbf{A}} \newcommand{\CombinedBatch}{B_{\text{total}}} \newcommand{\CombinedPlanValidationAllowance}{t_{\text{validate}}} \newcommand{\CommandComponentCount}{N_c} \newcommand{\CommandRateCeiling}{r} \newcommand{\CommandTransportTime}{T_{\text{bus}}} \newcommand{\CommandedActuatorEffort}{u_{\text{cmd}}} \newcommand{\CommandedApproachAcceleration}{a_{\text{cmd}}} \newcommand{\CommandedJointConfiguration}{\mathbf{q}_{\text{cmd}}} \newcommand{\CommandedJointCount}{N_j} \newcommand{\CommandedJointTorque}{\tau} \newcommand{\CommandedJointTorqueSlew}{\dot{\tau}} \newcommand{\CommandedTrackedPosition}{r_{\text{cmd}}} \newcommand{\CommandedTractiveForce}{F_{\text{cmd}}} \newcommand{\CommitBatchRecordCount}{N_{\text{batch}}} \newcommand{\CommitmentInstant}{t_{\text{commit}}} \newcommand{\CommitmentPathPosition}{q_{c}} \newcommand{\CommonPositionShift}{\Delta} \newcommand{\CommunicationComputeRatio}{\rho} \newcommand{\CommunicationIntensity}{\text{CI}} \newcommand{\CommunicationSlowdownFactor}{r} \newcommand{\CommunicationTime}{T_{\text{comm}}} \newcommand{\CommunicationTimeFraction}{f} \newcommand{\CompactedContextLength}{S_{\text{comp}}} \newcommand{\CompactionBoundaryCount}{k} \newcommand{\CompactionBoundaryIndex}{i} \newcommand{\CompactionCycleTurnCount}{n_{\text{cycle}}} \newcommand{\CompactionCycleTurnIndex}{i} \newcommand{\CompactionLossProbability}{\rho} \newcommand{\CompactionPassCost}{C_{\text{comp}}} \newcommand{\CompactionPathCost}{C_{\text{compact}}} \newcommand{\CompactionPaybackCallCount}{N_{\min}} \newcommand{\CompactionPerCallSaving}{s} \newcommand{\CompactionTargetLength}{S_{\text{low}}} \newcommand{\CompactionTriggerLength}{S_{\text{high}}} \newcommand{\CompactionUpfrontCost}{U} \newcommand{\ComparedPeriodAccuracy}{a} \newcommand{\ComparisonArmTrialCount}{n_{\text{arm}}} \newcommand{\ComparisonContext}{c} \newcommand{\ComparisonSampleEmpiricalCdf}{G_{m}} \newcommand{\ComparisonSampleSize}{m} \newcommand{\ComparisonTrajectory}{z} \newcommand{\ComparisonTrajectoryDerivative}{\dot{z}} \newcommand{\CompensatedEnvironmentState}{\sigma_0'} \newcommand{\CompensationPostcondition}{\phi} \newcommand{\CompensationPostconditionSet}{\Phi} \newcommand{\CompetingKeyCount}{n} \newcommand{\CompetingKeyLogit}{z} \newcommand{\CompilationBreakevenCount}{N_{\text{breakeven}}} \newcommand{\CompilationTime}{T_{\text{compile}}} \newcommand{\CompiledExecutionTime}{T_{\text{compiled}}} \newcommand{\CompilerBackendCount}{N_{\text{backend}}} \newcommand{\CompilerFrontendCount}{M} \newcommand{\ComplementarityNormalForce}{\lambda_n} \newcommand{\CompletedRequestCount}{N} \newcommand{\CompletedRoundIndex}{r} \newcommand{\CompletionCriteria}{\mathcal{K}_{\text{comp}}} \newcommand{\CompletionDeadline}{T_{\text{deadline}}} \newcommand{\CompletionOffset}{c} \newcommand{\CompliantElementPreload}{F_{\text{preload}}} \newcommand{\CompliantElementStiffness}{k_{\text{spring}}} \newcommand{\ComponentAvailability}{A_{\text{component}}} \newcommand{\ComponentFailureRate}{\lambda} \newcommand{\ComponentHazardRate}{h} \newcommand{\ComponentMttf}{\text{MTTF}_{\text{component}}} \newcommand{\ComponentReliability}{R_{\text{single}}} \newcommand{\ComposedChainTransform}{\mathbf{T}_{AC}} \newcommand{\ComposedFunctionInput}{x} \newcommand{\ComposedFunctionOutput}{y} \newcommand{\ComposedMechanismCount}{k} \newcommand{\CompoundScalingCoefficient}{\phi} \newcommand{\CompressedCommunicationTime}{T_{\text{compressed}}} \newcommand{\CompressedGradientUpdate}{\mathbf{v}} \newcommand{\CompressedGradientUpdateElement}{v} \newcommand{\CompressedOnlyCorrectCount}{n_{\text{comp}}} \newcommand{\CompressionRatio}{r_{\text{comp}}} \newcommand{\ComputationalDimensionCount}{N_{\text{comp}}} \newcommand{\ComputationalGraph}{G} \newcommand{\ComputeBudgetConstraint}{g} \newcommand{\ComputeChipPower}{P_{\text{chip}}} \newcommand{\ComputeConstrainedLagrangian}{\mathcal{L}_{\text{Lagrange}}} \newcommand{\ComputeConstraintMultiplier}{\lambda} \newcommand{\ComputeDemandVolume}{Q} \newcommand{\ComputeLimitedSampleRate}{R_{\text{compute}}} \newcommand{\ComputeOptimalTokenCount}{D_{\text{opt}}} \newcommand{\ComputeUnitCost}{P} \newcommand{\ConcordantTaskCount}{n} \newcommand{\ConcurrentTrajectories}{N_{\text{traj}}} \newcommand{\ConditionalDamageProbability}{p} \newcommand{\ConditionalDistribution}{p(y \mid x)} \newcommand{\ConditionalFlowMap}{\psi} \newcommand{\ConditionalVelocityField}{v} \newcommand{\ConditioningTokenPrefix}{x} \newcommand{\ConductorCurrent}{I} \newcommand{\ConeLimitStepSize}{\tau} \newcommand{\ConfidenceCalibrationDataset}{\mathcal{D}_{\text{cal}}} \newcommand{\ConfidenceCriticalQuantile}{z_{\alpha/2}} \newcommand{\ConfidenceLevel}{C} \newcommand{\ConfidentialityLabel}{\kappa} \newcommand{\ConfigurationSpace}{\mathcal{C}} \newcommand{\ConfirmationHitCount}{M} \newcommand{\ConfirmationWindowCount}{N_{\text{conf}}} \newcommand{\ConfluentVandermondeMatrix}{\mathbf{M}} \newcommand{\ConformalMiscoverageRate}{\epsilon} \newcommand{\ConformalPredictionSet}{\mathcal{C}} \newcommand{\ConformalQuantileRank}{k_{\epsilon}} \newcommand{\ConformalScoreQuantile}{\widehat{q}_{1-\epsilon}} \newcommand{\ConservativePenaltyWeight}{\alpha_{\text{CQL}}} \newcommand{\ConservativeSamplingDistribution}{\mu} \newcommand{\ConsoleCommunicationTime}{T_{\text{comm}}} \newcommand{\ConsolidationOverheadTime}{T_{\text{overhead}}} \newcommand{\ConsolidationStride}{c} \newcommand{\ConstantDivisorGrpoObjective}{\widehat{\mathcal{J}}_{\text{const}}} \newcommand{\ConstantHazardRate}{\lambda} \newcommand{\ConstrainedCallLatency}{T_{\text{constrained}}} \newcommand{\ConstrainedDecodingAutomaton}{\mathcal{D}} \newcommand{\ConstrainedParameterVector}{\mathbf{w}} \newcommand{\ConstrainedTestEnvelope}{\mathcal{S}} \newcommand{\ConstraintLagrangeMultiplier}{\lambda} \newcommand{\ConstraintRetentionFraction}{\eta_{\mathcal{C}}} \newcommand{\ContactApproachSpeed}{v_{\text{approach}}} \newcommand{\ContactCount}{N_c} \newcommand{\ContactDeformationDuration}{\Delta t_{\text{def}}} \newcommand{\ContactDirectionSpeed}{v_c} \newcommand{\ContactDirectionVelocity}{\dot{x}} \newcommand{\ContactDriftAcceleration}{a_{\text{drift}}} \newcommand{\ContactForce}{F_{\text{contact}}} \newcommand{\ContactForceBarrierFunction}{h_{\text{force}}} \newcommand{\ContactForceCap}{F_{\text{cap}}} \newcommand{\ContactForceCeiling}{F_{\max}} \newcommand{\ContactForceLimit}{F_{\text{limit}}} \newcommand{\ContactForceMagnitude}{F} \newcommand{\ContactForceRegularizationWeight}{w_f} \newcommand{\ContactForceRiseTime}{t_{\text{rise}}} \newcommand{\ContactGapAcceleration}{\ddot{\phi}} \newcommand{\ContactGapFunction}{\phi} \newcommand{\ContactGapVelocity}{\dot{\phi}} \newcommand{\ContactImpulse}{I} \newcommand{\ContactJacobianBaseBlock}{\mathbf{J}_{k,b}} \newcommand{\ContactJacobianJointBlock}{\mathbf{J}_{k,j}} \newcommand{\ContactLoopResponseTime}{T_c} \newcommand{\ContactNaturalTimescale}{T_{\text{contact}}} \newcommand{\ContactNormal}{\hat{\mathbf{n}}} \newcommand{\ContactNormalDeflection}{x} \newcommand{\ContactNormalJacobian}{\mathbf{J}_n} \newcommand{\ContactNormalJacobianDerivative}{\dot{\mathbf{J}}_n} \newcommand{\ContactNormalPosition}{x} \newcommand{\ContactNormalVelocity}{v_n} \newcommand{\ContactPatchRegion}{\mathcal{A}} \newcommand{\ContactPointForce}{\mathbf{f}} \newcommand{\ContactPointIndex}{i} \newcommand{\ContactPointJacobian}{\mathbf{J}_{\text{c}}} \newcommand{\ContactPointJacobianDerivative}{\dot{\mathbf{J}}_{\text{c}}} \newcommand{\ContactPointOffset}{\mathbf{r}} \newcommand{\ContactPointPosition}{x} \newcommand{\ContactPointTorque}{\boldsymbol{\tau}} \newcommand{\ContactReactionForce}{F} \newcommand{\ContactResponseLatency}{t_{\text{resp}}} \newcommand{\ContactStiffness}{k_{\text{contact}}} \newcommand{\ContactTorqueCeiling}{\tau_{\max}} \newcommand{\ContactTripwireForce}{F_{\text{trip}}} \newcommand{\ContactWrench}{\mathbf{w}} \newcommand{\ContactWrenchCeiling}{\mathbf{w}_{\max}} \newcommand{\ContactWrenchEnvelope}{\mathbf{w}_{\text{contact}}} \newcommand{\ContactWrenchTransform}{\mathbf{X}_k^*} \newcommand{\ContactYieldDeadline}{t_{\text{yield}}} \newcommand{\ContainerInnerRadius}{R} \newcommand{\ContainmentForceCeiling}{F_{\max}} \newcommand{\ContendingApplicationCount}{N} \newcommand{\ContentionCoefficient}{\sigma_{\text{cont}}} \newcommand{\ContextChunkTokenCount}{n} \newcommand{\ContextHiddenRepresentation}{\mathbf{h}_{\text{context}}} \newcommand{\ContextParallelDegree}{c} \newcommand{\ContextParallelRankIndex}{i} \newcommand{\ContextSaveTime}{t_{\text{context\_save}}} \newcommand{\ContextWindow}{S_{\max}} \newcommand{\ContinuationCount}{K} \newcommand{\ContinuationIndex}{i} \newcommand{\ContinuationReturnStandardDeviation}{\sigma} \newcommand{\ContinuityCorrectedCrossProduct}{A} \newcommand{\ContinuousActionComponent}{a} \newcommand{\ContinuousActionSpace}{\mathcal{A}} \newcommand{\ContinuousActionVector}{\mathbf{a}} \newcommand{\ContinuousCurrent}{I_{\text{cont}}} \newcommand{\ContinuousFactorialFunction}{\Gamma} \newcommand{\ContinuousMeasurementNoiseIntensity}{\mathbf{R}_{\text{cont}}} \newcommand{\ContinuousMotionModel}{\mathbf{f}} \newcommand{\ContinuousOutcome}{\mathbf{x}} \newcommand{\ContinuousRandomVariable}{\mathbf{X}} \newcommand{\ContinuousStateTransitionMatrix}{\boldsymbol{\Phi}} \newcommand{\ContinuousTorque}{\tau_{\text{cont}}} \newcommand{\ContractedBarrierFunction}{h_{\text{contracted}}} \newcommand{\ControlAffineDriftField}{\mathbf{f}} \newcommand{\ControlAffineInputField}{\mathbf{g}} \newcommand{\ControlCommand}{\mathbf{u}} \newcommand{\ControlCommandDerivative}{\dot{\mathbf{u}}} \newcommand{\ControlCommandSpace}{\mathcal{U}} \newcommand{\ControlConversionRate}{\hat{p}_A} \newcommand{\ControlCycleIndex}{i} \newcommand{\ControlInput}{\mathbf{u}} \newcommand{\ControlInputDimension}{m} \newcommand{\ControlInputLowerLimit}{\mathbf{u}_{\min}} \newcommand{\ControlInputSet}{\mathcal{U}} \newcommand{\ControlInputUpperLimit}{\mathbf{u}_{\max}} \newcommand{\ControlInputWindow}{\mathbf{u}_{[t, t+\Delta t]}} \newcommand{\ControlSampleIndex}{k} \newcommand{\ControlSampleSize}{m_A} \newcommand{\ControlSetpointJerk}{\mathbf{j}} \newcommand{\ControlSetpointPeriod}{\Delta t_{\text{ctrl}}} \newcommand{\ControlStepIndex}{t} \newcommand{\ControlTaskIndex}{i} \newcommand{\ControllabilityMatrix}{\mathbf{C}_{\text{ctrb}}} \newcommand{\ControlledStopCommand}{\mathbf{u}_{\text{stop}}} \newcommand{\ControllerReactionDelay}{T_{\text{react}}} \newcommand{\ConversationTurnIndex}{i} \newcommand{\ConverterLockoutVoltage}{V_{\text{uvlo}}} \newcommand{\ConveyorSpeed}{v_{\text{conv}}} \newcommand{\ConveyorSpeedBound}{v_{\text{conv}}} \newcommand{\ConvolutionActivation}{H} \newcommand{\ConvolutionTimeInstant}{t'} \newcommand{\CookedTokenKeyVector}{\mathbf{k}_{\text{cooked}}} \newcommand{\CookedTokenQueryVector}{\mathbf{q}_{\text{cooked}}} \newcommand{\CoolantHeatLoad}{P_{\text{thermal}}} \newcommand{\CoolantMassFlowRate}{\dot{m}} \newcommand{\CoolantTemperature}{T} \newcommand{\CoolingEnergy}{E_{\text{cooling}}} \newcommand{\CoordinateFrameEmbedding}{\mathbf{e}_{\text{frame}}} \newcommand{\CoordinationLatency}{L_{\text{lat,coordination}}} \newcommand{\CoordinationOverhead}{h} \newcommand{\CopperIronThermalResistance}{R_{\text{th,cu-iron}}} \newcommand{\CopperReferenceTemperature}{T_0} \newcommand{\CopperTemperatureCoefficient}{\alpha_{\text{Cu}}} \newcommand{\CopperThermalCapacitance}{C_{\text{cu}}} \newcommand{\CopperThermalTimeConstant}{\tau_{\text{th,cu}}} \newcommand{\CoreAmbientThermalResistance}{R_{\text{th,ca}}} \newcommand{\CoreRailVoltageDroop}{\Delta V_{\text{droop}}} \newcommand{\CoreThermalCapacitance}{C_{\text{core}}} \newcommand{\CoresetBudget}{K} \newcommand{\CoriolisCentrifugalMatrix}{\mathbf{C}} \newcommand{\CorrectCandidateTrialPassProbability}{p_{g}} \newcommand{\CorrectClassIndex}{c} \newcommand{\CorrectClassLogit}{z_{c}} \newcommand{\CorrectClassProbability}{\hat{y}_{c}} \newcommand{\CorrectnessReward}{R_{\text{corr}}} \newcommand{\CorrelationCoefficient}{\rho} \newcommand{\CorruptedAttentionScoreMatrix}{\mathbf{S}_{\text{corrupt}}} \newcommand{\CorruptedModelWeight}{w'} \newcommand{\CostAnomalyScore}{Z} \newcommand{\CostBudgetUsedFraction}{\rho_C} \newcommand{\CostCeiling}{C_{\max}} \newcommand{\CostPerAcceptedTask}{C_{\text{eff}}} \newcommand{\CostPerEmittedArtifact}{C_{\text{emit}}} \newcommand{\CostToGo}{C} \newcommand{\CoulombFrictionCoefficient}{\mu} \newcommand{\CoulombFrictionForce}{F_{\text{friction}}} \newcommand{\CountedFailureIndicator}{e} \newcommand{\CovariateDriftBound}{\mathcal{O}(S^2 \epsilon)} \newcommand{\CoverageFactor}{k} \newcommand{\CpuEnergy}{E_{\text{CPU}}} \newcommand{\CredibleBrakingDeceleration}{a_{\text{brake}}} \newcommand{\CreditWindowCapacity}{N_{\text{win}}} \newcommand{\CriticActionReturnEstimate}{Q_{\phi}} \newcommand{\CriticApproximationError}{\epsilon} \newcommand{\CriticModel}{M_{\text{value}}} \newcommand{\CriticParameters}{\phi} \newcommand{\CriticReturnEstimate}{V_{\phi}} \newcommand{\CriticalBatchSize}{B^{*}} \newcommand{\CriticalConstraint}{c} \newcommand{\CriticalPathDuration}{T_{\text{crit}}} \newcommand{\CriticalSectionIndex}{s} \newcommand{\CriticalSectionWcet}{C^{\text{cs}}} \newcommand{\CriticalTrackingErrorBound}{\epsilon_{\text{crit}}} \newcommand{\CriticalTransitDistance}{d_{\text{crit}}} \newcommand{\CrossEntropyLevelThreshold}{\gamma} \newcommand{\CrossEntropyLoss}{\mathcal{L}_{\text{CE}}} \newcommand{\CrossoverFrequency}{\omega_c} \newcommand{\CruiseSpeed}{v_{c}} \newcommand{\CumulativeArrivals}{A} \newcommand{\CumulativeCompletions}{C} \newcommand{\CumulativeIncidentCount}{N} \newcommand{\CumulativeLogLikelihoodRatio}{\Lambda} \newcommand{\CumulativeScheduleStepIndex}{s} \newcommand{\CumulativeTransmittance}{T} \newcommand{\CumulativeWorkCost}{C} \newcommand{\CurrentBinProportion}{A} \newcommand{\CurrentDistribution}{P_t} \newcommand{\CurrentFeatureMean}{\mu_{\text{curr}}} \newcommand{\CurrentFeatureStandardDeviation}{\sigma_{\text{curr}}} \newcommand{\CurrentLayerWidth}{n_{\ell}} \newcommand{\CurrentModelParameters}{\theta_{\text{old}}} \newcommand{\CurrentMonotonicTime}{t_{\text{now,mono}}} \newcommand{\CurrentNodeIndex}{j} \newcommand{\CurrentPeriodCost}{C_{\text{current}}} \newcommand{\CurrentStateDigest}{h_{\text{state},t}} \newcommand{\CurrentStateEstimate}{\hat{\mathbf{x}}_{t_{\text{current}}}} \newcommand{\CurrentTime}{t_{\text{now}}} \newcommand{\CurrentWallClockTime}{t_{\text{current}}} \newcommand{\CutCrossingDataVolume}{V_{\text{cut}}} \newcommand{\CvaeEncoderParameters}{\phi} \newcommand{\CvaeRecognitionEncoder}{q_\phi} \newcommand{\CycleAveragePowerCeiling}{\bar{P}_{\max}} \newcommand{\CycleGuardTime}{t_{\text{guard}}} \newcommand{\CylinderForce}{F_{\text{cyl}}} \newcommand{\DailyAccountQueryCount}{q_{\text{daily}}} \newcommand{\DailyQueryVolume}{Q_{\text{day}}} \newcommand{\DamageEventCount}{N_{\text{damage}}} \newcommand{\DamageProbabilityTolerance}{\epsilon} \newcommand{\DamageProbabilityUpperBound}{p_U} \newcommand{\DamagingOutcomeIndicator}{Y} \newcommand{\DampedLeastSquaresPseudoinverse}{\mathbf{J}_{\lambda}^\dagger} \newcommand{\DampedStepConfiguration}{\mathbf{q}_\lambda} \newcommand{\DampingRatio}{\zeta} \newcommand{\DataAcquisitionCost}{C_{\text{acquire}}} \newcommand{\DataDebtGrowthRate}{r} \newcommand{\DataEgressCost}{C_{\text{egress}}} \newcommand{\DataFieldBitCount}{B_{\text{data},i}} \newcommand{\DataInformationContent}{\mathcal{I}} \newcommand{\DataLabelingCost}{C_{\text{label}}} \newcommand{\DataLoaderWorkerCount}{W} \newcommand{\DataMovementEnergyFraction}{q} \newcommand{\DataParallelDegree}{N_{\text{DP}}} \newcommand{\DataPhaseBitRate}{R_{\text{data}}} \newcommand{\DataPipelineProcessingCost}{C_{\text{process}}} \newcommand{\DataProcessingCost}{C_{\text{process}}} \newcommand{\DataScaleCoefficient}{B} \newcommand{\DataScalingExponent}{\beta} \newcommand{\DataScalingLossFactor}{D^{-\beta}} \newcommand{\DataStallFraction}{f_{\text{stall}}} \newcommand{\DataStorageCost}{C_{\text{store}}} \newcommand{\DataSupplyRate}{R_{\text{data}}} \newcommand{\DataTaxonomyAxis}{\mathsf{Data}} \newcommand{\DataVolume}{D_{\text{vol}}} \newcommand{\DatasetQuery}{f} \newcommand{\DatasetQueryResult}{v} \newcommand{\DatasetShardCount}{K_{\text{shards}}} \newcommand{\DatasetSize}{D} \newcommand{\DatasetTransferTime}{T} \newcommand{\DcBusBulkCapacitance}{C_{\text{bus}}} \newcommand{\DcBusOvervoltageThreshold}{V_{\text{max\_safe}}} \newcommand{\DcBusVoltage}{V_{\text{bus}}} \newcommand{\DcRailVoltage}{V_{\text{rail}}} \newcommand{\DeadTimeCycleCount}{N_{\text{dtg}}} \newcommand{\DeadTimeDqVoltageError}{\Delta V_{d,q}} \newcommand{\DeadTimeSafetyMargin}{t_{\text{margin}}} \newcommand{\DeadTimeTickPeriod}{T_{\text{dtg}}} \newcommand{\DeadTimeVoltageError}{\Delta V_{\text{phase}}} \newcommand{\DeadlineInstant}{t_{\text{deadline}}} \newcommand{\DebiasingTotalLoss}{\mathcal{L}_{\text{total}}} \newcommand{\DebounceFrameCount}{N} \newcommand{\DecisionProcessState}{s} \newcommand{\DecisionScore}{s_{\text{dec}}} \newcommand{\DecisionStepIndex}{k} \newcommand{\DecodeArithmeticIntensity}{I_{\text{decode}}} \newcommand{\DecodeBatchSize}{B_{\text{dec}}} \newcommand{\DecodeInterval}{T_{\text{decode}}} \newcommand{\DecodeRequestSet}{\mathcal{D}} \newcommand{\DecodeTokenTimeFloor}{T_{\text{token}}} \newcommand{\DecoderEvaluationCount}{N_{\text{eval}}} \newcommand{\DecoderPassTime}{t_{\text{pass}}} \newcommand{\DecodingConstraintState}{q} \newcommand{\DecomposedTensor}{\mathcal{Y}} \newcommand{\DecomposedTensorEntry}{y_{ijt}} \newcommand{\DecouplingCapacitance}{C} \newcommand{\DecouplingDriftVector}{\mathbf{b}} \newcommand{\DecouplingMatrix}{\mathbf{E}} \newcommand{\DecouplingMatrixElement}{E} \newcommand{\DedicatedHourlyFixedCost}{C_{\text{fixed}}} \newcommand{\DedicatedVariableTokenCost}{c_{\text{ded}}} \newcommand{\DefectiveActionProbability}{p_{\text{bad}}} \newcommand{\DefinitionSerializedSize}{S} \newcommand{\DeflectionComplianceAllowance}{\delta_{\text{deflect}}} \newcommand{\DegradedFrictionCoefficient}{\mu_{\text{fault}}} \newcommand{\DegradedStepTime}{T_{\text{slow}}} \newcommand{\DelassusOperator}{\mathbf{A}_{\text{Delassus}}} \newcommand{\DelayPhaseLag}{\Delta \phi} \newcommand{\DelayTravelDistance}{d_{\text{delay}}} \newcommand{\DelayWindowIntegrationTime}{\sigma} \newcommand{\DelayedObservation}{\mathbf{y}_{t_0}} \newcommand{\DelegatedAllocationAmount}{b} \newcommand{\DelegationTokenMultiple}{r} \newcommand{\DeliveredActuatorTorque}{\tau_{\text{act}}} \newcommand{\DeliveredCapacityFraction}{u} \newcommand{\DemandCap}{x_{\max}} \newcommand{\DemandPriceElasticity}{\epsilon_{\text{elast}}} \newcommand{\DemandThreshold}{x} \newcommand{\DemonstratedTargetA}{\mathbf{y}_A} \newcommand{\DemonstratedTargetB}{\mathbf{y}_B} \newcommand{\DemonstrationActionDistribution}{p} \newcommand{\DemonstrationActionLabel}{\mathbf{a}} \newcommand{\DemonstrationArchiveActionDistribution}{p_{\text{demo}}} \newcommand{\DemonstrationChunkDistribution}{p_{\text{data}}} \newcommand{\DemonstrationDataset}{\mathcal{D}_{\text{demo}}} \newcommand{\DemonstrationRetentionRate}{R} \newcommand{\DemonstratorAction}{\mathbf{a}^{*}} \newcommand{\DemonstratorActionComponent}{a} \newcommand{\DenseEvaluationEnergy}{E_{\text{eval}}} \newcommand{\DenseEvaluationRate}{f_{\text{eval}}} \newcommand{\DenseVoxelGridMemory}{M_{\text{dense}}} \newcommand{\DepartmentQuotaLimit}{Q_{\text{department}}} \newcommand{\DependencyGraphEdgeSet}{E} \newcommand{\DependencyGraphVertex}{v} \newcommand{\DependencyGraphVertexSet}{V} \newcommand{\DepletedBusVoltage}{V_{\text{low}}} \newcommand{\DeploymentAge}{t} \newcommand{\DeploymentDistribution}{p_{\text{deploy}}} \newcommand{\DeploymentDuration}{T_{\text{deployment}}} \newcommand{\DepthBinCount}{D} \newcommand{\DepthBinDistribution}{\boldsymbol{\alpha}_{u, v}} \newcommand{\DepthBinIndex}{k} \newcommand{\DepthBinLogits}{\mathbf{d}_{u, v}} \newcommand{\DepthBinProbability}{\alpha_{u, v}} \newcommand{\DepthCalibrationScale}{s} \newcommand{\DepthCalibrationShift}{t} \newcommand{\DepthCriticalPathLatency}{T^{\text{depth}}} \newcommand{\DepthFrameRate}{f_{\text{cam}}} \newcommand{\DepthHypothesis}{d} \newcommand{\DepthModeComponentVector}{\mathbf{c}_s} \newcommand{\DepthModeFactorMatrix}{\mathbf{C}} \newcommand{\DepthModeFactorSlice}{\mathbf{c}} \newcommand{\DepthRayCount}{N_{\text{rays}}} \newcommand{\DepthScalingRatio}{\alpha} \newcommand{\DepthStandardDeviation}{\sigma_z} \newcommand{\DerivativeControlEffort}{\mathbf{u}_{d}} \newcommand{\DerivativeFilterTimeConstant}{T_{f}} \newcommand{\DerivativeGainMatrix}{\mathbf{K}_{d}} \newcommand{\DerivativeOperator}{d} \newcommand{\DerivativeSplineControlPoint}{\mathbf{v}} \newcommand{\DerivedMemoryEntry}{c} \newcommand{\DerivedRecord}{y} \newcommand{\DesignLatencyQuantile}{Q_{1-\epsilon}} \newcommand{\DesiredContactPosition}{x_{\text{des}}} \newcommand{\DesiredContactVelocity}{\dot{x}_{\text{des}}} \newcommand{\DesiredTaskAcceleration}{\ddot{\mathbf{x}}_d} \newcommand{\DesiredTaskPosition}{\mathbf{x}_d} \newcommand{\DesiredTaskSpaceAcceleration}{\ddot{\mathbf{x}}^{\text{des}}} \newcommand{\DesiredTaskVelocity}{\dot{\mathbf{x}}_d} \newcommand{\DestinationRankIndex}{j} \newcommand{\DetectionCount}{n_{\text{det}}} \newcommand{\DetectionInterval}{t_{\text{detect}}} \newcommand{\DetectionMeasurementNoiseCovariance}{\boldsymbol{\Sigma}_{\text{meas},j}} \newcommand{\DetectionRangeShortfall}{\Delta d_{\text{detect}}} \newcommand{\DetectionTimestamp}{t_{\text{det}}} \newcommand{\DetectorMissProbability}{p_{\text{miss}}} \newcommand{\DeterministicPolicy}{\mu_{\theta}} \newcommand{\DevelopmentIterationCount}{N_{\text{dev}}} \newcommand{\DeviationDisadvantage}{u} \newcommand{\DeviceCount}{N} \newcommand{\DeviceEnergy}{E_{\text{device}}} \newcommand{\DeviceHardwareTime}{T_{\text{hw}}} \newcommand{\DeviceMemoryCapacity}{M_{\text{device}}} \newcommand{\DevicePower}{P_{\text{device}}} \newcommand{\DeviceRequestCapacity}{Q_{\text{req,max}}} \newcommand{\DeviceSilentCorruptionProbability}{p} \newcommand{\DiagnosticCoverage}{C_{\text{diag}}} \newcommand{\DictionaryCoefficientMatrix}{\mathbf{C}} \newcommand{\DifferentiabilityClass}{C} \newcommand{\DifferentialEntropy}{h} \newcommand{\DiffusionCumulativeSchedule}{\bar{\alpha}} \newcommand{\DiffusionGaussianNoise}{\boldsymbol{\epsilon}} \newcommand{\DiffusionMatchingLoss}{\mathcal{L}_{\text{diff}}} \newcommand{\DiffusionNoiseVariance}{\beta} \newcommand{\DiffusionStepCount}{N} \newcommand{\DiffusionStepIndex}{k} \newcommand{\DiffusionStepRetention}{\alpha} \newcommand{\DiffusionTimeCoordinate}{t_{\text{diff}}} \newcommand{\DirectAxisCurrent}{i_d} \newcommand{\DirectAxisInductance}{L_d} \newcommand{\DirectAxisVoltage}{v_d} \newcommand{\DirectionalCosineMatrix}{\mathbf{R}} \newcommand{\DirectionalDerivativeStep}{\epsilon} \newcommand{\DisadvantagedGroupClassificationThreshold}{\gamma_{\text{cls},g=\text{B}}} \newcommand{\DiscordantPairCount}{n_{\text{disc}}} \newcommand{\DiscordantPairFraction}{\psi} \newcommand{\DiscountFactor}{\gamma} \newcommand{\DiscountedReturn}{G} \newcommand{\DiscountedReturnStepOffset}{j} \newcommand{\DiscountedStateVisitationDistribution}{d} \newcommand{\DiscreteLqrFeedbackGain}{\mathbf{K}_{\text{lqr},d}} \newcommand{\DiscreteLqrQuadraticObjective}{J_d} \newcommand{\DiscreteOutcome}{x} \newcommand{\DiscretePlantDynamics}{f} \newcommand{\DiscreteRandomVariable}{X} \newcommand{\DiscreteSampleIndex}{k} \newcommand{\DiscreteStateSpaceInputMatrix}{\mathbf{B}_{d}} \newcommand{\DiscreteStateSpaceSystemMatrix}{\mathbf{A}_{d}} \newcommand{\DiscretizationBinCount}{n_{\text{bin}}} \newcommand{\DisengagedTakeoverResponseTime}{T_{\Sigma,2}} \newcommand{\DiskBandwidth}{\text{BW}_{\text{disk}}} \newcommand{\DisparityStandardDeviation}{\sigma_d} \newcommand{\DispatchAdmissionCeiling}{\Delta_{\text{da,max}}} \newcommand{\DispatchAdmissionInterval}{\Delta_{\text{da}}} \newcommand{\DispatchObservationAge}{t_{\text{age}}} \newcommand{\DispatchedOperationCount}{N_{\text{ops}}} \newcommand{\DisplayPipelineLatency}{t_{\text{disp}}} \newcommand{\DispreferredReferenceRelativeScore}{\Delta_l} \newcommand{\DispreferredTrajectory}{\tau_l} \newcommand{\DistanceEstimateStandardDeviation}{\sigma} \newcommand{\DistanceMeasurement}{z} \newcommand{\DistanceNormOrder}{p} \newcommand{\DistanceQueryPoint}{\mathbf{y}} \newcommand{\DistillationClassProbability}{p^{(T_{\text{distill}})}} \newcommand{\DistillationLoss}{\mathcal{L}_{\text{distill}}} \newcommand{\DistillationLossWeight}{\gamma_{\text{KD}}} \newcommand{\DistillationTemperature}{T_{\text{distill}}} \newcommand{\DistortedImageAbscissa}{x_d} \newcommand{\DistortedImageOrdinate}{y_d} \newcommand{\DistributedStepTime}{T_{\text{step}}} \newcommand{\DisturbanceAccelerationBound}{a_{\text{dist}}} \newcommand{\DisturbanceBasisCoefficient}{\psi} \newcommand{\DisturbanceBasisCount}{K} \newcommand{\DisturbanceBasisFunction}{B} \newcommand{\DisturbanceBudget}{\Delta_{w}} \newcommand{\DisturbanceDimension}{p} \newcommand{\DisturbanceForceBound}{d_{\max}} \newcommand{\DisturbanceParameterSet}{\Psi} \newcommand{\DisturbanceParameterVector}{\boldsymbol{\psi}} \newcommand{\DisturbanceTrajectory}{w_{\text{dist}}} \newcommand{\DivergenceInstant}{t_{\text{div}}} \newcommand{\DivergenceMeasure}{\mathcal{D}} \newcommand{\DivergenceTolerance}{\delta_{\text{tol}}} \newcommand{\DmaBurstPeriod}{T_{\text{dma}}} \newcommand{\DmaBurstStallTime}{C_{\text{dma}}} \newcommand{\DmaQueueTime}{t_{\text{DMA}}} \newcommand{\DocumentPayloadFraction}{q} \newcommand{\DomainRandomizationDistribution}{\mathcal{D}_{\text{DR}}} \newcommand{\DomainRandomizationObjective}{J_{\text{DR}}} \newcommand{\DominantComponentEnergy}{E_{\text{dominant}}} \newcommand{\DominantShare}{d} \newcommand{\DoorOpenReward}{r_{\text{open}}} \newcommand{\DoubleIntegratorPosition}{p} \newcommand{\DoubleIntegratorPositionDerivative}{\dot{p}} \newcommand{\DoubleIntegratorVelocity}{v} \newcommand{\DoubleIntegratorVelocityDerivative}{\dot{v}} \newcommand{\DoubleTreeAllReduceTime}{T_{\text{double-tree}}} \newcommand{\DownstreamStageLatency}{Y} \newcommand{\DpoLoss}{\mathcal{L}_{\text{DPO}}} \newcommand{\DraftAcceptanceRate}{\alpha} \newcommand{\DraftCandidateToken}{\tilde{x}} \newcommand{\DraftModelDistribution}{q_{\phi}} \newcommand{\DraftPositionAcceptanceProbability}{\alpha_{\text{spec}, j}} \newcommand{\DraftPositionIndex}{i} \newcommand{\DraftSamplingDistribution}{q} \newcommand{\DraftTokenAcceptanceProbability}{\alpha_{\text{acc}}} \newcommand{\DraftTokenCostRatio}{\beta} \newcommand{\DraftTokenCount}{\gamma} \newcommand{\DraftedToken}{T} \newcommand{\DragonflyGlobalChannelCount}{h} \newcommand{\DragonflyGroupRouterCount}{a} \newcommand{\DragonflyTerminalPortCount}{p} \newcommand{\DrainSourceVoltage}{V_{\text{ds}}} \newcommand{\DriftElapsedTime}{t_{\text{drift}}} \newcommand{\DriftImpactTime}{t_{\text{impact}}} \newcommand{\DriftLieDerivativeOperator}{L_{\mathbf{f}}} \newcommand{\DriftSpeedBound}{v_{\text{drift}}} \newcommand{\DriftTestSampleSize}{n} \newcommand{\DriftVelocityBound}{v_{\text{drift}}} \newcommand{\DriveBrakingForceCeiling}{F} \newcommand{\DriveBrakingTorqueCeiling}{\tau} \newcommand{\DrivenWheelLoadFraction}{\phi_{\text{drive}}} \newcommand{\DriverInterruptLatency}{t_{\text{driver\_irq}}} \newcommand{\DrivetrainAntiresonanceFrequency}{f_{\text{anti}}} \newcommand{\DrivetrainResonanceFrequency}{f_{\text{res}}} \newcommand{\DroopedSupplyVoltage}{V_{\text{droop}}} \newcommand{\DropletDiameter}{d_{\text{droplet}}} \newcommand{\DropoutProbability}{p_{\text{drop}}} \newcommand{\DualNumberInfinitesimal}{\epsilon} \newcommand{\DuplicateEffectProbability}{p_{\text{dup}}} \newcommand{\DurableAcknowledgmentTime}{t_{\text{ack}}} \newcommand{\DurableStoreWriteBandwidth}{\text{BW}_{\text{store}}} \newcommand{\DutyCyclePeriod}{T_{\text{period}}} \newcommand{\DynamicPower}{P_{\text{dynamic}}} \newcommand{\DynamicReachableSet}{\mathcal{R}} \newcommand{\DynamicsRealityGap}{\Delta_{\text{dyn}}} \newcommand{\EagerExecutionTime}{T_{\text{eager}}} \newcommand{\EarlierBaseFlangeTransform}{\mathbf{T}_{\text{base}, k}^{\text{flange}}} \newcommand{\EarlierCameraTargetTransform}{\mathbf{T}_{\text{cam}, k}^{\text{target}}} \newcommand{\EarlierControlStepIndex}{t'} \newcommand{\EarlierWorkerCount}{k} \newcommand{\EarliestConflictTime}{t_{\text{conflict}}} \newcommand{\EarthReferenceFrame}{\mathcal{F}_{\text{earth}}} \newcommand{\EchoFactor}{e} \newcommand{\EchoRoundTripTime}{t_{\text{rt}}} \newcommand{\EditGrantRights}{\mathcal{R}_{\Gamma_{\text{edit}}}} \newcommand{\EditPhaseCapabilityGrant}{\Gamma_{\text{edit}}} \newcommand{\EffectiveAdmissionCeiling}{Q_{\text{effective}}} \newcommand{\EffectiveApiOutputTokenPrice}{c_{\text{API}}} \newcommand{\EffectiveBrakingDelay}{T_{\text{eff}}} \newcommand{\EffectiveBranchingFactor}{b_{\text{eff}}} \newcommand{\EffectiveConfidentialityLabel}{\kappa_{\text{eff}}} \newcommand{\EffectiveFleetThroughput}{R_{\text{eff}}} \newcommand{\EffectiveImpactMass}{m_{\text{eff}}} \newcommand{\EffectiveIntegrityProvenance}{\iota_{\text{eff}}} \newcommand{\EffectiveJointInertia}{J_{\text{eff}}} \newcommand{\EffectiveLossResistance}{R_{\text{eff}}} \newcommand{\EffectiveSampleSize}{N_{\text{eff}}} \newcommand{\EffectiveSeriesStiffness}{k_{\text{eff}}} \newcommand{\EffectiveServiceRate}{\mu_{\text{eff}}} \newcommand{\EffectiveSpotTrainingCost}{C_{\text{effective}}} \newcommand{\EffectiveStorageThroughput}{R_{\text{storage,eff}}} \newcommand{\EffectiveWasteFraction}{W_{\text{effective}}} \newcommand{\EfficiencyHw}{\eta_{\text{hw}}} \newcommand{\EgressArrivalRate}{\lambda_{\text{arr}}} \newcommand{\EgressBufferCapacity}{Q_{\text{max}}} \newcommand{\EgressPortUtilization}{\rho_{\text{egress}}} \newcommand{\EgressPrice}{R_{\text{egress/GB}}} \newcommand{\EgressQueueOccupancy}{Q} \newcommand{\EgressServiceRate}{\mu} \newcommand{\ElapsedPlanningPeriods}{n} \newcommand{\ElasticJointTorque}{\mathbf{z}} \newcommand{\ElasticMaximumWorkerCount}{N_{\text{max}}} \newcommand{\ElasticMinimumWorkerCount}{N_{\text{min}}} \newcommand{\ElasticModalFrequencyMatrix}{\boldsymbol{\Omega}} \newcommand{\ElasticPotentialEnergy}{E} \newcommand{\ElasticStrainEnergy}{U_{\text{elastic}}} \newcommand{\ElasticTorqueSecondDerivative}{\ddot{\mathbf{z}}} \newcommand{\ElbowSwivelAngle}{\psi} \newcommand{\ElectricalAngularSpeed}{\omega_e} \newcommand{\ElectricalResistance}{R} \newcommand{\ElectricalRotorAngle}{\theta_e} \newcommand{\ElectricalTimeConstant}{\tau_e} \newcommand{\ElectricityPrice}{R_{\$/\text{kWh}}} \newcommand{\ElementStorageSize}{s_{\text{elem}}} \newcommand{\ElementaryCharge}{q} \newcommand{\ElementaryOperationCount}{W} \newcommand{\ElevationAngle}{\phi} \newcommand{\EligibleCachedPrefixLength}{S_{\text{hit}}} \newcommand{\EligibleTargetPositionSet}{\mathcal{P}_{\text{elig}}} \newcommand{\EligibleVectorCount}{N} \newcommand{\EliteSampleFraction}{\beta} \newcommand{\EmbeddingDimension}{d} \newcommand{\EmbeddingShardCount}{N_{\text{shards}}} \newcommand{\EmergencyStopContact}{S} \newcommand{\EmergencyStopCount}{n_{\text{estop}}} \newcommand{\EmittedArtifactCount}{N_{\text{emit}}} \newcommand{\EmittedTokenCount}{S_{\text{out}}} \newcommand{\EmpiricalBellmanOperator}{\mathcal{B}} \newcommand{\EmpiricalExceedanceFraction}{\hat{\zeta}_{u}} \newcommand{\EmpiricalTimestepAverage}{\hat{\mathbb{E}}} \newcommand{\EmpiricalTransferDiscrepancy}{\hat{\epsilon}_{\text{gap}}} \newcommand{\EmptyByteString}{\epsilon} \newcommand{\EncodedLatentState}{\hat{\mathbf{z}}} \newcommand{\EncoderAngle}{\theta_{\text{enc}}} \newcommand{\EncoderBitCount}{n} \newcommand{\EncoderLatentRepresentation}{\mathbf{z}} \newcommand{\EncoderVelocityEstimate}{\dot{\theta}_{\text{enc}}} \newcommand{\EncoderVelocityNoise}{\sigma_{\dot{\theta}_{\text{enc}}}} \newcommand{\EndEffectorCameraTransform}{\mathbf{T}_{EC}} \newcommand{\EndEffectorFirstAxisPosition}{x} \newcommand{\EndEffectorPitchAngle}{\phi_{\text{pitch}}} \newcommand{\EndEffectorPose}{\mathbf{T}_{WE}} \newcommand{\EndEffectorRollAngle}{\phi_{\text{roll}}} \newcommand{\EndEffectorSecondAxisPosition}{y} \newcommand{\EndEffectorTaskAcceleration}{\ddot{\mathbf{x}}} \newcommand{\EndEffectorTaskPosition}{\mathbf{x}} \newcommand{\EndEffectorTaskVelocity}{\dot{\mathbf{x}}} \newcommand{\EndEffectorThirdAxisPosition}{z} \newcommand{\EndEffectorTwist}{\mathbf{V}_E} \newcommand{\EndEffectorVelocity}{\mathbf{v}_e} \newcommand{\EndEffectorYawAngle}{\phi_{\text{yaw}}} \newcommand{\EndToEndRequestLatency}{L_{\text{lat,total}}} \newcommand{\EnergyCrossoverIntensity}{I_{\text{crossover}}} \newcommand{\EnergyLimitedContactForce}{F_E} \newcommand{\EnergyPerByteMoved}{E_{\text{move}}} \newcommand{\EnergyPerOperation}{E_{\text{compute}}} \newcommand{\EnergyTankBarrierFunction}{h_{\text{energy}}} \newcommand{\EnergyTankLevel}{E_{\text{tank}}} \newcommand{\EnergyTankPower}{\dot{E}_{\text{tank}}} \newcommand{\EnergyTankReserve}{E_{\text{min}}} \newcommand{\EnforcedCommandLabel}{\mathbf{a}_{\text{enf}, t}} \newcommand{\EnforcedCommandTap}{a_{\text{enf}}} \newcommand{\EnforcerComputeTime}{T_{\text{comp}}} \newcommand{\EnforcerDeadline}{T_{\text{deadline,enf}}} \newcommand{\EngineerHourlyCost}{C_{\text{engineer}}} \newcommand{\EngineeringTeamSize}{n} \newcommand{\EngineeringTemperatureCeiling}{T_{\text{ceil}}} \newcommand{\EnsembleSpreadThreshold}{\sigma_{\text{thresh}}} \newcommand{\EnsemblingDecayRate}{m} \newcommand{\EnsemblingWindowLength}{K} \newcommand{\EntityCount}{N_{\text{entities}}} \newcommand{\EntityEmbedding}{\mathbf{e}} \newcommand{\EntityIndex}{j} \newcommand{\EntropyTemperature}{\alpha} \newcommand{\EnvelopeCallCount}{N} \newcommand{\EnvelopeSetupTime}{T_{\text{setup}}} \newcommand{\EnvironmentCycleTime}{T_{\text{cycle}}} \newcommand{\EnvironmentFixture}{f} \newcommand{\EnvironmentLatentDimension}{d_z} \newcommand{\EnvironmentLatentVector}{\mathbf{z}} \newcommand{\EnvironmentParameters}{e} \newcommand{\EnvironmentResetTime}{T_{r}} \newcommand{\EnvironmentResponseFunction}{g} \newcommand{\EnvironmentRolloutStepCount}{h} \newcommand{\EnvironmentTransitionDistribution}{p} \newcommand{\EpipolarLine}{\mathbf{l}} \newcommand{\EpochCount}{N_{\text{epochs}}} \newcommand{\EpochIndex}{n_{\text{epoch}}} \newcommand{\EquilibriumWindingTemperature}{T_\infty} \newcommand{\EquivalentSeriesStiffness}{k_{\text{eq}}} \newcommand{\ErasureDataFragmentCount}{d} \newcommand{\ErasureParityFragmentCount}{m} \newcommand{\ErroneousPredictionCost}{C_{\text{error}}} \newcommand{\ErrorBudgetConsumption}{B} \newcommand{\ErrorCovarianceDerivative}{\dot{\mathbf{P}}} \newcommand{\ErrorFeedbackResidual}{\mathbf{e}} \newcommand{\ErrorFeedbackResidualElement}{e} \newcommand{\ErrorGrowthRate}{r} \newcommand{\ErrorRecoveryCost}{C_{\text{recovery}}} \newcommand{\EscalationDecision}{d} \newcommand{\EscalationLossMatrix}{\mathbf{L}} \newcommand{\EscalationThresholdProbability}{p_{\text{threshold}}} \newcommand{\EssentialMatrix}{\mathbf{E}} \newcommand{\EstimateEpoch}{t_{\text{est}}} \newcommand{\EstimatedAcceptanceProbability}{\hat{p}} \newcommand{\EstimatedAccuracy}{\hat{p}} \newcommand{\EstimatedCandidateUtility}{\hat{U}} \newcommand{\EstimatedCleanActionChunk}{\hat{\mathbf{A}}} \newcommand{\EstimatedCoriolisMatrix}{\hat{\mathbf{C}}} \newcommand{\EstimatedDamageProbability}{\hat{p}} \newcommand{\EstimatedDivergenceInstant}{\hat{t}_{\text{div}}} \newcommand{\EstimatedForceSensorBias}{\hat{b}} \newcommand{\EstimatedGravitationalTorque}{\hat{\mathbf{g}}} \newcommand{\EstimatedGripContactForce}{\hat{x}} \newcommand{\EstimatedHistoryAdvantage}{\hat{A}} \newcommand{\EstimatedInertiaMatrix}{\hat{\mathbf{M}}} \newcommand{\EstimatedPairedAcceptanceDifference}{\hat{\Delta}} \newcommand{\EstimatedPlantState}{\hat{\mathbf{x}}} \newcommand{\EstimatedPosition}{\hat{\mathbf{p}}} \newcommand{\EstimatedRemainingReturn}{\hat{V}} \newcommand{\EstimatedUtilityStandardDeviation}{s} \newcommand{\EstimatedVelocity}{\hat{\mathbf{v}}} \newcommand{\EstimatedWindingTemperature}{\hat{T}_{\text{wind}}} \newcommand{\EstimationErrorCovariance}{\mathbf{P}} \newcommand{\EstimatorDrawCount}{N} \newcommand{\EstimatorDrawStandardDeviation}{\sigma} \newcommand{\EstimatorState}{\mathbf{x}} \newcommand{\EstimatorStateVector}{\mathbf{x}} \newcommand{\EstimatorStepIndex}{k} \newcommand{\EulerIntegralFirstShape}{a} \newcommand{\EulerIntegralSecondShape}{b} \newcommand{\EulerIntegralVariable}{t} \newcommand{\EvaluatedExceedance}{y} \newcommand{\EvaluationPredicate}{\phi} \newcommand{\EvaluationSampleCount}{N} \newcommand{\EvaluationTrialCount}{N} \newcommand{\EvaluationTrialIndex}{i} \newcommand{\EventContrastThreshold}{C_{\text{th}}} \newcommand{\EventDetectionPower}{P_{\text{detect}}} \newcommand{\EventIndicator}{\mathbf{1}} \newcommand{\EventPacket}{e} \newcommand{\EventPolarity}{p} \newcommand{\EventProcessingEnergy}{E_{\text{event}}} \newcommand{\EvidenceCaptureInstant}{t_{\text{capture}}} \newcommand{\EvidenceEpoch}{t_0} \newcommand{\EvidenceHorizon}{\tau_{\text{ev}}} \newcommand{\EvidenceLowerBound}{\mathcal{L}_{\text{ELBO}}} \newcommand{\EvidenceRecordEvent}{e_{\text{obs}}} \newcommand{\ExactFailureLowerLimit}{p_{L}} \newcommand{\ExactFailureUpperLimit}{p_{U}} \newcommand{\ExampleAveragedBatchLoss}{\mathcal{L}_{\text{example}}} \newcommand{\ExampleIndex}{i} \newcommand{\ExampleLabel}{y} \newcommand{\ExceedanceReturnLevel}{z_\epsilon} \newcommand{\ExceedanceSampleSet}{\mathcal{Y}_u} \newcommand{\ExceedanceThreshold}{u} \newcommand{\ExcessDistributionFunction}{F_{u}} \newcommand{\ExcessForcePenaltyWeight}{\lambda_f} \newcommand{\ExcessSupportUpperEndpoint}{y_{\max}} \newcommand{\ExecutedActionStepCount}{T_a} \newcommand{\ExecutedToolCall}{a} \newcommand{\ExecutedTrialCount}{N_{\text{trial}}} \newcommand{\ExecutionHorizon}{H_{\text{exec}}} \newcommand{\ExecutionNondeterminism}{\xi} \newcommand{\ExecutionSwitchTime}{T_{\text{switch}}} \newcommand{\ExogenousDataDistribution}{\mathcal{D}} \newcommand{\ExpectedCategoryFrequency}{n_i^{\text{exp}}} \newcommand{\ExpectedCheckingTime}{T_{\text{check}}} \newcommand{\ExpectedCostLimit}{\delta} \newcommand{\ExpectedDecisionRisk}{\mathcal{R}} \newcommand{\ExpectedHistoryActionReturn}{Q} \newcommand{\ExpectedIrreversibleLoss}{L_A} \newcommand{\ExpectedNormalMaximum}{m_{N}} \newcommand{\ExpectedQueryDistribution}{p_{\text{expected}}} \newcommand{\ExpectedRemainingReturn}{V} \newcommand{\ExpectedReturnObjective}{J} \newcommand{\ExpectedRunCompletionTime}{T} \newcommand{\ExpectedTaskCostSum}{J} \newcommand{\ExperienceReplayBuffer}{\mathcal{D}} \newcommand{\ExperimentCount}{N_{\text{exp}}} \newcommand{\ExperimentUserIndex}{i} \newcommand{\ExpertCapacityFactor}{C_{\text{cap}}} \newcommand{\ExpertCount}{N_{\text{experts}}} \newcommand{\ExpertDiscountedStateVisitationDistribution}{d^{\pi^*}} \newcommand{\ExpertIndex}{e} \newcommand{\ExpertSelectionProbability}{p_e} \newcommand{\ExpertStateVisitationDistribution}{p^{\pi^*}} \newcommand{\ExpertTokenCount}{B_e} \newcommand{\ExploitCandidateFraction}{p_{\text{exp}}} \newcommand{\ExploitTrajectory}{\tau_{\text{hack}}} \newcommand{\ExploratoryStateVisitationDistribution}{p^{\pi_{\text{expl}}}} \newcommand{\ExponentBitIndex}{k} \newcommand{\ExponentialSeriesArgument}{u} \newcommand{\ExponentialStabilityConstant}{k} \newcommand{\ExposedCommunicationTime}{T_{\text{comm,exposed}}} \newcommand{\ExposedUnitCount}{E_{\text{exposure}}} \newcommand{\ExposureDuration}{t_{\text{exp}}} \newcommand{\ExposureMidpointTime}{t_{\text{mid}}} \newcommand{\ExposureMotionDisplacement}{\Delta x_{\text{motion}}} \newcommand{\ExposureStartTime}{t_{\text{start}}} \newcommand{\ExposureTravelDistance}{\Delta x} \newcommand{\ExtendedClassKInfinityFamily}{\mathcal{K}_\infty} \newcommand{\ExtendedDepthLength}{K_{\text{ext}}} \newcommand{\ExternalContactTorque}{\boldsymbol{\tau}_{\text{ext}}} \newcommand{\ExternalDispatchAction}{a_{\text{ext}}} \newcommand{\ExternalDisturbanceForce}{d} \newcommand{\ExternalDisturbanceLoad}{\mathbf{d}_{\text{ext}}} \newcommand{\ExternalJointTorque}{\tau_{\text{ext}}} \newcommand{\ExternalObjectWrench}{\mathbf{w}_{\text{ext}}} \newcommand{\ExternalWait}{T_{\text{wait}}} \newcommand{\ExternalWrench}{\mathbf{F}_{\text{ext}}} \newcommand{\ExtractionAnomalyClassifier}{f_{\theta}} \newcommand{\ExtractionQueryCount}{n_{\text{queries}}} \newcommand{\ExtrinsicCalibrationCovariance}{\boldsymbol{\Sigma}_{\text{ext}}} \newcommand{\ExtrinsicCovarianceJacobian}{\mathbf{J}_{\text{ext}}} \newcommand{\ExtrinsicLateralError}{\Delta y} \newcommand{\ExtrinsicMisalignmentAngle}{\theta_{\text{ext}}} \newcommand{\EyeInHandCameraMotion}{\mathbf{B}} \newcommand{\EyeInHandFlangeMotion}{\mathbf{A}} \newcommand{\EyeInHandUnknownTransform}{\mathbf{X}} \newcommand{\EyeToHandCameraPose}{\mathbf{B}'} \newcommand{\EyeToHandFlangePose}{\mathbf{A}'} \newcommand{\EyeToHandTargetTransform}{\mathbf{Z}} \newcommand{\EyeToHandUnknownTransform}{\mathbf{X}'} \newcommand{\FacilityEnergy}{E_{\text{facility}}} \newcommand{\FacilityHeatRemovalCapacity}{\dot{Q}_{\text{remove,max}}} \newcommand{\FacilityPower}{P_{\text{facility}}} \newcommand{\FacilityWaterConsumption}{W_{\text{water}}} \newcommand{\FactoredIntermediateActivation}{\mathbf{z}} \newcommand{\FactorizationRank}{k} \newcommand{\FailureDetectionTime}{T_{\text{detect}}} \newcommand{\FailureEventCost}{C_{\text{per-failure}}} \newcommand{\FailureFlagLatency}{\delta_{\text{flag}}} \newcommand{\FailureMarginFunction}{l} \newcommand{\FailureModeOccurrenceCount}{n_{f}} \newcommand{\FailureObservationInterval}{T} \newcommand{\FailureOverheadFraction}{F_{\text{fail}}} \newcommand{\FailureRecoveryTime}{T_{\text{recovery}}} \newcommand{\FailureRegion}{F} \newcommand{\FailureSet}{\mathcal{F}_{\text{fail}}} \newcommand{\FailureUpperConfidenceLimit}{p_{\text{fail, upper}}} \newcommand{\FairShareStabilizingConstant}{\epsilon_{\text{stab}}} \newcommand{\FairnessGapTolerance}{\epsilon_{\text{fair}}} \newcommand{\FakeQuantizedOutput}{x_{\text{fake}}} \newcommand{\FallbackCost}{C_{\text{fallback}}} \newcommand{\FallbackDeadline}{T_{\text{deadline,fallback}}} \newcommand{\FallbackHold}{T_{\text{hold}}} \newcommand{\FalseAcceptHarmCost}{C_{\text{harm}}} \newcommand{\FalseApprovalCount}{N_{\text{fa}}} \newcommand{\FalseApprovalOutcomeCount}{k} \newcommand{\FalseApprovalPropensity}{Q} \newcommand{\FalseApprovalPropensityLevel}{q} \newcommand{\FalseDiscoveryRateTarget}{q} \newcommand{\FalsificationInitialStateSet}{\mathcal{X}_0} \newcommand{\FanoutBackendCount}{m} \newcommand{\FarthestCandidateDistance}{D_{\max}} \newcommand{\FatTreeHostCount}{N_{\text{hosts}}} \newcommand{\FatigueLifeCycleCount}{N} \newcommand{\FaultContainmentLatency}{\Delta t_{\text{bounded}}} \newcommand{\FaultDetectionLatency}{\Delta t_{\text{det}}} \newcommand{\FaultDomainIsolation}{\mathcal{F}} \newcommand{\FaultInjectionDuration}{\Delta t_{\text{duration}}} \newcommand{\FaultStartTimestamp}{t_{\text{fault\_start}}} \newcommand{\FaultTakeoverLatency}{\Delta t_{\text{takeover}}} \newcommand{\FaultTakeoverTimestamp}{t_{\text{takeover}}} \newcommand{\FaultToleranceCost}{C_{\text{ft}}} \newcommand{\FaultToleranceInvestment}{x} \newcommand{\FeasibleOutputTokenRate}{\mu_{\text{out}}} \newcommand{\FeasibleTrajectoryProjection}{\Pi_{\mathcal{K}}} \newcommand{\FeasibleTrajectorySet}{\mathcal{K}} \newcommand{\FeatureCategoryCount}{k} \newcommand{\FeatureCategoryIndex}{i} \newcommand{\FeatureCellVector}{\mathbf{f}_{u, v}} \newcommand{\FeatureChannelCount}{C} \newcommand{\FeatureCount}{N_{\text{features}}} \newcommand{\FeatureFreshnessLatency}{T_{\text{freshness}}} \newcommand{\FeatureMapColumnCoordinate}{x} \newcommand{\FeatureMapGrowthRate}{g} \newcommand{\FeatureMapHeight}{H_{\text{img}}} \newcommand{\FeatureMapRowCoordinate}{y} \newcommand{\FeatureMapWidth}{W_{\text{img}}} \newcommand{\FeatureRecordTime}{t} \newcommand{\FeatureRetentionWindow}{T_{\text{retention}}} \newcommand{\FeatureUpdateInterval}{T_{\text{update}}} \newcommand{\FeatureUpdateLag}{T_{\text{staleness}}} \newcommand{\FeatureUpdateTimestamp}{t_{\text{feat}}} \newcommand{\FeatureViewingDistance}{r} \newcommand{\FederatedRoundCount}{R} \newcommand{\FederatedRoundIndex}{t} \newcommand{\FederatedTrainingEnergy}{E_{\text{federated}}} \newcommand{\FeedForwardOperations}{O_{\text{FFN}}} \newcommand{\FeedForwardWidth}{d_{\text{ff}}} \newcommand{\FeedbackCheckDuration}{t_{\text{check}}} \newcommand{\FeedbackCriticalPathLatency}{T^{\text{feedback}}} \newcommand{\FeedbackIntervalCount}{k} \newcommand{\FeedbackStepIndex}{t} \newcommand{\FeedforwardJointTorque}{\boldsymbol{\tau}_{\text{ff}}} \newcommand{\FeedthroughMatrix}{\mathbf{D}} \newcommand{\FewShotStepCount}{n_{\text{steps}}} \newcommand{\FewShotSupportSet}{\mathcal{D}_{\text{shot}}} \newcommand{\FiberPropagationSpeed}{c_{\text{fiber}}} \newcommand{\FieldbusCycleTime}{T_{\text{cycle}}} \newcommand{\FilmEncounterRate}{\lambda_{\text{film}}} \newcommand{\FilterSolveBudget}{T_{\text{budget}}} \newcommand{\FilterSolveTime}{T_{\text{solve}}} \newcommand{\FilterTapCount}{N} \newcommand{\FilterWeight}{w} \newcommand{\FilteredScreenSpaceCovariance}{\boldsymbol{\Sigma}_{2D}'} \newcommand{\FinalBusVoltage}{V_{\text{final}}} \newcommand{\FinalGeneratorLatentVector}{\mathbf{z}_{m}} \newcommand{\FinalLayerFunction}{f_{N_L}} \newcommand{\FinalLayerWidth}{n_{N_L}} \newcommand{\FinalMiniBatchActivation}{a_{B}} \newcommand{\FinalRecurrentHiddenState}{\mathbf{h}_{S}} \newcommand{\FinalWatchdogToken}{T_{\text{final}}} \newcommand{\FingerNormalForce}{f_n} \newcommand{\FingerTangentialForce}{\mathbf{f}_t} \newcommand{\FinishedWorkerCount}{j} \newcommand{\FiniteChange}{\Delta} \newcommand{\FiniteSampleGeneralizationBound}{\delta_N} \newcommand{\FiniteTimeHorizon}{T} \newcommand{\FirstAdjacentCheckIndex}{a} \newcommand{\FirstAdjacentCheckPassProbability}{p_{a}} \newcommand{\FirstAdjacentCheckSlotTime}{T_{a}} \newcommand{\FirstAtomicGradientUpdate}{A} \newcommand{\FirstCatalogDefinitionCount}{n_{\text{def},A}} \newcommand{\FirstCatalogDefinitionSize}{S_{A}} \newcommand{\FirstClassCoverageFloor}{a} \newcommand{\FirstClientMaskedUpdate}{\mathbf{y}_A} \newcommand{\FirstClientModelParameters}{\theta_A} \newcommand{\FirstComparedGroupLabel}{a} \newcommand{\FirstComparedItem}{i} \newcommand{\FirstDiscardedSingularNumber}{\sigma_{r+1}} \newcommand{\FirstErrorStepIndex}{k} \newcommand{\FirstFloatingPointAddend}{a} \newcommand{\FirstGroupClassificationThreshold}{\tau_{\text{thr},a}} \newcommand{\FirstGroupQualifiedFraction}{q_a} \newcommand{\FirstGroupSampleApprovalRate}{\hat{p}_a} \newcommand{\FirstGroupSampleSize}{n_a} \newcommand{\FirstGroupThresholdClassifier}{h_a} \newcommand{\FirstIncidentTime}{t_1} \newcommand{\FirstInputNodePrimal}{v_{1-N}} \newcommand{\FirstJaccardSet}{\mathcal{A}} \newcommand{\FirstMistakeEvent}{\mathcal{E}} \newcommand{\FirstRankComputeTime}{T_{\text{rank}_0}} \newcommand{\FirstRaterCategoryFraction}{p_{y,1}} \newcommand{\FirstRingTraceElement}{a} \newcommand{\FirstSummandStandardDeviation}{\sigma_a} \newcommand{\FirstTwinCriticReturnEstimate}{Q_{\phi_1}} \newcommand{\FittedSensitivity}{\lambda} \newcommand{\FixedClearanceAllowance}{\delta} \newcommand{\FlangeCameraTransform}{\mathbf{T}_{\text{flange}}^{\text{cam}}} \newcommand{\FlangePose}{\mathbf{T}_{\text{flange}}} \newcommand{\FlangeReferenceFrame}{\mathcal{F}_{\text{flange}}} \newcommand{\FlangeTargetTransform}{\mathbf{T}_{\text{flange}}^{\text{target}}} \newcommand{\FlattenedFilterWeights}{\mathbf{w}_{\text{col}}} \newcommand{\FleetAcceleratorCount}{N_{\text{fleet}}} \newcommand{\FleetCommunicationTaxonomyAxis}{C_2} \newcommand{\FleetComputeTaxonomyAxis}{C_1} \newcommand{\FleetCoordinationTaxonomyAxis}{C_3} \newcommand{\FleetEnergyProductivity}{\rho_{\text{energy}}} \newcommand{\FleetManufacturingDistribution}{\mathcal{M}} \newcommand{\FleetResourceCapacity}{C_{r}} \newcommand{\FleetRobotCount}{N_{\text{fleet}}} \newcommand{\FlippedFloatExponentField}{e'} \newcommand{\FloatEncodedNumber}{x} \newcommand{\FloatExponentField}{e} \newcommand{\FloatMantissaField}{m} \newcommand{\FloatSignBit}{s} \newcommand{\FloatingBaseAccelerations}{\ddot{\mathbf{q}}_b} \newcommand{\FloatingBaseBiasForces}{\mathbf{h}_b} \newcommand{\FloatingBaseInertiaBlock}{\mathbf{M}_{bb}} \newcommand{\FloatingBasePose}{\mathbf{q}_b} \newcommand{\FlopPrice}{c_{\text{FLOP}}} \newcommand{\FlowMatchingLoss}{\mathcal{L}_{\text{FM}}} \newcommand{\FlowProbabilityPath}{\rho} \newcommand{\FlowSampleVector}{\mathbf{y}} \newcommand{\FlowTimeCoordinate}{t} \newcommand{\FocalLength}{f} \newcommand{\FollowerForwardWave}{\mathbf{u}_s} \newcommand{\FollowerJointPositions}{\mathbf{q}_{\text{follower}}} \newcommand{\FollowerMechanicalLatency}{t_{\text{mech}}} \newcommand{\FollowerReturnWave}{\mathbf{w}_s} \newcommand{\ForceGuidedRelay}{K} \newcommand{\ForceReadingInnovation}{\nu} \newcommand{\ForceSensorBias}{b} \newcommand{\ForceSensorReading}{y} \newcommand{\ForegroundLatency}{L_{\text{lat,fg}}} \newcommand{\ForgetDataset}{D_{\text{forget}}} \newcommand{\ForkBoundarySet}{\mathcal{B}_{\text{fork}}} \newcommand{\ForkedTrajectoryTokenCount}{N_{\text{total}}} \newcommand{\FormatComplianceScore}{\Phi} \newcommand{\FormatEfficiency}{\eta_{\text{format}}} \newcommand{\FormatRewardWeight}{\lambda_{\text{fmt}}} \newcommand{\ForwardDiffusionDistribution}{q} \newcommand{\ForwardEulerEigenvalue}{\lambda_{\text{FE}}} \newcommand{\ForwardEulerTransitionMatrix}{\mathbf{A}_{\text{FE}}} \newcommand{\ForwardInvariantSafeSet}{\mathcal{C}} \newcommand{\ForwardKinematicsMap}{\mathbf{FK}} \newcommand{\ForwardOccupancySet}{\mathcal{R}} \newcommand{\ForwardPassTokenCount}{n} \newcommand{\ForwardPosteriorMean}{\tilde{\boldsymbol{\mu}}} \newcommand{\ForwardPosteriorVariance}{\tilde{\beta}} \newcommand{\FourthRingTraceElement}{d} \newcommand{\FrameBitCount}{B_{\text{frame}}} \newcommand{\FrameBlockingTime}{B} \newcommand{\FrameExposureStartTime}{t_{\text{start}}} \newcommand{\FrameIndex}{i} \newcommand{\FramePayloadSize}{B_{\text{payload}}} \newcommand{\FramePeriod}{T} \newcommand{\FrameReadoutTime}{t_{\text{readout}}} \newcommand{\FrameReleaseJitter}{J} \newcommand{\FrameResponseTime}{R} \newcommand{\FrameSerializationTime}{t_{\text{frame},i}} \newcommand{\FrameTransmissionTime}{C} \newcommand{\FrameWireBitCount}{B_{\text{wire},i}} \newcommand{\FreeConfigurationSpace}{\mathcal{C}_{\text{free}}} \newcommand{\FreeCreditCount}{N_{\text{free}}} \newcommand{\FreeSpaceDepth}{d_{\text{free}}} \newcommand{\FreeSpaceLogOddsIncrement}{L_{\text{free}}} \newcommand{\FreeSurfaceTiltAngle}{\theta_{\text{tilt}}} \newcommand{\FreeboardHeight}{h_{f}} \newcommand{\FreshEvidenceTime}{t_{\text{fresh}}} \newcommand{\FreshInputTokenCount}{S_{\text{fresh}}} \newcommand{\FreshnessObjective}{S_{\text{freshness}}} \newcommand{\FrictionCoefficientFloor}{\mu_{\min}} \newcommand{\FrictionPyramidMatrix}{\mathbf{F}} \newcommand{\FrobeniusNorm}{F} \newcommand{\FrozenBackboneFunction}{f} \newcommand{\FrozenFeatureEncoder}{f} \newcommand{\FrozenWeightMatrix}{\mathbf{W}_{\text{frozen}}} \newcommand{\FrustumFeature}{\mathbf{c}_{u, v, k}} \newcommand{\FullBatchLoss}{\mathcal{L}_B} \newcommand{\FullDatasetSize}{D_{\text{total}}} \newcommand{\FullPrecisionWeight}{w} \newcommand{\FullSnapshotWriteVolume}{D_{\text{vol,full}}} \newcommand{\FullSpeedTravelTime}{b} \newcommand{\FunctionInputAdjoint}{\bar{x}} \newcommand{\FunctionInputDimension}{N} \newcommand{\FunctionInputElement}{x} \newcommand{\FunctionInputTangent}{\dot{x}} \newcommand{\FunctionInputVariable}{x} \newcommand{\FunctionInputVector}{\mathbf{x}} \newcommand{\FunctionJacobian}{\mathbf{J}} \newcommand{\FunctionOutputDimension}{M} \newcommand{\FunctionOutputElement}{y} \newcommand{\FunctionOutputVariable}{z} \newcommand{\FunctionOutputVector}{\mathbf{y}} \newcommand{\FunctionSecondInputVariable}{y} \newcommand{\FundamentalMatrix}{\mathbf{F}} \newcommand{\FusedConvolutionBias}{\mathbf{b}_{\text{fused}}} \newcommand{\FusedConvolutionWeight}{\mathbf{W}_{\text{fused}}} \newcommand{\FusedTokenCount}{N_{\text{total}}} \newcommand{\FusionCandidate}{x_{\text{cand}}} \newcommand{\FusionInputList}{\mathcal{L}} \newcommand{\FusionInputRank}{r} \newcommand{\FusionInputTensor}{\mathbf{X}} \newcommand{\FusionIntermediateTensor}{\mathbf{Z}} \newcommand{\FusionOutputTensor}{\mathbf{Y}} \newcommand{\FutureControlTrajectory}{\mathbf{u}_{[t, \infty)}} \newcommand{\FutureTimeInstant}{t'} \newcommand{\GaeAdvantageEstimate}{\widehat{A}^{\text{GAE}}} \newcommand{\GateCurrent}{I_g} \newcommand{\GateDriverSkew}{t_{\text{prop, skew}}} \newcommand{\GatePropagationDelay}{t_{\text{prop}}} \newcommand{\GateSourceCapacitance}{C_{\text{gs}}} \newcommand{\GateSourceCharge}{Q_{\text{gs}}} \newcommand{\GateSourceVoltage}{V_{\text{gs}}} \newcommand{\GaussianCovarianceMatrix}{\boldsymbol{\Sigma}} \newcommand{\GaussianDistribution}{\mathcal{N}} \newcommand{\GaussianFirstAxisScale}{s_{x}} \newcommand{\GaussianMeanVector}{\boldsymbol{\mu}} \newcommand{\GaussianMechanismNoiseVector}{\mathbf{z}} \newcommand{\GaussianMechanismStandardDeviation}{\sigma_{\text{mech}}} \newcommand{\GaussianOpacityLogit}{o} \newcommand{\GaussianPrimitiveCovariance}{\boldsymbol{\Sigma}} \newcommand{\GaussianPrimitiveDensity}{G} \newcommand{\GaussianPrimitiveIndex}{i} \newcommand{\GaussianPrimitiveMean}{\boldsymbol{\mu}} \newcommand{\GaussianPrimitiveOpacity}{\alpha} \newcommand{\GaussianPrimitiveScaleMatrix}{\mathbf{S}} \newcommand{\GaussianSecondAxisScale}{s_{y}} \newcommand{\GaussianStandardDeviation}{\sigma} \newcommand{\GaussianThirdAxisScale}{s_{z}} \newcommand{\GaussianViewDependentColor}{c} \newcommand{\GearFaceWidth}{b} \newcommand{\GearModule}{m} \newcommand{\GearRatedFatigueLife}{L_{\text{gear}}} \newcommand{\GearReductionRatio}{N_{\text{gear}}} \newcommand{\GearTangentialLoad}{W_t} \newcommand{\GearToothBendingStress}{\sigma_b} \newcommand{\GearTorqueReversalCount}{n_{\text{gear}}} \newcommand{\GearboxTransmissionEfficiency}{\eta_{\text{gear}}} \newcommand{\GemmAccumulatorScale}{\beta} \newcommand{\GemmColumnDimension}{N} \newcommand{\GemmInnerDimension}{K} \newcommand{\GemmLeftOperand}{\mathbf{A}} \newcommand{\GemmLeftOperandElement}{A} \newcommand{\GemmLeftOperandEntry}{A_{ik}} \newcommand{\GemmOutputElement}{C} \newcommand{\GemmOutputEntry}{C_{ij}} \newcommand{\GemmOutputMatrix}{\mathbf{C}} \newcommand{\GemmProductScale}{\alpha} \newcommand{\GemmReductionIndex}{k} \newcommand{\GemmRightOperand}{\mathbf{B}} \newcommand{\GemmRightOperandElement}{B} \newcommand{\GemmRightOperandEntry}{B_{kj}} \newcommand{\GemmRowDimension}{M} \newcommand{\GemmTileColumnDimension}{N_{\text{tile}}} \newcommand{\GemmTileInnerDimension}{K_{\text{tile}}} \newcommand{\GemmTileRowDimension}{M_{\text{tile}}} \newcommand{\GemvArithmeticIntensity}{I_{\text{GEMV}}} \newcommand{\GeneralPurposeEnergyProductivity}{\rho_{\text{energy,general}}} \newcommand{\GeneralizedAccelerationLowerBound}{\ddot{\mathbf{q}}_{\min}} \newcommand{\GeneralizedAccelerationUpperBound}{\ddot{\mathbf{q}}_{\max}} \newcommand{\GeneralizedAccelerations}{\ddot{\mathbf{q}}} \newcommand{\GeneralizedBiasForces}{\mathbf{h}} \newcommand{\GeneralizedCoordinateCount}{n} \newcommand{\GeneralizedCoordinates}{\mathbf{q}} \newcommand{\GeneralizedInertiaMatrix}{\mathbf{M}} \newcommand{\GeneralizedParetoDistribution}{H} \newcommand{\GeneralizedParetoLikelihood}{L} \newcommand{\GeneralizedVelocities}{\dot{\mathbf{q}}} \newcommand{\GeneratedResponse}{y} \newcommand{\GeneratedSampleCount}{n} \newcommand{\GeneratedTokenCap}{N_{\text{cap}}} \newcommand{\GenerationStepErrorRate}{\lambda_{\text{error}}} \newcommand{\GenerativeActionModelDistribution}{p_\theta} \newcommand{\GeneratorLatentVector}{\mathbf{z}} \newcommand{\GenericRandomVariable}{X} \newcommand{\GeometricStateRepresentation}{\mathbf{Z}_{\text{geom}}} \newcommand{\GevLocationParameter}{\mu} \newcommand{\GevScaleParameter}{\sigma} \newcommand{\GlobalBatchGradient}{\mathbf{g}_{\text{global}}} \newcommand{\GlobalBatchSize}{B_{\text{global}}} \newcommand{\GlobalDeviationPenalty}{\mathcal{R}} \newcommand{\GlobalModelParameters}{\theta_{\text{global}}} \newcommand{\GoalConfiguration}{\mathbf{q}_{\text{goal}}} \newcommand{\GoalSet}{\mathcal{G}_{\text{goal}}} \newcommand{\GoodputRelativeTolerance}{\epsilon_{\mathcal{G}}} \newcommand{\GpdCumulativeDistribution}{F_{\text{GPD}}} \newcommand{\GpdScaleParameter}{\tilde{\sigma}} \newcommand{\GpuAvailability}{A_{\text{GPU}}} \newcommand{\GpuEnergy}{E_{\text{GPU}}} \newcommand{\GpuFailureRate}{\lambda_{\text{GPU}}} \newcommand{\GpuMttf}{\text{MTTF}_{\text{GPU}}} \newcommand{\GpuTopologicalDistance}{d} \newcommand{\GradientClippingNorm}{C} \newcommand{\GradientCovarianceMatrix}{\Sigma} \newcommand{\GradientElementCount}{d_{\text{grad}}} \newcommand{\GradientMemory}{M_{\text{gradients}}} \newcommand{\GradientPayload}{M_{\text{grad}}} \newcommand{\GradientStaleness}{\tau_{\text{stale}}} \newcommand{\GrantAllowedAccesses}{\mathcal{A}} \newcommand{\GrantCondition}{\phi_{\Gamma}} \newcommand{\GrantExpiryTime}{t_{\text{exp}}} \newcommand{\GrantIssueTime}{T} \newcommand{\GrantRights}{\mathcal{R}_{\Gamma}} \newcommand{\GraphEdgeSet}{E} \newcommand{\GraphNodeIndex}{i} \newcommand{\GraphNodeSet}{V} \newcommand{\GraspContactDisplacement}{\mathbf{d}} \newcommand{\GraspForceCeiling}{f_{\max}} \newcommand{\GraspForceFloor}{f_{\min}} \newcommand{\GraspMap}{\mathbf{G}} \newcommand{\GraspOrientation}{\mathbf{R}_{\text{grasp}}} \newcommand{\GraspPose}{\mathbf{T}_{\text{grasp}}} \newcommand{\GraspPosition}{\mathbf{p}_{\text{grasp}}} \newcommand{\GraspVerticalAcceleration}{a_z} \newcommand{\GravitationalTorqueVector}{\mathbf{g}} \newcommand{\Gravity}{g} \newcommand{\GravityCenterHeight}{h_{\text{cg}}} \newcommand{\GravityVector}{\mathbf{g}_0} \newcommand{\GridFeedCapacity}{P_{\text{grid}}} \newcommand{\GridSideCellCount}{N} \newcommand{\GripContactForce}{x} \newcommand{\GripperContactAngle}{\theta_{\text{contact}}} \newcommand{\GripperOpeningCommand}{a_{\text{gripper}}} \newcommand{\GroundPlaneAbscissa}{x} \newcommand{\GroundPlaneOrdinate}{y} \newcommand{\GroupCommitWaitTime}{L_{\text{lat}, i}} \newcommand{\GroupContrastProbability}{p_{\text{contrast}}} \newcommand{\GroupDisparity}{\Delta_g} \newcommand{\GroupMeanReward}{\mu_{R}} \newcommand{\GroupRelativeAdvantage}{\hat{A}} \newcommand{\GroupRewardStandardDeviation}{\sigma_{R}} \newcommand{\GroupRolloutIndex}{i} \newcommand{\GroupSize}{G} \newcommand{\GrpoSampledObjective}{\widehat{\mathcal{J}}_{\text{GRPO}}} \newcommand{\GuardBandDuration}{t_{\text{guard}}} \newcommand{\GuardedContactPredicate}{P_{\text{contact}}} \newcommand{\GuestImageMemory}{M_{\text{guest}}} \newcommand{\GuestKernelBootTime}{T_{\text{kernel}}} \newcommand{\HadamardRotationMatrix}{\mathbf{H}} \newcommand{\HalfPrecisionGemvIntensity}{I_{\text{GEMV, 16-bit}}} \newcommand{\HammingDataBitCount}{n} \newcommand{\HandForceCriterion}{F_h} \newcommand{\HandleAffordanceFrame}{\mathcal{F}_{\text{handle}}} \newcommand{\HandoffExceedanceProbability}{\epsilon} \newcommand{\HandoverTimeout}{T_{\text{timeout}}} \newcommand{\HandoverTimeoutCeiling}{T_{\text{config}}} \newcommand{\HandshakeProtocolLatency}{T_{\text{handshake}}} \newcommand{\HardwareCommonCauseRate}{\lambda_{\text{other}}} \newcommand{\HardwareParameterVector}{\boldsymbol{\xi}_{\text{real}}} \newcommand{\HardwareServiceLife}{T_{\text{lifetime}}} \newcommand{\HarmInclusiveTaskCost}{C_{\text{with\ harm}}} \newcommand{\HarmInstant}{t_{\text{harm}}} \newcommand{\HarmLeadTime}{t_{\text{harm}}} \newcommand{\HarmonicDriveTorsionalStiffness}{k_c} \newcommand{\HarmonicPeriodMultiple}{m} \newcommand{\HarnessConnectorResistance}{R_{\text{harness}}} \newcommand{\HashBucketCount}{N_{\text{buckets}}} \newcommand{\HashEntrySize}{s_{\text{entry}}} \newcommand{\HashRingServer}{s} \newcommand{\HashRingServerCount}{N} \newcommand{\HashRingServerSet}{\mathcal{S}_{\text{srv}}} \newcommand{\HashedGridMemory}{M_{\text{hashed}}} \newcommand{\HazardClassIndex}{h} \newcommand{\HazardOnset}{t_{\text{onset}}} \newcommand{\HazardOnsetBound}{t_{\text{bound}}} \newcommand{\HazardousProposalRate}{\lambda_{\text{proposal}, h}} \newcommand{\HazardousWorldState}{s_B} \newcommand{\HeadAxisLabel}{h} \newcommand{\HeadByteAllocation}{M_{\text{head}}} \newcommand{\HeadComponentIndex}{m} \newcommand{\HeadDimensionAxisLabel}{d} \newcommand{\HeadKeyProjectionMatrix}{\mathbf{W}_{K,i}} \newcommand{\HeadQueryProjectionMatrix}{\mathbf{W}_{Q,i}} \newcommand{\HeadSamplingProbability}{\theta} \newcommand{\HeadValuesProjectionMatrix}{\mathbf{W}_{V,i}} \newcommand{\HeadingAngle}{\theta_{\text{head}}} \newcommand{\HeadingCurvature}{\kappa} \newcommand{\HealthyStepTime}{T_{\text{healthy}}} \newcommand{\HeartbeatAge}{\Delta t_{\text{heartbeat}}} \newcommand{\HeartbeatInterval}{H} \newcommand{\HeartbeatReceiptTime}{t_{\text{local}}} \newcommand{\HeartbeatSequenceCounter}{k} \newcommand{\HeartbeatTimestamp}{t^{\text{hb}}} \newcommand{\HeatDissipationPower}{P_{\text{heat}}} \newcommand{\HermiteBasisFunction}{h} \newcommand{\HermiteInterpolationFraction}{\lambda} \newcommand{\HermiteSegmentProgress}{s} \newcommand{\HertzianContactCoefficient}{k_{c}} \newcommand{\HertzianContactStiffness}{k_H} \newcommand{\HiddenActivation}{\mathbf{h}} \newcommand{\HiddenActivationMatrix}{\mathbf{H}} \newcommand{\HiddenDimension}{d} \newcommand{\HiddenUnitOutput}{h} \newcommand{\HighOccupancyBinCount}{m} \newcommand{\HigherPriorityFrames}{hp} \newcommand{\HigherPriorityTasks}{hp} \newcommand{\HighestSignalFrequency}{f_{\max}} \newcommand{\HnswLayerIndex}{L} \newcommand{\HnswLevelDraw}{U} \newcommand{\HnswLevelNormalization}{m_\ell} \newcommand{\HnswMaximumConnectionCount}{M} \newcommand{\HnswSearchBeamWidth}{ef_{\text{search}}} \newcommand{\HoldingTorque}{\tau_{\text{hold}}} \newcommand{\HomogeneousCameraFramePoint}{\tilde{\mathbf{p}}_C} \newcommand{\HomogeneousPixelCoordinates}{\tilde{\mathbf{m}}} \newcommand{\HomogeneousPointCoordinates}{\tilde{\mathbf{p}}} \newcommand{\HomogeneousTransform}{\mathbf{T}_{AB}} \newcommand{\HomogeneousWorldFramePoint}{\tilde{\mathbf{p}}_W} \newcommand{\HomographyColumn}{\mathbf{h}} \newcommand{\HomographyColumnEntry}{h} \newcommand{\HomographyConstraintVector}{\mathbf{v}} \newcommand{\HomographyScaleFactor}{\lambda} \newcommand{\HomomorphicCiphertext}{c} \newcommand{\HomomorphicFunction}{f} \newcommand{\HomomorphicPublicKey}{pk} \newcommand{\HomomorphicSecretKey}{sk} \newcommand{\HorizonStepIndex}{k} \newcommand{\HorizontalFocalLength}{f_x} \newcommand{\HostArrivalTimestamp}{t_{\text{host}}} \newcommand{\HostHeartbeatRate}{f_{\text{heartbeat}}} \newcommand{\HostLinkBandwidth}{\text{BW}_{\text{link}}} \newcommand{\HostPower}{P_{\text{host}}} \newcommand{\HostPreparationTime}{T_{\text{prep}}} \newcommand{\HostRuntimeCount}{N_{\text{host}}} \newcommand{\HostSoftwareTime}{T_{\text{sw}}} \newcommand{\HostTransferBandwidth}{\text{BW}_{\text{host}}} \newcommand{\HotTierHitProbability}{h} \newcommand{\HotTierServiceTime}{T_{\text{hot}}} \newcommand{\HourlyAccountQueryCount}{q_{\text{hourly}}} \newcommand{\HourlyComponentFailureRate}{\lambda_{\text{hour}}} \newcommand{\HuberLossThreshold}{\delta} \newcommand{\HullQueryTime}{t_{\text{query}}} \newcommand{\HullSphereRadius}{r_{\text{hull}}} \newcommand{\HumanCommandRate}{\dot{\mathbf{u}}_{\text{human}}} \newcommand{\HumanControlCommand}{\mathbf{u}_{\text{human}}} \newcommand{\HumanFallbackCost}{C_{h}} \newcommand{\HumanReactionTime}{T_{\text{human}}} \newcommand{\HumanResolutionProbability}{h} \newcommand{\HumanReviewCost}{C_{\text{human}}} \newcommand{\HumanStandaloneSensitivity}{S_{\text{human}}} \newcommand{\HumanWalkingSpeedBound}{v_h} \newcommand{\HybridIterationTime}{T_{\text{step}}} \newcommand{\HydraulicSupplyPressure}{p} \newcommand{\HypothesisIndex}{h} \newcommand{\HypothesisTestFalseNegativeRate}{\beta_{\text{stat}}} \newcommand{\HypothesisTestSignificanceLevel}{\alpha_{\text{sig}}} \newcommand{\HypothesizedAcceptanceProbability}{p} \newcommand{\HypothesizedTrialFailureProbability}{p} \newcommand{\IdealAcceleratorTime}{T_{\text{ideal}}} \newcommand{\IdealMemoryQueueDelay}{t_{\text{queue,ideal}}} \newcommand{\IdempotentAlgebraElement}{x} \newcommand{\IdentityMatrix}{\mathbf{I}} \newcommand{\IllustrativeFunction}{f} \newcommand{\ImageChannelCount}{C} \newcommand{\ImageChannelIndex}{c} \newcommand{\ImageColumnIndex}{w} \newcommand{\ImageEpipole}{\mathbf{e}} \newcommand{\ImageHeight}{H} \newcommand{\ImagePlanePixelCoordinates}{\mathbf{u}_{\text{px}}} \newcommand{\ImageRowIndex}{h} \newcommand{\ImageTensorElement}{X} \newcommand{\ImageWidth}{W} \newcommand{\ImaginaryUnit}{j} \newcommand{\ImitationLearnedPolicy}{\hat{\pi}} \newcommand{\ImitationTargetCommand}{\mathbf{u}_{\text{target}}} \newcommand{\ImmediateTaskCostScore}{C} \newcommand{\ImpactInstant}{T} \newcommand{\ImpactRiseTime}{t_{\text{rise}}} \newcommand{\ImpactSpeed}{v_{\text{impact}}} \newcommand{\ImpedanceControlledPosition}{x} \newcommand{\ImpedanceControlledVelocity}{\dot{x}} \newcommand{\ImpedanceEquilibriumPosition}{x_{\text{des}}} \newcommand{\ImpedanceEquilibriumVelocity}{\dot{x}_{\text{des}}} \newcommand{\ImpedanceRestoringForce}{F} \newcommand{\ImplicitPolicyEnergyFunction}{E_\theta} \newcommand{\ImportanceProposalDistribution}{q} \newcommand{\ImportanceSampledFailureProbability}{\hat{p}_F} \newcommand{\ImuSampleTime}{t_{\text{IMU}}} \newcommand{\InContactViableSet}{\mathcal{C}_{\text{contact}}} \newcommand{\IncidenceAngle}{\theta_{\text{inc}}} \newcommand{\IncidentOpticalPower}{P_{\text{opt}}} \newcommand{\IncomingChannelCommand}{u_{\text{new}}} \newcommand{\IncomingCommandDerivative}{\dot{u}_{\text{new}}} \newcommand{\IncorrectCandidateTrialPassProbability}{p_{b}} \newcommand{\IncrementalSnapshotWriteVolume}{D_{\text{vol,delta}}} \newcommand{\IncumbentControlCommand}{\mathbf{u}^{\text{incumbent}}} \newcommand{\IncumbentInterventionRate}{\lambda_{\text{incumbent}}} \newcommand{\IncumbentTrackingErrorStandardDeviation}{\sigma_{\text{incumbent}}} \newcommand{\IndependentAttemptCount}{k} \newcommand{\IndependentEventProbability}{p} \newcommand{\IndependentSampleRate}{f} \newcommand{\IndexGraphNodeSet}{V} \newcommand{\IndexedDocumentCount}{N} \newcommand{\IndicatorFunction}{\mathbb{I}} \newcommand{\InducedGateVoltage}{V_{\text{gs,induced}}} \newcommand{\InductiveVoltage}{v} \newcommand{\InequalityConstraintFunction}{g} \newcommand{\InertiaMatchingRatio}{N^*} \newcommand{\InertiaMatrixDerivative}{\dot{\mathbf{M}}} \newcommand{\InertialIntegrationTime}{T} \newcommand{\InferenceActiveTime}{t_{\text{inference}}} \newcommand{\InferenceCost}{C_{\text{infer}}} \newcommand{\InferenceDutyCycle}{\alpha_{\text{duty}}} \newcommand{\InferenceEnergy}{E_{\text{inf}}} \newcommand{\InferenceLatency}{L_{\text{lat,infer}}} \newcommand{\InferenceLoadSocPower}{P_{\text{load}}} \newcommand{\InflatedHullRadius}{r_{\text{inflated}}} \newcommand{\InflightRolloutReservation}{M_{\text{inflight}}} \newcommand{\InfluenceFunction}{I} \newcommand{\InformationTechnologyEnergy}{E_{\text{IT}}} \newcommand{\InformationTechnologyHeatLoad}{\dot{Q}_{\text{IT}}} \newcommand{\InformationTechnologyPower}{P_{\text{IT}}} \newcommand{\InformativeTaskFraction}{p_{\text{inform}}} \newcommand{\IngestionPricePerSample}{C_{\text{ingest/sample}}} \newcommand{\InitialAccuracy}{\text{Accuracy}_0} \newcommand{\InitialBusVoltage}{V_{\text{initial}}} \newcommand{\InitialPositionStandardDeviation}{\sigma_{p,0}} \newcommand{\InitialPositionVelocityCovariance}{\sigma_{pv,0}} \newcommand{\InitialProposalDistribution}{q_{\boldsymbol{\psi}_0}} \newcommand{\InitialStateDistribution}{\rho_0} \newcommand{\InitialTrackingError}{e_0} \newcommand{\InitialVelocityStandardDeviation}{\sigma_{v,0}} \newcommand{\InitiatedTasks}{N} \newcommand{\InjectionBandwidth}{\text{BW}_{\text{inject}}} \newcommand{\InjectionTriggerEpoch}{t_{\text{inject}}} \newcommand{\InnerChainTransform}{\mathbf{T}_{BC}} \newcommand{\InnerLayerFunction}{g} \newcommand{\InnerProductLeftComponent}{a} \newcommand{\InnerProductLeftVector}{\mathbf{a}} \newcommand{\InnerProductRightComponent}{v} \newcommand{\InnerProductRightVector}{\mathbf{b}} \newcommand{\InnovationBias}{b} \newcommand{\InnovationCovariance}{\mathbf{S}} \newcommand{\InnovationVariance}{S} \newcommand{\InputCaptureTime}{T_{\text{capture}}} \newcommand{\InputChannelCount}{C_{\text{in}}} \newcommand{\InputChannelIndex}{c} \newcommand{\InputColumnLieDerivativeOperator}{L_{\mathbf{g}_j}} \newcommand{\InputConsumerAcceleratorCount}{N_{\text{GPU}}} \newcommand{\InputCoordinateCount}{d} \newcommand{\InputDistribution}{p(x)} \newcommand{\InputEventRate}{r_{\text{event}}} \newcommand{\InputFeatureIndex}{i} \newcommand{\InputFeatureVector}{\mathbf{x}} \newcommand{\InputLieDerivativeOperator}{L_{\mathbf{g}}} \newcommand{\InputNodePrimal}{v_{i-N}} \newcommand{\InputPipelineRate}{R_{\text{pipeline}}} \newcommand{\InputPipelineRatio}{r_{\text{pipe}}} \newcommand{\InputPipelineServiceRate}{r_{\text{pipeline}}} \newcommand{\InputPipelineStageIndex}{j} \newcommand{\InputQuantizationScale}{s_X} \newcommand{\InputResolution}{r} \newcommand{\InputStageServiceRate}{r} \newcommand{\InputTokenPrice}{c_{\text{in}}} \newcommand{\InputTokenSequence}{x_{1:S}} \newcommand{\InputVariableIndex}{m} \newcommand{\InsetAvailableBrakingDistance}{D_{\text{avail}}} \newcommand{\InstanceReplenishTime}{T_{\text{init}}} \newcommand{\InstantaneousPhaseCurrent}{i_{\text{phase}}} \newcommand{\InstantaneousRequestOccupancy}{Q} \newcommand{\IntegerWeightCode}{q} \newcommand{\IntegralControlEffort}{\mathbf{u}_{\text{int}}} \newcommand{\IntegralGainMatrix}{\mathbf{K}_{i}} \newcommand{\IntegratedPixelResponse}{I_{\text{pixel}}} \newcommand{\IntegrationCandidateCommitHash}{h_{\text{candidate}}} \newcommand{\IntegrationDummyTime}{t'} \newcommand{\IntegrationHeadCommitHash}{h_{\text{head}}} \newcommand{\IntegrationPoint}{\mathbf{y}} \newcommand{\IntegrationPointCoordinate}{y} \newcommand{\IntegrationTimeInstant}{s} \newcommand{\IntegratorState}{\mathbf{z}} \newcommand{\IntegratorStateRate}{\dot{\mathbf{z}}} \newcommand{\IntegratorUnwindDelay}{T_{\text{unwind}}} \newcommand{\IntegrityProvenance}{\iota} \newcommand{\IntegrityTrustLabel}{\iota} \newcommand{\IntentAcknowledgmentEvent}{e_{\text{flush}}} \newcommand{\IntentAdministrativeLease}{T_{\text{admin}}} \newcommand{\IntentDemonstrationDataset}{\mathcal{D}_{\text{intent}}} \newcommand{\IntentLease}{\mathcal{I}_{\text{intent}}} \newcommand{\IntentLeaseExpiry}{t_{\text{intent\_exp}}} \newcommand{\IntentProposalPeriod}{T_{\text{period}}} \newcommand{\InterAnnotatorAgreement}{\kappa} \newcommand{\InterFeedInterval}{T_{\text{feed}}} \newcommand{\InterGroupColumnDelay}{t_{\text{CCD\_S}}} \newcommand{\InterKernelGapTime}{T_{\text{gap}}} \newcommand{\InterNodeContextParallelDegree}{c_{\text{inter}}} \newcommand{\InterQueryIntervalDeviation}{\sigma_{\text{inter-query}}} \newcommand{\InterSensorClockSkew}{\Delta t_{\text{skew}}} \newcommand{\InteractionHistory}{h} \newcommand{\InteractionPortForce}{F} \newcommand{\InteractionPortVelocity}{v} \newcommand{\InterarrivalVariationCoefficient}{c_{a}} \newcommand{\InterfaceMaterialThermalResistance}{R_{\text{th,TIM}}} \newcommand{\InterferenceSlowdownFactor}{r_{\text{slow}}} \newcommand{\InterframeSpacingTime}{t_{\text{interframe},i}} \newcommand{\InterleavedPipelineBubbleFraction}{b_{\text{interleaved}}} \newcommand{\IntermediateTensorSize}{M_{\text{tensor}}} \newcommand{\InternalDissipationPower}{g} \newcommand{\IntervalCompletionTime}{T_{\text{total}}} \newcommand{\IntervalMean}{\bar{T}} \newcommand{\IntervalMeanOccupancy}{\bar{Q}} \newcommand{\IntervalNormalQuantile}{z} \newcommand{\IntervalStandardDeviation}{\sigma} \newcommand{\IntervalTransitionMatrix}{\boldsymbol{\Phi}} \newcommand{\IntervalVariationCoefficient}{c} \newcommand{\InterventionDensity}{D_{\text{int}}} \newcommand{\InterventionRate}{\lambda_{\text{int}}} \newcommand{\InterventionWindowDuration}{W} \newcommand{\IntraClusterCorrelation}{\rho_{\text{ICC}}} \newcommand{\IntraGroupColumnDelay}{t_{\text{CCD\_L}}} \newcommand{\IntraNodeContextParallelDegree}{c_{\text{intra}}} \newcommand{\IntrusionDistance}{C} \newcommand{\IntrusionDistanceAllowance}{C} \newcommand{\InvalidatedArtifactNode}{v} \newcommand{\InverseDepth}{\rho} \newcommand{\InverseDepthLandmarkParameters}{\mathbf{y}} \newcommand{\InverseKinematicsDamping}{\lambda} \newcommand{\InverseSensorLogOdds}{L_{\text{sensor}}} \newcommand{\InverterCurrentLimit}{I_{\max}} \newcommand{\InverterDeadTime}{t_{\text{dead}}} \newcommand{\IoTransferTime}{T_{\text{IO}}} \newcommand{\IronCaseThermalResistance}{R_{\text{th,iron-case}}} \newcommand{\IronLawComputeTime}{T_{\text{compute}}} \newcommand{\IronLawMemoryTime}{T_{\text{memory}}} \newcommand{\IronLossPower}{P_{\text{iron}}} \newcommand{\IronThermalCapacitance}{C_{\text{iron}}} \newcommand{\IrreducibleLoss}{C_{\mathcal{L}}} \newcommand{\IsolatedEnforcerExecutionTime}{t_{\text{iso}}} \newcommand{\IsolatedJobRunTime}{T} \newcommand{\IspProcessingTime}{t_{\text{ISP}}} \newcommand{\IsrExecutionTime}{t_{\text{ISR}}} \newcommand{\IterationCost}{C_{\text{iter}}} \newcommand{\IterationTokenBudget}{N_{\text{budget}}} \newcommand{\JaccardSimilarity}{J} \newcommand{\JacobianLeftSingularMatrix}{\mathbf{U}} \newcommand{\JacobianLeftSingularVector}{\mathbf{u}} \newcommand{\JacobianPseudoinverse}{\mathbf{J}^\dagger} \newcommand{\JacobianRightSingularMatrix}{\mathbf{V}} \newcommand{\JacobianRightSingularVector}{\mathbf{v}} \newcommand{\JacobianSingularNumber}{\sigma} \newcommand{\JacobianSingularNumberMatrix}{\boldsymbol{\Sigma}} \newcommand{\JawAperture}{w_{\text{aperture}}} \newcommand{\JensenShannonDivergence}{\mathcal{D}_{\text{JS}}} \newcommand{\JensenShannonMixtureDistribution}{\bar{P}} \newcommand{\JerkLimit}{j_{\max}} \newcommand{\JerkWeightMatrix}{\mathbf{W}_j} \newcommand{\JitterBufferPlayoutDelay}{T_{\text{buf}}} \newcommand{\JobAbsoluteDeadline}{d} \newcommand{\JobAvailability}{A_{\text{all}}} \newcommand{\JobDuration}{T_{\text{job}}} \newcommand{\JobIndex}{j} \newcommand{\JobQueueWaitTime}{W} \newcommand{\JobReleaseTime}{r} \newcommand{\JobRestartTime}{T_{\text{restart}}} \newcommand{\JobSlowdown}{S} \newcommand{\JobStartupTime}{T_{\text{startup}}} \newcommand{\JointAcceleration}{\ddot{q}} \newcommand{\JointAngle}{\theta_{\text{joint}}} \newcommand{\JointAngleLowerLimit}{q_{\min}} \newcommand{\JointAngleUpperLimit}{q_{\max}} \newcommand{\JointAngularAcceleration}{\dot{\omega}} \newcommand{\JointAngularRate}{\omega} \newcommand{\JointAngularSpeed}{\omega} \newcommand{\JointBaseInertiaCoupling}{\mathbf{M}_{jb}} \newcommand{\JointBiasTorque}{\tau_{\text{bias}}} \newcommand{\JointCoordinate}{q} \newcommand{\JointCount}{n} \newcommand{\JointFrictionTorque}{\tau_{\text{fric}}} \newcommand{\JointIndex}{i} \newcommand{\JointJerk}{j_{\text{joint}}} \newcommand{\JointLoadTorque}{\tau_{\text{load}}} \newcommand{\JointOutputImpedance}{Z_{\text{out}}} \newcommand{\JointOutputTorque}{\tau_{\text{out}}} \newcommand{\JointPathCurvature}{\mathbf{q}''} \newcommand{\JointPathTangent}{\mathbf{q}'} \newcommand{\JointPosition}{q} \newcommand{\JointPositionLowerLimit}{\mathbf{q}_{\min}} \newcommand{\JointPositionSetpoint}{\mathbf{q}^*} \newcommand{\JointPositionTarget}{q_{\text{des}}} \newcommand{\JointPositionUpperLimit}{\mathbf{q}_{\max}} \newcommand{\JointReflectedRotorInertia}{J_{m}} \newcommand{\JointSampleTimestamp}{t_{\text{joint}}} \newcommand{\JointTorque}{\boldsymbol{\tau}} \newcommand{\JointTorqueConstant}{K_t} \newcommand{\JointTorqueLimit}{\tau_{\max}} \newcommand{\JointTorqueLimits}{\boldsymbol{\tau}_{\max}} \newcommand{\JointTorqueLowerLimit}{\boldsymbol{\tau}_{\min}} \newcommand{\JointTorqueSlew}{\dot{\boldsymbol{\tau}}} \newcommand{\JointTorqueSlewLimit}{\dot{\boldsymbol{\tau}}_{\max}} \newcommand{\JointTorqueTarget}{\tau_{\text{des}}} \newcommand{\JointTorqueUpperLimit}{\boldsymbol{\tau}_{\max}} \newcommand{\JointTorsionalStiffnessMatrix}{\mathbf{K}} \newcommand{\JointTrackingError}{\mathbf{e}} \newcommand{\JointVelocity}{\dot{q}} \newcommand{\JointVelocityCeiling}{\dot{q}_{\max}} \newcommand{\JointVelocityLimit}{\dot{\mathbf{q}}_{\max}} \newcommand{\JointVelocitySetpoint}{\dot{\mathbf{q}}^*} \newcommand{\JointVelocityTarget}{\dot{q}_{\text{des}}} \newcommand{\JouleanTemperatureRise}{\Delta T} \newcommand{\JunctionAmbientThermalResistance}{R_{\text{th,JA}}} \newcommand{\JunctionCaseThermalResistance}{R_{\text{th,JC}}} \newcommand{\JunctionTemperature}{T_{\text{j}}} \newcommand{\KalmanBucyObserverGain}{\mathbf{L}} \newcommand{\KalmanGain}{\mathbf{G}} \newcommand{\KeepContextPathCost}{C_{\text{keep}}} \newcommand{\KendallMarkovianCode}{M} \newcommand{\KernelActiveTime}{T_{\text{compute}}} \newcommand{\KernelColumnOffset}{n} \newcommand{\KernelExecutionTime}{T_{\text{kernel}}} \newcommand{\KernelHeight}{K_h} \newcommand{\KernelHorizontalLoopOffset}{k_{x}} \newcommand{\KernelRowOffset}{m} \newcommand{\KernelSize}{K} \newcommand{\KernelVerticalLoopOffset}{k_{y}} \newcommand{\KernelWeight}{W} \newcommand{\KernelWidth}{K_w} \newcommand{\KeyAxisLabel}{j} \newcommand{\KeyBufferPosition}{j} \newcommand{\KeyComponent}{k_{jm}} \newcommand{\KeyLeftSingularMatrix}{\mathbf{U}} \newcommand{\KeyLeftSingularVector}{\mathbf{u}} \newcommand{\KeyProjectionMatrix}{\mathbf{W}_{K}} \newcommand{\KeyRightSingularMatrix}{\mathbf{V}} \newcommand{\KeyRightSingularVector}{\mathbf{v}} \newcommand{\KeySingularNumber}{\sigma} \newcommand{\KeySingularSpectrumMatrix}{\mathbf{\Sigma}} \newcommand{\KeySourceMatrix}{\mathbf{X}_{K}} \newcommand{\KeySpectrumLength}{q} \newcommand{\KeyVector}{\mathbf{k}} \newcommand{\KineticEnergy}{E_k} \newcommand{\KineticEnergyCeiling}{E_{\max}} \newcommand{\KineticInsetBarrierFunction}{h_{\text{kinetic}}} \newcommand{\KineticInsetBarrierRate}{\dot{h}_{\text{kinetic}}} \newcommand{\KlDivergence}{\mathcal{D}_{\text{KL}}} \newcommand{\KlPenaltyCoefficient}{\beta_{\text{KL}}} \newcommand{\KlSampleStatistic}{d} \newcommand{\KnownComponentStopDistance}{d_{\text{budget}}} \newcommand{\KolmogorovSmirnovCriticalThreshold}{c_{\text{crit}}} \newcommand{\KolmogorovSmirnovStatistic}{\mathcal{D}_{\text{KS}}} \newcommand{\KroneckerIndicator}{\delta} \newcommand{\KrumClientCount}{n} \newcommand{\KrylovSubspace}{\mathcal{K}} \newcommand{\KsCriticalCoefficient}{c} \newcommand{\KvBlockSize}{S_{\text{blk}}} \newcommand{\KvBlockTailWaste}{\Delta_{\text{tail}}} \newcommand{\KvCacheBytesPerToken}{m_{\text{token}}} \newcommand{\KvCacheHandoffTime}{T_{\text{handoff}}} \newcommand{\KvCacheMemory}{M_{\text{KV}}} \newcommand{\KvElementStorageSize}{s_{\text{elem,KV}}} \newcommand{\KvHeadCount}{H_{\text{KV}}} \newcommand{\KvPoolHeadroomFraction}{f_{\text{head}}} \newcommand{\KvPoolMemory}{M_{\text{pool}}} \newcommand{\KvRecomputeTime}{T_{\text{recompute}}} \newcommand{\KvReloadTime}{T_{\text{reload}}} \newcommand{\KvTileCount}{T_c} \newcommand{\KvTileIndex}{j} \newcommand{\KvTileSize}{B_c} \newcommand{\LaSalleInvariantSet}{\Omega} \newcommand{\LabelCategoryIndex}{i} \newcommand{\LabelVector}{\mathbf{y}} \newcommand{\LabeledRecord}{x} \newcommand{\LabeledSampleCount}{D_{\text{labeled}}} \newcommand{\LabelingRoundIndex}{k} \newcommand{\LaggedModelInput}{x_{t-\Delta}} \newcommand{\LaggedStateDigest}{h_{\text{state},t-k}} \newcommand{\LandmarkDepth}{d} \newcommand{\LanguageInstruction}{c_{\text{instr}}} \newcommand{\LanguageSkillPrior}{p_{\text{LLM}}} \newcommand{\LaplaceLikelihoodScale}{b} \newcommand{\LaplaceNoiseSample}{x} \newcommand{\LaplaceNoiseScale}{b} \newcommand{\LaplaceVariable}{s} \newcommand{\LargestDrivenWheelLoadShare}{\varphi} \newcommand{\LargestEigenvalue}{\lambda_{\max}} \newcommand{\LargestInvariantSet}{\mathcal{M}} \newcommand{\LargestSingularNumber}{\sigma_{\max}} \newcommand{\LarsGlobalLearningRate}{\eta_{\text{global}}} \newcommand{\LastCandidateEmbeddingVector}{\mathbf{x}_N} \newcommand{\LastFunctionInputComponent}{x_N} \newcommand{\LastMeasurementTime}{t_{\text{last}}} \newcommand{\LastRankComputeTime}{T_{\text{rank}_{N-1}}} \newcommand{\LatchApproachSpeed}{v_{\text{latch}}} \newcommand{\LatchClearance}{c} \newcommand{\LatchContactForce}{f} \newcommand{\LatchForceLimit}{F_{\text{lim}}} \newcommand{\LatchPlateStiffness}{k_{\text{latch}}} \newcommand{\LatchStallForce}{F} \newcommand{\LatchStrengthFloor}{F_{\text{floor}}} \newcommand{\LateHandoffProbability}{p} \newcommand{\Latency}{L_{\text{lat}}} \newcommand{\LatencyBandwidthCrossoverSize}{n^*} \newcommand{\LatencyBoundedBatchSize}{B_{\text{SLO}}} \newcommand{\LatencyObjective}{S_{\text{latency}}} \newcommand{\LatencyQuantileFunction}{Q_p} \newcommand{\LatencyRewardExponent}{\beta_{\text{lat}}} \newcommand{\LatencySlo}{L_{\text{lat,SLO}}} \newcommand{\LatentActionComponent}{u} \newcommand{\LatentComponentMean}{\mu_{\phi, j}} \newcommand{\LatentComponentStandardDeviation}{\sigma_{\phi, j}} \newcommand{\LatentDimension}{d_z} \newcommand{\LatentGaussianPolicyDensity}{\mu} \newcommand{\LatentKlWeight}{\beta} \newcommand{\LatentPosteriorDistribution}{q} \newcommand{\LatentPosteriorMean}{\boldsymbol{\mu}_\phi} \newcommand{\LatentPosteriorStandardDeviation}{\boldsymbol{\sigma}_\phi} \newcommand{\LatentStateEncoder}{q_\phi} \newcommand{\LatentStyleVariable}{\mathbf{z}} \newcommand{\LatentVariableSpace}{\mathcal{Z}} \newcommand{\LaterBaseFlangeTransform}{\mathbf{T}_{\text{base}, k+1}^{\text{flange}}} \newcommand{\LaterCameraTargetTransform}{\mathbf{T}_{\text{cam}, k+1}^{\text{target}}} \newcommand{\LaterRolloutTurnIndex}{j} \newcommand{\LaterStepIndex}{j} \newcommand{\LateralClearance}{W_{\text{clear}}} \newcommand{\LatestSequentialObservation}{X_m} \newcommand{\LayerAllReduceTime}{T_{\text{layer comm}}} \newcommand{\LayerBackwardTime}{T_{\text{layer backward}}} \newcommand{\LayerCount}{N_L} \newcommand{\LayerExposedCommunicationTime}{T_{\text{exposed}}} \newcommand{\LayerFunction}{f} \newcommand{\LayerIndex}{\ell} \newcommand{\LayerInputComponent}{x} \newcommand{\LayerInputMatrix}{\mathbf{X}} \newcommand{\LayerInputVector}{\mathbf{x}} \newcommand{\LayerInputWidth}{d_{\text{in}}} \newcommand{\LayerIntermediateStateMemory}{s_{\ell}} \newcommand{\LayerNonlinearity}{\phi} \newcommand{\LayerNormMean}{\mu_{\text{LN}}} \newcommand{\LayerNormStandardDeviation}{\sigma_{\text{LN}}} \newcommand{\LayerOutputMatrix}{\mathbf{Y}} \newcommand{\LayerOutputVector}{\mathbf{y}} \newcommand{\LayerOutputWidth}{d_{\text{out}}} \newcommand{\LayerParameterPayload}{M_{\text{layer}}} \newcommand{\LayerSavedTensorCount}{n_{\text{saved}}} \newcommand{\LayerSelectionIndex}{i} \newcommand{\LayerWeightEntry}{W} \newcommand{\LayerWeights}{\mathbf{w}} \newcommand{\LayerWidth}{n} \newcommand{\LcResonantFrequency}{f_0} \newcommand{\LeaderForwardWave}{\mathbf{u}_m} \newcommand{\LeaderJointPositions}{\mathbf{q}_{\text{leader}}} \newcommand{\LeaderPortEffort}{\mathbf{F}_m} \newcommand{\LeaderPortFlow}{\dot{\mathbf{x}}_m} \newcommand{\LeaderPortPower}{P_m} \newcommand{\LeaderReturnWave}{\mathbf{w}_m} \newcommand{\LeaderWristRollAngle}{\theta_{\text{roll}}} \newcommand{\LeadingSupportDistance}{d_{\text{lead}}} \newcommand{\LeakageCurrent}{I_{\text{leak}}} \newcommand{\LeakagePower}{P_{\text{leakage}}} \newcommand{\LearnedActionProposal}{\hat{\mathbf{a}}_{\text{learned}}} \newcommand{\LearnedNominalTrajectory}{\hat{\mathbf{q}}_{\text{learned}}} \newcommand{\LearnedRemainingReturnEstimate}{\widehat{V}} \newcommand{\LearnedVelocityField}{v_\theta} \newcommand{\LearnerStateDisagreementRate}{\epsilon_\pi} \newcommand{\LearnerStateVisitationDistribution}{p^{\pi}} \newcommand{\LearningCurveSampleCount}{n} \newcommand{\LearningRate}{\eta} \newcommand{\LeaseAdmissionInstant}{t_{\text{adm}}} \newcommand{\LeaseDirtyMemory}{M_{\text{dirty}}} \newcommand{\LeaseExpiryDelaySubtotal}{\tau_{\text{delay,sub}}} \newcommand{\LeaseHoldTime}{T_{\text{hold}}} \newcommand{\LeasePathTravel}{d_{\text{lease}}} \newcommand{\LeaseRefreshInstant}{t_{\text{refresh}}} \newcommand{\LeftEvasionAction}{\mathbf{a}_{\text{left}}} \newcommand{\LeftSingularVectorMatrix}{\mathbf{P}} \newcommand{\LengthPenaltyWeight}{\lambda_{\text{len}}} \newcommand{\LeverArmLength}{r_{\text{arm}}} \newcommand{\LeverArmSweepError}{e_{\text{rot}}} \newcommand{\LewisFormFactor}{Y} \newcommand{\LexicalDocument}{x} \newcommand{\LexicalFrequencySaturation}{k_1} \newcommand{\LexicalLengthNormalization}{b} \newcommand{\LexicalQuery}{Q} \newcommand{\LidarAzimuthAngle}{\theta_{\text{az}}} \newcommand{\LidarBeamDirection}{\mathbf{d}} \newcommand{\LidarElevationAngle}{\phi} \newcommand{\LidarFramePoint}{\mathbf{p}_{\text{lidar}}} \newcommand{\LidarReferenceFrame}{\mathcal{F}_{\text{lidar}}} \newcommand{\LidarScanRate}{f_{\text{scan}}} \newcommand{\LidarSweepPeriod}{T_{\text{sweep}}} \newcommand{\LidarSweepStartTime}{t_{\text{sweep}}} \newcommand{\LieDerivativeAlongControl}{L_{\mathbf{g}} h} \newcommand{\LieDerivativeAlongDrift}{L_{\mathbf{f}} h} \newcommand{\LieDerivativeOrder}{k} \newcommand{\LikelihoodRatioWeight}{w} \newcommand{\LimitMarginFunction}{M} \newcommand{\LinearAcceleration}{\mathbf{a}} \newcommand{\LinearBarrierDecayRate}{\gamma_{\text{cbf}}} \newcommand{\LinearMomentum}{p} \newcommand{\LinearizedVirtualInput}{\mathbf{v}} \newcommand{\LinkAngularAcceleration}{\ddot{\theta}_{\text{link}}} \newcommand{\LinkBandwidth}{\beta} \newcommand{\LinkBitRate}{R_{\text{link}}} \newcommand{\LinkLength}{l} \newcommand{\LinkOutputPosition}{q_{\text{out}}} \newcommand{\LintFalseAcceptFraction}{\phi} \newcommand{\LipschitzConstant}{K} \newcommand{\LiveAutomatonStateSet}{Q_{\text{live}}} \newcommand{\LoadCurrent}{I_{\text{load}}} \newcommand{\LoadInertia}{J_{\text{load}}} \newcommand{\LoadStepCurrentDeficit}{\Delta I_{\text{step}}} \newcommand{\LoadStepDeficitDuration}{\Delta t_{\text{step}}} \newcommand{\LoadedEnforcerExecutionTime}{t_{\text{enf}}} \newcommand{\LoadedJunctionTemperature}{T_{\text{load}}} \newcommand{\LocalBatchSize}{B_{\text{local}}} \newcommand{\LocalEpochCount}{E} \newcommand{\LocalGradient}{\mathbf{g}} \newcommand{\LocalInferenceEnergy}{E_{\text{local}}} \newcommand{\LocalPathTime}{T_{\text{local}}} \newcommand{\LocalRankIndex}{i} \newcommand{\LocalTokenCount}{B_{\text{tok}}} \newcommand{\LocalUpdateCount}{H_{\text{local}}} \newcommand{\LocalityPenaltyFunction}{w} \newcommand{\LocalizationBound}{\delta_{\text{loc}}} \newcommand{\LogFailureRatio}{s_{\text{fail}}} \newcommand{\LogOddsLowerClamp}{L_{\min}} \newcommand{\LogOddsUpperClamp}{L_{\max}} \newcommand{\LogPositionIndex}{j} \newcommand{\LoggedEvent}{e} \newcommand{\LoggedEventPrefix}{\mathbf{e}_{1:j}} \newcommand{\LoggpLongMessageTime}{T_{\text{long}}} \newcommand{\LogisticProbability}{p_{\text{sig}}} \newcommand{\LogitMask}{\mathbf{M}} \newcommand{\LogitMaskEntry}{M} \newcommand{\LogitStorageSize}{s_{\text{logit}}} \newcommand{\LogitVector}{\mathbf{z}} \newcommand{\LogpNetworkLatency}{L_{\text{LogGP}}} \newcommand{\LonePassAdvantage}{\hat{A}_{\text{pass}}} \newcommand{\LongMessageGapPerByte}{G} \newcommand{\LongestInterruptMaskTime}{t_{\text{irq\_disabled,max}}} \newcommand{\LongitudinalFrictionCoefficient}{\mu_x} \newcommand{\LongitudinalSlipRatio}{\lambda} \newcommand{\LongitudinalTractionStiffness}{C_x} \newcommand{\LongitudinalVehicleSpeed}{v_x} \newcommand{\LookaheadStepIndex}{l} \newcommand{\LoopAcceptanceProbability}{p_{\text{loop}}} \newcommand{\LoopGainScalingFactor}{\kappa} \newcommand{\LoopNestDepth}{n_{\text{loops}}} \newcommand{\LoopOrderCount}{N_{\text{order}}} \newcommand{\LoopParallelizationChoiceCount}{\mathcal{P}_{\text{parallel}}} \newcommand{\LoopTurnCost}{C} \newcommand{\Loss}{L} \newcommand{\LossAdjointSeed}{\bar{\mathcal{L}}} \newcommand{\LossFunction}{\mathcal{L}} \newcommand{\LossGradient}{g} \newcommand{\LossGradientVector}{\mathbf{g}} \newcommand{\LossHessian}{\mathbf{H}} \newcommand{\LossLowerBound}{\mathcal{L}_{\inf}} \newcommand{\LossScaleFactor}{s_{\text{loss}}} \newcommand{\LossTimeDerivative}{\dot{\mathcal{L}}} \newcommand{\LostMotionDeflection}{\delta_{\text{lost}}} \newcommand{\LostSuffixTurnCount}{H_{\text{suffix},i}} \newcommand{\LostWorkReplayTime}{T_{\text{replay}}} \newcommand{\LotSamplingProbability}{q} \newcommand{\LowRankLeftFactor}{\mathbf{U}} \newcommand{\LowRankRightFactor}{\mathbf{V}} \newcommand{\LowerPriorityFrames}{lp} \newcommand{\LowerPriorityTasks}{lp} \newcommand{\LowerRatioClippingWidth}{\epsilon_{\text{low}}} \newcommand{\LqrControlWeightMatrix}{\mathbf{R}_u} \newcommand{\LqrCostToGoMatrix}{\mathbf{P}} \newcommand{\LqrFeedbackGain}{\mathbf{K}_{\text{lqr}}} \newcommand{\LqrQuadraticObjective}{J} \newcommand{\LqrStateWeightMatrix}{\mathbf{Q}_x} \newcommand{\LshBandCount}{L} \newcommand{\LshCandidateProbability}{p_{\text{candidate}}} \newcommand{\LshRowsPerBand}{r} \newcommand{\LyapunovAnalysisDomain}{\mathcal{D}} \newcommand{\LyapunovFunction}{V} \newcommand{\LyapunovFunctionDerivative}{\dot{V}} \newcommand{\LyapunovPositivityMargin}{\epsilon_{\text{pos}}} \newcommand{\LyapunovSublevelSet}{\Omega_c} \newcommand{\MacAccumulator}{\text{acc}} \newcommand{\MachineTaxonomyAxis}{\mathsf{Machine}} \newcommand{\MahalanobisDistance}{d_M} \newcommand{\ManifestTrackIndex}{k} \newcommand{\ManipulatorBaseFrame}{\mathcal{F}_{\text{base}}} \newcommand{\ManipulatorJacobian}{\mathbf{J}} \newcommand{\ManualLease}{T_{\text{lease,man}}} \newcommand{\ManualResetTime}{t_{\text{reset,manual}}} \newcommand{\ManualReviewCost}{C_{\text{manual}}} \newcommand{\ManualReviewFraction}{r_{\text{manual}}} \newcommand{\MapCovarianceJacobian}{\mathbf{J}_{\text{map}}} \newcommand{\MapOdometryTransform}{\mathbf{T}_{\text{map}}^{\text{odom}}} \newcommand{\MapParameterEstimate}{\theta_{\text{MAP}}} \newcommand{\MapPoseCovariance}{\boldsymbol{\Sigma}_{\text{map}}} \newcommand{\MapReferenceFrame}{\mathcal{F}_{\text{map}}} \newcommand{\MappedCommandTap}{a_{\text{cmd}}} \newcommand{\MappingSearchSpaceSize}{\mathcal{S}_{\text{mapping}}} \newcommand{\MarginalFalseApprovalProbability}{p} \newcommand{\MarginalRequestServiceTime}{t_{\text{req}}} \newcommand{\MarginalStoppingThreshold}{\epsilon_{\text{stop}}} \newcommand{\MarginalVelocityField}{u} \newcommand{\MarginalizedModelParameters}{\theta'} \newcommand{\MarkovDecisionProcess}{\mathcal{M}} \newcommand{\MaskTokenIndex}{i} \newcommand{\MaskedClientUpdate}{\mathbf{y}} \newcommand{\MaskedFinetuningLoss}{\mathcal{L}_{\text{SFT}}} \newcommand{\MaskedImitationDataset}{\mathcal{D}_{\text{train}}} \newcommand{\MaskedImitationLoss}{\mathcal{L}_{\text{imitation}}} \newcommand{\MaskedLogitVector}{\mathbf{z}'} \newcommand{\MaskedTokenLogit}{z'} \newcommand{\Mass}{m} \newcommand{\MassCenterAcceleration}{\ddot{\mathbf{c}}} \newcommand{\MassCenterHeight}{z_c} \newcommand{\MassCenterPosition}{\mathbf{c}} \newcommand{\MasterProcessingTime}{t_{\text{master}}} \newcommand{\MatchingRowCount}{K} \newcommand{\MatrixColumnIndex}{j} \newcommand{\MatrixEigenvalue}{\lambda} \newcommand{\MatrixMultiplyDestination}{\mathbf{D}} \newcommand{\MatrixRowIndex}{i} \newcommand{\MaxBatchSize}{B_{\text{max}}} \newcommand{\MaxBatchingWindow}{T_{\text{max}}} \newcommand{\MaxReceivedTokenCount}{B_{\text{max}}} \newcommand{\MaxResidentContextCount}{B_{\max}} \newcommand{\MaximumActuatorEffort}{u_{\max}} \newcommand{\MaximumBreakerCooldownInterval}{T_{\text{cool}}^{\max}} \newcommand{\MaximumCompletionOffset}{c_{\max}} \newcommand{\MaximumDepthHypothesis}{d_{\max}} \newcommand{\MaximumEntropyObjective}{J} \newcommand{\MaximumLoadCurrentStep}{\Delta I_{\max}} \newcommand{\MaximumLogit}{z_{\max}} \newcommand{\MaximumObservationAge}{t_{\text{age},\max}} \newcommand{\MaximumPlateIndentation}{x_{\max}} \newcommand{\MaximumRetryBackoffInterval}{b_{\max}} \newcommand{\MaximumTurnOffDelay}{t_{\text{off, max}}} \newcommand{\McnemarTestStatistic}{\chi^2} \newcommand{\McuCaptureTime}{t_{\text{MCU,capture}}} \newcommand{\McuDispatchTime}{t_{\text{MCU,dispatch}}} \newcommand{\MealTokenKeyVector}{\mathbf{k}_{\text{meal}}} \newcommand{\MealTokenQueryVector}{\mathbf{q}_{\text{meal}}} \newcommand{\MeanAcceptedDraftLength}{\bar{m}} \newcommand{\MeanAttemptCost}{c} \newcommand{\MeanClusterSize}{m} \newcommand{\MeanContextLength}{\bar{S}} \newcommand{\MeanDeliveryPayloadLength}{L} \newcommand{\MeanDocumentLength}{\overline{|x|}} \newcommand{\MeanHoldTime}{\bar{T}_{\text{hold}}} \newcommand{\MeanLatchContactForce}{\bar{F}} \newcommand{\MeanMessageQueueDelay}{\bar{T}_q} \newcommand{\MeanNeesStatistic}{\bar{\epsilon}} \newcommand{\MeanQueryDistance}{\mu_D} \newcommand{\MeanRolloutLength}{\bar{N}} \newcommand{\MeanSlotOccupancy}{\bar{N}_{\text{slot}}} \newcommand{\MeanSquaredErrorCloningLoss}{\mathcal{L}_{\text{MSE}}} \newcommand{\MeanStoredTokensPerRecord}{\bar{S}} \newcommand{\MeanTargetTokensPerRecord}{\bar{w}} \newcommand{\MeanTimeBetweenFailures}{\text{MTBF}} \newcommand{\MeanTimeToFailure}{\text{MTTF}} \newcommand{\MeanTimeToRepair}{\text{MTTR}} \newcommand{\MeanVerifierServiceTime}{\bar{T}_{\text{svc}}} \newcommand{\MeasuredAxisPosition}{x_{\text{meas}}} \newcommand{\MeasuredContactForce}{\mathbf{F}_{\text{contact}}} \newcommand{\MeasuredJointVelocities}{\dot{\mathbf{q}}_{\text{meas}}} \newcommand{\MeasuredPixelDepth}{Z_{\text{meas}}} \newcommand{\MeasuredResponseTap}{a_{\text{meas}}} \newcommand{\MeasuredSeamAccelerations}{\ddot{\mathbf{q}}_{\text{meas}}} \newcommand{\MeasuredSeamConfiguration}{\mathbf{q}_{\text{meas}}} \newcommand{\MeasuredSeamVelocities}{\dot{\mathbf{q}}_{\text{meas}}} \newcommand{\MeasuredTrackedPosition}{\mathbf{p}_{\text{meas}}} \newcommand{\MeasurementCovariance}{\boldsymbol{\Sigma}_z} \newcommand{\MeasurementDimension}{m} \newcommand{\MeasurementErrorStandardDeviation}{\sigma} \newcommand{\MeasurementFunction}{h} \newcommand{\MeasurementHistory}{\mathbf{y}_{1:k}} \newcommand{\MeasurementInnovation}{\boldsymbol{\nu}} \newcommand{\MeasurementMatrix}{\mathbf{H}} \newcommand{\MeasurementNoiseCovariance}{\boldsymbol{\Sigma}_{\text{meas}}} \newcommand{\MeasurementNoiseVector}{\mathbf{v}_{\text{meas}}} \newcommand{\MeasurementVector}{\mathbf{y}} \newcommand{\MeasurementVectorDerivative}{\dot{\mathbf{y}}} \newcommand{\MeasurementWindowEnd}{t_{\text{end}}} \newcommand{\MechanicalEnergy}{E} \newcommand{\MechanicalEnergyDerivative}{\dot{E}} \newcommand{\MechanicalImpedanceMap}{Z} \newcommand{\MechanicalPlantState}{\mathbf{x}} \newcommand{\MechanicalWork}{W} \newcommand{\MechanismAcceptanceProbability}{p'_{\text{acc}}} \newcommand{\MechanismAttemptCost}{C'_{\text{attempt}}} \newcommand{\MechanismLogMoment}{\alpha_{\mathcal{M}}} \newcommand{\MechanismOutcome}{o} \newcommand{\MechanismOutputSet}{\mathcal{S}} \newcommand{\MechanismOutputVector}{\mathbf{y}} \newcommand{\MechanismRenyiPrivacyBudget}{\epsilon_{\text{R},i}} \newcommand{\MemoryBusQueueDelay}{t_{\text{queue}}} \newcommand{\MemoryEntryBirthGeneration}{g_{\text{birth}}} \newcommand{\MemoryEntryDeathGeneration}{g_{\text{death}}} \newcommand{\MemoryHierarchyLevelCount}{N_{\text{mem}}} \newcommand{\MemoryHoldDuringWait}{O_{\text{mem}}} \newcommand{\MemoryPlacementCount}{\mathcal{M}_{\text{placement}}} \newcommand{\MemorySubsystemEnergy}{E_{\text{memory}}} \newcommand{\MergedAttentionOutput}{\mathbf{O}^{\text{new}}} \newcommand{\MergedSoftmaxMaximum}{m^{\text{new}}} \newcommand{\MergedSoftmaxNormalizer}{z^{\text{new}}} \newcommand{\MergedWeightMatrix}{\mathbf{W}_{\text{final}}} \newcommand{\MessageInjectionGap}{g} \newcommand{\MessageQueueDelay}{T_q} \newcommand{\MessageStartupLatency}{\alpha} \newcommand{\MessageTimestamp}{t_{\text{msg}}} \newcommand{\MetricDepth}{z_{\text{metric}}} \newcommand{\MicroUnitPrefix}{\text{µ}} \newcommand{\MicrobatchCount}{m} \newcommand{\MicrobatchGradient}{\mathbf{g}} \newcommand{\MicrobatchIndex}{j} \newcommand{\MicrobatchPassTime}{T_{\text{micro},j}} \newcommand{\MicrobatchSize}{B_{\text{micro}}} \newcommand{\MicrocontrollerClockTime}{t_{\text{MCU}}} \newcommand{\MillerCapacitance}{C_{\text{gd}}} \newcommand{\MillerCharge}{Q_{\text{gd}}} \newcommand{\MillerDisplacementCurrent}{I_{\text{miller}}} \newcommand{\MillerPlateauDuration}{t_{\text{plateau}}} \newcommand{\MillerPlateauVoltage}{V_{\text{plateau}}} \newcommand{\MinHashPermutation}{\sigma} \newcommand{\MinHashPermutationCount}{n_{\sigma}} \newcommand{\MinHashSketchSize}{s} \newcommand{\MiniBatchActivation}{a} \newcommand{\MiniBatchSet}{\mathcal{B}} \newcommand{\MinibatchGradient}{\mathbf{g}} \newcommand{\MinimumActuatorEffort}{u_{\min}} \newcommand{\MinimumCellSupportCount}{N_{\min}} \newcommand{\MinimumChunkSetpointCount}{h_{\min}} \newcommand{\MinimumCompletionOffset}{c_{\min}} \newcommand{\MinimumDepthHypothesis}{d_{\min}} \newcommand{\MinimumDetectableEffect}{\delta_{\text{MDE}}} \newcommand{\MinimumPrefetchBufferCount}{Q_{\text{prefetch,min}}} \newcommand{\MinimumRailVoltage}{V_{\text{rail,min}}} \newcommand{\MinimumRoundTripLatency}{L_{\text{lat,min}}} \newcommand{\MinimumStableBatchSize}{B_{\text{min}}} \newcommand{\MinimumTransitTime}{t_{\min}} \newcommand{\MinimumTurnOnDelay}{t_{\text{on, min}}} \newcommand{\MisclassifiedFraction}{r_{\text{error}}} \newcommand{\MisroutedQueryFraction}{m} \newcommand{\MissAcceptanceProbability}{\alpha} \newcommand{\MissPathServiceTime}{T_{\text{cold}}} \newcommand{\MissionDuration}{T_{\text{mission}}} \newcommand{\MissionEnergy}{E_{\text{mission}}} \newcommand{\MissionExceedanceBudget}{\epsilon_{\text{mission}}} \newcommand{\MissionHandoffCount}{K} \newcommand{\MixtureComponentCount}{M} \newcommand{\MixtureComponentCovariance}{\boldsymbol{\Sigma}_m} \newcommand{\MixtureComponentIndex}{m} \newcommand{\MixtureComponentMean}{\boldsymbol{\mu}_m} \newcommand{\MixtureComponentWeight}{w_m} \newcommand{\MixupSample}{\tilde{x}} \newcommand{\MixupWeight}{\lambda_{\text{mix}}} \newcommand{\MlProductivityGoodput}{\text{MPG}} \newcommand{\MlpWeightArithmeticIntensity}{I_{\text{MLP}}} \newcommand{\MobileBaseBarrierFunction}{h_{\text{base}}} \newcommand{\MobilenetWidthMultiplier}{\alpha_{\text{width}}} \newcommand{\ModelBandwidthUtilization}{\text{MBU}} \newcommand{\ModelCallIndex}{i} \newcommand{\ModelCallRequest}{\mathcal{R}} \newcommand{\ModelDownloadEnergy}{E_{\text{download}}} \newcommand{\ModelFlopsUtilization}{\text{MFU}} \newcommand{\ModelGenerationIndex}{n} \newcommand{\ModelInput}{x} \newcommand{\ModelLifetimeCost}{C_{\text{total}}} \newcommand{\ModelParameters}{\theta} \newcommand{\ModelPointAbscissa}{X} \newcommand{\ModelPointHeight}{Z} \newcommand{\ModelPointOrdinate}{Y} \newcommand{\ModelPrediction}{\hat{y}} \newcommand{\ModelPredictor}{f} \newcommand{\ModelScore}{s} \newcommand{\ModelStepOperations}{O_{\text{model}}} \newcommand{\ModelTime}{T_{\text{model}}} \newcommand{\ModelTimeFraction}{f} \newcommand{\ModelWeight}{w} \newcommand{\MomentOrder}{\lambda_{\text{mom}}} \newcommand{\MonitorStartupTime}{T_{\text{vmm}}} \newcommand{\MonitoredFairnessMetricCount}{m} \newcommand{\MonitoredFeatureLevel}{x_{\text{feat}}} \newcommand{\MonitoredGroupCount}{k} \newcommand{\MonitoredMetric}{X} \newcommand{\MonitoredMetricMean}{\mu} \newcommand{\MonitoredMetricStandardDeviation}{\sigma} \newcommand{\MonitoringAlertCost}{C_{\text{alert}}} \newcommand{\MonitoringComputeCost}{C_{\text{compute}}} \newcommand{\MonitoringCostComponent}{C_*} \newcommand{\MonitoringIngestionCost}{C_{\text{ingest}}} \newcommand{\MonitoringStorageCost}{C_{\text{storage}}} \newcommand{\MonotonicClockInstant}{t} \newcommand{\MonthlyOptimizationSavings}{C_{\text{save,monthly}}} \newcommand{\MotionBlurLength}{L} \newcommand{\MotionCyclePeriod}{T_{\text{cycle}}} \newcommand{\MotionModelInput}{\mathbf{u}} \newcommand{\MotorBackEmfConstant}{K_e} \newcommand{\MotorConstant}{K_m} \newcommand{\MotorPhaseRmsCurrent}{I_{\text{phase}}} \newcommand{\MotorRotorAccelerations}{\ddot{\boldsymbol{\theta}}_{\text{motor}}} \newcommand{\MotorRotorCoordinates}{\boldsymbol{\theta}_{\text{motor}}} \newcommand{\MotorRotorVelocities}{\dot{\boldsymbol{\theta}}_{\text{motor}}} \newcommand{\MotorShaftDamping}{D_{\text{motor}}} \newcommand{\MotorShaftPosition}{q_{\text{motor}}} \newcommand{\MotorTorque}{\tau_{\text{motor}}} \newcommand{\MotorTorqueConstant}{K_t} \newcommand{\MotorViscousDamping}{B_{m}} \newcommand{\MotorViscousDampingMatrix}{\mathbf{B}_m} \newcommand{\MpcControlSequence}{\mathbf{u}_{0:N_{\text{mpc}}-1}} \newcommand{\MpcControlSequenceTail}{\mathbf{u}_{1:N_{\text{mpc}}-1}} \newcommand{\MpcHorizonObjective}{J} \newcommand{\MpcPredictionHorizon}{N_{\text{mpc}}} \newcommand{\MpcTerminalCost}{\ell_f} \newcommand{\MpcTerminalCostMatrix}{\mathbf{P}_{N_{\text{mpc}}}} \newcommand{\MultiAgentAcceptanceProbability}{p_{\text{multi}}} \newcommand{\MultiDeviceRunTime}{T_N} \newcommand{\MultimodalFusedTokenStream}{\mathbf{Z}} \newcommand{\MultimodalObservation}{\mathbf{o}} \newcommand{\MutatingToolAction}{a} \newcommand{\MutualInformation}{I} \newcommand{\NaturalLogarithmBase}{e} \newcommand{\NearestCandidateDistance}{D_{\min}} \newcommand{\NeesStatistic}{\epsilon} \newcommand{\NegativeGateSupplyVoltage}{V_{\text{ee}}} \newcommand{\NeighborCount}{k} \newcommand{\NeighborUserIndex}{j} \newcommand{\NeighboringDataset}{X} \newcommand{\NetAngularBrakingDeceleration}{\alpha_{\text{net}}} \newcommand{\NetBrakingDeceleration}{a_{\text{net}}} \newcommand{\NetworkBandwidth}{\text{BW}_{\text{network}}} \newcommand{\NetworkDelayStandardDeviation}{\sigma_d} \newcommand{\NetworkEnergy}{E_{\text{network}}} \newcommand{\NetworkEquipmentPower}{P_{\text{network}}} \newcommand{\NetworkFunction}{f_{\text{net}}} \newcommand{\NetworkLatency}{L_{\text{lat,network}}} \newcommand{\NetworkOutput}{y} \newcommand{\NetworkTrafficVolume}{M} \newcommand{\NeuralLyapunovFactor}{\mathbf{L}_{\phi}} \newcommand{\NeuronActivation}{a} \newcommand{\NeuronBias}{b} \newcommand{\NeuronConnectionWeight}{w_{ij}} \newcommand{\NeuronIndex}{j} \newcommand{\NeuronPreactivation}{z} \newcommand{\NewSoftmaxRunningMaximum}{m_{\text{new}}} \newcommand{\NextDecisionProcessState}{s'} \newcommand{\NextFailureTime}{F} \newcommand{\NextLayerActivationMemory}{M_{\text{activations}}^{(\ell+1)}} \newcommand{\NextProprioceptiveObservation}{\mathbf{o}_{\text{proprio}, t+1}} \newcommand{\NextRobotAction}{\mathbf{a}'} \newcommand{\NextTokenDistribution}{p} \newcommand{\NextTokenEntropy}{\mathcal{H}} \newcommand{\NextTokenLogitFunction}{\mathbf{f}_\theta} \newcommand{\NgramLength}{n} \newcommand{\NicMttf}{\text{MTTF}_{\text{nic}}} \newcommand{\NicsPerNode}{n_{\text{nic}}} \newcommand{\NodeAcceleratorCount}{n_{\text{acc}}} \newcommand{\NodeHbmCapacity}{M_{\text{HBM}}} \newcommand{\NodeMtbf}{\text{MTBF}_{\text{node}}} \newcommand{\NodeStragglerProbability}{p_{\text{straggle}}} \newcommand{\NoisePredictionNetwork}{\boldsymbol{\epsilon}_\theta} \newcommand{\NoisedActionChunk}{\mathbf{A}^k} \newcommand{\NoisyClassProbability}{\tilde{p}} \newcommand{\NoisyClassProbabilityVector}{\tilde{\mathbf{p}}} \newcommand{\NoisyLabelSampleCount}{D_{\text{noisy}}} \newcommand{\NominalBitRate}{R_{\text{nom}}} \newcommand{\NominalBitTime}{T_{\text{bit,nom}}} \newcommand{\NominalBrakingDeceleration}{a_{\text{nominal}}} \newcommand{\NominalClearance}{C_{\text{nominal}}} \newcommand{\NominalClockFrequency}{f_{\text{nom}}} \newcommand{\NominalCommandWindow}{\mathbf{u}_{\text{nom}, t:t+H-1}} \newcommand{\NominalContactForces}{\mathbf{f}_{\text{nom}}} \newcommand{\NominalControlCommand}{\mathbf{u}_{\text{nom}}} \newcommand{\NominalFrameInterval}{T_{\text{nominal}}} \newcommand{\NominalFrictionCoefficient}{\mu_{\text{nom}}} \newcommand{\NominalOscillatorFrequency}{f_{\text{nom}}} \newcommand{\NominalPlanExpiry}{t_{\text{plan\_exp}}} \newcommand{\NominalRatedSpeed}{v_{\text{nominal}}} \newcommand{\NominalReferenceClearance}{c} \newcommand{\NominalSupplyVoltage}{V_{\text{nom}}} \newcommand{\NominalTickPeriod}{T_{\text{period}}} \newcommand{\NominalTrackingTolerance}{\epsilon_{\text{nom}}} \newcommand{\NonconformityScore}{s} \newcommand{\NoninferiorityRatioMargin}{\delta} \newcommand{\NoninferiorityTolerance}{\delta_{\text{tol}}} \newcommand{\NonlinearBiasTorque}{\mathbf{h}} \newcommand{\NonlinearObservationSpace}{\mathbf{O}_{\text{NL}}} \newcommand{\NonlinearOutputFunction}{\mathbf{h}} \newcommand{\NonzeroCount}{n_{\text{nz}}} \newcommand{\NonzeroParameterBudget}{k_{\text{nz}}} \newcommand{\NormWeightMatrix}{\mathbf{W}} \newcommand{\NormalContactForce}{f_{k, \perp}} \newcommand{\NormalContactImpulse}{P_n} \newcommand{\NormalizationScale}{\gamma} \newcommand{\NormalizationScaleVector}{\boldsymbol{\gamma}} \newcommand{\NormalizationShift}{\beta} \newcommand{\NormalizationShiftVector}{\boldsymbol{\beta}} \newcommand{\NormalizedActionCommand}{\tilde{a}} \newcommand{\NormalizedActionResidual}{e} \newcommand{\NormalizedActivation}{\hat{a}} \newcommand{\NormalizedCandidateScore}{c} \newcommand{\NormalizedElapsedTimeRatio}{D} \newcommand{\NormalizedGearRatio}{\tilde{N}} \newcommand{\NormalizedImageAbscissa}{x_n} \newcommand{\NormalizedImageOrdinate}{y_n} \newcommand{\NormalizedMetricBaseline}{v} \newcommand{\NormalizedPredicateMargin}{\bar{f}} \newcommand{\NormalizedRadialDistance}{r} \newcommand{\NormalizedStatusEnvelope}{\mathcal{N}} \newcommand{\NormalizerTokenIndex}{w} \newcommand{\NormalizingClassIndex}{k} \newcommand{\NormalizingKeyIndex}{m} \newcommand{\NormalizingNextState}{\tilde{s}} \newcommand{\NoticeByteAllocation}{M_{\text{notice}}} \newcommand{\NucleusProbabilityMass}{p} \newcommand{\NullSpaceProjector}{\mathbf{N}} \newcommand{\NullSpaceVelocityBias}{\dot{\mathbf{q}}_0} \newcommand{\NumericBitWidth}{b} \newcommand{\NumericalStabilityConstant}{\epsilon} \newcommand{\ObjectHandle}{h} \newcommand{\ObjectWrench}{\mathbf{w}_{\text{obj}}} \newcommand{\ObservabilityMatrix}{\mathbf{O}_{\text{obs}}} \newcommand{\ObservableModelOutput}{O} \newcommand{\ObservationAge}{t_{\text{age}}} \newcommand{\ObservationAgeBudget}{t_{\text{age},\max}} \newcommand{\ObservationAgeDisplacement}{\Delta \mathbf{p}} \newcommand{\ObservationBinding}{\lambda} \newcommand{\ObservationByteBudget}{M_{\text{obs},\max}} \newcommand{\ObservationCount}{N} \newcommand{\ObservationDataset}{\mathcal{D}} \newcommand{\ObservationEncodingTime}{t_{\text{enc}}} \newcommand{\ObservationFunction}{h} \newcommand{\ObservationHistory}{\mathbf{O}} \newcommand{\ObservationHistoryLength}{H_{\text{hist}}} \newcommand{\ObservationHistorySequence}{\mathbf{o}_{0:t}} \newcommand{\ObservationHistoryWindow}{\mathbf{o}_{t-H_{\text{hist}}:t}} \newcommand{\ObservationIntervalEnd}{t_{b}} \newcommand{\ObservationIntervalLength}{T_{\text{obs}}} \newcommand{\ObservationIntervalStart}{t_{a}} \newcommand{\ObservationPairingLag}{\Delta t_{\text{lag}}} \newcommand{\ObservationPayload}{\mathbf{T}_{\text{payload}}} \newcommand{\ObservationResponseLatency}{T_{\text{total}}} \newcommand{\ObservationTimestamp}{t_{\text{obs}}} \newcommand{\ObservationTokenCount}{S_{\text{obs}}} \newcommand{\ObservationTokenSequence}{\mathbf{z}_{\text{token}}} \newcommand{\ObservedAnnotatorAgreement}{p_o} \newcommand{\ObservedCategoryCount}{n_i^{\text{obs}}} \newcommand{\ObservedCycleCount}{N} \newcommand{\ObservedDataPoint}{\mathbf{x}} \newcommand{\ObservedFailureCount}{k} \newcommand{\ObservedFailureFraction}{\hat{p}} \newcommand{\ObservedFreeSpace}{\mathcal{M}_{\text{free}}} \newcommand{\ObservedLabelCount}{n} \newcommand{\ObservedOccupiedSpace}{\mathcal{M}_{\text{occ}}} \newcommand{\ObservedPixelCoordinates}{\tilde{\mathbf{m}}_{\text{observed}}} \newcommand{\ObservedPlantState}{\mathbf{x}_{\text{obs}}} \newcommand{\ObservedPointRange}{r} \newcommand{\ObservedRelativeSpeed}{v_{\text{rel}}} \newcommand{\ObservedSignificanceLevel}{p_{\text{val}}} \newcommand{\ObservedSuccessFraction}{\hat{p}} \newcommand{\ObservedTrialFailureCount}{k} \newcommand{\ObservedViolationFraction}{V} \newcommand{\ObservedVolume}{V_{\text{obs}}} \newcommand{\ObstacleConfigurationSet}{\mathcal{C}_{\text{obs}}} \newcommand{\ObstacleCostWeight}{\lambda_{\text{obs}}} \newcommand{\ObstaclePoint}{\mathbf{o}} \newcommand{\ObstaclePosition}{x_{\text{obstacle}}} \newcommand{\ObstacleProximityCost}{c_{\text{obs}}} \newcommand{\ObstacleRiskRadius}{r_{\text{risk}}} \newcommand{\ObstacleSeparationDistance}{d} \newcommand{\ObstacleStateSet}{\mathcal{X}_{\text{obs}}} \newcommand{\ObstacleSurfaceArea}{A_{\text{surface}}} \newcommand{\OccupancyCoverageMultiplier}{k_\sigma} \newcommand{\OccupancyLogOdds}{L} \newcommand{\OccupancyThreshold}{k} \newcommand{\OccupiedLogOddsIncrement}{L_{\text{occ}}} \newcommand{\OccupiedScenarioCellCount}{N_{\text{supported}}} \newcommand{\OdometryBaseTransform}{\mathbf{T}_{\text{odom}}^{\text{base}}} \newcommand{\OdometryCovarianceJacobian}{\mathbf{J}_{\text{odom}}} \newcommand{\OdometryNoiseStandardDeviation}{\sigma_{w}} \newcommand{\OdometryPoseCovariance}{\boldsymbol{\Sigma}_{\text{odom}}} \newcommand{\OdometryReferenceFrame}{\mathcal{F}_{\text{odom}}} \newcommand{\OfflineTransitionDataset}{\mathcal{D}_{\text{offline}}} \newcommand{\OffloadTailNetworkTime}{t_{\text{net}}^{\text{tail}}} \newcommand{\OffloadTailProcessingTime}{t_{\text{proc}}^{\text{tail}}} \newcommand{\OffloadTransactionWindow}{W} \newcommand{\OhmUnit}{\Omega} \newcommand{\OilBulkModulus}{\beta} \newcommand{\OldSoftmaxRunningMaximum}{m_{\text{old}}} \newcommand{\OnDieDecouplingCapacitance}{C_{\text{die}}} \newcommand{\OnlineSoftmaxKeyTile}{\mathbf{K}_{\text{tile}}} \newcommand{\OnlineSoftmaxQueryBlock}{\mathbf{Q}_{\text{block}}} \newcommand{\OnlineSoftmaxScoreBlock}{\mathbf{A}_{\text{block}}} \newcommand{\OpenLoopTransferFunction}{L} \newcommand{\OpenLoopTransferMatrix}{\mathbf{L}} \newcommand{\OperationChargeBound}{\bar{c}} \newcommand{\OperationDispatchOverhead}{t_{\text{dispatch}}} \newcommand{\OperationRecipient}{r} \newcommand{\OperationReconciliationTime}{T_{\text{rec}}} \newcommand{\OperationalFailureProbability}{p_F} \newcommand{\OperationalOverheadFraction}{f_{\text{overhead}}} \newcommand{\OperationalScenarioDistribution}{p} \newcommand{\OperationalTaxonomyDimension}{C} \newcommand{\OperationalTestDistribution}{\mathcal{D}} \newcommand{\Operations}{O} \newcommand{\OperationsPerSample}{O_{\text{sample}}} \newcommand{\OperatorCognitiveTime}{T_{\text{cognitive}}} \newcommand{\OperatorMotorTime}{T_{\text{motor}}} \newcommand{\OperatorResponseLatency}{t_{\text{hum}}} \newcommand{\OperatorSensoryTime}{T_{\text{sensory}}} \newcommand{\OperatorStabilizationInstant}{t_{\text{stabilize}}} \newcommand{\OperatorWindowTime}{t'} \newcommand{\OperatorWorkspaceMemory}{M_{\text{workspace}}} \newcommand{\OpticalFrequency}{\nu} \newcommand{\OpticalWavelength}{\lambda_{\text{wl}}} \newcommand{\OptimalCheckpointInterval}{T^\ast_{\text{ckpt}}} \newcommand{\OptimalCostToGoDerivative}{\dot{V}} \newcommand{\OptimalCostToGoFunction}{V} \newcommand{\OptimalModelParameters}{\theta^*} \newcommand{\OptimalStateReturn}{V_{\text{RL}}} \newcommand{\OptimizationBreakevenTime}{T_{\text{breakeven}}} \newcommand{\OptimizationImplementationCost}{C_{\text{optimization}}} \newcommand{\OptimizationIterate}{x} \newcommand{\OptimizerStateMemory}{M_{\text{optimizer}}} \newcommand{\OptimizerStepIndex}{t} \newcommand{\OptimizerStepTime}{T_{\text{update}}} \newcommand{\OptimizerUpdateCount}{T} \newcommand{\OptimumMissFactor}{x} \newcommand{\OrderedTestRank}{r} \newcommand{\OrientationTolerance}{\theta_{\text{tol}}} \newcommand{\OrphanSweepInterval}{T} \newcommand{\OscillationPriorStateDigest}{h_{\text{state},t-2}} \newcommand{\OscillatorAcceleration}{\ddot{q}} \newcommand{\OscillatorNaturalFrequency}{\omega} \newcommand{\OscillatorPosition}{q} \newcommand{\OscillatorStepVelocity}{v} \newcommand{\OscillatorVelocity}{\dot{q}} \newcommand{\OutcomeAlphabet}{\mathcal{X}} \newcommand{\OutcomeCheckPassProbability}{p_{\text{out}}} \newcommand{\OutcomeCheckSlotTime}{T_{\text{out}}} \newcommand{\OutcomePairPrivacyLoss}{\mathcal{L}_{\text{priv},(X,X')}^{(o)}} \newcommand{\OutcomeStandardDeviation}{\sigma} \newcommand{\OutgoingChannelCommand}{u_{\text{prior}}} \newcommand{\OutgoingCommandDerivative}{\dot{u}_{\text{prior}}} \newcommand{\OutputBearingDamping}{D_{\text{joint}}} \newcommand{\OutputChannel}{y} \newcommand{\OutputChannelCount}{C_{\text{out}}} \newcommand{\OutputChannelIndex}{k} \newcommand{\OutputComponentFunction}{h} \newcommand{\OutputDimension}{p} \newcommand{\OutputFeatureMapHeight}{H_{\text{out}}} \newcommand{\OutputFeatureMapWidth}{W_{\text{out}}} \newcommand{\OutputIndex}{\ell} \newcommand{\OutputLayerBiasVector}{\mathbf{b}_{\text{out}}} \newcommand{\OutputLayerWeightMatrix}{\mathbf{W}_{\text{out}}} \newcommand{\OutputLength}{K} \newcommand{\OutputLengthStandardDeviation}{\sigma} \newcommand{\OutputLimit}{K_{\max}} \newcommand{\OutputLogit}{z} \newcommand{\OutputNodeAdjoint}{\bar{v}_W} \newcommand{\OutputNodePrimal}{v_W} \newcommand{\OutputProjectionOperations}{O_{\text{out}}} \newcommand{\OutputQuantizationScale}{s_Y} \newcommand{\OutputRelativeDegree}{r} \newcommand{\OutputToken}{y} \newcommand{\OutputTokenPrefix}{y_{<t}} \newcommand{\OutputTokenPrice}{c_{\text{out}}} \newcommand{\OutputTokenSequence}{y_{1:K}} \newcommand{\OutputTorqueCeiling}{\tau_{\text{out,max}}} \newcommand{\OutstandingItemCount}{N_{\text{out}}} \newcommand{\OverheadCameraEmbedding}{\mathbf{e}_{\text{overhead}}} \newcommand{\OverlappedBackwardCommunicationTime}{T_{\text{pipelined}}} \newcommand{\OverlappedTime}{T_{\text{overlap}}} \newcommand{\OverlappingGaussianSet}{\mathcal{N}} \newcommand{\OversubscriptionRatio}{R} \newcommand{\OwnershipAcquisitionTime}{T_{\text{own}}} \newcommand{\PackageDecouplingCapacitance}{C_{\text{pkg}}} \newcommand{\PackageInductance}{L_{\text{pkg}}} \newcommand{\PackageResistance}{R_{\text{pkg}}} \newcommand{\PackageThermalCapacitance}{C_{\text{th}}} \newcommand{\PackageThermalTimeConstant}{\tau_{\text{th}}} \newcommand{\PackedExampleIndex}{k} \newcommand{\PackedExampleLength}{s} \newcommand{\PackedExampleOffset}{b} \newcommand{\PacketBuffer}{b} \newcommand{\PaddingWasteFraction}{W} \newcommand{\PageRankDampingFactor}{d} \newcommand{\PageRankScoreVector}{\mathbf{r}} \newcommand{\PairedAcceptanceDifference}{\Delta} \newcommand{\PairedDifferenceLowerLimit}{L_{\Delta}} \newcommand{\PairedDifferenceUpperLimit}{U_{\Delta}} \newcommand{\PairedOutcomeCellCount}{n} \newcommand{\PairedRandomVariable}{Y} \newcommand{\PairedTaskIndex}{j} \newcommand{\PairedTimeInstant}{s} \newcommand{\PairedVerdictCorrelation}{\hat{\phi}} \newcommand{\PairingLagCeiling}{\Delta t_{\text{lag,max}}} \newcommand{\PairwiseCoordinationCoefficient}{\beta_{\text{pair}}} \newcommand{\PairwiseMaskSecret}{\mathbf{s}} \newcommand{\ParallelEnvironmentCount}{n_{\text{env}}} \newcommand{\ParallelFraction}{f_{\text{parallel}}} \newcommand{\ParallelLoopCount}{k_{\text{parallel}}} \newcommand{\ParallelRigCount}{N_{\text{rig}}} \newcommand{\ParameterPayload}{M_{\text{param}}} \newcommand{\ParameterRandomizationRanges}{\mathcal{P}} \newcommand{\ParameterScaleCoefficient}{A} \newcommand{\ParameterScalingExponent}{\alpha} \newcommand{\ParameterServerCount}{K_{\text{srv}}} \newcommand{\ParameterSpace}{\Theta} \newcommand{\ParameterSpaceDirection}{u} \newcommand{\ParameterStreamingTime}{t_{\text{stream}}} \newcommand{\ParameterVelocity}{\dot{\theta}} \newcommand{\ParameterizedPredictor}{f_{\theta}} \newcommand{\Parameters}{P} \newcommand{\ParametricProposalDistribution}{q_{\boldsymbol{\psi}}} \newcommand{\ParasiticLoopInductance}{L_{\text{parasitic}}} \newcommand{\ParentCapabilityGrant}{\Gamma_{\text{parent}}} \newcommand{\ParentFreeBalance}{F_{P}} \newcommand{\ParentNodeIndex}{k} \newcommand{\ParentReservedFunds}{R_{P}} \newcommand{\ParentSettledCharges}{E_{P}} \newcommand{\ParetoMinimumDemand}{x_{\min}} \newcommand{\ParetoTailExponent}{\alpha_{\text{tail}}} \newcommand{\ParetoTaskDemand}{X} \newcommand{\ParticipatingClientCount}{N_{\text{clients}}} \newcommand{\PartnerBitIndex}{k} \newcommand{\PassAtKEstimate}{\widehat{\operatorname{pass@}k}} \newcommand{\PassedTrialCount}{N_{\text{pass}}} \newcommand{\PassingRunCount}{s} \newcommand{\PassingSampleCount}{c} \newcommand{\PassiveModelPrediction}{\hat{Y}} \newcommand{\PastSynchronizationStepIndex}{j} \newcommand{\PatchColumnIndex}{w} \newcommand{\PatchRowIndex}{h} \newcommand{\PatchTokenCount}{N} \newcommand{\PathAcceleration}{\ddot{s}} \newcommand{\PathAccelerationInput}{u} \newcommand{\PathAccelerationLowerBound}{\ddot{s}_{\min}} \newcommand{\PathAccelerationTorqueCoefficient}{\mathbf{a}_{\tau}} \newcommand{\PathAccelerationUpperBound}{\ddot{s}_{\max}} \newcommand{\PathCoordinate}{s} \newcommand{\PathDelayAsymmetry}{\Delta t_{\text{asym}}} \newcommand{\PathGridPointCount}{N_{\text{grid}}} \newcommand{\PathVelocity}{\dot{s}} \newcommand{\PathVelocityField}{v} \newcommand{\PathVelocitySquaredTorqueCoefficient}{\mathbf{b}_{\tau}} \newcommand{\PayloadGravityTorque}{\tau_{g}} \newcommand{\PayloadLeverArm}{r} \newcommand{\PcieLinkFailureRate}{\lambda_{\text{PCIe}}} \newcommand{\PdnBranchCurrent}{I_{\text{branch}}} \newcommand{\PdnBranchResistance}{R_{\text{PDN}}} \newcommand{\PdnTargetImpedance}{Z_{\text{target}}} \newcommand{\PeakBridgeJerk}{j_{\text{peak}}} \newcommand{\PeakContactForce}{F_{\text{peak}}} \newcommand{\PeakCopperLossPower}{P_{\text{peak}}} \newcommand{\PeakCurrent}{I_{\text{peak}}} \newcommand{\PeakMemoryBandwidth}{\text{BW}_{\text{peak}}} \newcommand{\PeakPenetrationDepth}{\delta_{\max}} \newcommand{\PeakRate}{R_{\text{peak}}} \newcommand{\PeakRegenerativePower}{P_{\text{regen, peak}}} \newcommand{\PeakRotorAngularSpeed}{\omega_{\max}} \newcommand{\PeakSlipRatio}{\lambda_{\text{peak}}} \newcommand{\PeakStopDeceleration}{a_{\text{peak}}} \newcommand{\PeakTorque}{\tau_{\text{peak}}} \newcommand{\PeakTractionCoefficient}{\mu_{\text{peak}}} \newcommand{\PearsonFitStatistic}{\chi^2} \newcommand{\PeerReviewerIndex}{i} \newcommand{\PeerToolCallIndex}{j} \newcommand{\PenaltyContactDamping}{c} \newcommand{\PenaltyContactStiffness}{k_{\text{pen}}} \newcommand{\PenaltyPenetrationDepth}{\delta_{\text{pen}}} \newcommand{\PenaltyRestitutionDuration}{\Delta t_{\text{res}}} \newcommand{\PendulumNaturalFrequency}{\omega_0} \newcommand{\PenetrationDepth}{\delta} \newcommand{\PenetrationRate}{\dot{\delta}} \newcommand{\PenultimateLayerWidth}{n_{N_L-1}} \newcommand{\PerDeviceComputeTime}{T_{\text{compute,local}}} \newcommand{\PerDeviceWeightReadTime}{T_{\text{read}}} \newcommand{\PerExperimentComputeCost}{C_{\text{compute,per-exp}}} \newcommand{\PerExperimentEngineeringCost}{C_{\text{engineer,per-exp}}} \newcommand{\PerFrameDetectionProbability}{p_{\text{frame}}} \newcommand{\PerGpuNetworkFailureRate}{\lambda_{\text{network/GPU}}} \newcommand{\PerGpuPowerFailureRate}{\lambda_{\text{power/GPU}}} \newcommand{\PerGpuTotalFailureRate}{\lambda_{\text{total/GPU}}} \newcommand{\PerStepCostBound}{C_{\max}} \newcommand{\PerStepErrorRate}{\epsilon} \newcommand{\PerStreamTokenRate}{R} \newcommand{\PerTaskRunCount}{R} \newcommand{\PerTestSignificanceLevel}{\alpha_{\text{sig}}'} \newcommand{\PerTokenDecodeTime}{t_{\text{decode}}} \newcommand{\PerTokenKlEstimate}{\hat{\mathcal{D}}} \newcommand{\PerTokenMaskingTime}{t_{\text{mask}}} \newcommand{\PerTokenPrefillTime}{t_{\text{prefill}}} \newcommand{\PerWorkerBatchSize}{B_{\text{per-worker}}} \newcommand{\PerceptionDepthCovariance}{\boldsymbol{\Sigma}_{\text{depth}}} \newcommand{\PerceptionDispatchTime}{t_{\text{IPC}}} \newcommand{\PerceptionErrorScale}{\epsilon_{\text{scale}}} \newcommand{\PeriodicPeakWindingTemperature}{T_{\text{peak}}} \newcommand{\PeriodicTaskCount}{n} \newcommand{\PermanentMagnetFluxLinkage}{\lambda_{\text{pm}}} \newcommand{\PermissionLoopPeriod}{T_{\text{tick}}} \newcommand{\PermissionPathKernel}{G_\kappa} \newcommand{\PermissionPathParameters}{\kappa} \newcommand{\PermissionTickWaitTime}{t_{\text{wait}}} \newcommand{\PermissionTickWcet}{T_{\text{wcet}}} \newcommand{\PermittedActions}{\mathcal{A}_{\text{perm}}} \newcommand{\PermittedUsePassProbability}{p_{\text{use}}} \newcommand{\PersonApproachTravel}{S_h} \newcommand{\PersonPositionUncertainty}{Z_d} \newcommand{\PersonalizationPenaltyWeight}{\lambda_{\text{reg}}} \newcommand{\PersonalizationVector}{\mathbf{p}} \newcommand{\PerturbationNoiseStandardDeviation}{\sigma} \newcommand{\PerturbationNormOrder}{p} \newcommand{\PerturbedPose}{\mathbf{T}'} \newcommand{\PerturbedSignalDimension}{D} \newcommand{\PerturbedSignalVector}{\mathbf{x}} \newcommand{\PfcWatchdogTimeout}{T_{\text{watchdog}}} \newcommand{\PhaseInductance}{L_{\text{phase}}} \newcommand{\PhaseJoulePower}{P_{\text{phase}}} \newcommand{\PhaseMargin}{\Phi_m} \newcommand{\PhaseResistance}{R_{\text{phase}}} \newcommand{\PhotodiodeQuantumEfficiency}{\eta_{\text{QE}}} \newcommand{\PhysicalPlantDynamics}{f_{\text{real}}} \newcommand{\PhysicalRestoreTime}{t_{\text{physical\_restore}}} \newcommand{\PhysicalReturnLevel}{z_{T, \text{real}}} \newcommand{\PhysicalStateTrajectory}{s_{\text{real}}} \newcommand{\PhysicalStlRobustness}{\rho_{\text{real}}} \newcommand{\PhysicalTrajectorySet}{\mathcal{S}_{\text{real}}} \newcommand{\PhysicalWorldState}{s} \newcommand{\PidDerivativeGain}{K_d} \newcommand{\PidIntegralGain}{K_i} \newcommand{\PidProportionalGain}{K_p} \newcommand{\PidProportionalGainMatrix}{\mathbf{K}_p} \newcommand{\PipelineBubbleFraction}{b_{\text{pipe}}} \newcommand{\PipelineBufferMemory}{M_{\text{required}}} \newcommand{\PipelineClockSkew}{t_{\text{skew}}} \newcommand{\PipelineFlushDelay}{t_{\text{hw\_pipe}}} \newcommand{\PipelineIterationTime}{T_{\text{iteration}}} \newcommand{\PipelineParallelDegree}{N_{\text{PP}}} \newcommand{\PipelineTimeSlot}{t} \newcommand{\PipelinedExecutionTime}{T_{\text{pipelined}}} \newcommand{\PistonArea}{A} \newcommand{\PixelColumnCoordinate}{u} \newcommand{\PixelLastEventTime}{t_{\text{last}}} \newcommand{\PixelOpacityContribution}{\alpha'} \newcommand{\PixelRowCoordinate}{v} \newcommand{\PixelRowStandardDeviation}{\sigma_v} \newcommand{\PixelStandardDeviation}{\sigma_u} \newcommand{\PlacementChoiceCount}{n} \newcommand{\PlaintextInput}{m} \newcommand{\PlanAction}{a} \newcommand{\PlanarHomographyMatrix}{\mathbf{H}} \newcommand{\PlanarPositionEmbedding}{\mathbf{E}_{\text{pos}}^{2D}} \newcommand{\PlanarSpecialEuclideanGroup}{SE(2)} \newcommand{\PlanckConstant}{h} \newcommand{\PlanningOperator}{o} \newcommand{\PlanningStageLatency}{T_{\text{plan}}} \newcommand{\PlanningStartInstant}{t_{\text{plan}}} \newcommand{\PlantDynamicsFunction}{\mathbf{f}} \newcommand{\PlantDynamicsParameters}{\theta_{\text{plant}}} \newcommand{\PlantOutcomeFunction}{g} \newcommand{\PlantParameters}{m} \newcommand{\PlantStateAcceleration}{\ddot{\mathbf{x}}} \newcommand{\PlantStateComponentCount}{N_s} \newcommand{\PlantStateDimension}{n} \newcommand{\PlantStateRate}{\dot{\mathbf{x}}} \newcommand{\PlantStateSpace}{\mathcal{X}} \newcommand{\PlantTransitionDensity}{p_m} \newcommand{\PlantTransitionKernel}{\mathcal{T}} \newcommand{\PlatformAnnualOperationsCost}{C_{\text{after}}} \newcommand{\PlatformResourceCapacity}{\text{Cap}} \newcommand{\PlatformResourceIndex}{i} \newcommand{\PlatformTotalCost}{C_{\text{platform}}} \newcommand{\PlatformUtilization}{U_{\text{platform}}} \newcommand{\PointClearanceMargin}{d_{\text{margin}}} \newcommand{\PointToPointMessageSize}{n} \newcommand{\PointToPointTransferTime}{T} \newcommand{\PoisonedModel}{f_{\mathcal{S} \cup \mathcal{S}_{\text{poison}}}} \newcommand{\PoisoningDataset}{\mathcal{S}_{\text{poison}}} \newcommand{\PoisoningTargetDataset}{\mathcal{S}_{\text{test}}} \newcommand{\PoissonSubintervalCount}{n} \newcommand{\Policy}{\pi_\theta} \newcommand{\PolicyAction}{a} \newcommand{\PolicyActionStandardDeviation}{\sigma^{\pi}} \newcommand{\PolicyActionWindow}{\mathbf{A}_{t:t+H-1}} \newcommand{\PolicyCheckpoint}{v} \newcommand{\PolicyEnsembleCovariance}{\boldsymbol{\Sigma}_{\pi}} \newcommand{\PolicyEntropy}{\mathcal{H}} \newcommand{\PolicyGaussianMean}{\boldsymbol{\mu}_{\theta}} \newcommand{\PolicyGaussianMeanComponent}{\mu^{\pi}} \newcommand{\PolicyGaussianStandardDeviation}{\boldsymbol{\sigma}_{\theta}} \newcommand{\PolicyGradientBaseline}{b} \newcommand{\PolicyGradientEstimate}{\widehat{g}} \newcommand{\PolicyHistoryActionReturn}{Q^{\pi}} \newcommand{\PolicyHistoryAdvantage}{A^{\pi}} \newcommand{\PolicyImitationLoss}{\mathcal{L}_{\text{policy}}} \newcommand{\PolicyLipschitzBound}{L_{\text{lip}}} \newcommand{\PolicyObservedState}{s} \newcommand{\PolicyPassRate}{f} \newcommand{\PolicyProbabilityRatio}{\rho} \newcommand{\PolicyRemainingReturn}{V^{\pi}} \newcommand{\PolicyRequestLength}{S_{\pi}} \newcommand{\PolicyStateActionDistribution}{\rho_{\pi_\theta}} \newcommand{\PolicyTrajectoryDistribution}{p_\theta} \newcommand{\PolicyTti}{T_{\text{TTI}}} \newcommand{\PolicyUpdateStepTime}{T_{\text{step}}} \newcommand{\PolyakAveragingCoefficient}{\tau} \newcommand{\PolynomialCoefficientVector}{\mathbf{a}} \newcommand{\PolynomialTrajectoryCoefficient}{a} \newcommand{\PomdpActionSet}{\mathsf{A}} \newcommand{\PomdpObservationFunction}{\mathsf{O}} \newcommand{\PomdpObservationSet}{\Omega} \newcommand{\PomdpRewardFunction}{\mathsf{R}} \newcommand{\PomdpStateSpace}{\mathsf{S}} \newcommand{\PomdpTransitionFunction}{\mathsf{T}} \newcommand{\PoolResidentMemory}{M_{\text{pool}}} \newcommand{\PooledAcceptanceProbability}{\bar{p}} \newcommand{\PooledConversionRate}{\hat{p}} \newcommand{\PooledSampleApprovalRate}{\hat{p}} \newcommand{\PopulationStabilityBinCount}{n_{\text{bins}}} \newcommand{\PopulationStabilitySmoothingConstant}{\epsilon_{\text{smooth}}} \newcommand{\PortCycleNetEnergy}{\Delta E} \newcommand{\PortEffort}{\mathbf{F}} \newcommand{\PortFlow}{\dot{\mathbf{x}}} \newcommand{\PortInput}{\mathbf{u}} \newcommand{\PortOutput}{\mathbf{y}} \newcommand{\PortStoredEnergy}{E} \newcommand{\PortVelocity}{v} \newcommand{\Pose}{\mathbf{T}} \newcommand{\PoseTwistPerturbation}{\boldsymbol{\epsilon}} \newcommand{\PoseTwistPerturbationMatrix}{\hat{\boldsymbol{\epsilon}}} \newcommand{\PositionComponent}{p} \newcommand{\PositionConfidenceEllipsoidRadius}{\chi_{3,0.95}} \newcommand{\PositionErrorBound}{E} \newcommand{\PositionErrorCeiling}{e_{\max}} \newcommand{\PositionErrorCovariance}{\mathbf{P}_{pp}} \newcommand{\PositionErrorEnvelope}{e} \newcommand{\PositionLossMask}{m} \newcommand{\PositionUncertaintyRadius}{r} \newcommand{\PositionalTaskTolerance}{r_{\text{tol}}} \newcommand{\PositiveClassInput}{x_{+}} \newcommand{\PositiveIntegerExponent}{n} \newcommand{\PostContactDrivenStroke}{\Delta x_{\text{driven}}} \newcommand{\PostImpactNormalVelocity}{v_n^+} \newcommand{\PostRevocationDelay}{\tau_{\text{rev}}} \newcommand{\PosteriorCovarianceMatrix}{\boldsymbol{\Sigma}_{\text{post}}} \newcommand{\PosteriorDifferentialEntropy}{h_{\text{post}}} \newcommand{\PostprocessingLatency}{L_{\text{lat,post}}} \newcommand{\PotentialOutcome}{Y^{\text{pot}}} \newcommand{\PowerCriticalQuantile}{z_{\beta}} \newcommand{\PowerLimitBase}{a} \newcommand{\PowerRailInductance}{L_{\text{bus}}} \newcommand{\PowerRailResistance}{R_{\text{bus}}} \newcommand{\PoweredHoldCommand}{\mathbf{u}_{\text{hold}}} \newcommand{\PoweredHoldState}{\mathbf{x}_{\text{hold}}} \newcommand{\PoweredServerCount}{N} \newcommand{\PpoClippedSurrogateObjective}{\mathcal{L}^{\text{CLIP}}} \newcommand{\PqApproximateDistance}{\tilde{d}} \newcommand{\PqCentroidCode}{c^{\text{pq}}} \newcommand{\PqSubspaceIndex}{j} \newcommand{\PqSubvectorCount}{m} \newcommand{\PreForwardEnvironmentState}{\sigma_0} \newcommand{\PreImpactNormalVelocity}{v_n^-} \newcommand{\PreImpactSeparationDistance}{d_{\text{sep}}} \newcommand{\PrePivotCatchRate}{v} \newcommand{\PreTriggerWindowDuration}{T_{\text{pre}}} \newcommand{\PreactivationMatrix}{\mathbf{Z}} \newcommand{\PreactivationVector}{\mathbf{z}} \newcommand{\PrebrakeDelay}{\tau_{\text{delay}}} \newcommand{\PrebrakeDelayCeiling}{\tau_{\text{delay},\max}} \newcommand{\PredecessorGraphVertex}{u} \newcommand{\PredicateLipschitzConstant}{L_{\phi}} \newcommand{\PredicateNormalizationScale}{c} \newcommand{\PredictedActionComponent}{\hat{a}} \newcommand{\PredictedClassProbability}{p} \newcommand{\PredictedConfidence}{\hat{p}} \newcommand{\PredictedDecision}{\hat{Y}} \newcommand{\PredictedEnvironmentLatent}{\hat{\mathbf{z}}} \newcommand{\PredictedErrorCovariance}{\mathbf{P}_{k|k-1}} \newcommand{\PredictedForceReading}{\hat{y}} \newcommand{\PredictedOutput}{\hat{\mathbf{y}}} \newcommand{\PredictedOutputComponent}{\hat{y}} \newcommand{\PredictedPolicyAction}{\hat{\mathbf{a}}} \newcommand{\PredictedProtectedAttribute}{\hat{a}} \newcommand{\PredictedRelativeDepth}{z_{\text{pred}}} \newcommand{\PredictedStateEmbedding}{\mathbf{e}_{\text{state}}} \newcommand{\PredictedStateEstimate}{\hat{\mathbf{x}}_{k|k-1}} \newcommand{\PredictionHeadFunction}{g} \newcommand{\PredictionStepIndex}{i} \newcommand{\PredictiveEntropy}{H_{\text{pred}}} \newcommand{\PreemptionFanoutCount}{k} \newcommand{\PreemptionRate}{\lambda_{\text{preempt}}} \newcommand{\PreemptionTaxTime}{T_{\text{preempt}}} \newcommand{\PreferenceMargin}{z} \newcommand{\PreferencePairDataset}{\mathcal{D}} \newcommand{\PreferenceScale}{\beta} \newcommand{\PreferenceScoredPositionSet}{\mathcal{A}} \newcommand{\PreferredReferenceRelativeScore}{\Delta_w} \newcommand{\PreferredTrajectory}{\tau_w} \newcommand{\PrefetchBufferCount}{N_{\text{prefetch}}} \newcommand{\PrefillAllocatedTokenCount}{C} \newcommand{\PrefillArithmeticIntensity}{I_{\text{prefill}}} \newcommand{\PrefillChunkSize}{C_{\text{chunk}}} \newcommand{\PrefillOperations}{O_{\text{prefill}}} \newcommand{\PrefillRequestIndex}{i} \newcommand{\PrefillTime}{T_{\text{prefill}}} \newcommand{\PrefixHitRate}{\rho_{\text{prefix}}} \newcommand{\PregraspPosition}{\mathbf{p}_{\text{pre}}} \newcommand{\PreprocessingLatency}{L_{\text{lat,pre}}} \newcommand{\PreprocessingServiceTime}{T_{\text{preprocessing}}} \newcommand{\PreprocessingThroughput}{R_{\text{preprocessing}}} \newcommand{\PresaturationTorqueCommand}{\boldsymbol{\tau}_{\text{cmd}}} \newcommand{\PreviousLayerWidth}{n_{\ell-1}} \newcommand{\PreviousPeriodCost}{C_{\text{previous}}} \newcommand{\PreviousRangeObservationHistory}{z_{1:t-1}} \newcommand{\PreviousUpdatedErrorCovariance}{\mathbf{P}_{k-1|k-1}} \newcommand{\PreviousUpdatedStateEstimate}{\hat{\mathbf{x}}_{k-1|k-1}} \newcommand{\PrimitiveOperation}{\phi} \newcommand{\PrincipalPointColumn}{c_x} \newcommand{\PrincipalPointRow}{c_y} \newcommand{\PriorCovarianceMatrix}{\boldsymbol{\Sigma}_{\text{prior}}} \newcommand{\PriorDifferentialEntropy}{h_{\text{prior}}} \newcommand{\PriorStandardDeviation}{\sigma_0} \newcommand{\PriorTurnCount}{j} \newcommand{\PrivacyAdditiveSlack}{\delta} \newcommand{\PrivacyBudget}{\epsilon} \newcommand{\PrivacyLossVariable}{\mathcal{L}_{\text{priv}}} \newcommand{\PrivacyNoiseMultiplier}{\sigma} \newcommand{\PrivatizedQuery}{\tilde{f}} \newcommand{\PrivilegeTrapTime}{T_{\text{trap}}} \newcommand{\PrivilegedSimulatorState}{s_{\text{priv}}} \newcommand{\PrivilegedStateDimension}{d_{\text{priv}}} \newcommand{\PrivilegedStateEncoder}{E} \newcommand{\ProbabilityFunction}{p} \newcommand{\ProbabilitySimplex}{\Delta} \newcommand{\ProbedCellCount}{n_{\text{probe}}} \newcommand{\ProcessConditionCheckTime}{T_{\text{proc}}} \newcommand{\ProcessConditionPassProbability}{p_{\text{proc}}} \newcommand{\ProcessNoiseCovariance}{\mathbf{Q}} \newcommand{\ProcessNoiseIntensity}{\mathbf{Q}} \newcommand{\ProcessNoiseVector}{\mathbf{w}} \newcommand{\ProcessedDataVolume}{D_{\text{vol,processed}}} \newcommand{\ProcessedKeyTileIndex}{t} \newcommand{\ProcessedSampleCount}{N_{\text{samples}}} \newcommand{\ProcessingBufferCount}{N_{\text{processing}}} \newcommand{\ProcessingPrice}{R_{\text{process/GB}}} \newcommand{\ProductFactorIndex}{j} \newcommand{\ProductionExecutionCount}{N_{\text{prod}}} \newcommand{\ProductionModelCount}{N_{\text{models}}} \newcommand{\ProductionOnlyFailureCount}{n_{\text{prod}}} \newcommand{\ProfileAccelerationBound}{a_{\max}} \newcommand{\ProfileJerk}{\dot{a}} \newcommand{\ProgramGoodput}{\eta_{\text{program}}} \newcommand{\ProgramInvariantPredicate}{P} \newcommand{\ProgramState}{s} \newcommand{\ProgramStateSpace}{\Sigma} \newcommand{\ProjectedSeamState}{\hat{\mathbf{x}}_{\text{seam}}} \newcommand{\ProjectedTrajectoryRecord}{R} \newcommand{\ProjectedTurnGradientContribution}{Z} \newcommand{\ProjectionBallRadius}{\epsilon} \newcommand{\ProjectionConstraintSet}{\mathcal{C}} \newcommand{\ProjectiveDistanceSample}{s} \newcommand{\ProjectiveRayScale}{\lambda} \newcommand{\ProjectiveScaleFactor}{s} \newcommand{\PromotedFusionInputRank}{r'} \newcommand{\PromptLength}{S_{\text{prompt}}} \newcommand{\PromptToken}{x} \newcommand{\PromptTokensSent}{S_{\text{sent}}} \newcommand{\PropagatedPositionStandardDeviation}{\sigma_p} \newcommand{\PropensityPriorApprovalShape}{a} \newcommand{\PropensityPriorRejectionShape}{b} \newcommand{\ProportionTestStatistic}{z} \newcommand{\ProportionalGainMatrix}{\mathbf{K}_{p}} \newcommand{\ProportionalPotentialEnergy}{\mathcal{L}_{\text{pos}}} \newcommand{\ProposalDeserializationTime}{t_{\text{deser}}} \newcommand{\ProposalExpiryInstant}{t_{\text{valid}}} \newcommand{\ProposalFirstWaypoint}{\mathbf{a}_0} \newcommand{\ProposalLinkTransportTime}{t_{\text{link}}} \newcommand{\ProposalParameterVector}{\boldsymbol{\psi}} \newcommand{\ProposalPayload}{\mathcal{P}} \newcommand{\ProposedAccess}{r} \newcommand{\ProposedContactForce}{F_{\text{nom}}} \newcommand{\ProposedEndEffectorPoseSequence}{\mathbf{X}_{1:H}} \newcommand{\ProposedGripperCommandSequence}{\mathbf{g}_{1:H}} \newcommand{\ProposedJointPositionSequence}{\mathbf{Q}_{1:H}} \newcommand{\ProposedJointVelocitySequence}{\dot{\mathbf{Q}}_{1:H}} \newcommand{\ProposedOperation}{o} \newcommand{\ProposerConfidenceScore}{\hat{p}} \newcommand{\ProposerEvaluationRate}{f} \newcommand{\ProposerInferenceTime}{t_{\text{infer}}} \newcommand{\ProprioceptiveInputSpace}{\mathcal{X}} \newcommand{\ProprioceptiveInputVector}{\mathbf{x}} \newcommand{\ProprioceptiveTokenEmbeddings}{\mathbf{z}_{\text{proprio}}} \newcommand{\ProtectedAttribute}{a} \newcommand{\ProtectedGroupMembership}{G} \newcommand{\ProtectedTrainingRecord}{R} \newcommand{\ProtectionSwitchResistance}{R_{\text{switch}}} \newcommand{\ProtectiveClearanceMargin}{\delta_{\text{margin}}} \newcommand{\ProtectiveSeparationDistance}{S_p} \newcommand{\ProtectiveSpringStiffness}{k_{\text{spring}}} \newcommand{\ProtectiveSpringTravel}{\delta} \newcommand{\ProxyTrajectoryReward}{\hat{R}} \newcommand{\PrunedWeightMatrix}{\hat{\mathbf{W}}} \newcommand{\PruningMask}{\mathbf{M}} \newcommand{\PruningMaskEntry}{M_{i,j}} \newcommand{\PruningThreshold}{\delta_{\text{prune}}} \newcommand{\PsuMttf}{\text{MTTF}_{\text{psu}}} \newcommand{\PtpExchangeTimestamp}{t} \newcommand{\PtpForwardPathDelay}{T_{\text{prop}, M \to S}} \newcommand{\PtpHardwareTimestamp}{t_{\text{PTP}}} \newcommand{\PtpPropagationDelay}{T_{\text{prop}}} \newcommand{\PtpReversePathDelay}{T_{\text{prop}, S \to M}} \newcommand{\PublicationEpoch}{t_{\text{pub}}} \newcommand{\PufChallenge}{C} \newcommand{\PufResponse}{R} \newcommand{\PufResponseBit}{r} \newcommand{\PulseRoundTripTime}{\Delta t} \newcommand{\PureNoiseActionChunk}{\mathbf{A}^N} \newcommand{\PureTransportDelay}{T_d} \newcommand{\PwmPeriod}{T_{\text{pwm}}} \newcommand{\QuadratureAxisInductance}{L_q} \newcommand{\QuadratureAxisVoltage}{v_q} \newcommand{\QualifiedAdmissionRate}{r} \newcommand{\QualityObjective}{S_{\text{quality}}} \newcommand{\QuantileLevel}{u} \newcommand{\QuantileProbabilityLevel}{q} \newcommand{\QuantileThresholdCandidate}{x} \newcommand{\QuantizationBitWidth}{b} \newcommand{\QuantizationBlockSize}{b_{\text{block}}} \newcommand{\QuantizationScale}{s} \newcommand{\QuantizationStep}{\delta} \newcommand{\QuantizationZeroPoint}{z} \newcommand{\QuantizedGradient}{\mathbf{g}_{\text{int8}}} \newcommand{\QuantizedIntegerCode}{x_q} \newcommand{\QuantizedWeightEntry}{W_{ik}} \newcommand{\QuantizerInput}{x} \newcommand{\QuarterCycleCompressionTime}{t_{\text{peak}}} \newcommand{\QueryAxisLabel}{i} \newcommand{\QueryBlockCount}{T_r} \newcommand{\QueryBlockIndex}{i} \newcommand{\QueryBlockSize}{B_r} \newcommand{\QueryBoundaryCount}{S_{\text{eff}}} \newcommand{\QueryBufferPosition}{i} \newcommand{\QueryComponent}{q_{im}} \newcommand{\QueryPrice}{p_{\text{query}}} \newcommand{\QueryProjectionMatrix}{\mathbf{W}_{Q}} \newcommand{\QuerySensitivity}{\Delta} \newcommand{\QuerySourceMatrix}{\mathbf{X}_{Q}} \newcommand{\QueryVector}{\mathbf{q}} \newcommand{\QueryWord}{q} \newcommand{\QueryWordDocumentFrequency}{n} \newcommand{\QueryWordFrequency}{f} \newcommand{\QueryWorkspaceGeneration}{g_q} \newcommand{\QueueArrivalTime}{t_{\text{arr}, i}} \newcommand{\QueueServerCount}{c} \newcommand{\QueueServiceVariationCoefficient}{c_{s}} \newcommand{\QueueSystemCapacity}{K} \newcommand{\QueueWaitTime}{W_{q}} \newcommand{\QueuedJobCount}{N_{\text{queue}}} \newcommand{\QueuedTransactionBytes}{D_{\text{vol}}} \newcommand{\QueuedTransactionCount}{K} \newcommand{\QueuedTransactionSet}{\mathcal{Q}} \newcommand{\QueueingLatency}{L_{\text{lat,queue}}} \newcommand{\QuiescentJunctionTemperature}{T_{\text{j},\text{target}}} \newcommand{\QuiescentSocPower}{P_{\text{base}}} \newcommand{\QuinticBlendCoefficient}{\mathbf{a}} \newcommand{\QuotaReductionSensitivity}{\gamma_{\text{rate}}} \newcommand{\RadarRangeResolution}{\Delta R} \newcommand{\RadialBasisKernelCoefficient}{\gamma} \newcommand{\RadialDistortionCoefficient}{k} \newcommand{\RadialRange}{R} \newcommand{\RadialRangeStandardDeviation}{\sigma_R} \newcommand{\RadiationWavelength}{\lambda} \newcommand{\RailVoltageTolerance}{\delta_{\text{tol}}} \newcommand{\RandomEnvironmentState}{S} \newcommand{\RandomRetainedElementCount}{K_{\text{rand}}} \newcommand{\RandomSampleCollectionSize}{D_{\text{eval,total}}} \newcommand{\RandomVectorDimension}{d} \newcommand{\RandomizationClusterCount}{K} \newcommand{\RandomizedMechanism}{\mathcal{M}} \newcommand{\RandomizedSmoothingNoise}{\boldsymbol{\delta}} \newcommand{\RangeObservation}{z} \newcommand{\RangeObservationHistory}{z_{1:t}} \newcommand{\RankComponentIndex}{s} \newcommand{\RankConstrainedMatrix}{\mathbf{A}} \newcommand{\RankContribution}{x} \newcommand{\RankCountBinaryExponent}{m} \newcommand{\RankFusionSmoothingConstant}{k_{\text{rrf}}} \newcommand{\RankIndex}{i} \newcommand{\RankReductionResult}{y} \newcommand{\RankingFunction}{V} \newcommand{\RatedActuatorTorque}{\tau_{\text{rated}}} \newcommand{\RatedCurrentEquilibriumTemperature}{T_{\text{eq}}} \newcommand{\RatedFatigueLife}{L_{10}} \newcommand{\RatedJointTorque}{\boldsymbol{\tau}_{\text{rated}}} \newcommand{\RatingCategory}{y} \newcommand{\RatioClippingWidth}{\epsilon_{\text{clip}}} \newcommand{\RationaleTokens}{z} \newcommand{\RawClearanceBarrierFunction}{h_{\text{raw}}} \newcommand{\RawDataUploadEnergy}{E_{\text{raw}}} \newcommand{\RawHardwareFaultRate}{\lambda_{\text{raw}}} \newcommand{\RawPipelineInput}{x} \newcommand{\RawRecordCount}{N} \newcommand{\RawSensoryData}{\mathbf{S}} \newcommand{\RayReturnRange}{r_{\text{hit}}} \newcommand{\RayStepCount}{N_{\text{steps}}} \newcommand{\RayTraversalLength}{d_{\text{ray}}} \newcommand{\RayVoxelRange}{r_{\text{voxel}}} \newcommand{\RayleighDissipationFunction}{\mathcal{D}} \newcommand{\ReachabilityCostate}{\mathbf{p}} \newcommand{\ReachabilityHamiltonian}{\mathcal{H}} \newcommand{\ReachabilityHorizonInstant}{t'} \newcommand{\ReachabilityLevelFunction}{V} \newcommand{\ReachabilityTerminalTime}{T} \newcommand{\ReachableArtifactNode}{u} \newcommand{\ReachableDistance}{d_{\text{reach}}} \newcommand{\ReachableWorkspace}{\mathcal{W}} \newcommand{\ReadEndSequenceCount}{c_{\text{end}}} \newcommand{\ReadStartSequenceCount}{c_{\text{start}}} \newcommand{\ReadTimeCeiling}{R} \newcommand{\RealDataset}{\mathcal{S}_{\text{real}}} \newcommand{\RealTimeTaskIndex}{i} \newcommand{\RealityGapVector}{\boldsymbol{\Delta}_{\text{sim2real}}} \newcommand{\RealizedActuatorEffort}{u_{\text{act}}} \newcommand{\RealizedArrivalCount}{n} \newcommand{\RealizedDamageOutcome}{y} \newcommand{\RealizedDampingPower}{P_d} \newcommand{\RealizedDeviceComputeRate}{R} \newcommand{\RealizedFalseAlarmProbability}{\alpha_{*}} \newcommand{\RealizedMissedDegradationProbability}{\beta_{*}} \newcommand{\RealizedServiceTime}{s} \newcommand{\ReceiptSampleIndex}{t_{\text{recv}}} \newcommand{\ReceiveBandwidth}{\text{BW}_{\text{rx}}} \newcommand{\ReceiverOverhead}{o_{\text{recv}}} \newcommand{\ReceiverTimingJitter}{\sigma_{\Delta t}} \newcommand{\RecentUsageShare}{F_{\text{actual}}} \newcommand{\RecommenderItemCount}{N_{\text{items}}} \newcommand{\RecommenderUserCount}{N_{\text{users}}} \newcommand{\ReconcilableToolInterface}{\mathbb{T}_{a}} \newcommand{\ReconstructedGradient}{\hat{\mathbf{g}}} \newcommand{\ReconstructedWeight}{\hat{w}} \newcommand{\RecordAdequacyPassProbability}{p_{\text{record}}} \newcommand{\RecordSizeCeiling}{s_{\max}} \newcommand{\RecordedAuthorityState}{S_{\text{auth}}} \newcommand{\RecoveryCompletionInstant}{t_{\text{rec}}} \newcommand{\RecoveryPoseTolerance}{\epsilon_{\text{sync}}} \newcommand{\RecoveryTargetLogPosition}{j_{\text{target}}} \newcommand{\RecoveryWarmupTime}{T_{\text{warmup}}} \newcommand{\RecurrentHiddenBias}{\mathbf{b}_{\text{h}}} \newcommand{\RecurrentHiddenState}{\mathbf{h}} \newcommand{\RecurrentInputWeights}{\mathbf{W}_{\text{hx}}} \newcommand{\RecurrentOutputWeights}{\mathbf{W}_{\text{yh}}} \newcommand{\RecurrentStateWeights}{\mathbf{W}_{\text{hh}}} \newcommand{\ReduceScatterCompletionTime}{T_{\text{reducescatter}}} \newcommand{\ReducedBoundaryConditionVector}{\mathbf{b}_{\text{red}}} \newcommand{\ReducedImpactMass}{m_{\text{red}}} \newcommand{\ReducibleLoss}{\hat{\mathcal{L}}} \newcommand{\ReductionInputCount}{n} \newcommand{\RedundantComponentCount}{N_{\text{red}}} \newcommand{\RedundantReplicaCount}{k} \newcommand{\RedundantServiceAvailability}{A_{\text{system}}} \newcommand{\ReferenceActionDisadvantage}{A_t^{\pi^*}} \newcommand{\ReferenceAssessedFailure}{F} \newcommand{\ReferenceBinIndex}{b} \newcommand{\ReferenceBinProportion}{E} \newcommand{\ReferenceCostToGo}{Q_t^{\pi^*}} \newcommand{\ReferenceDisagreementProbability}{\mathcal{L}} \newcommand{\ReferenceDistribution}{p} \newcommand{\ReferenceJointAccelerations}{\ddot{\mathbf{q}}^{\text{ref}}} \newcommand{\ReferenceJointPosition}{q_{\text{reference}}} \newcommand{\ReferenceJointPositions}{\mathbf{q}^{\text{ref}}} \newcommand{\ReferenceJointVelocities}{\dot{\mathbf{q}}^{\text{ref}}} \newcommand{\ReferenceLogProbabilitySum}{\Delta_{\text{ref}}} \newcommand{\ReferenceMixingProbability}{\lambda} \newcommand{\ReferenceNextTokenDistribution}{q} \newcommand{\ReferencePosition}{\mathbf{r}} \newcommand{\ReferenceProbabilityRatio}{z} \newcommand{\ReferenceRelativeScore}{\Delta_\theta} \newcommand{\ReferenceRequestLength}{S_{\text{ref}}} \newcommand{\ReferenceSampleEmpiricalCdf}{F} \newcommand{\ReferenceStateDisagreementRate}{\epsilon_E} \newcommand{\ReferenceStateDistribution}{d_{\pi^*}} \newcommand{\ReferenceStepDisagreementRate}{\epsilon} \newcommand{\ReferenceWindingResistance}{R_0} \newcommand{\ReflectedContactForce}{F_{\text{contact}}} \newcommand{\ReflectedRotorInertia}{J_{\text{ref}}} \newcommand{\ReflectedRotorInertiaMatrix}{\mathbf{J}_m} \newcommand{\ReflectedTransmissionInputInertia}{J_{\text{ref,in}}} \newcommand{\ReflectionAngle}{\theta_{\text{refl}}} \newcommand{\ReflexCollisionBudget}{T_{\text{reflex\_budget}}} \newcommand{\RegeneratedBrakingEnergy}{E_{\text{regen}}} \newcommand{\RegenerativeBrakingTorque}{\tau_{\text{brake}}} \newcommand{\RegenerativeRecoveryEfficiency}{\eta_{\text{regen}}} \newcommand{\RegisterSetupTime}{t_{\text{setup}}} \newcommand{\RegisteredDescriptorCount}{n_{\text{reg}}} \newcommand{\RegularizedEulerIntegral}{I} \newcommand{\RejectionDecodeStep}{t_{\text{cut}}} \newcommand{\RelationalSelection}{\sigma} \newcommand{\RelativeContrastTolerance}{\epsilon_{\text{contrast}}} \newcommand{\RelativeDeviationBound}{\delta} \newcommand{\RelativeImprovementFraction}{\delta} \newcommand{\RelativeStandardError}{r} \newcommand{\RelevantRecordSet}{\mathcal{D}^*} \newcommand{\ReliabilityTargetIndex}{i} \newcommand{\ReliableDetectionFrameCount}{N_{\text{frames}}} \newcommand{\RemainingCallCount}{N_{\text{rem}}} \newcommand{\RemainingDistanceEstimate}{\hat{s}} \newcommand{\RemainingExecutionLease}{T_{\text{lease,rem}}} \newcommand{\RemainingHarmDistance}{d_{\text{rem}}} \newcommand{\RemainingIntentTime}{T_{\text{rem}}} \newcommand{\RemainingReturn}{R_{\geq k}} \newcommand{\RemainingUprightDistance}{s} \newcommand{\RemoteHardwareEfficiency}{\eta_{\text{hw,remote}}} \newcommand{\RemotePathTime}{T_{\text{remote}}} \newcommand{\RemotePeakRate}{R_{\text{peak,remote}}} \newcommand{\RenderedPixelColor}{C} \newcommand{\RenewalJitterAllowance}{T_{\text{jitter}}} \newcommand{\RenyiDivergence}{\mathcal{D}_{\alpha_{\text{R}}}} \newcommand{\RenyiOrder}{\alpha_{\text{R}}} \newcommand{\RenyiPrivacyBudget}{\epsilon_{\text{R}}} \newcommand{\RepairAttemptCost}{C_{\text{repair}}} \newcommand{\RepairCap}{K_{\text{repair}}} \newcommand{\RepairCapabilityGrant}{\Gamma_{\text{repair}}} \newcommand{\RepairFirstCost}{C_{\text{repair\ first}}} \newcommand{\RepairPatchArtifact}{P} \newcommand{\RepairSuccessProbability}{p} \newcommand{\RepairTurnLatency}{T_{\text{repair}}} \newcommand{\ReparameterizationNoise}{\boldsymbol{\epsilon}} \newcommand{\RepeatedRunCount}{k} \newcommand{\RepeatedRunMean}{\mu_{\text{run}}} \newcommand{\RepeatedRunStandardDeviation}{\sigma_{\text{run}}} \newcommand{\ReplacementLatency}{L} \newcommand{\ReplacementTimingReserve}{T_{\text{reserve}}} \newcommand{\ReplanRequestOffset}{T_{\text{request}}} \newcommand{\ReplayBuffer}{\mathcal{M}} \newcommand{\ReplayBufferTransitionCount}{n_{\text{replay}}} \newcommand{\ReplayedErrorCovariance}{\mathbf{P}_{t_{\text{recv}}}} \newcommand{\ReplayedStateEstimate}{\hat{\mathbf{x}}_{t_{\text{recv}}}} \newcommand{\ReplicaAvailability}{A_{\text{single}}} \newcommand{\ReplicaColdStartTime}{T_{\text{cold-start}}} \newcommand{\ReplicaCount}{R} \newcommand{\ReplicaModelLoadTime}{T_{\text{load}}} \newcommand{\ReplicaProvisioningTime}{T_{\text{provision}}} \newcommand{\ReplicaWarmupTime}{T_{\text{warmup}}} \newcommand{\ReplyLossProbability}{q_{\text{rep}}} \newcommand{\RepositoryEdgeSourceIndex}{i} \newcommand{\RepositoryEdgeTargetIndex}{j} \newcommand{\RepositoryEdgeWeight}{A} \newcommand{\RepositoryEdgeWeightMatrix}{\mathbf{A}} \newcommand{\RepositoryFileCount}{n} \newcommand{\RepositoryGraphEdgeSet}{E} \newcommand{\RepositoryGraphVertexSet}{V} \newcommand{\RepositoryTransitionMatrix}{\mathbf{P}_{\text{graph}}} \newcommand{\ReprojectionResidual}{\epsilon_{\text{reproj}}} \newcommand{\RepublicationIndex}{k} \newcommand{\RepublicationPeriod}{T_{\text{rep}}} \newcommand{\RequantizationScale}{s_{\text{eff}}} \newcommand{\RequestCompressionRatio}{\gamma_{\text{req}}} \newcommand{\RequestConcurrency}{Q_{\text{req}}} \newcommand{\RequestLossProbability}{q_{\text{req}}} \newcommand{\RequestOutputLength}{S} \newcommand{\RequestPromptTokens}{\mathbf{x}} \newcommand{\RequestQueueTime}{T_{\text{queue}}} \newcommand{\RequestResidenceTime}{W} \newcommand{\RequestResponseTime}{t} \newcommand{\RequestSeenBatchSize}{B_{\text{req}}} \newcommand{\RequestServiceTime}{T_{\text{svc}}} \newcommand{\RequestTimeInSystem}{T_{\text{lat}}} \newcommand{\RequestedActionTap}{a_{\text{req}}} \newcommand{\RequiredClearance}{C_{\text{safe}}} \newcommand{\RequiredComponentCount}{N} \newcommand{\RequiredDetectionRange}{d_{\text{detect}}} \newcommand{\RequiredInputBandwidth}{\text{BW}_{\text{required}}} \newcommand{\RequiredMemoryBandwidth}{\text{BW}_{\text{req}}} \newcommand{\RequiredPremiseClaim}{P} \newcommand{\RequiredPremiseConfidence}{p} \newcommand{\RequiredPremiseCount}{n} \newcommand{\RequiredResultCount}{k} \newcommand{\RequiredScenarioCellCount}{N_{\text{req}}} \newcommand{\RequiredScenarioSet}{\mathcal{S}_{\text{req}}} \newcommand{\RequiredServiceRate}{\mu_{\text{required}}} \newcommand{\RequiredTaskPairCount}{N'} \newcommand{\RequiredUsersPerVariant}{n} \newcommand{\ResampledReplacementToken}{T_4'} \newcommand{\ReservedDeviceMemory}{M_{\text{reserve}}} \newcommand{\ResetCalibrationTime}{t_{\text{calibration}}} \newcommand{\ResetDuration}{t_{\text{rst}}} \newcommand{\ResetLatency}{T_{\text{reset}}} \newcommand{\ResidentStopDistance}{d_{\text{suffix}}} \newcommand{\ResidentWeightMemory}{M_{\text{weights,resident}}} \newcommand{\ResidualAdapterFunction}{A} \newcommand{\ResidualBlockOutput}{\mathbf{y}} \newcommand{\ResidualCorrectionCeiling}{\Delta_{\max}} \newcommand{\ResidualDynamicsPerturbation}{\Delta \mathbf{f}} \newcommand{\ResidualFrequencyError}{\Delta f_{\text{res}}} \newcommand{\ResidualFunction}{\mathcal{F}} \newcommand{\ResidualGate}{g} \newcommand{\ResidualPolicyTorque}{\boldsymbol{\tau}_{\text{res},\theta}} \newcommand{\ResidualSamplingDistribution}{p_{\text{res}}} \newcommand{\ResizedWorkerCount}{N_{\text{new}}} \newcommand{\ResolutionScalingRatio}{\gamma} \newcommand{\ResourceChangeRate}{r_{\text{chg}}} \newcommand{\ResourceCostBudget}{C_{\text{max}}} \newcommand{\ResourceTypeIndex}{r} \newcommand{\ResourceUtilization}{U} \newcommand{\ResponseActionTokens}{a} \newcommand{\ResponseMetadata}{\mathbf{m}} \newcommand{\ResponsePayload}{\mathbf{y}} \newcommand{\ResponseReward}{r} \newcommand{\ResponseThreshold}{\tau} \newcommand{\ResponseTimeDistributionFunction}{F} \newcommand{\ResponseTimeIterationIndex}{\ell} \newcommand{\ResponseTimeStandardDeviation}{\sigma_t} \newcommand{\RestConfiguration}{\mathbf{q}_{\text{rest}}} \newcommand{\RestitutionCoefficient}{e} \newcommand{\RestoreWorkerCount}{w} \newcommand{\RestrictedAccelerationBound}{a_{\text{restricted}}} \newcommand{\RestrictedSpeedBound}{v_{\text{restricted}}} \newcommand{\ResultActionTime}{T_{\text{action}}} \newcommand{\ResumeTime}{T_{\text{resume}}} \newcommand{\RetainedDigestCount}{m} \newcommand{\RetainedGradientElementCount}{K_{\text{top}}} \newcommand{\RetainedProductiveTime}{T_{\text{productive}}} \newcommand{\RetainedSpectralEnergyFraction}{\eta_r} \newcommand{\RetainingCallCount}{H_{\text{rem}}} \newcommand{\RetiringChunkJointVelocity}{\dot{q}_A} \newcommand{\RetiringChunkReferenceState}{\mathbf{x}_A} \newcommand{\RetrainingComputeCost}{C_{\text{compute}}} \newcommand{\RetrainingDeploymentCost}{C_{\text{deployment}}} \newcommand{\RetrainingInterval}{T} \newcommand{\RetrainingRiskCost}{C_{\text{risk}}} \newcommand{\RetrainingRunCost}{C} \newcommand{\RetrainingValidationCost}{C_{\text{validation}}} \newcommand{\RetrievalCollectionSize}{N} \newcommand{\RetrievalCutoffCount}{k} \newcommand{\RetrievalMethodIndex}{i} \newcommand{\RetrievedRecordSet}{\mathcal{R}} \newcommand{\RetryAttemptIndex}{j} \newcommand{\RetryBackoffInterval}{b} \newcommand{\RetryJitterDelay}{d} \newcommand{\ReturnLevel}{z} \newcommand{\ReturnPeriodTrialCount}{T} \newcommand{\ReturnStepOffset}{k} \newcommand{\ReturnedClassLabel}{c} \newcommand{\ReusedPrefixLength}{S_{\text{match}}} \newcommand{\ReverseModeWorkConstant}{C} \newcommand{\ReverseTransitionCovariance}{\boldsymbol{\Sigma}} \newcommand{\ReverseTransitionMean}{\boldsymbol{\mu}_\theta} \newcommand{\RevertFidelity}{\rho_{\text{revert}}} \newcommand{\ReviewerFalseApprovalIndicator}{X} \newcommand{\ReviewerIndex}{j} \newcommand{\RevisionPassProbability}{p_{\text{rev}}} \newcommand{\Reward}{r} \newcommand{\RewardFunction}{r} \newcommand{\RewardModel}{r} \newcommand{\RightEvasionAction}{\mathbf{a}_{\text{right}}} \newcommand{\RightSingularVectorMatrix}{\mathbf{Q}} \newcommand{\RigidGangJob}{J} \newcommand{\RigidImpactInstant}{t_{\text{impact}}} \newcommand{\RigidTransformTranslation}{\mathbf{t}} \newcommand{\RingAllReduceBandwidthTime}{T_{\text{bandwidth}}} \newcommand{\RingAllReduceCompletionTime}{T_{\text{ring}}} \newcommand{\RingAllReduceStartupTime}{T_{\text{latency}}} \newcommand{\RingBufferHorizon}{T_{\text{buffer}}} \newcommand{\RingBufferSlotCount}{N_{\text{buffer}}} \newcommand{\RingStepIndex}{s} \newcommand{\RingTreeCrossoverPayload}{M_{\text{crossover}}} \newcommand{\RmsMotorTorque}{\tau_{\text{rms}}} \newcommand{\RmspropSquaredGradientAverage}{s} \newcommand{\RobotAction}{\mathbf{a}} \newcommand{\RobotApproachSpeed}{v_r} \newcommand{\RobotApproachVelocity}{v_{\text{robot}}} \newcommand{\RobotObservation}{\mathbf{o}} \newcommand{\RobotPosition}{x_{\text{robot}}} \newcommand{\RobotPositionUncertainty}{Z_r} \newcommand{\RobotReactionTime}{T_r} \newcommand{\RobotReactionTravel}{S_r} \newcommand{\RobotStoppingTravel}{S_s} \newcommand{\RobotStructuralStiffness}{k_{\text{robot}}} \newcommand{\RobotTransitVolume}{\mathcal{T}_{\text{robot}}} \newcommand{\RollingShutterDistortion}{\Delta \mathbf{x}} \newcommand{\RollingShutterFrameSkew}{\Delta t_{\text{skew}}} \newcommand{\RollingShutterRowReadout}{t_{\text{row}}} \newcommand{\RolloutAction}{a} \newcommand{\RolloutActionSequence}{\mathbf{a}_{0:T}} \newcommand{\RolloutAdmissionAge}{\Delta T_{\text{rollout}}} \newcommand{\RolloutAssessmentTime}{T_{v}} \newcommand{\RolloutDuration}{T_{\text{rollout}}} \newcommand{\RolloutEnvironmentState}{s} \newcommand{\RolloutHorizon}{T} \newcommand{\RolloutLoss}{\mathcal{L}} \newcommand{\RolloutPolicyParameters}{\theta_{\text{old}}} \newcommand{\RolloutPolicyTokenCount}{N} \newcommand{\RolloutStateSequence}{s_{0:T}} \newcommand{\RolloutStepCount}{N} \newcommand{\RolloutStepIndex}{k} \newcommand{\RolloutSurrogateObjective}{\mathcal{L}} \newcommand{\RolloutTurnIndex}{k} \newcommand{\RooflineRidgePoint}{I_{\text{ridge}}} \newcommand{\RotaryRotationMatrix}{\mathbf{R}} \newcommand{\RotatedActivationMatrix}{\mathbf{X}'} \newcommand{\RotatedWeightMatrix}{\mathbf{W}'} \newcommand{\RotatingBodyAngularSpeed}{\omega} \newcommand{\RotatingBodyInertia}{J} \newcommand{\RotationOriginAcceleration}{\mathbf{a}_O} \newcommand{\RotationOriginVelocity}{\mathbf{v}_O} \newcommand{\RotationalKineticEnergy}{E_{k,\text{rot}}} \newcommand{\RotationalSpringStiffness}{K} \newcommand{\RotorAngularSpeed}{\omega_m} \newcommand{\RotorInertia}{J_{\text{rotor}}} \newcommand{\RotorPolePairCount}{N_{\text{poles}}} \newcommand{\RoundCommunicationVolume}{M_r} \newcommand{\RoundDownloadVolume}{M_{\text{download},r}} \newcommand{\RoundDuration}{t_r} \newcommand{\RoundEmittedTokenCount}{N_{\text{emit}}} \newcommand{\RoundProtocolVolume}{M_{\text{protocol},r}} \newcommand{\RoundRetryVolume}{M_{\text{retry},r}} \newcommand{\RoundSampleCount}{n_{\text{round}}} \newcommand{\RoundUploadVolume}{M_{\text{upload},r}} \newcommand{\RoundedClassProbability}{p^{\text{rnd}}} \newcommand{\RoundingDecimalCount}{d_{\text{dec}}} \newcommand{\RoutedExpertCount}{k_{\text{experts}}} \newcommand{\RouterGateProbability}{p_{\text{gate}}} \newcommand{\RowActivationDelay}{t_{\text{RCD}}} \newcommand{\RowActiveTime}{t_{\text{RAS}}} \newcommand{\RowAttitudeIncrement}{\Delta \boldsymbol{\theta}_{\text{att}}} \newcommand{\RowConflictCount}{N_{\text{conflict}}} \newcommand{\RowCycleTime}{t_{\text{RC}}} \newcommand{\RowExposureStartTime}{t_{\text{scan}}} \newcommand{\RowModeComponentVector}{\mathbf{a}_s} \newcommand{\RowModeFactorMatrix}{\mathbf{A}} \newcommand{\RowModeFactorSlice}{\mathbf{a}} \newcommand{\RowParallelOutputMatrix}{\mathbf{Z}} \newcommand{\RowParallelWeightMatrix}{\mathbf{B}} \newcommand{\RowPrechargeTime}{t_{\text{RP}}} \newcommand{\RunIndexSubset}{J} \newcommand{\RuntimeGoodput}{\eta_{\text{runtime}}} \newcommand{\RuntimeReserveMemory}{M_{\text{runtime}}} \newcommand{\SCurveAccelerationPhaseTime}{T_{\text{acc}}} \newcommand{\SafeApproachSpeedEnvelope}{v_{\text{safe}}} \newcommand{\SafeControlSet}{\mathcal{U}_{\text{safe}}} \newcommand{\SafeOverrideCommand}{\mathbf{u}_{\text{safe}}} \newcommand{\SafeSeparationDistance}{d_{\text{safe}}} \newcommand{\SafeSetProjection}{\mathcal{P}_{\mathcal{C}}} \newcommand{\SafeStateConstraintSet}{\mathcal{X}_{\text{safe}}} \newcommand{\SafeStateSet}{\mathcal{X}_{\text{safe}}} \newcommand{\SafeWorldState}{s_A} \newcommand{\SafeguardSeparationDistance}{S} \newcommand{\SafeguardStoppingTime}{T} \newcommand{\SafetyBoundaryManifold}{\partial \mathcal{C}} \newcommand{\SagaCompensatingStep}{C} \newcommand{\SagaFailedForwardStep}{F_k^{\text{fail}}} \newcommand{\SagaForwardStep}{F} \newcommand{\SagaStepIndex}{k} \newcommand{\SampleAcquisitionPrice}{c_{\text{sample}}} \newcommand{\SampleGradientStandardDeviation}{\sigma} \newcommand{\SampleLabelingPrice}{c_{\text{label}}} \newcommand{\SampleStatistic}{\widehat{\theta}} \newcommand{\SampleStorageSize}{s_{\text{sample}}} \newcommand{\SampledPolicyToken}{w} \newcommand{\SampledSimulationParameterVector}{\tilde{\boldsymbol{\xi}}} \newcommand{\SampledUnit}{y} \newcommand{\SampledUnitCount}{m} \newcommand{\SamplingParameters}{\mathbf{\Theta}_{\text{sample}}} \newcommand{\SamplingPeriod}{T_s} \newcommand{\SamplingRate}{f_s} \newcommand{\SamplingTemperature}{\tau_{\text{temp}}} \newcommand{\SandboxColdBootTime}{T_{\text{cold}}} \newcommand{\SaturatedJointTorque}{\boldsymbol{\tau}_{\text{act}}} \newcommand{\SavedEngineeringTime}{T_{\text{saved}}} \newcommand{\ScalarFieldSize}{k} \newcommand{\ScalarGraphFunction}{f} \newcommand{\ScalarKalmanGain}{g} \newcommand{\ScalarTrackingError}{e} \newcommand{\ScalarTrackingErrorAcceleration}{\ddot{e}} \newcommand{\ScalarTrackingErrorRate}{\dot{e}} \newcommand{\ScaleCoefficient}{A_{\mathcal{L}}} \newcommand{\ScaledBatchSize}{B_{\text{new}}} \newcommand{\ScaledJointStiffnessMatrix}{\tilde{\mathbf{K}}} \newcommand{\ScaledLearningRate}{\eta_{\text{new}}} \newcommand{\ScaledResource}{X} \newcommand{\ScaledSerialFraction}{s} \newcommand{\ScalingCurveWorkerCount}{k} \newcommand{\ScalingEfficiency}{\eta_{\text{scaling}}} \newcommand{\ScalingExponent}{\alpha_{\text{scale}}} \newcommand{\ScalingLawLoss}{\mathcal{L}} \newcommand{\ScanCapabilityGrant}{\Gamma_{\text{scan}}} \newcommand{\ScatteringCrossSection}{\sigma_s} \newcommand{\ScenarioCellRecordCount}{N_{\text{cell}}} \newcommand{\SceneRadiance}{I} \newcommand{\ScheduleFinishTime}{T_{\text{finish}}} \newcommand{\ScheduledSessionDuration}{T_{\text{sched}}} \newcommand{\SchedulingClassWeight}{w} \newcommand{\SchedulingGoodput}{\eta_{\text{scheduling}}} \newcommand{\SchedulingIntervalLength}{t} \newcommand{\ScoreNoiseStandardDeviation}{\sigma} \newcommand{\ScoreNoiseVector}{\mathbf{z}} \newcommand{\ScoreRefreshInterval}{k_{\text{refresh}}} \newcommand{\ScoredPrefixLength}{S_{\text{step}}} \newcommand{\ScoredStepCount}{J} \newcommand{\ScoredStepIndex}{j} \newcommand{\ScoredToolCall}{a} \newcommand{\ScoredToolCallCount}{N} \newcommand{\ScoringErrorStandardDeviation}{\sigma} \newcommand{\ScreenSpaceCovariance}{\boldsymbol{\Sigma}_{2D}} \newcommand{\ScreenedFeature}{x} \newcommand{\ScreenedFeatureSet}{X} \newcommand{\ScreeningMissRate}{m} \newcommand{\SeamActualAccelerations}{\ddot{\mathbf{q}}_{\text{actual}}} \newcommand{\SeamActualConfiguration}{\mathbf{q}_{\text{actual}}} \newcommand{\SeamActualVelocities}{\dot{\mathbf{q}}_{\text{actual}}} \newcommand{\SeamBlendReference}{\mathbf{s}} \newcommand{\SeamBridgeDuration}{T_{\text{blend}}} \newcommand{\SeamBridgePosition}{q_{\text{blend}}} \newcommand{\SeamInstant}{t_{\text{seam}}} \newcommand{\SeamStepTorque}{\tau_{\text{request}}} \newcommand{\SearchBranchingFactor}{b} \newcommand{\SearchDepth}{d_{\max}} \newcommand{\SearchDepthIndex}{d} \newcommand{\SearchQueryEmbedding}{\mathbf{q}} \newcommand{\SecondAdjacentCheckIndex}{b} \newcommand{\SecondAdjacentCheckPassProbability}{p_{b}} \newcommand{\SecondAdjacentCheckSlotTime}{T_{b}} \newcommand{\SecondAtomicGradientUpdate}{B} \newcommand{\SecondCatalogDefinitionCount}{n_{\text{def},B}} \newcommand{\SecondCatalogDefinitionSize}{S_{B}} \newcommand{\SecondClassCoverageFloor}{b} \newcommand{\SecondClientMaskedUpdate}{\mathbf{y}_B} \newcommand{\SecondClientModelParameters}{\theta_B} \newcommand{\SecondComparedGroupLabel}{b} \newcommand{\SecondComparedItem}{j} \newcommand{\SecondFloatingPointAddend}{b} \newcommand{\SecondGroupClassificationThreshold}{\tau_{\text{thr},b}} \newcommand{\SecondGroupQualifiedFraction}{q_b} \newcommand{\SecondGroupSampleApprovalRate}{\hat{p}_b} \newcommand{\SecondGroupSampleSize}{n_b} \newcommand{\SecondJaccardSet}{\mathcal{B}} \newcommand{\SecondRankComputeTime}{T_{\text{rank}_1}} \newcommand{\SecondRaterCategoryFraction}{p_{y,2}} \newcommand{\SecondRingTraceElement}{b} \newcommand{\SecondSummandStandardDeviation}{\sigma_b} \newcommand{\SecondTwinCriticReturnEstimate}{Q_{\phi_2}} \newcommand{\SecurityLabelLattice}{\mathbb{L}} \newcommand{\SecurityLabelSet}{\mathcal{S}_{\text{lab}}} \newcommand{\SelectedActuationCommand}{\mathbf{u}_{\text{act}}} \newcommand{\SelectedDescriptorCount}{n_{\text{sel}}} \newcommand{\SelectedLayerSet}{\mathcal{S}} \newcommand{\SelectionOverheadSize}{S_{\text{sel}}} \newcommand{\SelectionScoreFunction}{f} \newcommand{\SelectionTime}{T_{\text{selection}}} \newcommand{\SelectiveAcceptanceScore}{\kappa} \newcommand{\SelfConsistencySampleCount}{k} \newcommand{\SelfWatchdogTimeout}{T_{\text{self}}} \newcommand{\SenderOverhead}{o_{\text{send}}} \newcommand{\SensingRealityGap}{\Delta_{\text{sens}}} \newcommand{\SensingStageLatency}{T_{\text{sense}}} \newcommand{\SensorErrorBound}{\epsilon} \newcommand{\SensorFeatureTokens}{\mathbf{z}_{\text{sensor}}} \newcommand{\SensorLeverArm}{\mathbf{r}_{P/O}} \newcommand{\SensorLeverArmLength}{r} \newcommand{\SensorLinkTransportTime}{t_{\text{transport}}} \newcommand{\SensorNoiseBound}{\epsilon} \newcommand{\SensorNoiseDensity}{N_{\text{IMU}}} \newcommand{\SensorNoiseStandardDeviation}{\sigma} \newcommand{\SensorObservationFunction}{g} \newcommand{\SensorPatternDictionary}{\mathbf{\Phi}_{\text{dict}}} \newcommand{\SensorPitchAngle}{\theta_{\text{pitch}}} \newcommand{\SensorPointAcceleration}{\mathbf{a}_P} \newcommand{\SensorPointVelocity}{\mathbf{v}_P} \newcommand{\SensorReadoutTime}{t_{\text{readout}}} \newcommand{\SensorReferenceFrame}{\mathcal{F}_{\text{sensor}}} \newcommand{\SensorRowIndex}{y} \newcommand{\SensorTraceMatrix}{\mathbf{X}} \newcommand{\SequenceCounterReading}{S} \newcommand{\SequenceIterationOperations}{c_{\text{decode}}} \newcommand{\SequenceLength}{S} \newcommand{\SequenceToken}{x} \newcommand{\SequentialAttemptIndex}{j} \newcommand{\SequentialBackwardCommunicationTime}{T_{\text{sequential}}} \newcommand{\SequentialCandidateCount}{M} \newcommand{\SequentialCostPerAcceptedTask}{C_{\text{eff,seq}}} \newcommand{\SequentialExecutionTime}{T_{\text{sequential}}} \newcommand{\SequentialLikelihoodRatio}{\Lambda_m} \newcommand{\SequentialLogLikelihoodRatio}{\Lambda_m} \newcommand{\SequentialTestObservation}{X} \newcommand{\SequentialTrialCount}{m} \newcommand{\SerialAutocorrelation}{\rho} \newcommand{\SerialCallCount}{n} \newcommand{\SerialFraction}{r} \newcommand{\SerialLinkClockFrequency}{f_{\text{link}}} \newcommand{\SerialReferenceTime}{T_{\text{serial}}} \newcommand{\SerializationLatency}{L_{\text{lat,serialization}}} \newcommand{\SerializedChunkVolume}{D_{\text{vol,chunk}}} \newcommand{\SerializedTrainingExample}{X} \newcommand{\SeriesComponentCount}{N_{\text{series}}} \newcommand{\SeriesElasticStiffness}{k} \newcommand{\SeriesPsuCount}{n_{\text{psu}}} \newcommand{\ServerAggregationEnergy}{E_{\text{aggregation}}} \newcommand{\ServerIndex}{i} \newcommand{\ServerPower}{P_{\text{server}}} \newcommand{\ServerRoutingWeight}{w} \newcommand{\ServiceRate}{\mu} \newcommand{\ServiceTimeStandardDeviation}{\sigma} \newcommand{\ServiceTimeVariationCoefficient}{c_{s}} \newcommand{\ServingCostPerQuery}{C_{\text{serving}}} \newcommand{\ServingEmpiricalCdf}{F_{P_t}} \newcommand{\ServingPathPredictor}{f_{\text{serve}}} \newcommand{\ServingTransformFunction}{f_{\text{serve}}} \newcommand{\ServingUtilization}{\rho_{\text{serv}}} \newcommand{\ServoFrequencyCorrection}{\Delta f} \newcommand{\SessionAttemptCount}{N_{\text{att}}} \newcommand{\SessionRequestCount}{N_{\text{session}}} \newcommand{\SetMemberPoint}{\mathbf{z}} \newcommand{\SetpointSampleIndex}{k} \newcommand{\SetpointStepInterval}{\Delta t_{\text{step}}} \newcommand{\SettledOperationCharge}{c} \newcommand{\SettledTrajectoryCost}{C} \newcommand{\SetupShareCap}{\phi} \newcommand{\ShadowOnlyFailureCount}{n_{\text{shadow}}} \newcommand{\ShannonEntropy}{H} \newcommand{\ShapedObservationSize}{S_{\text{shaped}}} \newcommand{\ShapedTotalReward}{r_{\text{total}}} \newcommand{\ShapingPotential}{\Phi} \newcommand{\ShardIndex}{s} \newcommand{\ShardReaderCount}{n_{\text{workers}}} \newcommand{\SharedBusBandwidth}{\text{BW}_{\text{bus}}} \newcommand{\SharedHardwareInterferenceDelay}{T_{\text{interf,shared}}} \newcommand{\SharedPoolWorkerCount}{N_{\text{pool}}} \newcommand{\SharedPrefixFraction}{f} \newcommand{\SharedPrefixLength}{S_{\text{prefix}}} \newcommand{\SharedPrefixRequestCount}{n_{\text{req}}} \newcommand{\ShellRelativeThickness}{\epsilon} \newcommand{\ShieldInterceptionCoverage}{c_h} \newcommand{\ShiftedMpcControlSequence}{\tilde{\mathbf{u}}_{0:N_{\text{mpc}}-1}} \newcommand{\ShiftedTestDistribution}{\mathcal{D}'} \newcommand{\ShingleLength}{w} \newcommand{\ShipDecision}{\mathbf{1}_{\text{ship}}} \newcommand{\ShootThroughCurrent}{I_{\text{shoot-through}}} \newcommand{\SiblingPolicyAction}{a'} \newcommand{\SiblingTeamAllocation}{U_{\text{allocated}}} \newcommand{\SightlineRange}{d} \newcommand{\SigmoidFunction}{\sigma} \newcommand{\SignalDimension}{n} \newcommand{\SignalHandoff}{\mathcal{H}} \newcommand{\SignalPropagationDelay}{t_{\text{prop}}} \newcommand{\SignalTrajectory}{s} \newcommand{\SignatureBandCount}{b} \newcommand{\SignificanceCriticalQuantile}{z_{1-\alpha_{\text{sig}}/2}} \newcommand{\SignificanceLevel}{\alpha} \newcommand{\SiliconThermalTimeConstant}{\tau_{\text{th,silicon}}} \newcommand{\SimplexProjection}{\Pi_{\Delta^{K-1}}} \newcommand{\SimulatedPlantDynamics}{f_{\text{sim}}} \newcommand{\SimulatedReturnLevel}{z_{T, \text{sim}}} \newcommand{\SimulatedStateTrajectory}{s_{\text{sim}}} \newcommand{\SimulatedStlRobustness}{\rho_{\text{sim}}} \newcommand{\SimulatedTrajectorySet}{\mathcal{S}_{\text{sim}}} \newcommand{\SimulatedTransportDelay}{T_{d,\text{sim}}} \newcommand{\SimulatedUnbrakedImpactForce}{F_{\text{unbraked,sim}}} \newcommand{\SimulationParameterSet}{\Xi} \newcommand{\SimulationParameterVector}{\boldsymbol{\xi}} \newcommand{\SimulatorStepFunction}{\mathbf{F}} \newcommand{\SingleAgentAcceptanceProbability}{p_{\text{single}}} \newcommand{\SingleDeviceContextLength}{S_{\text{single}}} \newcommand{\SingleDeviceRunTime}{T_1} \newcommand{\SingleJointAccelerationLimit}{\ddot{q}_{i,\max}} \newcommand{\SingleJointInertia}{M} \newcommand{\SingleJointVelocityLimit}{\dot{q}_{i,\max}} \newcommand{\SingleLinkBandwidth}{\text{BW}_{\text{link}}} \newcommand{\SinglePrecisionGemvIntensity}{I_{\text{GEMV, 32-bit}}} \newcommand{\SingleStepImitationError}{\epsilon} \newcommand{\SingularSpectrumMatrix}{\mathbf{\Sigma}} \newcommand{\SisaShardCount}{K} \newcommand{\SisaTrainingShard}{S} \newcommand{\SixthHarmonicTorqueRipple}{\tau_{\text{ripple}}} \newcommand{\SkewDisplacementEnvelope}{d_{\text{skew}}} \newcommand{\SkillSelectionDistribution}{p} \newcommand{\SlaveDriveCount}{S} \newcommand{\SlaveDriveIndex}{s} \newcommand{\SlaveForwardingDelay}{t_{\text{slave},s}} \newcommand{\SlipAccelerationBound}{a_{\text{slip}}} \newcommand{\SlipRegularizationSpeed}{\epsilon_{\text{reg}}} \newcommand{\SloVector}{\mathbf{S}} \newcommand{\SlowdownPersistenceUpdateCount}{K} \newcommand{\SmallChange}{\delta} \newcommand{\SmallPerturbation}{\delta} \newcommand{\SmallestJacobianSingularNumber}{\sigma_{\min}} \newcommand{\SmallestKeySingularNumber}{\sigma_{\min(S, d_{\text{head}})}} \newcommand{\SmoothedClassifier}{g} \newcommand{\SmoothedRunnerUpProbability}{p_{B}} \newcommand{\SmoothedTargetAction}{\tilde{\mathbf{a}}'} \newcommand{\SmoothedTopClassProbability}{p_{A}} \newcommand{\SmoothingNoiseClipBound}{c} \newcommand{\SmoothingNoiseStandardDeviation}{\sigma} \newcommand{\SmoothnessConstant}{L_s} \newcommand{\SnapshotReadTime}{t_{\text{own}}} \newcommand{\SnapshotResetCycleTime}{T_{\text{cycle,snap}}} \newcommand{\SnapshotStepIndex}{s} \newcommand{\SoftExpectedActionReturn}{Q} \newcommand{\SoftExpectedRemainingReturn}{V} \newcommand{\SoftenedStudentProbabilityVector}{\mathbf{p}_{\text{student}}^{(T_{\text{distill}})}} \newcommand{\SoftenedTeacherProbabilityVector}{\mathbf{p}_{\text{teacher}}^{(T_{\text{distill}})}} \newcommand{\SoftmaxFunction}{\sigma} \newcommand{\SoftmaxInputScore}{x} \newcommand{\SoftmaxInputVector}{\mathbf{x}} \newcommand{\SoftmaxNormalizer}{z} \newcommand{\SoftmaxOutputProbability}{p} \newcommand{\SoftmaxRowMaximum}{m} \newcommand{\SoftmaxRowScore}{s} \newcommand{\SoftmaxRunningMaximum}{m} \newcommand{\SoftmaxVectorLength}{n} \newcommand{\SontagStabilizingControl}{\mathbf{u}_{\text{Sontag}}} \newcommand{\SourceCurrent}{I_{\text{source}}} \newcommand{\SourceEventTime}{T_{\text{event}}} \newcommand{\SourceFramePoint}{\mathbf{p}_B} \newcommand{\SourceSinkPathSet}{\Pi} \newcommand{\SourceVoltage}{V_{\text{source}}} \newcommand{\SourceWriteShardGrant}{\Gamma_{c}} \newcommand{\SpareStoppingClearance}{d_{\text{spare}}} \newcommand{\SparseMatrixEntryCount}{n_{\text{elem}}} \newcommand{\SparseMatrixRowCount}{n_{\text{rows}}} \newcommand{\SparseProductInputComponent}{v} \newcommand{\SparseWeightMatrix}{\mathbf{W}_{\text{sparse}}} \newcommand{\SparsityPenaltyWeight}{\lambda_{\text{L1}}} \newcommand{\SparsityRatio}{\rho_{\text{sparse}}} \newcommand{\SpatialClearancePredicate}{P_{\text{clear}}} \newcommand{\SpatialColumnIndex}{j} \newcommand{\SpatialCovarianceEmbedding}{\mathbf{e}_{\Sigma}} \newcommand{\SpatialErrorVector}{\boldsymbol{\epsilon}_{\text{spatial}}} \newcommand{\SpatialHashFunction}{h} \newcommand{\SpatialMemoryMap}{\mathcal{M}} \newcommand{\SpatialPositionCount}{N_{\text{pix}}} \newcommand{\SpatialRowIndex}{i} \newcommand{\SpatialTransformation}{\mathcal{T}} \newcommand{\SpecialEuclideanAlgebra}{\mathfrak{se}(3)} \newcommand{\SpecialEuclideanGroup}{SE(3)} \newcommand{\SpecialOrthogonalGroup}{SO(3)} \newcommand{\SpecializedEnergyProductivity}{\rho_{\text{energy,specific}}} \newcommand{\SpecificHeatCapacity}{c_p} \newcommand{\SpectrallyNormalizedWeightMatrix}{\overline{\mathbf{W}}} \newcommand{\SpeculativeDecodingSpeedup}{S_{\text{spec}}} \newcommand{\SpeculativeDraftLength}{K} \newcommand{\SpeculativeDraftTokenCount}{k} \newcommand{\SpeedAtDetection}{v} \newcommand{\SpeedBound}{v_{\max}} \newcommand{\SpendingWindowDuration}{T_{\text{win}}} \newcommand{\SphereSurfaceArea}{S_{D-1}} \newcommand{\SplineControlPoint}{\mathbf{p}} \newcommand{\SplineDegree}{p} \newcommand{\SplineFinalControlIndex}{L} \newcommand{\SplineKnotTime}{\xi} \newcommand{\SplitAssignmentMap}{s} \newcommand{\SplitMessageCount}{N_{\text{msg}}} \newcommand{\SpotHourlyPrice}{C_{\text{spot}}} \newcommand{\SpringBrakeEngagementTime}{t_{\text{engage}}} \newcommand{\SpringCompressionForce}{F} \newcommand{\SprtExpectedLogIncrement}{m} \newcommand{\SprtLowerBoundary}{\Lambda_{\text{lo}}} \newcommand{\SprtLowerLogBoundary}{b_{\text{low}}} \newcommand{\SprtStoppingSampleCount}{N_{\text{stop}}} \newcommand{\SprtUpperBoundary}{\Lambda_{\text{up}}} \newcommand{\SprtUpperLogBoundary}{u} \newcommand{\SquareGemmDimension}{N} \newcommand{\SquaredGaussianSumQuantile}{\chi} \newcommand{\SquaredPathVelocity}{x} \newcommand{\SquaredRadiusSubstitution}{u} \newcommand{\SquashedActionComponent}{a} \newcommand{\SramCapacity}{M_{\text{SRAM}}} \newcommand{\StabilizationErrorThreshold}{\epsilon_{\text{stable}}} \newcommand{\StabilizationSlewCeiling}{j_{\text{stable}}} \newcommand{\StackedContactForces}{\mathbf{f}_{\text{c}}} \newcommand{\StageConditionalAcceptanceProbability}{q} \newcommand{\StageEpisodeCount}{N_{\text{episodes}}} \newcommand{\StageReachProbability}{r} \newcommand{\StagedDefinitionCount}{n_{\text{def}}} \newcommand{\StagingExhaustionTime}{T_{\text{exhaust}}} \newcommand{\StagingStoreCapacity}{M_{\text{stage}}} \newcommand{\StaleSupportRate}{\epsilon_{\text{stale}}} \newcommand{\StalenessAdjustedLearningRate}{\eta'} \newcommand{\StalenessBound}{s} \newcommand{\StallCounterTorque}{\tau_{\text{stall}}} \newcommand{\StallTravelBound}{d_{\text{F1}}} \newcommand{\StandardDeviationMultiple}{k} \newcommand{\StandardNormalCumulativeDistribution}{\Phi} \newcommand{\StandardNormalQuantile}{z_q} \newcommand{\StandbyInstanceMemory}{M_{\text{standby}}} \newcommand{\StandbyPower}{P_{\text{idle}}} \newcommand{\StandbyReserveCount}{N_{\text{reserve}}} \newcommand{\StandstillSpeedThreshold}{\epsilon_{\text{vel}}} \newcommand{\StateConstraintMatrix}{\mathbf{H}_x} \newcommand{\StateConstraintVector}{\mathbf{b}_x} \newcommand{\StateCotangentSpace}{T_{\mathbf{x}}^*} \newcommand{\StateDimension}{n} \newcommand{\StateDistribution}{d_\pi} \newcommand{\StateEstimate}{\hat{\mathbf{x}}} \newcommand{\StateEstimateDerivative}{\dot{\hat{\mathbf{x}}}} \newcommand{\StateEstimationError}{\mathbf{e}} \newcommand{\StateExposureLevel}{S} \newcommand{\StateNormWeighting}{W} \newcommand{\StateOperation}{f} \newcommand{\StateParameterSensitivity}{\mathbf{S}} \newcommand{\StateRecurrencePeriod}{\ell} \newcommand{\StateScalarFunction}{\phi} \newcommand{\StateSpaceDimension}{d_s} \newcommand{\StateSpaceInputMatrix}{\mathbf{B}} \newcommand{\StateSpaceSystemMatrix}{\mathbf{A}_{\text{sys}}} \newcommand{\StateTokenCount}{K_s} \newcommand{\StateTrackingWeightMatrix}{\mathbf{W}_q} \newcommand{\StateTransitionMatrix}{\mathbf{F}} \newcommand{\StatelessCursorPayload}{d} \newcommand{\StaticBatchingOperations}{O_{\text{traditional}}} \newcommand{\StaticChassisPower}{P_{\text{chassis\_static}}} \newcommand{\StaticDataDistribution}{p_{\text{data}}} \newcommand{\StationaryConditionPolynomial}{P} \newcommand{\StatisticalDivergence}{\mathcal{D}(P_t \| P_0)} \newcommand{\StatisticalFalseNegativeRate}{\beta} \newcommand{\StatisticalHypothesis}{H} \newcommand{\StatisticalPowerQuantile}{z_{1-\beta}} \newcommand{\StatisticalSignificanceLevel}{\alpha_{\text{sig}}} \newcommand{\StatorCoreTemperature}{T_{\text{core}}} \newcommand{\StatorIronTemperature}{T_{\text{iron}}} \newcommand{\StatorThermalCapacitance}{C_{\text{th}}} \newcommand{\StatusPollCount}{N_{\text{poll}}} \newcommand{\SteadyDeceleration}{a} \newcommand{\SteadyStateAvailability}{A} \newcommand{\SteadyStateCurrent}{I_{\text{final}}} \newcommand{\SteadyStateErrorCovariance}{\mathbf{P}_{\text{est}}} \newcommand{\SteadyStateIntegratorState}{\mathbf{z}_{\text{ss}}} \newcommand{\SteadyStateTemperatureRise}{\Delta T_{\max}} \newcommand{\SteadyStateTrackingError}{\mathbf{e}_{\text{ss}}} \newcommand{\SteeringTransferTime}{T} \newcommand{\StepFailureHazard}{a} \newcommand{\StepGenerationCost}{C_{\text{gen}}} \newcommand{\StepGenerationTime}{T_{\text{step}}} \newcommand{\StepIoTime}{T_{\text{IO}}} \newcommand{\StepResponsePhaseLag}{\Delta \phi} \newcommand{\StepSettlingTime}{t_{\text{settle}}} \newcommand{\StepSuccessProbability}{p} \newcommand{\StepTestVoltage}{V_{\text{step}}} \newcommand{\StepTimePenalty}{c_{\text{time}}} \newcommand{\StepTokenLogit}{z_{t,v}} \newcommand{\StereoBaseline}{b} \newcommand{\StereoDisparity}{d} \newcommand{\StlEventuallyDeadline}{\tau} \newcommand{\StlFormula}{\phi} \newcommand{\StlIntervalEnd}{b} \newcommand{\StlIntervalStart}{a} \newcommand{\StlPredicateFunction}{f} \newcommand{\StlRobustness}{\rho} \newcommand{\StlUntilOperator}{\mathcal{U}_{[a, b]}} \newcommand{\StockoutNormalQuantile}{z_{1-\epsilon}} \newcommand{\StockoutProbabilityTarget}{\epsilon} \newcommand{\StopAxisAcceleration}{\ddot{q}_{\text{stop}}} \newcommand{\StopAxisPosition}{q_{\text{stop}}} \newcommand{\StopCompletionInstant}{t_{\text{stop\_end}}} \newcommand{\StopDecisionComputeBound}{T_{\text{compute}}} \newcommand{\StopProgress}{u} \newcommand{\StopSequenceSet}{\mathcal{S}_{\text{stop}}} \newcommand{\StoppingBoundaryClearance}{z} \newcommand{\StoppingCrossoverSpeed}{v^{*}} \newcommand{\StoppingDeadline}{t_{\text{deadline,stop}}} \newcommand{\StoppingDistance}{d_{\text{stop}}} \newcommand{\StoppingDistanceBudget}{d_{\text{budget}}} \newcommand{\StoppingDuration}{T_{\text{stop}}} \newcommand{\StorageAccessFactor}{F_{\text{access}}} \newcommand{\StorageBandwidth}{\text{BW}_{\text{storage}}} \newcommand{\StorageCapacityPrice}{C_{\text{storage/byte-time}}} \newcommand{\StorageEquipmentPower}{P_{\text{storage}}} \newcommand{\StorageFunction}{V} \newcommand{\StorageFunctionDerivative}{\dot{V}} \newcommand{\StorageIngestBandwidth}{\text{BW}_{\text{ingest}}} \newcommand{\StoragePrice}{c_{\text{storage}}} \newcommand{\StorageReadTime}{T_{\text{read}}} \newcommand{\StorageRetentionTime}{T_{\text{months}}} \newcommand{\StorageThroughput}{R_{\text{storage}}} \newcommand{\StoredDataVolume}{D_{\text{vol,store}}} \newcommand{\StoredEmbedding}{\mathbf{z}} \newcommand{\StoredIndexVector}{\mathbf{x}} \newcommand{\StoredSystemState}{s} \newcommand{\StoredTokenVolume}{V} \newcommand{\StragglerStepTime}{T_{\text{step,straggler}}} \newcommand{\StreamAcceptanceProbability}{p} \newcommand{\StreamingEndToEndLatency}{T_{\text{streaming}}} \newcommand{\StrideCheckpointCount}{N} \newcommand{\StrongConfigurationAttemptCost}{c_{\text{big}}} \newcommand{\StrongConfigurationPassProbability}{p_{\text{big}}} \newcommand{\StruckObjectMass}{m_{\text{obj}}} \newcommand{\StructuredSparsityGroupSize}{m_{\text{group}}} \newcommand{\StructuredSparsityNonzeroCount}{n_{\text{keep}}} \newcommand{\StudentProbabilityVector}{\mathbf{p}_{\text{student}}} \newcommand{\StuffBitTime}{t_{\text{stuff},i}} \newcommand{\SubgroupIndex}{g} \newcommand{\SubgroupSampleSize}{n} \newcommand{\SubintervalFailureProbability}{p} \newcommand{\SublevelSetThreshold}{c} \newcommand{\SubsequentArrivalTime}{\tau} \newcommand{\SubsetAllPassIndicator}{I_J^{\text{all}}} \newcommand{\SubsetAnyPassIndicator}{I_J} \newcommand{\SubsetDatasetSize}{D_{\text{subset}}} \newcommand{\SuccessCountIndex}{j} \newcommand{\SuccessLowerConfidenceLimit}{p_{\text{lower}}} \newcommand{\SuccessfulTrialCount}{k} \newcommand{\SuccessorActionVector}{\mathbf{a}'} \newcommand{\SuccessorPlanningState}{s'} \newcommand{\SuffixFoldTime}{T_{\text{fold}}} \newcommand{\SummaryOutputLength}{K_{\text{sum}}} \newcommand{\SummaryTokenEmbedding}{\mathbf{x}_{\text{class}}} \newcommand{\SupervisoryMtbi}{T_{\text{MTBI}}} \newcommand{\SupervisoryTakeoverLatency}{T_{\Sigma}} \newcommand{\SupplyVoltage}{V} \newcommand{\SupportPolygon}{\mathcal{P}_{\text{support}}} \newcommand{\SupportSetSize}{n_{\text{shot}}} \newcommand{\SustainableAttemptRate}{R_{\text{attempt}}} \newcommand{\SustainableCopperLossPower}{P_{\text{loss,ss}}} \newcommand{\SustainableHoldingTorque}{\tau_{\text{hold,max}}} \newcommand{\SustainedComputeRate}{R_{\text{sustained}}} \newcommand{\SustainedDropoutFrameCount}{N_{\text{drop}}} \newcommand{\SustainedMemoryBandwidth}{\text{BW}_{\text{mem}}} \newcommand{\SweepCandidateCostFraction}{f} \newcommand{\SweepCandidateCount}{k} \newcommand{\SwitchBreakdownVoltage}{V_{\text{breakdown}}} \newcommand{\SwitchInputCapacitance}{C_{\text{iss}}} \newcommand{\SwitchOnResistance}{R_{\text{ds(on)}}} \newcommand{\SwitchRadix}{k} \newcommand{\SwitchedCapacitance}{C} \newcommand{\SwitchingActivityFactor}{\alpha} \newcommand{\SwitchingEnergy}{E} \newcommand{\SwitchingTransitionTime}{t_{\text{sw}}} \newcommand{\SymbolicPlanningState}{s} \newcommand{\SymmetricClippingThreshold}{\alpha_{\text{sym}}} \newcommand{\SymmetricMessageOverhead}{o} \newcommand{\SymplecticEulerTransitionMatrix}{\mathbf{A}_{\text{symp}}} \newcommand{\SyncMessageInterval}{\Delta t_{\text{interval}}} \newcommand{\SyncPairingDisplacement}{\Delta \mathbf{x}_{\text{sync}}} \newcommand{\SynchronizationBlackout}{T_{\text{blackout}}} \newcommand{\SynchronizationClearanceMargin}{d_{\text{sync}}} \newcommand{\SynchronizationErrorBound}{\epsilon_{\text{sync}}} \newcommand{\SynchronizationStepIndex}{k} \newcommand{\SynchronizationTime}{T_{\text{sync}}} \newcommand{\SyntheticDataGenerator}{G_{\theta}} \newcommand{\SyntheticDataset}{\mathcal{S}_{\text{synthetic}}} \newcommand{\SystemCallFilterTime}{T_{\text{filter}}} \newcommand{\SystemCallOverheadTime}{T_{\text{syscall}}} \newcommand{\SystemFailureRate}{\lambda_{\text{system}}} \newcommand{\SystemHazardRate}{\lambda_{\text{system}, h}} \newcommand{\SystemInstructionTokenCount}{S_{\text{system}}} \newcommand{\SystemMatrixPowerIndex}{k} \newcommand{\SystemMemoryBandwidth}{\text{BW}_{\text{system}}} \newcommand{\SystemMtbf}{\text{MTBF}_{\text{system}}} \newcommand{\SystemReliability}{R_{\text{system}}} \newcommand{\TableRowCount}{N} \newcommand{\TailByteAllocation}{M_{\text{tail}}} \newcommand{\TailMomentOrder}{k} \newcommand{\TailPerformanceMetric}{X} \newcommand{\TailRequestLatency}{T_{\text{lat},\text{p99}}} \newcommand{\TailRequestSeenBatchSize}{B_{\text{req,p99}}} \newcommand{\TailRiskDistributionFunction}{F} \newcommand{\TailRiskObservation}{X} \newcommand{\TailRiskObservationLevel}{x} \newcommand{\TailShapeParameter}{\xi} \newcommand{\TailStepIoTime}{T_{\text{IO,p99}}} \newcommand{\TailSupportUpperEndpoint}{x_F} \newcommand{\TakeoverInstant}{t_{\text{takeover}}} \newcommand{\TakeoverResponseTime}{T_{\Sigma, 1}} \newcommand{\TakeoverStateVisitationDistribution}{p^{\text{takeover}}} \newcommand{\TakeoverTrackingError}{\mathbf{e}_{\text{track}}} \newcommand{\TangentDirection}{\mathbf{v}} \newcommand{\TangentSeedVector}{\dot{\mathbf{x}}} \newcommand{\TangentialContactShear}{\mathbf{f}_{k, \parallel}} \newcommand{\TangentialSpeed}{v_{\text{tangential}}} \newcommand{\TapeIntermediateResult}{y_{\text{tape}}} \newcommand{\TargetAcceptanceDifference}{\Delta} \newcommand{\TargetActionReturnEstimate}{\hat{Q}} \newcommand{\TargetActorParameters}{\theta'} \newcommand{\TargetBatchSize}{B_{\text{target}}} \newcommand{\TargetCompletionQuantile}{q} \newcommand{\TargetComputeRate}{R_{\text{ops}}} \newcommand{\TargetComputeTimeFraction}{\eta_{\text{target}}} \newcommand{\TargetCriticParameters}{\phi'} \newcommand{\TargetCriticReturnEstimate}{Q_{\phi'}} \newcommand{\TargetDeterministicPolicy}{\mu_{\theta'}} \newcommand{\TargetError}{\epsilon} \newcommand{\TargetExceedanceProbability}{\epsilon} \newcommand{\TargetFairShare}{F_{\text{target}}} \newcommand{\TargetFramePoint}{\mathbf{p}_A} \newcommand{\TargetHazardRate}{\lambda_{\text{target}}} \newcommand{\TargetImpedanceDampingMatrix}{\mathbf{D}_d} \newcommand{\TargetImpedanceInertiaMatrix}{\mathbf{M}_d} \newcommand{\TargetImpedanceStiffnessMatrix}{\mathbf{K}_d} \newcommand{\TargetInferenceLatency}{L_{\text{lat,target}}} \newcommand{\TargetKeyAttentionWeight}{\alpha_{\text{target}}} \newcommand{\TargetKeyLogit}{z_{\text{target}}} \newcommand{\TargetModelDistribution}{p_{\theta}} \newcommand{\TargetOrientation}{\mathbf{R}_{\text{target}}} \newcommand{\TargetPlantState}{\mathbf{x}_{f}} \newcommand{\TargetPolicyEntropy}{\overline{\mathcal{H}}} \newcommand{\TargetPose}{\mathbf{T}_{\text{target}}} \newcommand{\TargetPosition}{\mathbf{p}_{\text{target}}} \newcommand{\TargetPositionComponent}{p_{\text{target},i}} \newcommand{\TargetRange}{z} \newcommand{\TargetRepeatedRunConsistency}{p_{\text{target}}} \newcommand{\TargetSamplingDistribution}{p} \newcommand{\TargetServingUtilization}{\rho_{\text{target}}} \newcommand{\TargetSmoothingNoise}{\boldsymbol{\epsilon}} \newcommand{\TargetSmoothingNoiseStandardDeviation}{\sigma} \newcommand{\TargetTokenVolume}{W} \newcommand{\TargetTravelDistance}{d} \newcommand{\TargetTrialFailureProbability}{p_{*}} \newcommand{\TargetTrialSuccessProbability}{p_{\text{target}}} \newcommand{\TargetTwinCriticReturnEstimate}{Q_{\phi'_i}} \newcommand{\TargetUnitQuaternion}{\mathbf{q}_{\text{quat,target}}} \newcommand{\TargetUpdateCount}{K_{\text{target}}} \newcommand{\TargetUtilizationBatchSize}{B_{\text{util}}} \newcommand{\TargetXPosition}{x} \newcommand{\TargetYPosition}{p_y} \newcommand{\TargetZPosition}{z} \newcommand{\TaskAcceptanceLabel}{x} \newcommand{\TaskBlockingTime}{B} \newcommand{\TaskContract}{\mathcal{C}} \newcommand{\TaskContractGoal}{G} \newcommand{\TaskCost}{C_{\text{task}}} \newcommand{\TaskCount}{K} \newcommand{\TaskCoverageProbability}{Q} \newcommand{\TaskCriticalSections}{cs} \newcommand{\TaskDerivativeGain}{\mathbf{K}_{d,i}} \newcommand{\TaskDistance}{d_{\text{task}}} \newcommand{\TaskEnvironment}{\mathcal{E}_{\text{env}}} \newcommand{\TaskErrorTolerance}{\tau_{\text{tol}}} \newcommand{\TaskGroupMap}{g} \newcommand{\TaskIndex}{i} \newcommand{\TaskInterferenceTime}{I} \newcommand{\TaskJacobian}{\mathbf{J}} \newcommand{\TaskJacobianDerivative}{\dot{\mathbf{J}}} \newcommand{\TaskJacobianPseudoinverse}{\mathbf{J}^\dagger} \newcommand{\TaskKinematicMap}{f} \newcommand{\TaskLoss}{\mathcal{L}_{\text{task}}} \newcommand{\TaskLossGradient}{\nabla \mathcal{L}} \newcommand{\TaskPeriod}{T} \newcommand{\TaskProportionalGain}{\mathbf{K}_{p,i}} \newcommand{\TaskReadCount}{n_{\text{read}}} \newcommand{\TaskRelativeDeadline}{D} \newcommand{\TaskRelevantOutcome}{\mathbf{Y}_{\text{task}}} \newcommand{\TaskReward}{r_{\text{task}}} \newcommand{\TaskSetUtilization}{U} \newcommand{\TaskSpaceAcceleration}{\ddot{\mathbf{x}}} \newcommand{\TaskSpaceCoordinates}{\mathbf{x}} \newcommand{\TaskSpaceDimension}{m} \newcommand{\TaskSpaceReference}{\mathbf{x}_i^{\text{ref}}} \newcommand{\TaskSpaceReferenceAcceleration}{\ddot{\mathbf{x}}^{\text{ref}}} \newcommand{\TaskSpaceReferenceVelocity}{\dot{\mathbf{x}}^{\text{ref}}} \newcommand{\TaskSpaceVelocity}{\dot{\mathbf{x}}} \newcommand{\TaskSpecificLoss}{\mathcal{L}} \newcommand{\TaskStateTokenCount}{S_{\text{state}}} \newcommand{\TaskToleranceSemiAxes}{\mathbf{r}} \newcommand{\TaskToleranceSemiAxis}{r} \newcommand{\TaskTurnCost}{C_{\text{call}}} \newcommand{\TaskWeight}{w} \newcommand{\TasksPerComparisonArm}{N_{\text{arm}}} \newcommand{\TeacherProbabilityVector}{\mathbf{p}_{\text{teacher}}} \newcommand{\TeamQuotaCap}{Q_{\text{team}}} \newcommand{\TelemetryFlushTime}{t_{\text{telemetry\_flush}}} \newcommand{\TelemetryFreshnessBound}{\Delta t_{\text{fresh}}} \newcommand{\TelemetryRetentionDuration}{T_{\text{retention}}} \newcommand{\TelemetrySamplingFrequency}{f_{\text{sample}}} \newcommand{\TelemetrySeriesCount}{N_{\text{series}}} \newcommand{\TelemetryTickInterval}{\Delta t_s} \newcommand{\TeleoperationCommandLatency}{t_{\text{cmd}}} \newcommand{\TeleoperationDownlinkTime}{T_{\text{downlink}}} \newcommand{\TeleoperationRoundTripLatency}{t_{\text{loop}}} \newcommand{\TeleoperationRoundTripTime}{T_{\text{RTT}}} \newcommand{\TeleoperationStateVisitationDistribution}{p^{\pi_{\text{teleop}}}} \newcommand{\TeleoperationUplinkTime}{T_{\text{uplink}}} \newcommand{\TeleoperationVideoLatency}{T_{\text{video}}} \newcommand{\TemperatureDualObjective}{\mathcal{L}} \newcommand{\TemperatureStepSize}{\lambda_{\alpha}} \newcommand{\TemplateSharedMemory}{M_{\text{template}}} \newcommand{\TemporalDifferenceResidual}{\delta} \newcommand{\TemporalEnsemblingWeight}{w_i} \newcommand{\TenantIndex}{i} \newcommand{\TenantResourceAllocation}{a_{i,r}} \newcommand{\TensorAxisCount}{n} \newcommand{\TensorColumnModeSize}{J} \newcommand{\TensorCoreAccumulatorMatrix}{\mathbf{C}_{\text{acc}}} \newcommand{\TensorCoreLeftInput}{\mathbf{A}_{\text{tc}}} \newcommand{\TensorCoreOutputMatrix}{\mathbf{D}_{\text{tc}}} \newcommand{\TensorCoreRightInput}{\mathbf{B}_{\text{tc}}} \newcommand{\TensorDepthModeSize}{T} \newcommand{\TensorElementCount}{N} \newcommand{\TensorModeIndex}{n_{\text{mode}}} \newcommand{\TensorParallelDegree}{N_{\text{TP}}} \newcommand{\TensorParallelLayerTime}{T_{\text{inference}}} \newcommand{\TensorRowModeSize}{I} \newcommand{\TerminalFeedbackGain}{\mathbf{K}_f} \newcommand{\TerminalInvariantSet}{\mathcal{X}_{f}} \newcommand{\TerminalPlantState}{\mathbf{x}_N} \newcommand{\TerminalTransitTime}{t_{\text{transit}}} \newcommand{\TerminalVoltageLimit}{V_{\max}} \newcommand{\TerminationProtocol}{\kappa} \newcommand{\TestExample}{z_{\text{test}}} \newcommand{\TestFamilySize}{k} \newcommand{\TestPhaseCapabilityGrant}{\Gamma_{\text{test}}} \newcommand{\TestsDirectoryShardGrant}{\Gamma_{a}} \newcommand{\TextTokenCount}{S_{\text{text}}} \newcommand{\TextTokenEmbeddings}{\mathbf{z}_{\text{text}}} \newcommand{\ThermalExpansionCoefficient}{\alpha} \newcommand{\ThermalPenaltyWeight}{\lambda_T} \newcommand{\ThermalPowerLimit}{P_{\text{thermal}}} \newcommand{\ThermalResistance}{R_{\text{th}}} \newcommand{\ThermalTimeConstant}{\tau_{\text{th}}} \newcommand{\ThirdAtomicGradientUpdate}{C} \newcommand{\ThirdFloatingPointAddend}{c} \newcommand{\ThirdRingTraceElement}{c} \newcommand{\ThresholdExceedanceCount}{N_u} \newcommand{\ThresholdExceedanceRate}{\zeta_u} \newcommand{\ThresholdExcess}{y} \newcommand{\ThresholdExcessVariable}{Y} \newcommand{\ThresholdedSparsityRatio}{\rho_{\text{sparse},\delta}} \newcommand{\ThrottleClearTemperature}{T_{\text{clear}}} \newcommand{\ThrottleOnsetJunctionTemperature}{T_{\text{j},\text{start}}} \newcommand{\ThrottleRecoveryTime}{t_{\text{recov}}} \newcommand{\ThrottleTripTemperature}{T_{\text{trip}}} \newcommand{\ThrottledClockFrequency}{f_{\text{throt}}} \newcommand{\TickCycleCount}{N} \newcommand{\TickIndex}{n} \newcommand{\TickPeriodJitterBound}{J_{\text{phase}}} \newcommand{\TieredRequestServiceTime}{T} \newcommand{\TightenedDiscreteSafeSet}{\mathcal{C}_{\text{discrete}}} \newcommand{\TileRowIndex}{m} \newcommand{\TiltAngle}{\theta_{\text{tilt}}} \newcommand{\Time}{T} \newcommand{\TimeBudgetUsedFraction}{\rho_T} \newcommand{\TimeInstant}{t} \newcommand{\TimeScaleSeparationRatio}{\epsilon} \newcommand{\TimeStepIndex}{t} \newcommand{\TimeToResult}{T_{\text{result}}} \newcommand{\TimeToTarget}{T_{\text{target}}} \newcommand{\TimeoutSafetyMultiplier}{k} \newcommand{\TimeoutTrialCount}{n_{\text{timeout}}} \newcommand{\TimerClockPeriod}{T_{\text{timer\_clk}}} \newcommand{\TimestampJitterDelay}{\delta_{\text{jitter}}} \newcommand{\TimestampQuantizationBound}{T_{\text{quant}}} \newcommand{\TimestampSkew}{t_{\text{skew}}} \newcommand{\TimingJitter}{\sigma_{\text{jitter}}} \newcommand{\TimingRealityGap}{\Delta_{\text{lat}}} \newcommand{\TokenAuthenticationCode}{\sigma} \newcommand{\TokenAveragedBatchLoss}{\mathcal{L}_{\text{token}}} \newcommand{\TokenBucketDepth}{b} \newcommand{\TokenBucketRefillRate}{r} \newcommand{\TokenBudgetUsedFraction}{\rho_N} \newcommand{\TokenByteDecoding}{s} \newcommand{\TokenCaveat}{c} \newcommand{\TokenDispatchTime}{T_{\text{dispatch}}} \newcommand{\TokenIdentifierSize}{s_{\text{id}}} \newcommand{\TokenIndex}{t} \newcommand{\TokenPrefix}{x_{<t}} \newcommand{\TokenVocabulary}{\mathcal{V}} \newcommand{\TokenizationTime}{T_{\text{tokenize}}} \newcommand{\ToleranceEllipsoidMatrix}{\mathbf{E}} \newcommand{\ToleratedFailureProbability}{\epsilon} \newcommand{\ToleratedPositionError}{\epsilon_{\text{pos}}} \newcommand{\TombstonedNodeSet}{V_{\text{tomb}}} \newcommand{\TombstonedRecordFraction}{\rho_{\text{dead}}} \newcommand{\ToolArgumentKey}{p} \newcommand{\ToolCallCategory}{y} \newcommand{\ToolCallCost}{c_{\text{tool}}} \newcommand{\ToolCallIndex}{i} \newcommand{\ToolCallReadSet}{R} \newcommand{\ToolCallWriteSet}{W} \newcommand{\ToolCartesianPose}{\mathbf{x}} \newcommand{\ToolCartesianVelocity}{\dot{\mathbf{x}}} \newcommand{\ToolCenterPointAxis}{\hat{\mathbf{z}}_{\text{TCP}}} \newcommand{\ToolCenterPointFrame}{\mathcal{F}_{\text{TCP}}} \newcommand{\ToolCenterPointPose}{\mathbf{T}_{\text{TCP}}} \newcommand{\ToolCenterPointPosition}{\mathbf{p}_{\text{TCP}}} \newcommand{\ToolClearanceDistance}{d_{\text{tool}}} \newcommand{\ToolDeclarationTokenCount}{S_{\text{tools}}} \newcommand{\ToolDescriptorSize}{S_{\text{desc}}} \newcommand{\ToolPlanarAbscissa}{x} \newcommand{\ToolPlanarOrdinate}{y} \newcommand{\ToolPositionError}{e_{\text{tool}}} \newcommand{\ToolServiceCount}{N_{\text{tool}}} \newcommand{\ToolSpeedLimit}{v_{\text{TCP}}} \newcommand{\ToolTargetState}{s} \newcommand{\ToolTime}{T_{\text{tool}}} \newcommand{\ToolTipPose}{\mathbf{T}_{\text{tool}}} \newcommand{\TopClassCount}{k} \newcommand{\TopMagnitudeIndicator}{\mathbf{1}_{|\mathbf{g}| \geq |\mathbf{g}|_{(K_{\text{top}})}}} \newcommand{\TopTokenSampleCount}{k} \newcommand{\TopologicalPlaceNode}{p^{\text{place}}} \newcommand{\TopologyEndpointCount}{N} \newcommand{\TorqueCutoffCommand}{\mathbf{u}_{\text{cutoff}}} \newcommand{\TorqueEffortPenaltyWeight}{\lambda_{\tau}} \newcommand{\TorqueProducingCurrent}{i_q} \newcommand{\TorqueRateLimit}{\dot{\tau}_{\max}} \newcommand{\TorqueRegularizationWeight}{w_\tau} \newcommand{\TorqueSlewPenaltyWeight}{\lambda_{\dot{\tau}}} \newcommand{\TorusFirstAxisChipCount}{X} \newcommand{\TorusSecondAxisChipCount}{Y} \newcommand{\TorusThirdAxisChipCount}{Z} \newcommand{\TotalChipPower}{P_{\text{total}}} \newcommand{\TotalCollisionQueryTime}{T_{\text{query\_total}}} \newcommand{\TotalDataCost}{C_{\text{total}}} \newcommand{\TotalDelayPhaseShift}{\phi_{\text{total}}} \newcommand{\TotalEnergy}{E_{\text{total}}} \newcommand{\TotalExecutedTrialCount}{N_{\text{total}}} \newcommand{\TotalFailureRecoveryTime}{T_{\text{recovery}}} \newcommand{\TotalGateCharge}{Q_g} \newcommand{\TotalInterventionCount}{N_{\text{int}}} \newcommand{\TotalKineticEnergy}{E_{k,\text{total}}} \newcommand{\TotalMemoryFootprint}{M_{\text{total}}} \newcommand{\TotalPipelineLatency}{L_{\text{lat,total}}} \newcommand{\TotalTrainingRunCost}{C_{\text{total}}} \newcommand{\TraceCrashCount}{N_{\text{crash}}} \newcommand{\TraceCrashIndex}{i} \newcommand{\TraceDecay}{\lambda} \newcommand{\TraceIntermediateAdjoint}{\bar{v}} \newcommand{\TraceIntermediateTangent}{\dot{v}} \newcommand{\TraceIntermediateVariable}{v} \newcommand{\TrackIndex}{i} \newcommand{\TrackLastUpdateTime}{t_{\text{last}}} \newcommand{\TrackLossTimeout}{T_{\text{lost}}} \newcommand{\TrackPositionDeviation}{\sigma_{\text{track}}} \newcommand{\TrackPredictedErrorCovariance}{\mathbf{P}_{t|t-1}} \newcommand{\TrackPredictedStateEstimate}{\hat{\mathbf{x}}_{t|t-1}} \newcommand{\TrackedEvidenceHorizon}{\tau_{\text{ev,tracked}}} \newcommand{\TrackerFrameIndex}{t} \newcommand{\TrackingErrorAcceleration}{\ddot{\mathbf{e}}} \newcommand{\TrackingErrorAllowance}{\epsilon_{\text{pos}}} \newcommand{\TrackingErrorBound}{\epsilon_{\text{track}}} \newcommand{\TrackingErrorDistance}{e} \newcommand{\TrackingErrorRate}{\dot{\mathbf{e}}} \newcommand{\TrackingErrorVector}{\mathbf{e}} \newcommand{\TrackingRelaxationSlack}{\delta} \newcommand{\TrackingSlackPenaltyWeight}{p} \newcommand{\TrackingStartInstant}{t_{\text{start}}} \newcommand{\TractionLimitedDeceleration}{a} \newcommand{\TractiveForce}{F_x} \newcommand{\TrainableStateMemory}{M_{\text{train}}} \newcommand{\TrainerUpdateTime}{T_{\text{train}}} \newcommand{\TrainingCompute}{O_{\text{train}}} \newcommand{\TrainingCost}{C_{\text{train}}} \newcommand{\TrainingDataset}{D} \newcommand{\TrainingDistribution}{P_0} \newcommand{\TrainingEmpiricalCdf}{F_{P_0}} \newcommand{\TrainingExample}{z} \newcommand{\TrainingFailureCount}{N_{\text{failures}}} \newcommand{\TrainingFeatureMean}{\mu} \newcommand{\TrainingFeatureStandardDeviation}{\sigma} \newcommand{\TrainingLabelMask}{\mathcal{M}_{\text{train}}} \newcommand{\TrainingLoss}{\mathcal{L}_{\text{train}}} \newcommand{\TrainingPathPredictor}{f_{\text{train}}} \newcommand{\TrainingPipelineFunction}{f} \newcommand{\TrainingRunCount}{N_{\text{runs}}} \newcommand{\TrainingSampleThroughput}{R_{\text{train}}} \newcommand{\TrainingSchemaKeySet}{\mathcal{K}_{\text{train}}} \newcommand{\TrainingServingSkew}{S_{\text{skew}}} \newcommand{\TrainingSplitFraction}{f_{\text{train}}} \newcommand{\TrainingStepCount}{K} \newcommand{\TrainingStepEnergy}{E_{\text{step}}} \newcommand{\TrainingStepOperations}{O_{\text{step}}} \newcommand{\TrainingStepTime}{T_{\text{step}}} \newcommand{\TrainingThroughput}{R_{\text{training}}} \newcommand{\TrainingTime}{T_{\text{train}}} \newcommand{\TrainingTransformFunction}{f_{\text{train}}} \newcommand{\Trajectory}{\tau} \newcommand{\TrajectoryAction}{a} \newcommand{\TrajectoryAdmissionRate}{\lambda_{\text{traj}}} \newcommand{\TrajectoryBudget}{\mathbf{B}} \newcommand{\TrajectoryCallCount}{N_{\text{call}}} \newcommand{\TrajectoryCategoryIndex}{j} \newcommand{\TrajectoryCheckpointCount}{N_{\text{ckpt}}} \newcommand{\TrajectoryDivergenceResidual}{e_{\text{div}}} \newcommand{\TrajectoryDuration}{T_{\text{traj}}} \newcommand{\TrajectoryGoodput}{\mathcal{G}} \newcommand{\TrajectoryObservation}{o} \newcommand{\TrajectoryOptimizationObjective}{\mathcal{U}} \newcommand{\TrajectoryRecordDuration}{T_{\text{record}}} \newcommand{\TrajectoryRecordFrame}{\mathcal{F}} \newcommand{\TrajectoryReturn}{R} \newcommand{\TrajectoryReward}{R} \newcommand{\TrajectorySampleCount}{N} \newcommand{\TrajectoryState}{s} \newcommand{\TrajectoryStateSpace}{\mathcal{S}} \newcommand{\TrajectoryTimeLimit}{T_{\max}} \newcommand{\TrajectoryTokenCost}{C_{\text{session}}} \newcommand{\TrajectoryTokenLimit}{N_{\max}} \newcommand{\TrajectoryTurnLimit}{H_{\max}} \newcommand{\TransceiverDelay}{t_{\text{transceiver}}} \newcommand{\TransductionInstant}{t_{\text{transduction}}} \newcommand{\TransferBufferCount}{N_{\text{transfer}}} \newcommand{\TransferDiscrepancyBound}{\epsilon_{\text{gap}}} \newcommand{\TransferTimeForPayload}{T_{\text{transfer}}} \newcommand{\TransferredDataVolume}{D_{\text{vol,transfer}}} \newcommand{\TransformGraph}{\mathcal{G}} \newcommand{\TransformGraphEdgeSet}{\mathcal{E}} \newcommand{\TransformGraphFrame}{\mathcal{F}} \newcommand{\TransformGraphVertexSet}{\mathcal{V}} \newcommand{\TransformRotationBlock}{\mathbf{R}_{AB}} \newcommand{\TransformTranslationBlock}{\mathbf{t}_{AB}} \newcommand{\TransformationInputCount}{k} \newcommand{\TransformedCartesianPosition}{\mathbf{p}'} \newcommand{\TransformedHomogeneousPointCoordinates}{\tilde{\mathbf{p}}'} \newcommand{\TransistorThresholdVoltage}{V_{\text{th}}} \newcommand{\TransitionStorageSize}{b_{\text{tr}}} \newcommand{\TranslationComponent}{v} \newcommand{\TranslationVector}{\mathbf{v}} \newcommand{\TranslationalDriftError}{e_{\text{trans}}} \newcommand{\TranslationalJerk}{j} \newcommand{\TranslationalKineticEnergy}{E_{k,\text{trans}}} \newcommand{\TransmissionEnergyPerByte}{E_{\text{tx}}} \newcommand{\TransmissionInputInertia}{J_{\text{in}}} \newcommand{\TransmissionTorsionalStiffness}{K_{\text{joint}}} \newcommand{\TransverseStandardDeviation}{\sigma_\perp} \newcommand{\TravelPosition}{x} \newcommand{\TraverseDistance}{d} \newcommand{\TreatedNeighborFraction}{e} \newcommand{\TreatmentAssignment}{w} \newcommand{\TreatmentConversionRate}{\hat{p}_B} \newcommand{\TreatmentSampleSize}{m_B} \newcommand{\TreeAllReduceCompletionTime}{T_{\text{tree}}} \newcommand{\TreeLikeAllReduceTime}{T_{\text{tree-like}}} \newcommand{\TreeSearchExplorationWeight}{c_{\text{explore}}} \newcommand{\TreeSearchLeafScore}{V} \newcommand{\TreeSearchMeanReturn}{Q} \newcommand{\TreeSearchPriorDistribution}{p_{\text{prior}}} \newcommand{\TreeSearchVisitCount}{N_{\text{visit}}} \newcommand{\TrialCampaignWallTime}{T_{\text{wall}}} \newcommand{\TrialCompletionIndicator}{Y} \newcommand{\TrialCondition}{c} \newcommand{\TrialControlStepCount}{N_{\text{steps}, i}} \newcommand{\TrialCount}{N} \newcommand{\TrialFailureIndicator}{x} \newcommand{\TrialFailureProbability}{p_{\text{fail}}} \newcommand{\TrialIndex}{n} \newcommand{\TrialInterventionCount}{n_{\text{int}}} \newcommand{\TrialLoadReversalCount}{n_{\text{rev}}} \newcommand{\TrialPassProbability}{p_{\text{trial}}} \newcommand{\TrialPathDistance}{d} \newcommand{\TrialResetLatency}{T_{\text{reset}}} \newcommand{\TrialResetTime}{t_{\text{reset}}} \newcommand{\TrialRolloutTime}{t_{\text{rollout}}} \newcommand{\TrialRunTime}{t_{\text{run}}} \newcommand{\TrialSuccessProbability}{p} \newcommand{\TriggeredWindowArrivalCount}{Q_{\text{arr}}} \newcommand{\TrueClearance}{C_{\text{true}}} \newcommand{\TrueLabelComponent}{y} \newcommand{\TrueOutcome}{Y} \newcommand{\TrueOutcomeLevel}{v} \newcommand{\TrueReferentScore}{c_{y_j}} \newcommand{\TruncatedDistanceSample}{d_{\mu}} \newcommand{\TruncatedKeyApproximation}{\hat{\mathbf{K}}_r} \newcommand{\TruncatedKeyLeftSingularMatrix}{\mathbf{U}_r} \newcommand{\TruncatedKeyRightSingularMatrix}{\mathbf{V}_r} \newcommand{\TruncatedKeySpectrumMatrix}{\mathbf{\Sigma}_r} \newcommand{\TruncationBandVolume}{V_{\text{band}}} \newcommand{\TruncationRank}{r} \newcommand{\TruthInstrumentSet}{\mathcal{I}_{\text{truth}}} \newcommand{\TsdfAccumulatedDistance}{D} \newcommand{\TsdfAccumulatedWeight}{W} \newcommand{\TsdfObservationWeight}{w} \newcommand{\TsdfTruncationBand}{\mu_{\text{tsdf}}} \newcommand{\TsdfWeightCap}{W_{\max}} \newcommand{\TuckerCoreTensor}{\mathcal{G}} \newcommand{\TurnAppendLength}{\Delta S_{\text{turn}}} \newcommand{\TurnBoundaryDelay}{t_{\text{boundary}}} \newcommand{\TurnBudgetUsedFraction}{\rho_H} \newcommand{\TurnContext}{c} \newcommand{\TurnContributionDeviationBound}{\sigma} \newcommand{\TurnCovarianceBoundScale}{C} \newcommand{\TurnCovarianceDecayRatio}{\alpha_{\text{corr}}} \newcommand{\TurnFailureRate}{\lambda_{\text{fail}}} \newcommand{\TurnGeneratedTokenCount}{n_{\text{gen}}} \newcommand{\TurnHorizon}{H} \newcommand{\TurnIndex}{t} \newcommand{\TurnInputTokenCost}{C_{\text{in}}} \newcommand{\TurnOffGateCurrent}{I_{g,\text{off}}} \newcommand{\TurnOffGateResistance}{R_{g,\text{off}}} \newcommand{\TurnOnGateResistance}{R_{g,\text{on}}} \newcommand{\TurnOutputTokenCost}{C_{\text{out}}} \newcommand{\TurnPayloadProbability}{q_{\text{turn}}} \newcommand{\TurnReadCount}{r} \newcommand{\TurnReconstructionTime}{T_{\text{recon}}} \newcommand{\TurnReexecutionTime}{T_{\text{exec}}} \newcommand{\TurnReward}{r} \newcommand{\TurnSandboxCost}{C_{\text{sandbox}}} \newcommand{\TurnStateGrowth}{s_{\text{turn}}} \newcommand{\TurnToolFeeCost}{C_{\text{tools}}} \newcommand{\TustinEigenvalue}{\lambda_{\text{Tustin}}} \newcommand{\TustinTransitionMatrix}{\mathbf{A}_{\text{Tustin}}} \newcommand{\TwinCriticReturnEstimate}{Q_{\phi_i}} \newcommand{\TwistCoordinates}{\boldsymbol{\xi}} \newcommand{\TwistCovarianceMatrix}{\boldsymbol{\Sigma}_{\boldsymbol{\xi}}} \newcommand{\TwistMatrix}{\hat{\boldsymbol{\xi}}} \newcommand{\TwistRotationAngle}{\theta_{\text{rot}}} \newcommand{\TwistRotationCoordinates}{\boldsymbol{\omega}} \newcommand{\TwistTranslationMatrix}{\mathbf{V}} \newcommand{\TwistWedgeOperator}{\wedge} \newcommand{\UnacceptedTaskMeanCost}{C_{\text{fail}}} \newcommand{\UnassistedCompletionCount}{N_{\text{unassisted}}} \newcommand{\UnassistedSuccessIndicator}{A} \newcommand{\UnbiasedAngularBrakingDeceleration}{\alpha_{\text{nom}}} \newcommand{\UnbrakedImpactForce}{F_{\text{unbraked}}} \newcommand{\UncachedInputTokenCount}{n_{\text{in}}} \newcommand{\UncachedPromptLength}{S_{\text{new}}} \newcommand{\UncertainScenarioParameters}{x} \newcommand{\UnconstrainedCallLatency}{T_{\text{free}}} \newcommand{\UnconstrainedParseFailureRate}{p_{\text{err}}} \newcommand{\UndampedNaturalFrequency}{\omega_n} \newcommand{\UnfoldedConvolutionOutput}{\mathbf{Y}_{\text{col}}} \newcommand{\UnfoldedPatchMatrix}{\mathbf{X}_{\text{col}}} \newcommand{\UniformDistribution}{\mathcal{U}} \newcommand{\UniformLoopTurnCost}{C_{\text{turn}}} \newcommand{\UnitAliasMultiplier}{k} \newcommand{\UnitImpulseFunction}{\delta} \newcommand{\UnitQuaternion}{\mathbf{q}_{\text{quat}}} \newcommand{\UnitQuaternionScalarComponent}{q_w} \newcommand{\UnitQuaternionSphere}{S^3} \newcommand{\UnitQuaternionXComponent}{q_x} \newcommand{\UnitQuaternionYComponent}{q_y} \newcommand{\UnitQuaternionZComponent}{q_z} \newcommand{\UnitTemperatureProbabilityVector}{\mathbf{p}_{\tau_{\text{temp}}=1}} \newcommand{\UnlabeledPool}{U} \newcommand{\UnloadedTickExecutionTime}{t_{\text{unloaded}}} \newcommand{\UnmitigatedHardwareFaultRate}{\lambda_{\text{unmitigated}}} \newcommand{\UnmodeledCommandPathDelay}{\Delta t_{\text{bus}}} \newcommand{\UnobservableForceOffset}{\Delta} \newcommand{\UnobservedUnknownSpace}{\mathcal{M}_{\text{unknown}}} \newcommand{\UnprojectionJacobian}{\mathbf{J}_{\text{unproj}}} \newcommand{\UnrecoverableDamageCost}{C_{\text{blast}}} \newcommand{\UnreservedStopDelay}{\delta} \newcommand{\UnscaledAttentionScoreMatrix}{\mathbf{A}} \newcommand{\UnshardedLocalExecutionTime}{T_{\text{compute}}} \newcommand{\UnsquashedLatentAction}{\mathbf{u}} \newcommand{\UntilPrefixTime}{t''} \newcommand{\UntrackedEvidenceHorizon}{\tau_{\text{ev,untracked}}} \newcommand{\UpdatedErrorCovariance}{\mathbf{P}_{k|k}} \newcommand{\UpdatedModelParameters}{\theta_{\text{new}}} \newcommand{\UpdatedParameterSubset}{\theta_{\text{updated}}} \newcommand{\UpdatedSoftmaxRunningMaximum}{m'} \newcommand{\UpdatedStateEstimate}{\hat{\mathbf{x}}_{k|k}} \newcommand{\UpperRatioClippingWidth}{\epsilon_{\text{high}}} \newcommand{\UprightPosition}{\mathbf{p}_{\text{upright}}} \newcommand{\UprightRange}{r} \newcommand{\UpstreamGradientElement}{\bar{y}} \newcommand{\UpstreamGradientVector}{\mathbf{v}} \newcommand{\UpstreamStageLatency}{X} \newcommand{\UsableDemonstrationYield}{Y_{\text{usable}}} \newcommand{\UsefulAcceleratorHourCost}{C_{\text{useful}}} \newcommand{\UsefulComputeFraction}{f_{\text{compute}}} \newcommand{\UsefulModelFlops}{O_{\text{useful}}} \newcommand{\UsefulStepCount}{N} \newcommand{\UsefulTrainingTime}{T_{\text{useful}}} \newcommand{\UserConnectionSet}{\mathcal{N}} \newcommand{\UserSpaceSetupTime}{T_{\text{user}}} \newcommand{\UvloThresholdVoltage}{V_{\text{UVLO}}} \newcommand{\VacuumLightSpeed}{c} \newcommand{\ValidCandidateRate}{p_{\text{valid}}} \newcommand{\ValidTokenSet}{\mathcal{V}_{\text{valid}}} \newcommand{\ValidatedMotionDuration}{T_{\text{yield}}} \newcommand{\ValidatedProposalEvent}{e_{\text{prop}}} \newcommand{\ValidationDataset}{\mathcal{D}_{\text{val}}} \newcommand{\ValidationGateThreshold}{\gamma_{\text{gate}}} \newcommand{\ValidationLoss}{\mathcal{L}_{\text{val}}} \newcommand{\VanishingTimeOffset}{\epsilon} \newcommand{\VariationalDistribution}{q_\phi} \newcommand{\VariationalParameters}{\phi} \newcommand{\VectorAngle}{\phi} \newcommand{\VectorElementCount}{N_{\text{vec}}} \newcommand{\Velocity}{\mathbf{v}} \newcommand{\VelocitySaturationExponent}{\alpha} \newcommand{\VerificationCheckCost}{C_{\text{ver}}} \newcommand{\VerificationCheckCount}{K} \newcommand{\VerificationPoolCapacity}{\mu_{\text{verify}}} \newcommand{\VerificationScheduleCost}{C} \newcommand{\VerificationTrialCount}{n_{\text{trial}}} \newcommand{\VerificationTrialIndex}{j} \newcommand{\VerificationTrialTime}{T_{\text{trial}}} \newcommand{\VerifiedDemonstrationDataset}{\mathcal{D}_{\text{verified}}} \newcommand{\VerifierFalseAcceptanceRate}{\epsilon_{\text{FA}}} \newcommand{\VerifierFalseRejectionRate}{\epsilon_{\text{FR}}} \newcommand{\VerifierPassProbability}{q} \newcommand{\VerifierPrecision}{\Pi_{V}} \newcommand{\VerifierTimeout}{T_{\text{out}}} \newcommand{\VerifierTrueAcceptanceRate}{u} \newcommand{\VerifierVerdict}{V} \newcommand{\VersionSkewBound}{k_{\text{skew}}} \newcommand{\VertexSlotTime}{d} \newcommand{\VerticalFocalLength}{f_y} \newcommand{\VibrationFrequency}{f_{\text{vib}}} \newcommand{\VirtualAccelerationCommand}{\ddot{\mathbf{q}}^*} \newcommand{\VirtualDampingMatrix}{\mathbf{D}_{\text{virt}}} \newcommand{\VirtualPipelineStagesPerDevice}{V} \newcommand{\ViscousDampingMatrix}{\mathbf{D}} \newcommand{\VisionBackboneTime}{t_{\text{backbone}}} \newcommand{\VisionTokenEmbeddings}{\mathbf{z}_{\text{vision}}} \newcommand{\VisualConditioningEmbedding}{\mathbf{E}} \newcommand{\VisualEncodingTime}{t_{\text{vis}}} \newcommand{\VitImagePatch}{\mathbf{x}_p} \newcommand{\VitPatchProjectionWeights}{\mathbf{W}_{\text{patch}}} \newcommand{\VitPatchSize}{p_{\text{patch}}} \newcommand{\VitPatchTokenEmbedding}{\mathbf{z}} \newcommand{\VocabularyToken}{v} \newcommand{\VocabularyTokenLogit}{o} \newcommand{\VolumetricFlowRate}{\dot{V}} \newcommand{\VoxelBlockCoordinate}{\mathbf{b}} \newcommand{\VoxelBlockEdgeLength}{L_{\text{blk}}} \newcommand{\VoxelCenterPosition}{\mathbf{p}_{\text{vox}}} \newcommand{\VoxelIndex}{i} \newcommand{\VoxelOccupancyState}{m} \newcommand{\VoxelPitch}{r} \newcommand{\VoxelStorageSize}{s_{\text{voxel}}} \newcommand{\VoxelUpdateTraffic}{s_{\text{rw}}} \newcommand{\WarmupEpochCount}{N_{\text{warmup}}} \newcommand{\WarmupStepCount}{W} \newcommand{\WatchdogClockFrequency}{f_{\text{wdg}}} \newcommand{\WatchdogCounterReading}{W} \newcommand{\WatchdogEarliestServiceTime}{T_{\text{lower}}} \newcommand{\WatchdogLatestServiceTime}{T_{\text{upper}}} \newcommand{\WatchdogLowerWindowCount}{W_{\text{lower}}} \newcommand{\WatchdogReloadCount}{W_{\text{init}}} \newcommand{\WatchdogServiceTime}{t_{\text{service}}} \newcommand{\WatchdogToken}{T} \newcommand{\WatchdogUpperWindowCount}{W_{\text{upper}}} \newcommand{\WaveImpedance}{b} \newcommand{\WeightElementStorageSize}{s_{\text{elem,W}}} \newcommand{\WeightMatrix}{\mathbf{W}} \newcommand{\WeightMatrixColumnCount}{n} \newcommand{\WeightMatrixEntry}{W_{ij}} \newcommand{\WeightMatrixRowCount}{m} \newcommand{\WeightMemory}{M_{\text{weights}}} \newcommand{\WeightOnlyStepTime}{t} \newcommand{\WeightPenaltyStrength}{\lambda_{\text{reg}}} \newcommand{\WeightQuantizationScale}{s_W} \newcommand{\WeightRangeBound}{W_{\text{max}}} \newcommand{\WeightStreamingDecodeTime}{T_{\text{decode}}} \newcommand{\WeightVector}{\mathbf{w}} \newcommand{\WeightedNormArgument}{\mathbf{z}} \newcommand{\WheelAngularSpeed}{\omega} \newcommand{\WheelDiameter}{D_{\text{wheel}}} \newcommand{\WheelInertia}{J_{\text{wheel}}} \newcommand{\WheelNormalLoad}{F_z} \newcommand{\WheelRadius}{r} \newcommand{\WheelRevolutionCount}{N_{\text{rev}}} \newcommand{\WheelTrackWidth}{b} \newcommand{\WhiteNoiseProcess}{\mathcal{WN}} \newcommand{\WholeBodyDecisionVariables}{\mathbf{z}} \newcommand{\WholeRepositoryShardGrant}{\Gamma_{b}} \newcommand{\WidthMultiplier}{w_{\text{mult}}} \newcommand{\WidthScalingRatio}{\beta} \newcommand{\WilsonIntervalCenter}{\tilde{p}} \newcommand{\WindingCoreThermalResistance}{R_{\text{th,wc}}} \newcommand{\WindingCurrent}{I} \newcommand{\WindingJouleHeat}{E_{\text{thermal}}} \newcommand{\WindingLossPower}{P_{\text{loss}}} \newcommand{\WindingTemperature}{T_{\text{winding}}} \newcommand{\WindingTemperatureLimit}{T_{\text{limit}}} \newcommand{\WindingTerminalVoltage}{V_{\text{terminal}}} \newcommand{\WindingThermalCapacitance}{C_{\text{wind}}} \newcommand{\WindowArrivalCount}{k} \newcommand{\WindowArrivalOffset}{t} \newcommand{\WindowSpendingLimit}{C_{\text{win}}} \newcommand{\WithinTaskRunStandardDeviation}{\sigma_{\text{run}}} \newcommand{\WorkedTraceProduct}{c} \newcommand{\WorkedTraceProductAdjoint}{\bar{c}} \newcommand{\WorkedTraceSine}{b} \newcommand{\WorkedTraceSineAdjoint}{\bar{b}} \newcommand{\WorkedTraceSquare}{a} \newcommand{\WorkedTraceSquareAdjoint}{\bar{a}} \newcommand{\WorkerBaseCommitHash}{h_{\text{base}}} \newcommand{\WorkerCandidateCommitHash}{h_{\text{worker}}} \newcommand{\WorkerCompletionDistribution}{F} \newcommand{\WorkerCompletionTime}{T} \newcommand{\WorkerCount}{N_{\text{workers}}} \newcommand{\WorkerDelayProbability}{p} \newcommand{\WorkerIndex}{k} \newcommand{\WorkerMinibatch}{B} \newcommand{\WorkerOverheadSlope}{\gamma} \newcommand{\WorkerTransformTime}{T_{\text{transform}}} \newcommand{\WorkerWrittenFileCount}{w} \newcommand{\WorkloadMeanOutputLength}{\mu} \newcommand{\WorkloadRequestIndex}{i} \newcommand{\WorkspaceExtentX}{L_x} \newcommand{\WorkspaceExtentY}{L_y} \newcommand{\WorkspaceExtentZ}{L_z} \newcommand{\WorkspaceRestoreTime}{T_{\text{ws}}} \newcommand{\WorkspaceVolume}{V_{\text{ws}}} \newcommand{\WorldBaseTransform}{\mathbf{T}_{WB}} \newcommand{\WorldBodyTransform}{\mathbf{T}_{wb}} \newcommand{\WorldFramePoint}{\mathbf{p}_{\text{world}}} \newcommand{\WorldLidarTransform}{\mathbf{T}_{wl}} \newcommand{\WorldMapTransform}{\mathbf{T}_{\text{world}}^{\text{map}}} \newcommand{\WorldPointCovariance}{\boldsymbol{\Sigma}_{\text{world}}} \newcommand{\WorldReferenceFrame}{\mathcal{F}_W} \newcommand{\WorldStateSpace}{\mathcal{S}} \newcommand{\WorldToCameraRotation}{\mathbf{R}_{CW}} \newcommand{\WorldToCameraTransform}{\mathbf{T}_{CW}} \newcommand{\WorldToCameraTranslation}{\mathbf{t}_{CW}} \newcommand{\WornPlantTransitionDistribution}{p_{n \gg 1}} \newcommand{\WorseArmSuccessProbability}{p_{\text{low}}} \newcommand{\WorstCaseExecutionTime}{C} \newcommand{\WorstCaseInterruptLatency}{t_{\text{irq,lat}}} \newcommand{\WorstCasePermissionCycleTime}{T_{\text{exec}}} \newcommand{\WorstCaseResponseTime}{R} \newcommand{\WristAngularVelocity}{\boldsymbol{\omega}_{\text{wrist}}} \newcommand{\WristCameraEmbedding}{\mathbf{e}_{\text{wrist}}} \newcommand{\WristLinearVelocity}{\mathbf{v}_{\text{wrist}}} \newcommand{\WristObjectTransform}{\mathbf{T}_{\text{wrist} \leftarrow \text{object}}} \newcommand{\WristSkewDisplacement}{\Delta \mathbf{p}_{\text{skew}}} \newcommand{\XAxisAngularRate}{\omega_x} \newcommand{\XAxisRotationCoordinate}{\omega_x} \newcommand{\XForceCeiling}{F_x} \newcommand{\XPositionErrorEnvelope}{e_x} \newcommand{\XTaskToleranceSemiAxis}{r_x} \newcommand{\XTorqueCeiling}{\tau_x} \newcommand{\YAxisAngularRate}{\omega_y} \newcommand{\YAxisRotationCoordinate}{\omega_y} \newcommand{\YForceCeiling}{F_y} \newcommand{\YPositionErrorEnvelope}{e_y} \newcommand{\YTaskToleranceSemiAxis}{r_y} \newcommand{\YTorqueCeiling}{\tau_y} \newcommand{\YawRate}{\omega_z} \newcommand{\YoshikawaManipulability}{w} \newcommand{\ZAxisRotationCoordinate}{\omega_z} \newcommand{\ZForceCeiling}{F_z} \newcommand{\ZPositionErrorEnvelope}{e_z} \newcommand{\ZTaskToleranceSemiAxis}{r_z} \newcommand{\ZTorqueCeiling}{\tau_z} \newcommand{\ZTransformVariable}{z} \newcommand{\ZeroEntryIndicator}{\mathbf{1}_{\{(\mathbf{W}_{\text{sparse}})_{ij} = 0\}}} \newcommand{\ZeroFailureTrialCount}{n} \newcommand{\ZeroFailureUpperConfidenceLimit}{p_{\text{fail, upper}}^{95\%}} \newcommand{\ZeroMatrix}{\mathbf{0}} \newcommand{\ZeroMomentPoint}{\mathbf{p}_{\text{ZMP}}} \newcommand{\ZeroVector}{\mathbf{0}} \newcommand{\ZohHoldTravel}{d_{\text{ZOH}}} \newcommand{\ZohPhaseShift}{\phi_{\text{ZOH}}} \newcommand{\ZohTransportDelay}{\tau_{\text{ZOH}}} \newcommand{\AuthorityLevels}{\AuthorityExposureLevel} \newcommand{\BreakEvenTaskVolume}{\BreakEvenTaskCount} \newcommand{\PertokenPricesCache}{\CachedInputTokenPrice} \newcommand{\ContentionAndCoherencyCoefficientsTwo}{\CoherencyCoefficient} \newcommand{\CoherencyContentionCoefficient}{\CoherencyCoefficient} \newcommand{\TaskDeadline}{\CompletionDeadline} \newcommand{\Deadline}{\CompletionDeadline} \newcommand{\Confidentiality}{\ConfidentialityLabel} \newcommand{\ContentionAndCoherencyCoefficients}{\ContentionCoefficient} \newcommand{\CostPerAcceptedTaskEff}{\CostPerAcceptedTask} \newcommand{\DuplicateeffectProbability}{\DuplicateEffectProbability} \newcommand{\EstimatedAdvantageK}{\EstimatedHistoryAdvantage} \newcommand{\EstimatedValueK}{\EstimatedRemainingReturn} \newcommand{\ExpectedIrreversibleLossA}{\ExpectedIrreversibleLoss} \newcommand{\PertokenPricesIn}{\InputTokenPrice} \newcommand{\CohensKappa}{\InterAnnotatorAgreement} \newcommand{\KvBlockSizeBlk}{\KvBlockSize} \newcommand{\MaskedFinetuningLossSft}{\MaskedFinetuningLoss} \newcommand{\ValidityIntervalOfAMemoryEntryBirth}{\MemoryEntryBirthGeneration} \newcommand{\ValidityIntervalOfAMemoryEntryDeath}{\MemoryEntryDeathGeneration} \newcommand{\MemoryHeldDuringAWait}{\MemoryHoldDuringWait} \newcommand{\OptimalCheckpointIntervalCkpt}{\OptimalCheckpointInterval} \newcommand{\PertokenPricesOut}{\OutputTokenPrice} \newcommand{\PertokenDecodeTime}{\PerTokenDecodeTime} \newcommand{\TokenLossMask}{\PositionLossMask} \newcommand{\LossMaskT}{\PositionLossMask} \newcommand{\ValidityIntervalOfAMemoryEntryQ}{\QueryWorkspaceGeneration} \newcommand{\RequestAndReplylossProbabilitiesTwo}{\ReplyLossProbability} \newcommand{\RequestAndReplylossProbabilities}{\RequestLossProbability} \newcommand{\EnvironmentStateK}{\RolloutEnvironmentState} \newcommand{\StalesupportRate}{\StaleSupportRate} \newcommand{\StateLevels}{\StateExposureLevel} \newcommand{\GoalContract}{\TaskContractGoal} \newcommand{\Environment}{\TaskEnvironment} \newcommand{\Vocabulary}{\TokenVocabulary} \newcommand{\ActionProposal}{\TrajectoryAction} \newcommand{\ConcurrentTrajectoriesTwo}{\TrajectoryAdmissionRate} \newcommand{\ActionObservation}{\TrajectoryObservation} \newcommand{\Observation}{\TrajectoryObservation} \newcommand{\StateAtTurn}{\TrajectoryState} \newcommand{\PerturnAppend}{\TurnAppendLength} \newcommand{\Context}{\TurnContext} \newcommand{\Horizon}{\TurnHorizon} \newcommand{\VerifierFalseacceptance}{\VerifierFalseAcceptanceRate} \newcommand{\VerifierFalseacceptanceFr}{\VerifierFalseRejectionRate} \newcommand{\WorkerCountWorkers}{\WorkerCount} \newcommand{\AllocationHoldTime}{\AllocatedWallTime} \newcommand{\CheckpointIntervalCkpt}{\CheckpointInterval} \newcommand{\AcceleratorsPerNodeNodes}{\ClusterNodeCount} \newcommand{\CommunicationcomputationRatio}{\CommunicationComputeRatio} \newcommand{\PercomponentFailureRate}{\ComponentFailureRate} \newcommand{\Correlation}{\CorrelationCoefficient} \newcommand{\DataparallelDegreeDp}{\DataParallelDegree} \newcommand{\NumberOfDevices}{\DeviceCount} \newcommand{\TypeIAndTypeIiErrorRatesStat}{\HypothesisTestFalseNegativeRate} \newcommand{\TypeIAndTypeIiErrorRatesSig}{\HypothesisTestSignificanceLevel} \newcommand{\DollarCostInfer}{\InferenceCost} \newcommand{\KvcacheBytesPerToken}{\KvCacheBytesPerToken} \newcommand{\KvcacheMemory}{\KvCacheMemory} \newcommand{\CrossoverPoint}{\LatencyBandwidthCrossoverSize} \newcommand{\LoggpLongmessageTime}{\LoggpLongMessageTime} \newcommand{\LogploggpNetworkLatency}{\LogpNetworkLatency} \newcommand{\LongmessageGapPerByte}{\LongMessageGapPerByte} \newcommand{\MeanTimeBetweenFailuresThree}{\MeanTimeBetweenFailures} \newcommand{\PermessageLatency}{\MessageStartupLatency} \newcommand{\NdeviceTime}{\MultiDeviceRunTime} \newcommand{\PipelineparallelDegreePp}{\PipelineParallelDegree} \newcommand{\MlProductivityGoodputFactorsProgram}{\ProgramGoodput} \newcommand{\ReceiverOverheadRecv}{\ReceiverOverhead} \newcommand{\CollectiveCompletionTimeRing}{\RingAllReduceCompletionTime} \newcommand{\RingtreeCrossoverPayload}{\RingTreeCrossoverPayload} \newcommand{\MlProductivityGoodputFactorsRuntime}{\RuntimeGoodput} \newcommand{\GoodputRatio}{\RuntimeGoodput} \newcommand{\ScalingExponentScale}{\ScalingExponent} \newcommand{\MlProductivityGoodputFactorsScheduling}{\SchedulingGoodput} \newcommand{\SingledeviceTimeOne}{\SingleDeviceRunTime} \newcommand{\ReliabilityFunctionSystem}{\SystemReliability} \newcommand{\TensorparallelDegreeTp}{\TensorParallelDegree} \newcommand{\SmallConstant}{\ToleratedFailureProbability} \newcommand{\DollarCostTrain}{\TrainingCost} \newcommand{\CollectiveCompletionTimeTree}{\TreeAllReduceCompletionTime} \newcommand{\UsefulComputetimeFraction}{\UsefulComputeFraction} \newcommand{\AccuracyAtTime}{\AccuracyAfterDeployment} \newcommand{\NumberOfAttentionHeads}{\AttentionHeadCount} \newcommand{\Distribution}{\InputDistribution} \newcommand{\NumberOfKeyValueHeads}{\KvHeadCount} \newcommand{\NumberOfKeyvalueHeadsKv}{\KvHeadCount} \newcommand{\NumberOfLayers}{\LayerCount} \newcommand{\LayerInputAndOutputWidths}{\LayerInputWidth} \newcommand{\LayerInputAndOutputWidthsTwo}{\LayerOutputWidth} \newcommand{\Gradient}{\LossGradient} \newcommand{\TrainingDistributionZero}{\TrainingDistribution} \newcommand{\AcceleratorCountGpu}{\AcceleratorCount} \newcommand{\ActivationMemoryActivations}{\ActivationMemory} \newcommand{\BatchServiceTimeSvc}{\BatchServiceTime} \newcommand{\EnergyPerOperationCompute}{\EnergyPerOperation} \newcommand{\GradientMemoryGradients}{\GradientMemory} \newcommand{\IronlawTermTimesCompute}{\IronLawComputeTime} \newcommand{\SingleDeviceComputeTime}{\IronLawComputeTime} \newcommand{\IronlawTermTimesMemory}{\IronLawMemoryTime} \newcommand{\LossscaleFactor}{\LossScaleFactor} \newcommand{\OptimizerstateMemory}{\OptimizerStateMemory} \newcommand{\RequestTimeInSystemLat}{\RequestTimeInSystem} \newcommand{\StoragePricePerByteTime}{\StorageCapacityPrice} \newcommand{\WeightMemoryWeights}{\WeightMemory} \newcommand{\WindingAndAmbientTemperatureTwo}{\AmbientTemperature} \newcommand{\BackemfVoltageBemf}{\BackEmfVoltage} \newcommand{\CoordinateReferenceFramesB}{\BodyReferenceFrame} \newcommand{\CameraframeThreedCoordinate}{\CameraFramePoint} \newcommand{\CartesianThreedPosition}{\CartesianPosition} \newcommand{\CommandTransportTimeBus}{\CommandTransportTime} \newcommand{\ContactForceVectorK}{\ContactPointForce} \newcommand{\ContactPointJacobianK}{\ContactPointJacobian} \newcommand{\ContinuousPeakCurrent}{\ContinuousCurrent} \newcommand{\CredibleDecelerationBrake}{\CredibleBrakingDeceleration} \newcommand{\OpenloopCrossoverFrequency}{\CrossoverFrequency} \newcommand{\PhaseLagDegradation}{\DelayPhaseLag} \newcommand{\DiffusionScheduleParameterK}{\DiffusionCumulativeSchedule} \newcommand{\DispatchtoadmissionIntervalDa}{\DispatchAdmissionInterval} \newcommand{\EmittedTokenCountOut}{\EmittedTokenCount} \newcommand{\FundamentalAndEssentialMatricesTwo}{\EssentialMatrix} \newcommand{\ForwardinvariantSafeSet}{\ForwardInvariantSafeSet} \newcommand{\FreespaceDepth}{\FreeSpaceDepth} \newcommand{\FundamentalAndEssentialMatrices}{\FundamentalMatrix} \newcommand{\TransmissionEfficiencyGear}{\GearboxTransmissionEfficiency} \newcommand{\HardwareAndCommoncauseRateOther}{\HardwareCommonCauseRate} \newcommand{\ContinuousPeakTorqueHold}{\HoldingTorque} \newcommand{\OptimalInertiamatchingRatio}{\InertiaMatchingRatio} \newcommand{\IntentleaseExpiryIntentexp}{\IntentLeaseExpiry} \newcommand{\LatentStyleStateEmbedding}{\LatentStyleVariable} \newcommand{\LinearBarrierDecayRateCbf}{\LinearBarrierDecayRate} \newcommand{\Momentum}{\LinearMomentum} \newcommand{\RotorAndLoadInertiaTwo}{\LoadInertia} \newcommand{\LqrGainAndWeights}{\LqrFeedbackGain} \newcommand{\CenterOfMass}{\MassCenterPosition} \newcommand{\TorqueAndBackemfConstants}{\MotorTorqueConstant} \newcommand{\NoisePredictionNetworkTwo}{\NoisedActionChunk} \newcommand{\ObservabilityMatricesNl}{\NonlinearObservationSpace} \newcommand{\ObservabilityMatrices}{\ObservabilityMatrix} \newcommand{\ContinuousPeakCurrentTwo}{\PeakCurrent} \newcommand{\ContinuousPeakTorque}{\PeakTorque} \newcommand{\PermissionloopPeriodTick}{\PermissionLoopPeriod} \newcommand{\PhaseInductanceAndResistance}{\PhaseInductance} \newcommand{\PhaseInductanceAndResistanceTwo}{\PhaseResistance} \newcommand{\InitialAndCeilingError}{\PositionErrorCeiling} \newcommand{\RenewaljitterAllowance}{\RenewalJitterAllowance} \newcommand{\ResidentStopDistanceSuffix}{\ResidentStopDistance} \newcommand{\CoefficientOfRestitution}{\RestitutionCoefficient} \newcommand{\RigidtransformTranslation}{\RigidTransformTranslation} \newcommand{\RotorAndLoadInertia}{\RotorInertia} \newcommand{\SamplingPeriodAndRate}{\SamplingPeriod} \newcommand{\SensorLeverarmVector}{\SensorLeverArm} \newcommand{\SequentialLoglikelihoodRatioM}{\SequentialLogLikelihoodRatio} \newcommand{\SinglestepImitationError}{\SingleStepImitationError} \newcommand{\SprtBoundariesLo}{\SprtLowerBoundary} \newcommand{\SprtBoundariesUp}{\SprtUpperBoundary} \newcommand{\LinearStatespaceMatrices}{\StateSpaceInputMatrix} \newcommand{\LinearStatespaceMatricesSys}{\StateSpaceSystemMatrix} \newcommand{\PertrialProbabilitiesTarget}{\TargetTrialSuccessProbability} \newcommand{\TorqueproducingCurrent}{\TorqueProducingCurrent} \newcommand{\TrackingerrorBound}{\TrackingErrorBound} \newcommand{\PertrialProbabilitiesFail}{\TrialFailureProbability} \newcommand{\TsdfAccumulatedVolumeVox}{\TsdfAccumulatedWeight} \newcommand{\VirtualDampingAndStiffness}{\VirtualDampingMatrix} \newcommand{\Radius}{\WheelRadius} \newcommand{\WindingAndAmbientTemperature}{\WindingTemperature} \newcommand{\CoordinateReferenceFramesW}{\WorldReferenceFrame} \newcommand{\ZerofailureTrialCount}{\ZeroFailureTrialCount} \newcommand{\ZeroMomentPointZmp}{\ZeroMomentPoint} \newcommand{\Glyph}[1]{#1} $$

16 Responsible AI

Fleet governance overlay wrapping data, training, serving, monitoring, policy, fairness, privacy, audit, accountability, and incident response.

Purpose

Fleet Machine Learning Systems Stack

Fleet stack focus for this chapter.

Why can an accurate, fast model still be unfit for deployment?

In high-risk regulated settings, a model that cannot explain or document its behavior, support audit, or meet applicable discrimination rules may fail deployment review regardless of its accuracy or latency. Strong aggregate performance can conceal a pattern of errors concentrated among people with little power to challenge the outcome. Increasing throughput then increases the reach of that failure. A single-node evaluation can measure predictions, but it cannot establish whether every deployed version uses an approved decision policy or whether an affected person can obtain a correction. Across a fleet, records, models, interfaces, and organizational authority must remain connected as each changes. An explanation delivered too late may be useless to someone facing an immediate decision; retaining every detail indefinitely can create a separate privacy problem. Investigating an alert requires staff and evidence, while correcting a decision may require action across several dependent services. These obligations consume resources and can constrain deployment even when inference capacity is ample. They also persist after launch: a change in population, workflow, or model behavior can invalidate the evidence that originally justified operation. Responsible AI engineering makes those obligations part of the organization’s daily operation, with resources and authority to act when measured behavior falls short. In C³ terms, responsibility is a coordination constraint: the fleet needs evidence and authority to decide when compute may run, when it must stop, and who can correct its consequences.

Learning Objectives
  • Explain why an accurate, fast model can still fail deployment review, and why each safeguard is budgeted capacity whose placement decides who is protected
  • Calculate fairness metrics and evaluate observational versus causal definitions under base-rate and prediction trade-offs
  • Design bias detection and fairness monitoring across demographic groups, drift, and fleet-scale feedback loops
  • Evaluate privacy and machine-unlearning controls against accuracy, compute, and governance requirements
  • Select explanation methods under latency, compute, auditability, and user-contestability constraints
  • Analyze human-AI feedback loops, automation bias, and value conflicts in deployment contexts
  • Construct an auditable assurance case, including bounded robustness and generative-system controls, from intended use and evidence through launch, remedy, material change, and retirement

16.1 The Governance Imperative

In 2018, Reuters reported that Amazon had abandoned an experimental hiring algorithm trained on historical resume data after discovering it systematically penalized female candidates (Dastin 2018). The historical records supplied a computable training objective, but reproducing patterns in those records was not the same as identifying qualified applicants fairly. The experiment exposed a mismatch between the learned objective and the legitimate hiring goal, because historical success could encode unequal access rather than merit-based qualifications.

Dastin, Jeffrey. 2018. “Amazon Scraps Secret AI Recruiting Tool That Showed Bias Against Women.” Reuters.
Stoica, Ion, Dawn Song, Raluca Ada Popa, David Patterson, Michael W. Mahoney, Randy Katz, Anthony D. Joseph, et al. 2017. “A Berkeley View of Systems Challenges for AI.” arXiv Preprint arXiv:1712.05855.

Production AI already has a systems agenda spanning architecture, infrastructure, data processing, security, and robustness (Stoica et al. 2017). The preceding chapters made the fleet secure against adversaries, robust under shift, and accountable for the energy it draws. The siting analysis in Environmental justice and responsible development left one question that energy and carbon accounting could expose but not settle, namely who bears the environmental cost of where the fleet runs. Responsible AI carries that question from the fleet’s resource footprint to the decisions the fleet makes about people. A service that remains available, secure, accurate, and within its resource budget can still distribute harms unfairly or deny affected people a remedy, and the hiring incident makes that distinction concrete. Fairness, transparency, and accountability therefore need measurable requirements and operating controls alongside the mechanisms that keep the fleet running.

Across the multi-tier fleet hierarchy in The Fleet Stack, responsible AI completes the Governance band, the point where the system meets the real world. The Infrastructure, Distribution, and Serving bands beneath it supply compute, data movement, distributed execution, and serving infrastructure. Within the Governance band, the Assurance row contributes security controls and robustness mechanisms, and the Governance & Sustainability row contributes sustainability budgets; responsible AI weighs that evidence and adds the constraints that determine why the machine runs and whom it serves, requiring owners to identify, assess, limit, and remedy harms from an otherwise correctly functioning system. Alongside the Fleet Law’s accounting of execution time, responsible AI adds conditions for continued operation: evidence that the deployment remains within its approved bounds and authority to intervene when it does not. Toxic outputs can erode user trust, discriminatory decisions can distort future training data when those decisions shape data collection, and privacy violations can require restricting or suspending a service. These consequences depend on the deployment, but the obligation to investigate harm does not depend on whether it also degrades model performance. Responsible AI therefore shapes objective selection and operating constraints from the beginning of design.

↩︎ The Fleet Law governing execution time and scaling efficiency is established in The Fleet Law.

Definition 16.1: Responsible AI

Responsible AI is the practice of designing, auditing, and operating ML systems to measurable fairness, safety, privacy, and accountability standards, translating ethical principles into verifiable system properties that constrain model training, deployment decisions, and operational monitoring.

  1. Significance: Responsible AI constraints impose real costs: fairness-aware training can lengthen training runs, real-time bias monitoring can consume serving-path latency, and on-demand explainability can require additional model evaluations or asynchronous worker capacity. At fleet scale, these safeguards must be budgeted like reliability or security controls. Conversely, a facial recognition system with a persistent subgroup error gap can affect millions of users before detection, creating regulatory and liability costs that dwarf the monitoring investment.
  2. Distinction: AI ethics examines normative principles about what systems should do; responsible AI engineering turns selected requirements into controls and evidence. Bias detection algorithms, differential privacy implementations, audit trails, and architectural guardrails support bounded claims that reviewers can inspect. Choosing legitimate requirements and judging the remaining harms still require domain expertise, stakeholder participation, and accountable authority.
  3. Common pitfall: A frequent misconception is that responsible AI is a final compliance review applied to a finished model. Postprocessing can satisfy selected metrics on observed outcomes, but threshold adjustment cannot repair an invalid target, unreliable labels, or missing information. Those defects may require changes to data collection, labels, or learned representations. The remedy depends on the source of harm; a final threshold check cannot substitute for investigating it.

That practice must account for sociotechnical dynamics1 that extend beyond any individual system and operate inside organizational and regulatory contexts. Public risk-management frameworks, mapped onto the assurance lifecycle below, record the same shift from abstract principles toward governable requirements. Privacy mechanisms, robustness techniques, and sustainability metrics provide the technical foundation; responsible AI adds bias detection, organizational governance structures, and stakeholder engagement processes on top of them. That integration is a significant infrastructure investment, and the training, inference, and memory overheads quantified in section 16.4.2 must be provisioned as essential capacity, analogous to how security and redundancy are budgeted in distributed systems.

1 Sociotechnical system: Coined by the Tavistock Institute in the 1950s to describe the interdependent relationship between humans and technology in the workplace. ML fleets are sociotechnical systems in exactly this sense, because their “performance” is not merely a benchmark score but an emergent property of how model outputs interact with user behavior, legal frameworks, and physical resource constraints.

Treating fairness, transparency, accountability, and privacy as rigorous engineering specifications rather than abstract ideals transforms responsible AI from aspiration into practice. Each principle becomes a design constraint with measurable criteria, attached to a specific stage of the machine learning lifecycle. The assurance lifecycle first establishes who may set and approve those constraints, and the deployment tier determines where each control can run and what it costs. Fairness, privacy, explainability, and safety are then developed one at a time, each from definition through measurement to the controls that enforce it. Accountability and sociotechnical analysis close the argument by testing whether those controls remain effective inside human workflows and institutions.

Self-Check: Question
  1. In the ML fleet stack, why does Responsible AI constitute the Governance band rather than existing as a supplementary post-training checklist?

    1. Because it replaces lower-level distributed execution frameworks with legal compliance parsers
    2. Because it serves solely to optimize training throughput and hardware acceleration efficiency
    3. Because it establishes requirements, evidence, and accountable owners for why the system runs and whom it serves, including risks that statistical optimization alone does not resolve
    4. Because it operates exclusively as a hardware watchdog circuit to prevent physical server overheating
  2. Contrast the engineering objectives of Responsible AI with those of Robust AI.

  3. True or False: Responsible AI is primarily an ethical review process applied to a finished model artifact at the end of the deployment pipeline.

  4. How does the Amazon hiring algorithm incident illustrate that statistical optimization can coexist with severe societal harm?

See Answers →

16.2 The Governance and Assurance Lifecycle

A model registry can prove which weights reached production, but it cannot prove that the deployment was justified. That judgment requires a chain of evidence connecting the deployment context to affected people, foreseeable harms, measurable requirements, implemented controls, accountable owners, and the authority to launch or stop the system. Responsible AI therefore needs an assurance lifecycle: a repeatable operating path that converts normative commitments into reviewable claims and keeps those claims valid as the system changes.

The lifecycle begins before model selection. Teams first define the intended use, prohibited uses, affected parties, operating environment, and decision consequences. They then identify harms and requirements, including subgroup performance, privacy, security, robustness, sustainability, human-oversight, and contestability obligations. Some controls are implemented locally; others are inherited from data providers, foundation-model vendors, cloud platforms, or downstream operators. Each inherited control needs an interface contract stating what the supplier guarantees, what evidence supports that guarantee, and which residual risks remain with the deploying organization.

Constraint selection needs an explicit division of authority. Domain experts and affected parties identify consequential harms and acceptable uses; policy and legal specialists identify applicable obligations; engineers determine what can be measured and enforced. The accountable launch authority approves the resulting criteria and records unresolved disagreements. A convenient metric or an available implementation does not authorize the engineering team to choose whose errors matter most.

The resulting assurance case is not a single compliance document, but a versioned set of linked artifacts that structure accountability across the system lifecycle. At its foundation sits an explicit claim defining the property required for a specified use and operating envelope. An argument articulates how operational controls and empirical observations justify that claim, drawing on evidence from reproducible evaluations, audits, access logs, documentation, and user research. These claims and arguments hold only under stated assumptions regarding environmental, population, supplier, and workflow boundaries. To ensure operational authority, every assurance case specifies an accountable owner empowered to block launch, restrict use, or require remediation, governed by an explicit invalidation rule that defines the measurable performance change, distribution shift, or operational incident that expires prior approval and triggers reassessment. Evidence reaches the claim only through the argument and only inside the stated assumptions, and the owner’s launch decision lasts only until the invalidation rule fires (figure 1).

Figure 1: Assurance Case Structure: Evidence supports a claim only through an explicit argument and only within stated assumptions. An accountable owner turns the claim into a launch decision, and a material change named by the invalidation rule expires that approval, so the case is a versioned artifact rather than a one-time sign-off.

This structure prevents a common category error. A fairness dashboard, privacy accountant, red-team report, or carbon inventory is evidence for a bounded claim; none is itself proof that the full system is responsible. That evidence becomes operational only when an owner can act on it and affected people have a path to contest a decision and obtain remedy (table 1).

At release time, the evaluation contract defined in The end-to-end evaluation contract binds those assurance claims to the exact model, workload, acceptance authority, rollback target, and evidence-retention period. The assurance case explains why deployment is justified; the evaluation contract ensures that promotion and invalidation execute that judgment against one reproducible artifact.

Table 1: Governance and Assurance Lifecycle: Responsible operation connects context and affected parties to requirements, inherited controls, evidence, launch authority, monitoring, incidents, remedy, material-change review, and retirement. Each stage produces an auditable artifact and a decision rather than a policy statement.
Lifecycle stage Required artifact Operational decision
Context and affected parties Intended-use statement, prohibited uses, stakeholder map, decision-impact analysis Is this use legitimate and within organizational authority?
Risk and requirements Harm model, legal and policy obligations, measurable acceptance criteria Which risks must be prevented, bounded, transferred, or accepted?
Controls and dependencies Control inventory, supplier evidence, data and model lineage, output filters Are local and inherited controls sufficient for the operating envelope?
Evaluation and assurance Assurance case, disaggregated results with uncertainty, robustness and security evidence, sustainability accounting Does the evidence support launch, restricted launch, or rejection?
Launch authority Signed decision record, residual-risk owner, rollback and appeal paths Who may authorize deployment, and who may stop it?
Operation and incident response Monitoring thresholds, escalation owners, incident log, remedy workflow When must the system degrade, roll back, notify, compensate, or suspend?
Material change Change classification, impact assessment, revalidation scope Does a new model, dataset, tool, region, or use invalidate prior approval?
Retirement Decommission plan, retention and deletion record, user and dependent-system notice How are access, data, models, interfaces, and unresolved harms closed out?

Named frameworks organize this work at different levels. The National Institute of Standards and Technology (NIST) AI Risk Management Framework structures activity around Govern, Map, Measure, and Manage; ISO/IEC 42001 specifies an organizational AI management system; ISO/IEC 23894 supplies AI risk-management guidance; and the recommendations of the Organisation for Economic Co-operation and Development (OECD) and the United Nations Educational, Scientific and Cultural Organization (UNESCO) state broader principles and public responsibilities (Tabassi 2023; International Organization for Standardization and International Electrotechnical Commission 2023b, 2023a; Organisation for Economic Co-operation and Development 2024; UNESCO 2022). Mapped onto one operating lifecycle, those perspectives complement one another rather than serving as interchangeable checklists (table 2).

Tabassi, Elham. 2023. Artificial Intelligence Risk Management Framework (AI RMF 1.0). NIST AI 100-1. National Institute of Standards; Technology. https://doi.org/10.6028/NIST.AI.100-1.
International Organization for Standardization, and International Electrotechnical Commission. 2023a. ISO/IEC 23894:2023 Information Technology – Artificial Intelligence – Guidance on Risk Management. ISO/IEC standard.
Organisation for Economic Co-operation and Development. 2024. Recommendation of the Council on Artificial Intelligence. OECD Legal Instruments.
UNESCO. 2022. Recommendation on the Ethics of Artificial Intelligence. UNESCO.
Table 2: Framework Crosswalk: Public frameworks differ in scope and legal status, but their durable systems contribution is complementary. They help organizations establish authority, identify and measure risk, operate controls, and reassess evidence through change and retirement.
Lifecycle responsibility NIST AI RMF emphasis Management-system and public-policy emphasis
Establish context, affected parties, and authority Govern and Map Organizational context, leadership, stakeholder participation, and human oversight
Measure risk and assemble evidence Measure Risk assessment, documented objectives, evaluation, transparency, and traceability
Decide, operate, and respond Manage Operational controls, accountability, incident response, remedy, and continual improvement
Reassess change and retirement Govern and Manage Change management, corrective action, lifecycle review, and decommissioning obligations

Regulation turns parts of this lifecycle into legal obligations, and it does so by classifying uses rather than by reducing AI risk to one verifiable metric. The EU AI Act (2024) uses a risk-based structure that includes prohibited practices, high-risk systems, transparency duties for some systems, and minimal or no-risk uses; high-risk deployments face conformity, documentation, and logging obligations (European Parliament and Council of the European Union 2024). Narrower statutes govern particular uses, as the Illinois Artificial Intelligence Video Interview Act does for automated analysis of recorded job interviews (Illinois General Assembly 2020). United States federal policy has changed repeatedly since 2023. The safety reporting thresholds of Executive Order 14110 were revoked in January 2025, and later orders redirected agency emphasis toward AI innovation, cybersecurity, and critical-infrastructure defense (Executive Office of the President 2023, 2025a, 2025b, 2026). China’s Interim Measures for Generative AI (2023) subject some public-facing services to security assessment and algorithm-filing requirements rather than a universal pre-release assessment (Cyberspace Administration of China et al. 2023). These requirements cannot be collapsed into a single checklist. For a global ML fleet, applicable obligations depend on the service, affected population, organizational role, and jurisdiction, not server location alone. The deploying organization must identify the obligations that apply, assign owners to the procedures and evidence they require, and bind the approved policies to those deployment conditions in the control plane, preserving their versions and propagating changes to the components that enforce them.

Illinois General Assembly. 2020. Artificial Intelligence Video Interview Act (Public Act 101-0260). 820 ILCS 42, effective January 1, 2020.
Executive Office of the President. 2023. Safe, Secure, and Trustworthy Development and Use of Artificial Intelligence. Executive Order 14110, 88 FR 75191.
Executive Office of the President. 2025a. Initial Rescissions of Harmful Executive Orders and Actions. Executive Order 14148, 90 FR 8237.
Executive Office of the President. 2025b. Removing Barriers to American Leadership in Artificial Intelligence. Executive Order 14179.
Executive Office of the President. 2026. Promoting Advanced Artificial Intelligence Innovation and Security. Executive Order 14409, 91 FR 34565.
Cyberspace Administration of China, National Development and Reform Commission, Ministry of Education, Ministry of Science and Technology, Ministry of Industry and Information Technology, Ministry of Public Security, and National Radio and Television Administration. 2023. Interim Measures for Administration of Generative Artificial Intelligence Services. State Council Gazette.

Three details keep this lifecycle from becoming ceremonial. First, fairness estimates must carry denominators, confidence intervals, and data-coverage limits; a noisy subgroup gap should trigger investigation, not automatic claims of either discrimination or safety. Second, sustainability evidence belongs in the same assurance record, because the functional unit, system boundary, carbon signal, water accounting, embodied-impact allocation, uncertainty, and quality constraint determine whether an environmental claim is comparable or actionable. Third, a generative service that retrieves documents into a model’s context needs an authorization boundary independent of model alignment. Least-privilege scopes, output validation, provenance, and revocation must be versioned and monitored because retrieved content remains an untrusted input.

↩︎ The sustainability measurement contract, which fixes the functional unit, system boundary, carbon signal, and attribution rule, is established in Energy Measurement and Modeling.

Approval expires when its supporting assumptions no longer hold. A change of foundation model, training distribution, retrieval corpus, deployment region, user population, decision purpose, or human workflow can be material even when the application code is unchanged. The change record should identify which claims are invalidated and select the smallest defensible revalidation scope. At the end of service, retirement must revoke credentials, stop dependent interfaces safely, apply retention and deletion rules, preserve required audit evidence, notify affected users and downstream operators, and leave an owner for unresolved appeals or harms. Governance covers the system after launch and after shutdown, rather than solely at the moment a review board signs a release.

Self-Check: Question
  1. A global ML platform serves inference traffic across the European Union (EU AI Act), the United States, and Asia. How does this fragmented regulatory landscape reshape the serving control plane of the ML fleet?

    1. The platform must shut down all cloud datacenters and operate exclusively on local microcontrollers
    2. The platform must completely retrain its foundation models with new random seeds for each country
    3. The platform can ignore regional regulations by routing all traffic through international satellite links
    4. The control plane must bind approved policies to the applicable use, organizational role, and jurisdiction; regional gateways and shared model weights are one possible implementation.
  2. A product team submits a fairness dashboard showing small subgroup gaps as proof that its loan-screening system is responsible. Within an assurance case, what role should the dashboard play?

    1. It is sufficient proof, because a fairness dashboard already covers the system’s privacy, security, and contestability obligations
    2. It is evidence for a bounded claim, valid only under stated assumptions, and it becomes operational only when an accountable owner can act on it and affected people can contest decisions
    3. It replaces the claim and argument, because measured results speak for themselves
    4. It is irrelevant once the model registry records which weights reached production
  3. True or False: A team swaps the retrieval corpus behind an approved generative service without changing any application code, so the prior launch approval remains valid.

  4. Order the following stages of the governance and assurance lifecycle from earliest to latest: (1) launch authority signs a decision record with rollback and appeal paths, (2) define intended use, prohibited uses, and affected parties, (3) retire the system, revoking credentials and preserving required audit evidence, (4) build the harm model and measurable acceptance criteria, (5) operate with monitoring thresholds, escalation owners, and a remedy workflow.

See Answers →

16.3 Core Principles and the ML Lifecycle

A continuous integration pipeline can block a release when an evaluation detects a 15 percent drop in accuracy specifically for elderly users. Unlike a failing unit test or a latency regression, which the pipeline can check deterministically, a subgroup result requires a specified population, sufficient evaluation data, and an agreed acceptance criterion. Responsible AI translates those commitments into deployment gates. The continuous integration/continuous deployment (CI/CD) pipeline enforces the approved rule, while the accountable reviewer interprets uncertainty and decides whether the evidence supports release, restricted use, or remediation.

That release gate is one instance of a general translation from principle to enforceable requirement. Transparency discloses how the system as a whole was built and governed: its data sources, training procedure, intended uses, and known limitations. Explainability is narrower, producing evidence about the model’s behavior on particular decisions for a specified audience. Together they make the system inspectable by the developers, auditors, and affected people who must judge it. Fairness constrains how selection rates, error rates, or the meaning of a score may differ across population subgroups; its violations can compound through feedback loops, as in predictive policing, while the service remains technically available. Privacy bounds what the system reveals about the people whose data it uses, safety and robustness bound how it fails, and accountability assigns owners who can trace, remedy, and answer for its outcomes. Two further principles govern the objective and its supervision. Value alignment2 asks whether the objective itself reflects legitimate human intent, and human oversight3 preserves the ability of people to supervise, correct, or halt automated decisions. The sections that follow develop the first group in turn; alignment and oversight return where autonomy and human workflows make them binding, in section 16.8.3 and section 16.9.4.2.

2 Value alignment: The problem of ensuring AI systems optimize for human values rather than proxy objectives. Russell (2021) argues that specifying the objective is harder than optimizing it. The engineering consequence is that the training objective becomes a governed artifact with an owner and a review path, not a fixed input chosen once by the modeling team.

Russell, S. 2021. “Human-Compatible Artificial Intelligence.” In Human-Like Machine Intelligence. Oxford University Press. https://doi.org/10.1093/oso/9780198862536.003.0001.

3 HITL (human-in-the-loop): Human participation in model decisions adds response delay and improves safety only when the operator can identify and correct the relevant error. Staffing demand depends on the decision arrival rate, the fraction escalated, and the time required per review. In ML serving architectures, HITL requires routing logic, escalation criteria, and queue management that reshape the inference pipeline.

No principle ensures a responsible system on its own. The principles overlap, compete for priority when budgets are finite, and act in different phases of the responsible AI lifecycle, from data collection through model training, evaluation, and deployment to monitoring (table 3).

Table 3: Responsible AI Lifecycle: Embedding fairness, explainability, privacy, accountability, and robustness throughout the ML system lifecycle, from data collection to monitoring, ensures these principles become architectural commitments rather than post-hoc considerations. The table maps these principles to specific development phases, revealing how proactive integration addresses potential risks and promotes trustworthy AI systems.
Principle Data collection Model training Evaluation Deployment Monitoring
Fairness Representative sampling Bias-aware algorithms Group-level metrics Threshold adjustment Subgroup performance
Explainability Documentation standards Interpretable architecture Model behavior analysis User-facing explanations Explanation quality logs
Transparency Data source tracking Training documentation Performance reporting Model cards Change tracking
Privacy Consent mechanisms Privacy-preserving methods Privacy impact assessment Secure deployment Access audit logs
Accountability Governance frameworks Decision logging Audit trail creation Override mechanisms Incident tracking
Robustness Quality assurance Robust training methods Stress testing Failure handling Performance monitoring

Fairness and privacy constraints begin at data collection; robustness likewise depends on data quality and training choices, while accountability requires named owners before deployment. Their operational consequences become visible when the system serves users and teams must respond to failures. Explainability spans the full lifecycle, supporting model debugging at design time and evidence about decisions during use. This mapping reinforces that responsible AI is a multiphase architectural commitment, not a post-hoc compliance step.

16.4 Architectural Trade-Offs

A centralized audit can join predictions, demographic attributes, and delayed outcomes when access to those records is authorized. A federated model running on a million smartphones may provide no such joined dataset. The same fairness criterion then requires a different evidence path, such as restricted aggregate statistics or a separately governed audit sample. Deployment architecture determines where the evidence can be assembled and who can act on it.

These architectural differences redistribute both feasible safeguards and accountable parties. The comparison that follows uses four deployment tiers that differ in compute, connectivity, and update authority: Cloud ML runs on serving replicas in data-center fleets, whereas Edge ML moves execution to gateways and servers near the data source. On the client side, Mobile ML runs on phone-class devices with sustained power budgets of a few watts, the regime of Archetype C (Federated MobileNet), while TinyML operates on microcontrollers with hundreds of kilobytes of memory and milliwatt power budgets, an extreme below Archetype C that often lacks any update channel. The volume’s other lighthouses sit in the cloud tier: Archetype A (GPT-4/Llama-3) and Archetype B (DLRM at Scale) serve from data-center fleets, and even Archetype C relies on a cloud aggregator for its fleet-level evidence. TinyML has no lighthouse of its own; it appears here because it marks the limit case, a deployment whose safeguards must be fixed before it ships. Resource availability, latency constraints, user interface design, and the presence or absence of connectivity determine whether responsible AI principles can be enforced consistently across deployment contexts. The same model may support rich explanation, continuous monitoring, and centralized auditability in the cloud, yet require static validation and simplified safeguards when embedded in a device with intermittent connectivity. Tier choice is also an equity decision, because a safeguard that needs a data-center round trip reaches only users whose connectivity supports it (section 16.4.3).

↩︎ Archetype C (Federated MobileNet) and its few-watt per-device envelope are established in Archetype C (Federated MobileNet).

16.4.1 Design trade-offs

An autonomous braking controller or a wearable gesture recognizer cannot spend hundreds of milliseconds running Shapley attributions on every sensor frame, and a personalized model adapting on one phone cannot see whether its updates widen error gaps across the rest of the population. Machine learning systems do not operate in idealized silos; they must navigate competing objectives under finite compute, strict latency deadlines, shifting user behavior, and regulatory constraints.

Cloud-based systems can provision extensive monitoring, fairness audits, interpretability services, and privacy-preserving tools using shared compute and storage. Centralized data handling also concentrates exposure to surveillance and breaches. On-device execution can keep raw data local, but user control still depends on interfaces, permissions, retention rules, and update authority. Postdeployment visibility, fairness instrumentation, and adaptation depend on which evidence and maintenance paths the architecture provides.

Tensions between goals often become apparent at the architectural level. When an endpoint has too little latency budget for a costly explanation on every inference, designers can evaluate lightweight methods within that budget, precompute suitable summaries, or retain decision records for asynchronous analysis. The explanation’s audience and required delivery time determine which of these paths can satisfy the obligation.

Conflicts also emerge between personalization and fairness. Systems that adapt to individuals based on local usage data often lack the global context necessary to assess disparities across population subgroups. Preventing personalized predictions from creating systematic exclusion requires balancing user-level adaptation with mechanisms for group-level equity and auditability.

Privacy and robustness objectives can also conflict. Logging rare events or user outliers can help diagnose reliability failures, but the records may expose sensitive behavior. If raw records must remain local or encrypted, the improvement process needs an authorized evidence path, such as restricted review or aggregate diagnostics. Robustness requirements belong in the initial design; subsequent refinement depends on whether the retained evidence and update mechanism support it.

Energy budgets can constrain the frequency and placement of safeguards. Reducing model cost does not itself require weaker fairness monitoring; teams can compare local checks, sampled audits, and off-device analysis against the evidence and response deadlines. In federated learning, clipping, noise generation, and communication can consume additional energy, but their placement and cost depend on the mechanism. A central-DP design may add noise at the curator, whereas a local-DP design places randomization on the client. Battery feasibility therefore requires measuring the chosen implementation.4

4 Energy-privacy trade-off: Privacy-preserving techniques like differential privacy and secure multi-party computation can increase computation, communication, and battery use. In federated learning on mobile devices, the equity implication is direct. Users with older devices, limited data plans, or limited battery life may be excluded from privacy-protected AI services, creating a system where privacy protection becomes contingent on hardware resources.

Together, these deployment examples reveal a broader systems-level challenge. Responsible AI principles cannot be considered in isolation. They interact, and optimizing for one may constrain another. The appropriate balance depends on deployment architecture, stakeholder priorities, domain-specific risks, the consequences of error, and the environmental and distributional impacts of computational resource requirements. Responsible machine learning design therefore depends on making those constraints explicit before choosing methods, so that the resulting system can be evaluated against the deployment context it must actually inhabit.

Comparing these settings (table 4) demonstrates that no deployment context dominates across all principles; each makes distinct architectural compromises. Cloud systems support computationally expensive explanation methods and centralized fairness monitoring. Shapley-value attribution (SHAP) credits each input feature with its average marginal contribution to a prediction across subsets of the other features, and local interpretable model-agnostic explanations (LIME) fit a simple surrogate model to many perturbed copies of one input; both require many extra model evaluations per explained decision, and section 16.7 develops them. Cloud deployments can afford that work, but introduce privacy risks through data aggregation. Edge and mobile deployments offer stronger data locality but limit postdeployment observability and global fairness assessment. TinyML systems face particularly tight budgets; their validation, monitoring, and update plans must reflect the connectivity and storage actually provided. These constraints also decide which users receive which safeguards, the equity question raised in section 16.4.3. Understanding these deployment constraints provides necessary context for the technical methods that translate responsible AI principles into production controls.

Table 4: Deployment Trade-Offs: Responsible AI principles manifest differently across deployment contexts due to varying constraints on compute, connectivity, and governance; cloud deployments support complex explainability methods, while TinyML severely limits them. Prioritizing certain principles like explainability, fairness, privacy, safety, and accountability requires careful consideration of these constraints when designing machine learning systems for cloud, edge, mobile, and TinyML environments.
Principle Cloud ML Edge ML Mobile ML TinyML
Explainability Supports complex models and methods like SHAP and sampling approaches Needs lightweight, low-latency methods like saliency maps Requires interpretable outputs for users, often defers deeper analysis to the cloud Severely limited due to constrained hardware; mostly static or compile-time only
Fairness Large datasets allow bias detection and mitigation Localized biases harder to detect but allows on-device adjustments High personalization complicates group-level fairness tracking Minimal data limits bias analysis and mitigation
Privacy Centralized data at risk of breaches but can use strong encryption and differential privacy methods Sensitive personal data on-device requires on-device protections Tight coupling to user identity requires consent-aware design and local processing Distributed data reduces centralized risks but poses challenges for anonymization
Safety Vulnerable to hacking and large-scale attacks Real-world interactions make reliability important Operates under user supervision, but still requires graceful failure Needs static safety envelopes, watchdogs, and fail-safe behavior
Accountability Corporate policies and audits allow traceability and oversight Fragmented supply chains complicate accountability Requires clear user-facing disclosures and feedback paths Traceability required across long, complex hardware chains
Governance Applicable law and oversight; centralized evidence and named owners Applicable law and oversight; allocate duties across integrators Applicable law and oversight; coordinate platform and app duties Applicable law and oversight; preserve evidence through servicing and retirement

The deployment analysis identifies where each obligation must be implemented. A constrained endpoint may log bounded decision metadata while a backend aggregates subgroup metrics, stores audit evidence, and serves explanations. An offline endpoint instead needs a defined evidence-retrieval and update path, or an operating envelope that does not depend on unavailable controls. Device capacity limits placement and frequency; it does not by itself remove the fleet operator’s responsibility to provide the control.

Tier placement decides where a control runs; it does not decide which control a defect needs. As the hiring case at the start of the chapter showed, predictive accuracy on historical labels does not establish that the target is legitimate. Threshold postprocessing can change a decision-rate disparity, while an unsuitable target may require changes to labels and training, and both need validation and operational ownership.

The principle sections that follow, beginning with fairness in section 16.5, share one structure. Within each principle the methods do one of three jobs. Detection exposes a problem early enough to intervene, mitigation changes data, training, or decision policy to reduce the harm, and validation assembles the evidence a launch authority needs to accept the remaining risk. Each job carries its own cost in accuracy, computation, and implementation effort.

16.4.2 Computational overhead of responsible AI techniques

Adding seven-step adversarial training multiplies batch compute roughly eightfold, and running model-agnostic SHAP attributions on every request can multiply inference work by hundreds or thousands of evaluations. Detection, mitigation, validation, privacy, and explanation techniques each impose a distinct cost on training, inference, memory, and accuracy (table 5). Reading the table first lets engineers evaluate responsible AI methods as concrete capacity choices rather than as costless ethical labels.

Table 5: Performance Impact of Responsible AI Techniques: The table gives planning ranges for capacity exercises rather than universal benchmark results. Differential privacy and fairness constraints mainly affect training and validation budgets; explainability cost depends on the value function and algorithm: model-agnostic subset enumeration grows combinatorially, sampled kernel methods require repeated evaluations, and model-specific TreeSHAP can compute exact attributions in polynomial time under its tree and value-function assumptions. The differential-privacy accuracy range runs from fine-tuning a publicly pretrained model (low end) to training from scratch on a small image dataset (high end), the two regimes whose published private accuracies are compared in Quantifying the privacy-utility trade-off. Adversarial training is shown as a multiple of standard training cost because each step first generates an attack; a seven-step attack costs about eight passes per batch. These sizing ranges help engineers reason about production constraints before choosing a responsible-AI implementation.
Technique Accuracy loss Training overhead Inference cost Memory overhead
Differential Privacy (DP-SGD) 1–20% 30–300% Minimal 10–20%
Fairness-Aware Training 1–3% 5–15% Minimal 5–10%
Sampled KernelSHAP N/A N/A 50–200% 20–100%
Exhaustive SHAP Enumeration N/A N/A 50–1,000× 50–200%
Adversarial Training 3–15% 2–11× Minimal 50–100%
Federated Learning 5–15% 200–500% Minimal 100–300%

These overhead ranges should be read as scenario assumptions, not as claims that any cited paper establishes a single universal overhead.5 Actual overhead varies significantly based on model architecture, dataset size, attack strength, explanation method, hardware, communication pattern, and implementation quality. Responsible-AI controls consume real training, serving, memory, or review capacity, so they must be budgeted before launch. An organization unable to afford one configuration must assess alternatives such as a smaller model, sampled audits, or asynchronous explanations against the same required evidence. Resource limits can restrict the feasible deployment scope; they do not remove the obligation. Who can afford which configuration is therefore an equity question as well as a capacity question.

5 Measurement context: The sizing exercise assumes common production reference points such as GPU training, GPU or CPU inference, image/text/tabular models, and benchmark datasets. These figures are not canonical constants; they are order-of-magnitude planning anchors for deciding whether a safeguard belongs inline, asynchronous, offline, or in the training pipeline.

16.4.3 Resource requirements and equity implications

A municipal clinic or school district operating on a tight computing budget cannot afford to double its training cluster for differential privacy or provision extra GPU replicas for real-time Shapley explanations. Each cell of table 3 is work that someone must pay for: representative sampling needs data acquisition, subgroup metrics need labeled evaluation data and analysis capacity, and user-facing explanations need serving capacity. When smaller organizations cannot fund every safeguard in the table, the people they serve receive fewer protections than the users of a better-resourced deployment. Large-scale deployments that depend on accelerator clusters and low-latency connectivity can likewise exclude users whose networks or devices cannot meet those assumptions.

The costs in table 5 set how high these barriers are, and they are paid in energy as well as capacity. Model-specific algorithms, approximation, caching, and selective generation change that cost; asynchronous execution moves work off the request path without eliminating it. A high-traffic system serving these features to 10 million users must budget the work on the paths where it runs, then determine whether existing capacity is sufficient or additional resources are needed.

Infrastructure placement adds two further distributional effects. Data-center siting decisions that optimize power cost and latency can concentrate local environmental costs on nearby communities that had little say in the decision.6 Connectivity also affects access to safeguards. A user-facing explanation that requires a low-latency round trip to a data center may miss its delivery deadline on a slow network, whereas server-side fairness monitoring can analyze recorded decisions without another user round trip. The architecture must distinguish immediate user needs from audit work that can run asynchronously. Computational equity therefore depends on placement decisions as well as algorithmic design, and the assurance case should record these distributional effects alongside the model’s group metrics.

6 Data center environmental justice: Data center siting can place backup diesel generators, cooling heat, and grid strain near communities that had little say in the siting decision; the distributional effect must be measured site by site rather than assumed.

Computational costs and architectural constraints determine which controls a deployment can sustain. Preventive requirements guide design before harm occurs; detection then tests whether observed behavior remains within those requirements. Effective correction needs evidence of the problem, an investigation path, and an owner able to act.

Self-Check: Question
  1. Why do resource-constrained TinyML deployments emphasize validated local safety envelopes and lightweight checks rather than continuous on-device SHAP explanations or large rolling fairness analyses?

    1. Tight compute, memory, power, and connectivity budgets limit heavy runtime analysis; local checks must be paired with fleet or servicing evidence and a defined update or retirement path.
    2. Because TinyML devices execute exclusively on cloud tensor processing units where telemetry logging is prohibited by law
    3. Because embedded C++ compilers automatically convert nonlinear deep neural networks into linear decision trees
    4. Because differential privacy guarantees are mathematically impossible on 32-bit microcontroller registers
  2. Why does federated learning across mobile devices make group-level fairness auditing substantially more difficult than in centralized cloud architectures?

  3. Order the following engineering actions for embedding responsible AI constraints across the ML lifecycle from earliest to latest development phase: (1) In-processing bias-aware loss constraints and DP-SGD noise injection, (2) Representative sampling and consent collection protocols, (3) Decision threshold policy calibration and human override routing, (4) Subgroup drift telemetry and rolling metric alerting, (5) Group-level disaggregated metric evaluation and stress testing.

See Answers →

16.5 Fairness and Bias Mitigation

A loan model can approve 70 percent of one group’s applicants and 40 percent of another’s while reporting a single headline accuracy. Exposing that gap, deciding which gap the deployment must close, and keeping it visible after launch are separate engineering tasks. Formal criteria define the disparity, statistical tests decide whether it exceeds sampling noise, and monitoring infrastructure tracks it in production.

16.5.1 Fairness in machine learning

Automated decisions in hiring, lending, and healthcare affect millions of people, and historical data used to train these systems encodes decades of structural inequality. The engineering question is how to formalize “equitable treatment” in a way that a system can measure and enforce.

Definition 16.2: Algorithmic fairness

Algorithmic fairness is a family of criteria for evaluating equitable treatment and outcomes in automated decisions. The group-based criteria developed here compare selection rates, errors, or score meaning across protected demographic groups; individual and causal criteria ask different questions.

  1. Significance: Formal criteria make competing fairness goals measurable. Selection-rate or error-rate constraints can change predictive accuracy, while group-specific calibration asks whether predicted probabilities match observed outcome frequencies within each protected group. The trade-offs depend on the criterion, data, and decision policy. Satisfying one criterion does not establish equitable treatment by itself.
  2. Distinction: Unlike average accuracy, which can hide subgroup disparities, group fairness examines the joint distribution of predictions and outcomes within each group, \(\ProbabilityFunction(\PredictedDecision,\TrueOutcome\mid \ProtectedGroupMembership)\). The chosen criterion determines which conditional rates to compare; a group gap diagnoses that metric rather than fairness as a whole.
  3. Common pitfall: A frequent misconception is that there is a single “fair” solution. In reality, fairness requirements can conflict under specified assumptions. The simplest conflict pairs demographic parity with equalized odds, both defined below. With unequal base rates (the fractions of actual positive cases within groups), the two can hold together only if each group’s true positive rate equals its false positive rate. The positive decision is then equally likely among actual positives and actual negatives, so it carries no information about the outcome. A constant classifier satisfies both; any informative classifier must give one up. A deeper result about calibrated scores follows the formal definitions.

Aggregate accuracy cannot reveal whether an automated system disproportionately disadvantages a protected group. Because these systems are trained on historical data, they can reproduce and amplify patterns of systemic bias embedded in that data. A widely studied example comes from the healthcare domain. An algorithm7 used to allocate care management resources in US hospitals was found to systematically underestimate the health needs of Black patients (Obermeyer et al. 2019). The model used healthcare expenditures as a proxy for health status, but due to longstanding disparities in access and spending, Black patients were less likely to incur high costs. As a result, the model inferred that they were less sick, despite often having equal or greater medical need. This case illustrates how seemingly neutral design choices such as proxy variable selection can yield discriminatory outcomes when historical inequities are not properly accounted for. Correcting an invalid proxy can improve alignment with the actual clinical goal. A separate engineering question is whether imposing a particular fairness constraint reduces accuracy on a fixed target. That scenario-specific reduction, the fairness cost, is priced in section 16.5.3 once the criteria and the decision thresholds that enforce them have been defined.

7 Healthcare algorithm scale: The study examined one widely used algorithm in a broader class of risk-prediction tools that industry estimates placed at approximately 200 million U.S. patients annually (Obermeyer et al. 2019). In the study’s simulated correction at the automatic-enrollment threshold, the fraction of Black patients among those identified for additional care rose from 17.7 percent to 46.5 percent. These are shares of the selected population, not the fraction of all Black patients identified or a measured nationwide enrollment reduction.

Obermeyer, Ziad, Brian Powers, Christine Vogeli, and Sendhil Mullainathan. 2019. “Dissecting Racial Bias in an Algorithm Used to Manage the Health of Populations.” Science 366 (6464): 447–53. https://doi.org/10.1126/science.aax2342.

Evaluating these risks requires formal criteria, defined in full below; the release gates of Fairness gates enforce two of them, demographic parity and equalized odds, as thresholds. Each criterion turns a different meaning of fairness (equal selection, equal error rates, equal opportunity for the qualified, or scores that mean the same thing in every group) into a conditional probability that a system can measure and enforce, so choosing a criterion is choosing which of those meanings the deployment must honor. Suppose a model \(\BinaryClassifier(\ModelInput)\) predicts a binary outcome, such as loan repayment, and let \(\ProtectedGroupMembership\) represent a sensitive attribute with subgroups \(\FirstComparedGroupLabel\) and \(\SecondComparedGroupLabel\). Three widely adopted group criteria compare different conditional rates of that prediction.

Demographic parity

Definition 16.3: Demographic parity

Demographic parity is the fairness constraint where a model’s positive prediction rate is independent of group membership \((\Pr(\BinaryClassifier(\ModelInput)=1 \mid \ProtectedGroupMembership=\FirstComparedGroupLabel) = \Pr(\BinaryClassifier(\ModelInput)=1 \mid \ProtectedGroupMembership=\SecondComparedGroupLabel))\).

  1. Significance: It requires equal positive prediction rates across groups, regardless of underlying base-rate differences. It does not require identical outcomes for every individual, and it is not universally more restrictive than error-rate or calibration criteria.
  2. Distinction: Unlike equalized odds (which focuses on error rates such as false positives), demographic parity focuses only on the final prediction, ignoring the relationship between the prediction and the ground truth.
  3. Common pitfall: A frequent misconception is that demographic parity ensures “fairness.” Equal approval rates can coexist with unequal error rates. Changing decision thresholds can alter who receives approval without changing the underlying scores or their calibration; the resulting decisions and the meaning of the scores require separate evaluation.

Demographic parity asks whether favorable outcomes, such as loan approval or treatment referral, occur at equal rates across subgroups defined by a sensitive attribute \(\ProtectedGroupMembership\). Formally, the model satisfies demographic parity if: \[ \Pr\big(\BinaryClassifier(\ModelInput) = 1 \mid \ProtectedGroupMembership = \FirstComparedGroupLabel\big) = \Pr\big(\BinaryClassifier(\ModelInput) = 1 \mid \ProtectedGroupMembership = \SecondComparedGroupLabel\big) \]

In the healthcare example, this criterion would ask whether Black and white patients were referred for care at the same rate, regardless of their underlying health needs. That may sound like equal access, but it ignores real differences in medical status and risk, potentially overcorrecting when needs are not evenly distributed. The limitation of ignoring base-rate differences motivates error-rate-based fairness criteria.

Equalized odds

Equalized odds requires that the model’s predictions are conditionally independent of group membership given the true label. Specifically, the true positive and false positive rates must be equal across groups: \[ \Pr\big(\BinaryClassifier(\ModelInput) = 1 \mid \ProtectedGroupMembership = \FirstComparedGroupLabel, \TrueOutcome= \TrueOutcomeLevel\big) = \Pr\big(\BinaryClassifier(\ModelInput) = 1 \mid \ProtectedGroupMembership = \SecondComparedGroupLabel, \TrueOutcome= \TrueOutcomeLevel\big), \quad \text{for } \TrueOutcomeLevel \in \{0, 1\}. \]

That is, for each true outcome \(\TrueOutcome= \TrueOutcomeLevel\), the model should produce the same prediction distribution across groups \(\ProtectedGroupMembership = \FirstComparedGroupLabel\) and \(\ProtectedGroupMembership = \SecondComparedGroupLabel\). Equalized odds equalizes conditional error rates, not error counts; groups with different numbers of positive or negative cases can still experience different numbers of errors. Applied to a binary medical referral decision, this criterion requires equal referral rates across racial groups separately among patients who need the intervention and among those who do not, according to the chosen label \(\TrueOutcome\).

Equality of opportunity

Equality of opportunity is a less stringent relaxation of equalized odds that focuses only on the true positive rate (Hardt et al. 2016). It requires that, among individuals who should receive a positive outcome, the probability of receiving one is equal across groups: \[ \Pr\big(\BinaryClassifier(\ModelInput) = 1 \mid \ProtectedGroupMembership = \FirstComparedGroupLabel, \TrueOutcome= 1\big) = \Pr\big(\BinaryClassifier(\ModelInput) = 1 \mid \ProtectedGroupMembership = \SecondComparedGroupLabel, \TrueOutcome= 1\big). \]

Equality of opportunity equalizes the approval rate among qualified individuals, who have \(\TrueOutcome= 1\), across groups. It does not require identical decisions for every pair of qualified individuals or constrain errors among unqualified applicants.

In medical referral, this measure would require equal identification rates across racial groups among patients labeled as needing the intervention. Both error-rate criteria inherit whatever the label \(\TrueOutcome\) measures, which is the lesson of the healthcare case. A model trained to predict expenditure could equalize its error rates against expenditure and still misallocate care, because expenditure is not need. The cited study measured illness burden at a given risk score rather than group error rates, so it cannot itself be scored against these criteria. The loan scenario that follows supplies the binary labels and decisions needed to calculate all three on one model, and it becomes the section’s running example.

Napkin Math 16.1: Calculating fairness metrics
Problem: Calculate demographic parity across two demographic groups (100 applicants each) for a loan approval model.

Variables:

  • Group A: 70 approved (40 repaid, 30 defaulted), 30 rejected.
  • Group B: 40 approved (30 repaid, 10 defaulted), 60 rejected.

Math:

  1. Group A approval rate: \(\Pr(\BinaryClassifier(\ModelInput) = 1 \mid \ProtectedGroupMembership = \FirstComparedGroupLabel) = \frac{70}{100} = 0.70\).
  2. Group B approval rate: \(\Pr(\BinaryClassifier(\ModelInput) = 1 \mid \ProtectedGroupMembership = \SecondComparedGroupLabel) = \frac{40}{100} = 0.40\).
  3. Parity gap: \(0.70 - 0.40 = 0.30\) (30 percentage-point gap).

Systems insight: Evaluating demographic parity exposes group approval rate disparities regardless of ground-truth repayment capability, requiring explicit metric selection during model threshold calibration.

The next calculation assumes that repayment labels are also known for rejected applicants. Among the rejected applicants in Group A, five would repay and 25 would default; in Group B, 20 would repay and 40 would default. These are hypothetical evaluation labels. A production lender ordinarily observes repayment only for approved loans, so estimating the same error rates requires additional evidence about rejected applicants and an account of how that evidence was obtained.

Napkin Math 16.2: Calculating equality of opportunity
Calculating equality of opportunity (true positive rate [TPR]):

Among applicants who would actually repay (\(\TrueOutcome=1\)): \[\begin{gather*} \Pr(\BinaryClassifier(\ModelInput) = 1 \mid \ProtectedGroupMembership = \FirstComparedGroupLabel, \TrueOutcome = 1) = \frac{40}{40 + 5} = \frac{40}{45} \approx 0.89 \\ \Pr(\BinaryClassifier(\ModelInput) = 1 \mid \ProtectedGroupMembership = \SecondComparedGroupLabel, \TrueOutcome = 1) = \frac{30}{30 + 20} = \frac{30}{50} = 0.60 \end{gather*}\]

Disparity: \(0.89 - 0.60 = 0.29\) (29 percentage-point gap in TPR)

The model violates equality of opportunity. Among qualified applicants who would repay, Group A members are correctly approved 89 percent of the time while Group B members are only approved 60 percent of the time.

Calculating equalized odds (true positive rate [TPR] and false positive rate [FPR]):

The TPR values are calculated in the preceding step. For false positive rates among applicants who would not repay (\(\TrueOutcome=0\)): \[\begin{gather*} \Pr(\BinaryClassifier(\ModelInput) = 1 \mid \ProtectedGroupMembership = \FirstComparedGroupLabel, \TrueOutcome = 0) = \frac{30}{30 + 25} = \frac{30}{55} \approx 0.55 \\ \Pr(\BinaryClassifier(\ModelInput) = 1 \mid \ProtectedGroupMembership = \SecondComparedGroupLabel, \TrueOutcome = 0) = \frac{10}{10 + 40} = \frac{10}{50} = 0.20 \end{gather*}\]

The model also has unequal false positive rates. It incorrectly approves 55 percent of Group A applicants who will default, but only 20 percent of Group B applicants who will default. The model is therefore more lenient with Group A applicants who will not repay.

Systems insight: This model violates all three fairness criteria. Addressing one criterion does not automatically satisfy others. Whether they can all be satisfied together depends on base rates and prediction quality, the question the impossibility results below address.

Calibration

A fourth criterion concerns the score rather than the decision. A model satisfies score calibration with respect to a sensitive attribute if, among individuals assigned score \(\ModelScore\) by the model, the fraction with positive outcomes equals that score within each group (Kleinberg et al. 2017): \[ \Pr(\TrueOutcome= 1 \mid \ModelScore(\ModelInput) = \ModelScore, \ProtectedGroupMembership = \FirstComparedGroupLabel) = \ModelScore= \Pr(\TrueOutcome= 1 \mid \ModelScore(\ModelInput) = \ModelScore, \ProtectedGroupMembership = \SecondComparedGroupLabel), \quad \forall \ModelScore\]

The condition applies at score levels supported within each group. Matching the groups’ outcome frequencies is insufficient if those frequencies differ from the score itself. For hard binary predictions, a distinct condition is equal positive predictive value (PPV) (precision) among predicted positives. Groupwise score calibration does not by itself guarantee equal PPV after thresholding, because the selected groups can have different score distributions: \[ \text{PPV}(\FirstComparedGroupLabel) = \frac{\Pr(\TrueOutcome=1, \BinaryClassifier(\ModelInput)=1 \mid \ProtectedGroupMembership=\FirstComparedGroupLabel)}{\Pr(\BinaryClassifier(\ModelInput)=1 \mid \ProtectedGroupMembership=\FirstComparedGroupLabel)} = \text{PPV}(\SecondComparedGroupLabel) \]

Evaluating this condition on the loan-approval example yields the respective predictive values: \[\begin{align*} \text{PPV}(\FirstComparedGroupLabel) &= \frac{40}{70} = 0.571 \\ \text{PPV}(\SecondComparedGroupLabel) &= \frac{30}{40} = 0.750 \end{align*}\]

The positive predictive value gap is \(0.750 - 0.571 = 0.179\). Group B’s predicted positives are actually positive 75 percent of the time, while Group A’s are only 57 percent accurate. This violates predictive parity for hard decisions and reveals that the model is less reliable when predicting approval for Group A. Demonstrating score calibration itself would require comparing observed outcome frequencies with predicted probabilities within each group, using score bins with sufficient support. That check is essential in high-stakes decisions where people rely on predicted probabilities, because a miscalibrated model systematically over- or underpredicts risk for specific groups, misallocating resources and eroding trust.

Why the fairness criteria conflict

The loan model’s failure to satisfy every criterion raises a broader question about their compatibility. Its answer depends on base rates and prediction quality, and the definitions can conflict outright under deployment-specific conditions.8 A university admissions example makes the simplest conflict, the one previewed in the algorithmic-fairness definition, concrete before the broader calibration result (Kleinberg et al. 2017; Chouldechova 2017).

8 Fairness impossibility theorems: Kleinberg et al. (2017) studies groupwise score calibration together with balance of mean scores in each outcome class. Chouldechova (2017) studies predictive parity and error-rate constraints for recidivism prediction. These are distinct conditions; their incompatibility results require assumptions on base rates and predictive performance. Demographic parity is a distinct constraint on selection rates that can also conflict with calibration or error-rate goals in practice. The systems consequence is that no amount of engineering can satisfy every normative fairness criterion in all settings, so fairness becomes a constrained multi-objective optimization requiring explicit policy choices about which criterion to prioritize for a given deployment context.

Kleinberg, Jon, Sendhil Mullainathan, and Manish Raghavan. 2017. “Inherent Trade-Offs in the Fair Determination of Risk Scores.” 8th Innovations in Theoretical Computer Science Conference (ITCS 2017), Leibniz international proceedings in informatics (LIPIcs), vol. 67: 43:1–23. https://doi.org/10.4230/LIPIcs.ITCS.2017.43.
Chouldechova, Alexandra. 2017. “Fair Prediction with Disparate Impact: A Study of Bias in Recidivism Prediction Instruments.” Big Data 5 (2): 153–63. https://doi.org/10.1089/big.2016.0047.

Suppose a university admits only qualified applicants, and a larger fraction \(\FirstGroupQualifiedFraction\) of Group A’s applicants are qualified than the fraction \(\SecondGroupQualifiedFraction\) of Group B’s. Equal opportunity asks that the same fraction \(\QualifiedAdmissionRate\) of qualified applicants be admitted from each group, for example 80 percent of qualified Group A applicants and 80 percent of qualified Group B applicants. The overall admission rates are then \(\QualifiedAdmissionRate \FirstGroupQualifiedFraction\) and \(\QualifiedAdmissionRate \SecondGroupQualifiedFraction\), which differ whenever \(\FirstGroupQualifiedFraction\neq \SecondGroupQualifiedFraction\), so demographic parity fails; they match only at \(\QualifiedAdmissionRate= 0\). The no-unqualified-admissions rule fixes each group’s false positive rate at zero, so equal opportunity here coincides with equalized odds, and parity holds only when each group’s true positive rate also falls to zero. That is the definition’s condition (true positive rate equal to false positive rate) in concrete form. Relaxing the rule removes the conflict, because admitting some unqualified Group B applicants can raise Group B’s overall rate to Group A’s. Which constraint to give up is a value judgment about the decision, not a property the model can settle.

The fairness impossibility theorem (principle 26) is the canonical result, and it concerns scores rather than decisions. It joins the groupwise calibration of section 16.5.1.4 to score balance, which requires equal average scores across groups among people with positive outcomes and, separately, among people with negative outcomes. With unequal base rates and imperfect prediction, all three requirements cannot hold together (Kleinberg et al. 2017). The admissions conflict concerns decisions and this result concerns scores, so they constrain different criteria. The score result also does not say that a calibrated score can never meet equalized odds at a particular threshold; that is a third, narrower question. Satisfying one criterion may preclude another, so engineers must treat fairness metrics like latency budgets, explicit trade-offs chosen by stakeholders, enforced by the system, and monitored for violation. Determining which metric to prioritize requires careful consideration of the application context, potential harms, and stakeholder values as detailed in section 16.9.4.3. Whenever base rates differ and predictions remain imperfect, group calibration, positive-class score balance, and negative-class score balance converge on an infeasible joint state (figure 2).

Figure 2: Conditional Fairness Trade-Offs: For score-based prediction, calibration within groups and equal mean scores within both outcome classes cannot all hold with unequal base rates and imperfect prediction. Equal base rates or perfect prediction are exceptional cases. This score-balance theorem is distinct from checking equalized odds at one decision threshold.

The conflict persists as the classification threshold moves. For two groups with unequal base rates, every threshold from 0.15 to 0.85 leaves at least one of demographic parity, equalized odds, and equal opportunity substantially violated (figure 3). A threshold that reduces one measured gap need not minimize the others, so the policy must specify which criterion governs the decision and evaluate the remaining gaps.

Figure 3: Fairness Metric Disagreement Across Thresholds: Three fairness metrics, demographic parity, equalized odds, and equal opportunity, computed on synthetic scores for two groups with differing base rates as the classification threshold varies over a nontrivial operating range. At every evaluated threshold, at least one metric is substantially violated, illustrating practical trade-offs among selection-rate, error-rate, and opportunity criteria. Trivial always-positive or always-negative classifiers fall outside the evaluated range. The shaded region marks the largest of the three violations at each threshold.

Group metrics also leave open how an observed disparity arose, because a gap does not identify the mechanism that produced it. Causal analysis addresses that question through explicit assumptions.

Observational and causal fairness

The preceding metrics describe associations in observed decisions, such as group differences in selection rates, error rates, or calibration. They can establish a disparity without identifying the pathway that produced it. The same approval-rate gap could arise from direct use of a protected attribute, a correlated proxy, unequal access to an earlier process, measurement error, or an unobserved common cause. No comparison of observed rates alone distinguishes these mechanisms.

A causal claim adds a structural causal model whose arrows state how protected attribute \(\ProtectedGroupMembership\), mediators \(\CausalMediator\), outcome \(\TrueOutcome\), and decision \(\PredictedDecision\) are assumed to relate. Counterfactual fairness then asks whether the decision for the same individual, holding the modeled background factors fixed, would have changed in a counterfactual world where \(\ProtectedGroupMembership\) had taken another value (Kusner et al. 2017). This is a question about an assumed data-generating process, not a stronger version of demographic parity.

Kusner, Matt J., Joshua Loftus, Chris Russell, and Ricardo Silva. 2017. “Counterfactual Fairness.” Advances in Neural Information Processing Systems 30: 4066–76.
Nabi, Razieh, and Ilya Shpitser. 2018. “Fair Inference on Outcomes.” Proceedings of the AAAI Conference on Artificial Intelligence 32. https://doi.org/10.1609/aaai.v32i1.11553.

The healthcare proxy illustrates the distinction. A graph might include race \(\ProtectedGroupMembership \rightarrow\) access to care \(\CausalMediator_1 \rightarrow\) expenditure \(\CausalMediator_2 \rightarrow\) risk score \(\PredictedDecision\), alongside pathways from health need \(\TrueOutcome\) to expenditure. A total effect asks how changing \(\ProtectedGroupMembership\) propagates through every modeled path. A path-specific effect isolates selected routes, such as the historically mediated access-to-expenditure path (Nabi and Shpitser 2018). Declaring one path permissible and another discriminatory is a domain and normative judgment; neither the graph nor the estimator makes that choice automatically.

Causal conclusions require assumptions that observational data alone cannot establish: which variables and arrows belong in the graph, whether relevant confounders are measured, and whether the counterfactual interventions are coherent. Different plausible structures can support different answers. Causal analysis therefore complements group metrics, domain knowledge, legal analysis, and stakeholder participation. The metrics continue to monitor realized disparities; the causal model makes the additional mechanism claim and its assumptions inspectable.

16.5.2 Measuring disparity

A 30-point approval gap observed on 20 loan applications could be sampling noise, and a gender-classification audit that checks race and gender separately can report above 90 percent accuracy on both while missing a 34-point error gap on darker-skinned women. Turning a fairness criterion into evidence a launch authority can act on requires a point metric with a denominator and a confidence interval, coverage of the intersections where errors concentrate, and a governed choice of the criterion the deployment will be judged against.

Quantitative fairness measurement

Formal fairness criteria become operational only when practitioners can measure the degree of violation and establish actionable thresholds for intervention. The mathematical framework quantifies disparities and uncertainty; domain and policy owners must justify the acceptance criteria and authorize the response. A computed gap supplies evidence for that decision rather than deciding which harms are acceptable.

Four point metrics turn the fairness criteria introduced above into numbers an auditor can threshold. Each one equalizes a different quantity, so each exposes a different failure of the same classifier. On the running loan example (table 6), Group A is approved at 0.70 and Group B at 0.40, qualified-applicant true-positive rates are 0.89 and 0.60, and unqualified-applicant false-positive rates are 0.55 and 0.20.

Table 6: Fairness Metrics on the Loan Example: Four group-fairness metrics, each equalizing a different quantity, evaluated on the loan approval model. The disparate impact ratio is a descriptive selection-rate screen whose legal weight depends on the application; the additive differences are easier to track over time; the average absolute odds difference captures both true-positive and false-positive error gaps.
Metric Equalizes Formula \((\FirstComparedGroupLabel, \SecondComparedGroupLabel)\) Loan value Choose it when
Disparate impact (DI) ratio (four-fifths rule) (Feldman et al. 2015) lower approval rate divided by higher approval rate \(\dfrac{\min_\SubgroupIndex\Pr(\BinaryClassifier=1 \mid \SubgroupIndex)}{\max_\SubgroupIndex\Pr(\BinaryClassifier=1 \mid \SubgroupIndex)}\) \(\dfrac{0.40}{0.70} = 0.57\) a descriptive selection-rate screen is useful; legal interpretation depends on the application
Statistical parity difference (SPD) (Calders and Verwer 2010) additive gap in approval rates \(\Pr(\BinaryClassifier=1 \mid \FirstComparedGroupLabel) - \Pr(\BinaryClassifier=1 \mid \SecondComparedGroupLabel)\) \(0.70 - 0.40 = 0.30\) comparing across groups or tracking drift against a deployment-approved gap threshold
Equal opportunity difference (Hardt et al. 2016) true-positive rates among qualified applicants \(\Pr(\BinaryClassifier=1 \mid \FirstComparedGroupLabel, \TrueOutcome{=}1) - \Pr(\BinaryClassifier=1 \mid \SecondComparedGroupLabel, \TrueOutcome{=}1)\) \(0.89 - 0.60 = 0.29\) the harm is denying deserving individuals
Average absolute odds difference (Hardt et al. 2016; Bellamy et al. 2019; Bird et al. 2020) both true-positive and false-positive rates \(\tfrac{1}{2}\big[\,\lvert \FiniteChange\text{TPR}\rvert + \lvert \FiniteChange\text{FPR}\rvert\,\big]\) \(\tfrac{1}{2}[0.29 + 0.35] = 0.32\) both error types matter; the metric is 0 at perfect equalized odds
Feldman, M., S. A. Friedler, J. Moeller, C. Scheidegger, and S. Venkatasubramanian. 2015. “Certifying and Removing Disparate Impact.” Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 259–68. https://doi.org/10.1145/2783258.2783311.
Calders, Toon, and Sicco Verwer. 2010. “Three Naive Bayes Approaches for Discrimination-Free Classification.” Data Mining and Knowledge Discovery 21 (2): 277–92. https://doi.org/10.1007/s10618-010-0190-x.
Bellamy, Rachel K. E., Kuntal Dey, Michael Hind, Seung Hoffman, Sylvain Houde, Karthikeyan Kannan, Pradeep Lohia, et al. 2019. “AI Fairness 360: An Extensible Toolkit for Detecting and Mitigating Algorithmic Bias.” IBM Journal of Research and Development 63 (4/5): 4:1–15. https://doi.org/10.1147/jrd.2019.2942287.

The four metrics measure different quantities by construction. The disparate impact ratio of 0.57 means the lower-approval group receives approvals at only that fraction of the higher-approval group’s rate, below the illustrative 0.8 screening threshold. The additive 0.30 gap, the 0.29 opportunity gap, and the 0.32 average absolute odds gap each quantify a distinct dimension of the same disparity. No single number is sufficient, which is why the impossibility results of section 16.5.1.5 force an explicit choice about which metric a deployment will prioritize.

Statistical testing of fairness violations

Confidence intervals and hypothesis tests help assess whether sampling variation plausibly explains an observed disparity under a stated sampling model. For demographic parity, the null hypothesis \(\StatisticalHypothesis_0: \Pr(\BinaryClassifier(\ModelInput)=1 \mid \ProtectedGroupMembership=\FirstComparedGroupLabel) = \Pr(\BinaryClassifier(\ModelInput)=1 \mid \ProtectedGroupMembership=\SecondComparedGroupLabel)\) can be tested using a two-proportion z-test when observations are independent and expected approval and rejection counts in both groups support the normal approximation. Repeated decisions for the same person or correlated observations require an uncertainty estimate that accounts for that dependence. Under the independent-sample assumptions, the test statistic is: \[ \ProportionTestStatistic= \frac{\FirstGroupSampleApprovalRate- \SecondGroupSampleApprovalRate}{\sqrt{\PooledSampleApprovalRate(1-\PooledSampleApprovalRate)\left(\frac{1}{\FirstGroupSampleSize} + \frac{1}{\SecondGroupSampleSize}\right)}} \]

where \(\FirstGroupSampleApprovalRate\) and \(\SecondGroupSampleApprovalRate\) are the sample approval rates, \(\PooledSampleApprovalRate= \frac{\FirstGroupSampleSize\FirstGroupSampleApprovalRate+ \SecondGroupSampleSize\SecondGroupSampleApprovalRate}{\FirstGroupSampleSize+ \SecondGroupSampleSize}\) is the pooled proportion, and \(\FirstGroupSampleSize\), \(\SecondGroupSampleSize\) are sample sizes.

For the loan example with \(\FirstGroupSampleSize= \SecondGroupSampleSize= 100\), \(\FirstGroupSampleApprovalRate= 0.70\), \(\SecondGroupSampleApprovalRate= 0.40\): \[\begin{align*} \PooledSampleApprovalRate &= \frac{100(0.70) + 100(0.40)}{200} = 0.55 \\ \ProportionTestStatistic &= \frac{0.70 - 0.40}{\sqrt{0.55(0.45)(0.02)}} = \frac{0.30}{0.0704} = 4.26 \end{align*}\]

With \(\ProportionTestStatistic = 4.26\) (far exceeding critical value \(\ConfidenceCriticalQuantile = 1.96\)), the test rejects \(\StatisticalHypothesis_0\) and concludes the demographic parity violation is statistically significant at \(\ObservedSignificanceLevel < 0.001\). Similar tests can be constructed for equal opportunity and equalized odds by restricting to subpopulations where \(\TrueOutcome=1\) or \(\TrueOutcome=0\) respectively. Statistical significance does not establish the severity or acceptability of a disparity. Even a small rate difference can affect many people at fleet scale; the decision depends on the consequences and approved criteria as well as magnitude. Conversely, large disparities in small samples may not reach statistical significance but still warrant investigation or intervention.

Intersectional fairness

A 2-by-2 grid of skin tone by gender: lighter-skinned men 99.7 percent in the lightest gray cell, lighter-skinned women and darker-skinned men in gray cells that darken as accuracy falls, and darker-skinned women 65.3 percent in a red cell.

Error concentrates at the intersection: darker-skinned women.

Broad demographic categories can also hide disparities within their intersections. Standard fairness analysis often evaluates single axes of identity (for example, race or gender) independently, which can mask large disparities at the intersection of those attributes. For example, IBM’s gender-classification system achieved 99.7 percent accuracy for lighter-skinned men but only 65.3 percent for darker-skinned women in the Gender Shades evaluation (Buolamwini and Gebru 2018). A single-axis audit can obscure such an intersectional disparity. This phenomenon, sometimes called fairness gerrymandering, requires evaluating model performance on intersectional subgroups (for example, \(\text{Race}{\times}\text{Gender}\)) to detect and mitigate compounded biases.

Errors fell after the disparity was published. In August 2018, about six months after the Gender Shades results were published, Raji and Buolamwini (2019) repeated the audit on the same benchmark. Each of the three companies that had been named had reduced its error on darker-skinned women: IBM from 34.7 to 17.0 percent, Face++ from 34.5 to 4.1, and Microsoft from 20.8 to 1.5 (figure 4). Two systems the original audit had not named, from Amazon and Kairos, measured for the first time in 2018, misclassified 31.4 and 22.5 percent of darker-skinned women, comparable to the named systems’ 2017 levels. The study reports an association rather than a controlled effect, but it suggests that a specific, published intersectional audit can act as an operational lever as well as a measurement.

Figure 4: Audit and Re-audit: Gender-classification error by skin-type and gender subgroup on the Pilot Parliaments Benchmark, for the three systems named in the 2018 Gender Shades audit (measured in spring 2017, red) and in an August 2018 re-audit (blue), and for two systems first measured in the re-audit (blue only). Errors fell most for the darker-skinned women the audit had highlighted. Data from Buolamwini and Gebru (2018) (Table 4) and Raji and Buolamwini (2019) (Table 1).
Buolamwini, Joy, and Timnit Gebru. 2018. “Gender Shades: Intersectional Accuracy Disparities in Commercial Gender Classification.” Conference on Fairness, Accountability and Transparency, 77–91.
Raji, Inioluwa Deborah, and Joy Buolamwini. 2019. “Actionable Auditing: Investigating the Impact of Publicly Naming Biased Performance Results of Commercial AI Products.” Proceedings of the 2019 AAAI/ACM Conference on AI, Ethics, and Society, 429–35. https://doi.org/10.1145/3306618.3314244.

An intersectional audit must specify the population slices it can identify and the evidence available within them. Work on multicalibration extends calibration checks to a specified, potentially rich family of overlapping subgroups (Hébert-Johnson et al. 2018). This does not certify every possible subgroup or every fairness criterion. It motivates evaluation and monitoring infrastructure that can examine relevant intersections while reporting where sample support or attribute availability limits the claim.

Hébert-Johnson, U., M. P. Kim, O. Reingold, and G. N. Rothblum. 2018. “Multicalibration: Calibration for the (Computationally-Identifiable) Masses.” In Proceedings of the 35th International Conference on Machine Learning, ICML 2018, Stockholmsmässan, Stockholm, Sweden, July 10-15, 2018, edited by Jennifer G. Dy and Andreas Krause, vol. 80. Proceedings of Machine Learning Research. PMLR.

Choosing the governing criterion

The running loan example establishes how to measure a disparity and its sampling uncertainty. Applying that framework still requires identifying whether a positive decision grants a benefit or imposes a burden, checking the criteria a headline metric misses, and choosing the requirement that fits the deployment.

Napkin Math 16.3: Auditing a confusion matrix
Problem: A fraud detection model operates on two groups. What do demographic parity and equal opportunity reveal about the deployment?

Variables:

  • Group A (majority): \(\text{TP}=450\), \(\text{FP}=50\), \(\text{FN}=30\), \(\text{TN}=470\) (\(\AuditGroupRecordCount=1000\)).
  • Group B (minority): \(\text{TP}=180\), \(\text{FP}=70\), \(\text{FN}=120\), \(\text{TN}=630\) (\(\AuditGroupRecordCount=1000\)).

Math:

  1. Demographic parity (positive prediction rate): \(\Pr(\PredictedDecision=1)\).
    • Group A: \((450+50)/1000 = 0.50\).
    • Group B: \((180+70)/1000 = 0.25\).
    • Gap: 0.25. The lower-to-higher flag-rate ratio is \(0.25/0.50 = 0.5 < 0.8\). Fraud flags are adverse outcomes, so this descriptive ratio is not a four-fifths employment-selection test.
  2. Equal opportunity (TPR): \(\text{TP} / (\text{TP}+\text{FN})\).
    • Group A: \(450 / (450+30) = 0.938\).
    • Group B: \(180 / (180+120) = 0.60\).
    • Gap: 0.338. (Severe violation).

Systems insight: Here a positive prediction flags suspected fraud, rather than granting a benefit as in the loan example. Equalizing detection rates therefore requires weighing missed fraud against false accusations. Lowering Group B’s threshold may catch more fraud but can also increase false alarms; the score distributions are needed to quantify the effect on predictive parity.

The running loan model fails every criterion at once, which can suggest that a single headline metric would have caught it. A second hypothetical loan model, deliberately different from the running example, shows the opposite risk, in which one criterion is satisfied exactly while the others fail (table 7). Unlike the running model, whose false positive rates differ (0.55 against 0.20), this model approves would-be defaulters at the same 20 percent rate in both groups. Equalized odds would require both true positive rates and false positive rates to match, so the table shows the narrower case of false-positive-rate parity rather than full equalized odds, and because one fairness metric can appear satisfied while others expose substantial disparities, a deployment must decide in advance which criterion governs it.

Table 7: Disaggregated Fairness Metrics: A hypothetical loan approval system satisfies equalized false positive rates (0 percentage-point gap) but violates demographic parity (15 percentage-point approval gap) and equal opportunity (30 percentage-point TPR gap). Production systems must document the selected criteria and evaluate candidate policies against them.
Metric Definition A B Gap
Approval Rate (TP + FP) divided by total 55% 40% 15 pp
True Positive Rate TP divided by positives 90% 60% 30 pp
False Positive Rate FP divided by negatives 20% 20% 0 pp
Positive Predictive Value TP divided by predicted positives 82% 75% 7 pp

Example 16.1: Choosing a fairness metric
Scenario: A hiring recommendation engine must select its primary fairness constraint before production launch across heterogeneous applicant pools. The accountable reviewers prioritize equal access for qualified applicants and have independently validated qualification labels for both selected and rejected applicants.

Diagnosis: Demographic parity forces equal selection rates regardless of candidate qualification, while calibration requires predicted probabilities to match outcome frequencies within each group. Equal opportunity specifically mandates equal true positive rates among qualified applicants (\(\text{TPR}_\FirstComparedGroupLabel = \text{TPR}_\SecondComparedGroupLabel\)), directly matching the goal of equal opportunity for qualified talent.

Systems lesson: Metric selection is a governance decision that sets the operational objective of the serving pipeline. System designers must align the mathematical constraint with the domain’s legal and ethical requirements before training or thresholding.

The chosen fairness definition determines which error trade-off the system is allowed to make, so the choice precedes optimization against that criterion. A model can satisfy a specified fairness criterion, but responsibility depends on the system that uses it. Data collection, labels, modeling choices, evaluation procedures, and decision thresholds all affect the resulting outcomes. Postprocessing can repair a selected rate disparity without resolving an invalid target or an unsupported deployment. Privacy, explainability, robustness, and accountability likewise require evidence about the relevant pipeline, beyond properties of the weights. A fairness policy is therefore realized through coordinated data collection, evaluation, threshold policy, and monitoring across the lifecycle (table 3), and group-specific thresholds are one possible intervention within that policy, not a universal requirement.

The system boundary extends past the model’s decisions to the infrastructure that runs them, because who can reach the safeguards and who bears their environmental costs are distributional effects of the same system (section 16.4.3). Collecting the evidence creates a further constraint, because demographic attributes useful for auditing may also increase privacy exposure. Governance must justify both the fairness claim and the data practices used to support it.

16.5.3 Threshold setting and fairness trade-offs

When two applicant groups have different score distributions, applying a single 0.75 approval cutoff can approve 75 percent of qualified applicants in one group and only 25 percent in the other, while lowering one group’s cutoff to equalize opportunity gives two applicants with the same score different decisions. In practice, fairness metrics can be changed after training by adjusting classification thresholds per group. In the equations below, a larger score favors a positive decision, as with predicted repayment probability. Given a scoring function \(\DecisionScore(\ModelInput)\), define group-specific thresholds \(\FirstGroupClassificationThreshold\) and \(\SecondGroupClassificationThreshold\) such that \(\FirstGroupThresholdClassifier(\ModelInput) = \mathbb{1}[\DecisionScore(\ModelInput) \geq \FirstGroupClassificationThreshold]\) for group \(\FirstComparedGroupLabel\) and similarly for group \(\SecondComparedGroupLabel\).

To achieve demographic parity, solve: \[ \Pr(\DecisionScore(\ModelInput) \geq \FirstGroupClassificationThreshold\mid \ProtectedGroupMembership = \FirstComparedGroupLabel) = \Pr(\DecisionScore(\ModelInput) \geq \SecondGroupClassificationThreshold\mid \ProtectedGroupMembership = \SecondComparedGroupLabel) \]

To achieve equal opportunity, solve: \[ \Pr(\DecisionScore(\ModelInput) \geq \FirstGroupClassificationThreshold\mid \ProtectedGroupMembership = \FirstComparedGroupLabel, \TrueOutcome= 1) = \Pr(\DecisionScore(\ModelInput) \geq \SecondGroupClassificationThreshold\mid \ProtectedGroupMembership = \SecondComparedGroupLabel, \TrueOutcome= 1) \]

For equalized odds, both true positive and false positive rate constraints must hold simultaneously. A single deterministic threshold per group need not satisfy both. Postprocessing can instead randomize between threshold rules within each group to attain a shared pair of rates (Hardt et al. 2016). The resulting criterion constrains group-level probabilities, so validation must evaluate the randomized policy rather than only its component thresholds.

Hardt, Moritz, Eric Price, and Nathan Srebro. 2016. “Equality of Opportunity in Supervised Learning.” Advances in Neural Information Processing Systems (NeurIPS) 29: 3315–23.

Threshold adjustment still requires evaluating the other criteria. When base rates differ (that is, \(\Pr(\TrueOutcome=1 \mid \ProtectedGroupMembership=\FirstComparedGroupLabel) \neq \Pr(\TrueOutcome=1 \mid \ProtectedGroupMembership=\SecondComparedGroupLabel)\)), calibration and error-rate constraints can conflict under the conditions discussed earlier. The effect of a particular threshold policy must be measured on the joint score and label distribution; a base-rate difference alone does not determine its accuracy cost.

Two slope panels separated by a thin rule and drawn at the same scale, comparing a base policy with a parity policy. Top panel, labeled approval: a thin light-gray line labeled A stays flat at 80 percent while a heavy dark line labeled B rises from 60 to 80 percent. Bottom panel, labeled acc.: a dark line falls from 85 to 81 percent.

Lifting Group B’s approval rate to parity costs 4 points of accuracy.

The accuracy cost of a threshold policy becomes concrete on a separate credit model, distinct from the running loan example. Its score is a predicted default probability, so a lower score favors approval and each cutoff admits applicants below it. The scenario enforces demographic parity, the first threshold equation above, and prices the accuracy that enforcement costs.

Napkin Math 16.4: The fairness cost
Problem: Consider a credit model with 85 percent accuracy. Group A (majority) has a 20 percent default rate. Group B (minority) has a 40 percent default rate due to systemic factors. If demographic parity (equal approval rates) is enforced, what happens to accuracy?

Math:

This scenario holds Group A’s approval rate fixed and raises Group B’s rate to match it; demographic parity alone does not require that particular choice. The accuracy values are assumed held-out validation results, where the additional Group B approvals carry higher default risk.

  1. Unconstrained: Model approves everyone with predicted default prob < 30 percent.
    • Group A approval: 80 percent.
    • Group B approval: 60 percent.
    • Total Accuracy: 85 percent.
  2. Constrained (parity): Holding Group A’s rate fixed, approve Group B at 80 percent rate.
    • New threshold for Group B: Approve default prob < 50 percent.
    • The revised cutoff admits Group B applicants with higher predicted default risk than the original policy allowed.
    • New Total Accuracy: 81 percent.

Systems insight: This parity policy cost 4 percentage points of accuracy (about a 4.7 percent relative accuracy drop in this credit-scoring scenario). The drop is the fairness cost of this scenario, not a universal property of fairness constraints. Accuracy still measures prediction against the specified default labels; whether those labels capture the legitimate lending objective is a separate question. Engineers must report the predictive trade-off while making the target and policy assumptions explicit.

The 4 percentage points cost belongs to one parity policy on one prediction target. A different criterion moves the thresholds for a different reason, and the next scenario, which returns to the repayment-score convention, targets equal opportunity by comparing the score distributions among qualified applicants. Differential thresholds require access to sensitive attributes at inference time and raise concerns about explicit group-based treatment, which may itself be considered unfair or illegal in certain jurisdictions. The required thresholds depend on those distributions and the chosen criterion; a lower threshold for the minority group is not a universal fairness rule.

Napkin Math 16.5: Threshold for equal opportunity
Problem: Calculate group-specific thresholds required to equalize true positive rates (equal opportunity) across Group A and Group B in a credit scoring model.

Variables: Let the score \(\DecisionScore(\ModelInput)\) be an unbounded decision score, not a calibrated probability, and write Group A as \(\ProtectedGroupMembership=\FirstComparedGroupLabel\) and Group B as \(\ProtectedGroupMembership=\SecondComparedGroupLabel\). Assume \(\DecisionScore(\ModelInput)\mid(\TrueOutcome=1,\ProtectedGroupMembership=\FirstComparedGroupLabel)\sim\GaussianDistribution(0.72,0.15^2)\) and \(\DecisionScore(\ModelInput)\mid(\TrueOutcome=1,\ProtectedGroupMembership=\SecondComparedGroupLabel)\sim\GaussianDistribution(0.65,0.16^2)\). These are hypothetical positive-class distributions; no negative-class distribution or prevalence is specified.

Math:

  1. Single threshold: At \(\FirstGroupClassificationThreshold=\SecondGroupClassificationThreshold=0.60\), \(\text{TPR}_\FirstComparedGroupLabel=1-\StandardNormalCumulativeDistribution(-0.8)\approx0.788\) and \(\text{TPR}_\SecondComparedGroupLabel=1-\StandardNormalCumulativeDistribution(-0.3125)\approx0.623\), where \(\StandardNormalCumulativeDistribution\) is the standard normal cumulative distribution function.
  2. Equalizing thresholds: Preserve Group A’s threshold and match its standardized cutoff, \((\SecondGroupClassificationThreshold-0.65)/0.16=-0.8\). Thus \(\SecondGroupClassificationThreshold=0.522\) yields the same true positive rate.
  3. Unspecified costs: Lowering Group B’s threshold cannot decrease its false positive rate, but its magnitude requires \(\DecisionScore(\ModelInput)\mid(\TrueOutcome=0,\ProtectedGroupMembership=\SecondComparedGroupLabel)\). Precision also requires Group B’s prevalence. Neither quantity follows from the positive-class distributions alone.

Systems insight: Equal opportunity determines a threshold only relative to the stated score distributions and target rate. Before deployment, evaluate the resulting false positives, precision, and review workload on representative data. Threshold policies change decisions, not the underlying score calibration.

A separate illustrative loan scenario partitions applicants into Subgroup A (higher score distribution, blue band) and Subgroup B (lower score distribution, amber band), and the summary panels of figure 5 contrast two operating regimes. Applying a single global threshold (\(\ClassificationThreshold = 0.75\)) approves qualified applicants in Subgroup B at only 25 percent TPR compared to 75 percent for Subgroup A, a threefold opportunity disparity. Conversely, shifting to group-adapted thresholds (\(\FirstGroupClassificationThreshold= 0.75\) for Subgroup A and \(\SecondGroupClassificationThreshold= 0.45\) for Subgroup B) equalizes true positive rates at 75 percent. That policy requires the authorized decision component to access the relevant group attribute and log the governing threshold. Neither the attribute lookup nor the policy decision must run on the client, but the system must preserve evidence explaining why identical scores receive different decisions.

Figure 5: Threshold-Dependent Fairness: Varying classification thresholds across subgroups allows equal true positive rates but introduces complexity in model serving and requires access to sensitive attributes at inference time. Achieving fairness requires careful consideration of subgroup-specific performance, as a single threshold may disproportionately impact certain groups, highlighting the tension between accuracy and equitable outcomes in machine learning systems.

16.5.4 Fairness evidence across deployment tiers

A federated keyboard model running across millions of phones—the regime of Archetype C (Federated MobileNet)—never sends raw keystrokes or user demographic labels to the central server, so the fleet operator cannot simply run a SQL query to check whether next-word accuracy drops on a protected subgroup. Fairness presents a deployment problem whose binding constraint is data visibility. A cloud platform with authorized access to demographic labels and outcomes can compute group-level metrics, run fairness-aware training, and audit post-hoc. A federated9 or on-device deployment instead needs an explicit evidence path, such as aggregate client statistics or a separately governed audit sample. Without sufficient evidence, the corresponding metric is unmeasurable; local execution alone does not make the audit impossible. The evidence available for fairness analysis narrows from cloud to TinyML (fairness row of table 4), and two consequences of that narrowing recur across deployments.

9 Federated learning and fairness: Google’s public Gboard trial illustrated training across devices without centralizing raw examples (Hard et al. 2018). Model updates alone do not necessarily reveal the demographic labels and outcomes needed for a fairness audit, so the communication cost, privacy protection, and statistical uncertainty of whatever evidence path replaces them must be evaluated for that design.

Hard, Andrew, Kanishka Rao, Rajiv Mathews, Swaroop Ramaswamy, Françoise Beaufays, Sean Augenstein, Hubert Eichner, Chloé Kiddon, and Daniel Ramage. 2018. “Federated Learning for Mobile Keyboard Prediction.” arXiv Preprint arXiv:1811.03604.
Dwork, Cynthia, Moritz Hardt, Toniann Pitassi, Omer Reingold, and Richard Zemel. 2012. “Fairness Through Awareness.” Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, 214–26. https://doi.org/10.1145/2090236.2090255.

The first consequence concerns decision policy. Equal aggregate accuracy across groups does not establish equal opportunity under a uniform threshold, as the illustrative gap in figure 5 demonstrates. A deployment must select and evaluate a policy against its approved criterion; group-specific thresholds are one possible intervention, not a requirement imposed by edge execution. The second consequence sharpens the personalization conflict raised in section 16.4.1. Local adaptation aims to improve a user’s utility, whereas individual fairness requires similar individuals to receive similar decisions under a task-relevant similarity metric (Dwork et al. 2012). Personalization does not establish that requirement, and adaptation on sparse or unrepresentative observations can reinforce existing gaps. When the relevant evidence stays local, fleet operators need an authorized way to assess the resulting disparities. Section 16.9.4.1 analyzes the feedback mechanism and its intervention points; the deployment consequence is that a fleet which cannot centralize outcomes must budget an explicit evidence path for detecting it.

That evidence path creates a further responsible AI tension. Keeping sensitive data local reduces centralized exposure, while fleet-level audits still need adequate group statistics. Privacy architecture (section 16.6.2) determines which records or aggregates may cross the boundary and under what protections.

16.5.5 Bias detection and monitoring

Suppose a nationally deployed credit model begins rejecting applicants from a specific ZIP code at twice its previous rate. Monitoring can expose that change before a periodic audit, but the rate alone does not establish its cause. An investigator must check population changes, data quality, and decision policy against the approved fairness criteria. Bias detection turns formal definitions into operational telemetry, using slice-based analysis to identify subpopulations whose outcomes warrant examination.

Measurement costs and intervention points

The criteria of section 16.5.1 define what a disparity is and how to test one. Computing them continuously on a production system that serves thousands of predictions per second is where the engineering cost appears, and that cost has computational, data, and organizational parts that decide which metrics a system can afford to monitor.

Measurement overhead arises because computing group-specific metrics requires maintaining separate statistics for each protected group: for \(\MonitoredGroupCount\) groups and \(\MonitoredFairnessMetricCount\) metrics, this adds \(\mathcal{O}(\MonitoredGroupCount \MonitoredFairnessMetricCount)\) counters and \(\mathcal{O}(\MonitoredGroupCount \MonitoredFairnessMetricCount)\) statistical tests per evaluation cycle. Streaming counters can update cheaply per prediction while statistical tests run at a separate evaluation interval, so profiling the number of groups, windows, and tests, rather than request rate alone, determines whether sampling or asynchronous aggregation is needed. Those counters also depend on which fields the metric consumes, because error-rate criteria need outcome labels (\(\TrueOutcome\)) alongside sensitive attributes \((\ProtectedGroupMembership)\) across a sample that supports the intended population claim, whereas demographic parity needs group membership and decisions without outcomes. Availability of those sensitive attributes requires an explicit governance and engineering choice among authorized direct collection, restricted audit records, encrypted or differentially private group statistics, or an offline sample; when inferred attributes are used instead, the audit must evaluate inference errors rather than treat the inferred groups as known, and when the evidence cannot support a metric, the system must report that limitation rather than interpret missing measurements as fair behavior.

Selecting acceptable disparity thresholds then demands domain expertise and stakeholder input, since the four-fifths rule is a screening convention from U.S. employment selection rather than a universal legal test for lending or fraud detection, and thresholds must reflect context-specific harm assessments, statistical uncertainty, and documented legal rationale. Because distribution shift, feedback loops, or model updates can erode fairness over time, temporal stability further requires monitoring those thresholds across evaluation windows. Automated alerting (for example, “alert if \(|\text{SPD}| > 0.15\) for 7 consecutive days”) defines when an owner receives a signal; the persistence window reduces sensitivity to brief fluctuations at the cost of response delay, so its acceptability depends on the harm and exposure during that interval, as section 16.9.3 develops.

Offline and CI-stage audits are the first place these metrics run, and open-source toolkits such as Fairlearn package the per-group bookkeeping (Bird et al. 2020), as in the audit of listing 1. Applied to the running loan example, that audit’s per-group table would report approval rates of 0.70 for Group A and 0.40 for Group B, the disparate impact ratio of 0.57 that falls below the 0.8 screening threshold in table 6. That comparison is an audit signal, not a lending-law verdict. The architecture must supply aligned decisions and group membership through an authorized audit path. Metrics that require outcome labels must use the relevant observed outcomes rather than substitute past decisions; an offline audit does not require exposing group attributes throughout runtime serving.

Bird, Sarah, Miro Dudı́k, Richard Edgar, Brandon Horn, Roman Lutz, Vanessa Milan, Mehrnoosh Sameki, Hanna Wallach, and Kathleen Walker. 2020. “Fairlearn: A Toolkit for Assessing and Improving Fairness in AI.” Microsoft Technical Report MSR-TR-2020-32.
Listing 1: Bias Detection with Fairlearn: Illustrative audit excerpt for evaluating a loan-approval model across demographic groups. The excerpt assumes aligned arrays of observed outcomes, predictions, and demographic labels.
import numpy as np
from fairlearn.metrics import MetricFrame, selection_rate
from sklearn.metrics import accuracy_score, precision_score

def false_positive_rate(y_true, y_pred):
    y_true, y_pred = np.asarray(y_true), np.asarray(y_pred)
    negatives = y_true == 0
    if not negatives.any():
        return float("nan")  # No observed negatives: rate is unmeasurable.
    return ((y_pred == 1) & negatives).sum() / negatives.sum()

# Loan approval model evaluation across demographic groups
mf = MetricFrame(
    metrics={
        "approval_rate": selection_rate,
        "accuracy": accuracy_score,
        "precision": precision_score,
        "false_positive_rate": false_positive_rate,
    },
    y_true=loan_repaid_actual,  # observed repayment outcome, not past approval
    y_pred=loan_approvals_predicted,
    sensitive_features=applicant_demographics["ethnicity"],
)

# NaN means a group lacks negative examples, not that its FPR is zero.
# Display performance disparities across groups
print("Loan Approval Performance by Group:")
print(mf.by_group)
# Hypothetical output on the running loan example:
# approval_rate 0.70 for group A, 0.40 for group B

Where sensitive attributes are unavailable at inference time, as is common in mobile, federated, and embedded systems, group-specific thresholds may be infeasible. Restricted offline audits can still guide data changes, retraining, or a revised policy that does not require an attribute lookup on each request.

Fairness interventions may be applied at different points in the pipeline, but each comes with system-level implications. Preprocessing methods change the training distribution through sampling, reweighting, or augmentation. Their data requirements depend on the method; group-targeted reweighting needs group information, while feature augmentation also needs access to the affected examples. Versioning and lineage must preserve which transformation produced the training data. In-processing approaches instead embed fairness constraints directly into optimization. They require support for the chosen loss or constrained solver and may add training work or validation requirements.

↩︎ Feature versioning and the lineage records that trace each training input are established in Feature versioning and lineage.

At the serving layer, postprocessing methods apply an approved decision rule to model outputs. Group-specific thresholds require the component choosing the threshold to obtain authorized group information; other policy rules may use different inputs. The dual-threshold policy in figure 5 (\(\FirstGroupClassificationThreshold= 0.75\), \(\SecondGroupClassificationThreshold= 0.45\)) therefore needs a controlled attribute lookup and a record of the applied policy, but not propagation of the attribute through every routing and inference component. Access controls should limit that exposure. Validation must evaluate the resulting decisions, operational stability, and applicable restrictions on attribute use.

Multicalibration (section 16.5.2.3) can run in backend training infrastructure even when the resulting model serves on a constrained endpoint, but a training-time result does not establish calibration after deployment conditions change. If telemetry cannot support renewed subgroup audits, the operator must record that evidence limitation and restrict the approved operating envelope accordingly.

Mitigation also decays after launch. A fairness-aware model may degrade if retraining pipelines omit fairness checks, if logging cannot track subgroup outcomes, or if user feedback introduces biases absent from the training distribution, so retraining protocols need subgroup-labeled validation data under data-governance review. Deciding which disparity to remediate, and at what cost to other objectives, remains a stakeholder decision (section 16.9.4.3). The architecture’s job is to make each disparity visible, in time, to the owner who must make that decision.

Real-time fairness monitoring architecture

Implementing responsible AI principles in production systems requires architectural patterns that integrate fairness monitoring, explainability, and privacy controls directly into the model serving infrastructure. The infrastructure separates into two decoupled tiers (figure 6). A synchronous request path enforces access control, data minimization, and low-latency inference, while an asynchronous governance tier ingests bounded execution evidence and delayed labels to drive fairness auditing, post-hoc explanations, and owner-governed release gates.

Figure 6: Production Responsible AI Architecture: The request path performs access controls, minimization, and inference. Bounded evidence collection feeds asynchronous fairness monitoring and explanation services. Delayed outcomes support label-dependent metrics; a governed update path returns approved changes to serving.

The request path applies access controls and data minimization before inference and records only the evidence needed for the approved monitoring policy. Group-level fairness analysis and expensive explanations can run asynchronously; synchronous checks must fit the serving service-level objective (SLO). Delayed labels enter the analysis path when outcomes become available, and a named owner approves model or policy changes.

Real-time fairness monitoring updates prediction-only metrics such as demographic parity as decisions arrive, maintaining rolling statistics across protected groups. Label-dependent metrics such as equalized odds and equality of opportunity update when delayed outcomes or audited labels arrive. Groups whose labeled windows are too small must remain visible as having insufficient evidence, with a defined collection or escalation policy. The system flags supported disparities that exceed configured thresholds and separately reports gaps in coverage. Storage and compute requirements depend on the number of groups, decision segments, and retention windows.

The explanation engine generates evidence for the audience and decision under review. Its budget depends on the method and model; exact model-specific attribution may be feasible where exhaustive subset evaluation is not. Approximation, caching, selective generation, and asynchronous execution offer different cost and delivery-time trade-offs. The monitoring part of this architecture collects predictions and computes rolling group metrics with threshold alerts (listing 2). The listing omits delayed outcome ingestion, the full equalized-odds calculation, and explanation generation, so it is a partial implementation rather than a complete governance service.

Listing 2: Production Fairness Monitoring: Simplified monitoring pseudocode for processing predictions and computing rolling fairness metrics. Delayed outcome ingestion is omitted.
import numpy as np

class RealTimeFairnessMonitor:
    # alert_threshold mirrors the |SPD| > 0.15 rule; persistence check omitted.
    def __init__(self, window_size=1000, alert_threshold=0.15, min_group=30):
        self.min_group = min_group  # Illustrative policy; set from precision needs.
        self.window_size = window_size
        self.alert_threshold = alert_threshold
        self.window = []

    async def process_prediction(self, prediction, demographics,
                                 actual_label=None):
        # Slide a fixed window over the stream, then re-check fairness.
        self.window.append((prediction, demographics, actual_label))
        self.window = self.window[-self.window_size :]
        metrics = self._compute_metrics()
        if (metrics["demographic_parity"] is not None
            and metrics["demographic_parity"] > self.alert_threshold) or (
            metrics["equalized_odds"] is not None
            and metrics["equalized_odds"] > self.alert_threshold
        ):
            await self._trigger_bias_alert(metrics)
        return metrics

    def _compute_metrics(self):
        # Bucket predictions and labels by protected group.
        by_group = {}
        for pred, demo, label in self.window:
            bucket = by_group.setdefault(
                demo.get("ethnicity", "unknown"), {"preds": [], "labels": []}
            )
            bucket["preds"].append(pred)
            if label is not None:
                bucket["labels"].append((pred, label))

        rates = [np.mean(d["preds"]) for g, d in by_group.items()
                 if g != "unknown" and len(d["preds"]) >= self.min_group]
        parity = max(rates) - min(rates) if len(rates) > 1 else None
        return {
            "demographic_parity": parity,
            # Requires sufficiently labeled outcomes per group; omitted here.
            "equalized_odds": self._equalized_odds_gap(by_group),
            "groups": {g: len(d["preds"]) for g, d in by_group.items()},
            "eligible_groups": len(rates),  # Compare with required group coverage.
        }

    def _equalized_odds_gap(self, by_group): ...
    async def _trigger_bias_alert(self, metrics): ...  # page and audit

This simplified pattern separates metric availability from metric values, because an unavailable comparison is not a zero disparity. A production monitor must also enforce required group coverage, sample-size policies, and freshness before interpreting a result. The overhead ranges summarized in table 5 explain why fairness monitoring, privacy transformations, and explanation generation need explicit capacity budgets. Request metadata collection may be synchronous, while metric aggregation, delayed-label analysis, and explanation generation can run asynchronously under their own freshness requirements. These overheads must be balanced against reliability and compliance requirements when designing production systems.

A grid of 150 small gray squares labeled 150 metrics times 5 percent. Seven and a half squares are red, labeled about 7.5 false alerts per interval.

At a 5 percent false-alarm rate, 150 metrics raise about 7.5 spurious alerts per interval.

At the scale of a global production fleet, fairness monitoring becomes a substantial data engineering challenge. This sizing scenario assumes roughly 864 million inferences per day at 10,000 queries/s across 50 demographic subgroups, with 150 metrics (false positive rate, true positive rate, and calibration error for each of the 50 groups). A 1 percent sampling rate yields 8.64 million monitoring events daily. At an assumed 200 bytes per record, those events require approximately 1.7 GB per day before additional audit records or storage overhead. Actual record contents and retention follow the approved measurement and privacy requirements; outcome-dependent metrics also require labels that may arrive later. The monitoring infrastructure itself must therefore be reliable, secure, and cost-effective. With 150 active metrics, an illustrative per-metric false-alarm probability of 5 percent would yield roughly 7.5 false alerts per evaluation interval if every tested null hypothesis is true. This expected count follows by summing false-alarm probabilities and does not require independence. Production thresholds must instead reflect subgroup denominators, delayed labels, repeated testing, confidence intervals, minimum detectable effects, and correction for multiple comparisons. A threshold crossing opens an investigation; it does not by itself prove discrimination or justify automatic retraining.

↩︎ False alarms, the spurious threshold crossings that accumulate as a fleet multiplies monitored metrics, are established in The alert fatigue problem.

In C³ terms, this monitoring load is communication and coordination added to the fleet. Every sampled record must travel from a serving replica to the aggregation tier, and every alert must reach an owner who can act before the harm it signals compounds. The deployment tier sets how long that path is. A cloud service aggregates telemetry continuously, subject to storage and privacy budgets. An intermittently connected client keeps bounded local records until it next synchronizes, and a safety-critical edge system needs local checks that can trigger fallback within the decision deadline because the fleet cannot respond in time. A disconnected TinyML endpoint may deliver its evidence only at a servicing visit, and correcting its model may require a firmware update or physical replacement. Those differences change the evidence delay and remediation path, not the requirement to name an owner for each monitored obligation.

Checkpoint 16.1: Putting bias detection into production

The bias-detection and monitoring sections turned static fairness definitions into live telemetry: slice-based detection with Fairlearn, CI-stage audits, production monitoring of demographic parity and equalized odds, the evidence paths that federated and on-device deployments require, and the distinction between observing a disparity and remediating it.

Detecting the disparity

From signal to action

Self-Check: Question
  1. A loan approval model evaluates two demographic groups (Group A and Group B). Group A has a baseline approval rate of \(70\%\) (\(\text{PPV} = 57.1\%\)), while Group B has a baseline approval rate of \(40\%\) (\(\text{PPV} = 75.0\%\)). If the engineering team lowers the decision threshold for Group B to enforce demographic parity (\(70\%\) approval for both groups), what is the immediate system-level consequence?

    1. Group B’s positive predictive value increases while overall model accuracy remains completely unchanged
    2. Lowering the threshold admits additional applicants with lower predicted repayment scores; the effects on approval precision and overall accuracy must be evaluated rather than inferred from approval rates alone.
    3. The model automatically satisfies equalized odds without any change to false positive rates
    4. The underlying true default base rates of both populations become mathematically equalized
  2. For risk scores, the chapter’s score-balance impossibility result combines calibration within each group with equal mean scores across groups among positive outcomes and, separately, among negative outcomes. Which cases escape the stated incompatibility?

    1. Whenever the training dataset contains more than \(10^6\) balanced records across all demographic slices
    2. Whenever the model is trained with \(L_2\) regularization and post-hoc isotonic calibration
    3. Whenever demographic parity is explicitly enforced via multi-task adversarial training
    4. Only in degenerate or trivial cases, such as perfect prediction (zero error) or identical base rates across groups
  3. Explain how single-axis fairness audits can enable ‘fairness gerrymandering’ and describe the evaluation strategy required to detect it.

  4. Which statement correctly differentiates Preprocessing, In-processing, and Postprocessing fairness interventions with respect to ML system infrastructure requirements?

    1. Preprocessing modifies serving thresholds at inference, In-processing requires anonymizing logs, and Postprocessing alters training labels in feature stores
    2. All three methods require identical runtime compute overhead on the live model serving path
    3. Preprocessing is only applicable to TinyML devices, while In-processing and Postprocessing can only run in cloud clusters
    4. Preprocessing changes training data and needs lineage; in-processing changes training optimization; group-specific threshold postprocessing requires authorized group information at the component applying the decision rule.
  5. A streaming loan-approval service records authorized group attributes and decisions immediately, but repayment outcomes arrive months later. Why can demographic-parity statistics update earlier than equalized-odds statistics?

    1. Demographic Parity depends only on model predictions and input demographics available at inference time, whereas Equalized Odds requires true outcome labels that arrive with substantial real-world latency
    2. Demographic Parity requires calculating matrix inverses that execute faster on GPU tensor cores
    3. Equalized Odds is a convex optimization problem that cannot be evaluated on streaming CPU worker nodes
    4. Demographic Parity violates privacy regulations if processed asynchronously in background databases
  6. A production ML fleet serving 864 million daily inferences tracks 150 distinct subgroup fairness metrics. With an unadjusted per-metric false alarm rate of \(5\%\), the system experiences roughly 7.5 false alerts per evaluation interval. Explain the operational consequence of this false alarm volume and describe how the monitoring architecture should mitigate it.

See Answers →

16.6 Privacy and Data Governance

Every fairness audit and monitor consumes demographic evidence, and that evidence is itself sensitive data. The threat models and privacy mechanisms of Security & Privacy provide the technical controls; governance defines the evidence, ownership, and lifecycle interfaces that production systems require when inheriting them. A deletion workflow must identify which records and derived artifacts fall within an applicable obligation, such as an erasure requirement under the GDPR (European Parliament and Council of the European Union 2016). Removing a database row may leave replicas, backups, or trained models to address. Where removal of training influence is required, lineage, retraining, validation, deployment, and audit become part of the same workflow.

Governing these risks coordinates two classes of control that are easy to conflate. Privacy mechanisms bound specified information exposures, while machine unlearning (section 16.6.4) targets the influence a record retains in trained weights under a stated removal criterion. A privacy guarantee does not by itself remove a record from the training history, so the assurance case must distinguish these obligations and supply evidence for each. Robustness and generative-system controls receive the same evidence-and-ownership treatment in section 16.8.

16.6.1 Core data governance principles

A fairness audit may need the same demographic field that a data-minimization policy would otherwise exclude. Privacy mechanisms constrain exposure and leakage; governance determines whether collecting the field is justified, who may use it, and how long the audit needs it. This decision connects privacy to fairness (section 16.5.1) and to transparency (section 16.7.1). Group-based monitoring needs evidence about group membership, but the audit design determines whether operators receive individual fields, restricted audit records, or aggregate statistics. Explainability methods can also reveal information about training examples, while detailed disclosure can conflict with individual privacy. Responsible AI systems must justify the evidence collected and limit its exposure while retaining enough information to evaluate the chosen requirements.

↩︎ Federated learning, encrypted computation, and synthetic data, each bounding who can observe raw records, are established in Privacy-preserving data techniques.

Carlini, N., F. Tramer, E. Wallace, M. Jagielski, A. Herbert-Voss, K. Lee, A. Roberts, et al. 2021. “Extracting Training Data from Large Language Models.” 30th USENIX Security Symposium (USENIX Security 21), 2633–50.

Because training and personalization rely on personal data, privacy is a design constraint across the whole system lifecycle, and its central difficulty is the tension between data utility and individual protection. Rich, high-resolution datasets can enhance model accuracy and adaptability but also heighten the risk of exposing sensitive information, particularly when datasets are aggregated or linked with external sources. For example, large language models trained on broad text corpora have been shown to memorize specific strings that can later be retrieved through model queries or adversarial prompting (Carlini et al. 2021).

↩︎ The GPT-2 extraction attack, which recovered verbatim training records through ordinary generated outputs, is established in GPT-2 data extraction case study.

Privacy risks also depend on how records are linked over time and across sources. A wearable device’s heart-rate or location record can already be sensitive; combining physiological and behavioral signals can reveal additional details about a user’s health, routines, or relationships. Limited visibility or control over processing, retention, and transmission makes it harder for users to understand or contest these uses.

Addressing these challenges requires understanding privacy as a system principle that entails robust data governance. This includes defining what data is collected, under what conditions, and with what degree of consent and transparency. Foundational data engineering practices, including data validation, schema management, versioning, and lineage tracking, provide the technical infrastructure for implementing these governance requirements. Responsible governance requires attention to labeling practices, access controls, logging infrastructure, and compliance with jurisdictional requirements. These mechanisms serve to constrain how data flows through a system and to document accountability for its use.

Weak data governance can obscure both quality defects and privacy exposures, but they require different evidence. In clinical applications, missing values or demographic skew can compromise predictive performance; neither alone establishes a privacy violation. Privacy assessment must also examine identifiability, access, and disclosure. Documentation should make these distinct risks traceable to the data practices that create them.

Privacy is not solely the concern of isolated algorithms or data processors; like fairness, it must be addressed as a structural property of the system. Decisions about consent collection, data retention, model design, and auditability all contribute to the privacy posture of a machine learning pipeline. This requires anticipating risks during inference and continuous operation as well as during training. Threats such as membership inference, which infers from a deployed model’s outputs whether a record was in its training set, show why privacy safeguards must be embedded in both model architecture and interface behavior.

↩︎ Membership inference, its mechanism, and why an empirical audit gives only a lower bound on leakage are established in Membership inference.

10 CCPA (California Consumer Privacy Act): CCPA grants California residents rights over covered personal information, including a deletion right subject to statutory exceptions (California Legislature 2023). For ML serving infrastructure, deletion requests create an architectural constraint that must be planned from the data pipeline forward, because raw-record deletion does not automatically remove a record’s influence from trained model parameters.

California Legislature. 2023. California Consumer Privacy Act of 2018. California Legislative Information.
Personal Information Protection Commission, Japan. 2023. Act on the Protection of Personal Information. Personal Information Protection Commission, Japan.

Legal frameworks make privacy an enforceable design concern. The GDPR, the California Consumer Privacy Act (CCPA),10 and Japan’s Act on the Protection of Personal Information establish different obligations and individual rights within their respective scopes (European Parliament and Council of the European Union 2016; California Legislature 2023; Personal Information Protection Commission, Japan 2023). An implementation must identify which rules govern its collection, use, retention, and removal of data rather than treating consent or deletion as a uniform requirement across jurisdictions. That applicability decision belongs in the system’s documented data-governance requirements.

Privacy mechanisms limit specified data exposures under their threat models; they do not establish that a system’s decisions are safe. A model may satisfy its privacy requirements while still failing catastrophically on unexpected inputs, a complementary concern about how systems fail that section 16.8 takes up. Within privacy itself, the next decision is where the protected boundary sits in each deployment architecture.

16.6.2 Privacy across deployment tiers

Training a model with differential privacy does nothing to protect a user whose raw prompt is copied into a plaintext serving log at the API gateway, while keeping raw records on a phone protects against central database breaches at the cost of hiding fleet-wide telemetry from operators. Privacy inherits the same centralization trade-off across deployment tiers (privacy row of table 4). Aggregating data in the cloud enables high-capacity modeling and monitoring but concentrates exposure to breaches and surveillance, so it must be paired with strong encryption, access control, and auditability. Keeping data local on mobile, federated, or TinyML clients reduces that central exposure but changes the evidence available to fleet operators. Privacy controls must cover local storage, outputs, telemetry, and update channels; an endpoint with no update path needs controls that remain valid for its approved service life.

The constraint the table cannot show is that privacy claims must name their boundary. Differentially private training bounds training-data leakage through the released model; ordinary inference on fixed weights remains within that post-processing guarantee. It does not protect new private inputs copied into service logs or unrelated private-data accesses. Interface design, retention rules, rate limiting, and access control address those separate exposures. Opaque data collection can also violate user expectations, making consent surfaces and clear disclosure part of the privacy architecture.

Federated training draws three such boundaries (figure 7). Raw records stay on the client, secure aggregation hides individual updates only under its collusion and dropout assumptions, and central differential privacy bounds what the released model reveals only if the curator that adds the noise is trusted. Each protection covers a different quantity against a different observer, so a claim about one says nothing about the others. The privacy unit, clipping rule, protocol assumptions, and composition across rounds define each guarantee (Bonawitz et al. 2017; Dwork and Roth 2014).

Bonawitz, Keith, Vladimir Ivanov, Ben Kreuter, Antonio Marcedone, H. Brendan McMahan, Sarvar Patel, Daniel Ramage, Aaron Segal, and Karn Seth. 2017. “Practical Secure Aggregation for Privacy-Preserving Machine Learning.” Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 1175–91. https://doi.org/10.1145/3133956.3133982.
Dwork, Cynthia, and Aaron Roth. 2014. “The Algorithmic Foundations of Differential Privacy.” Foundations and Trends® in Theoretical Computer Science, Foundations and trends in theoretical computer science, vol. 9 (3-4): 211–487. https://doi.org/10.1561/0400000042.
Figure 7: Privacy Boundaries in Federated Training: Each protection holds only at its own boundary. Raw records stay on clients, secure aggregation protects individual updates under its protocol assumptions, and central differential privacy bounds the released model relative to the specified privacy unit, provided the curator is trusted. Neither implies a universal ordering of privacy strength.

An architecture decides where the privacy boundary sits; the model decides how much crosses it. A service can keep raw records behind every access control and still release training data through the weights it serves, which is where the governance of privacy guarantees begins.

16.6.3 Governing privacy guarantees

A language model that regurgitates a patient’s phone number from its training set or a classifier whose confidence scores reveal whether a specific customer was in the training cohort leaks private data through authorized outputs even when no database is breached. Technical methods for privacy preservation aim to prevent data leakage, limit memorization, and uphold user rights such as consent, opt-out, and data deletion across data collection, model behavior, and user interaction.

Governing a privacy guarantee starts from the leaks that Leakage through authorized outputs develops. Because a model can memorize training records in images as well as text and reveal membership through its outputs, governance turns each leak into an audit obligation. A membership-inference audit must state the attacker access it assumes and reads only as a lower bound on leakage, so a formal bound has to come from the training mechanism.

For differential privacy, governance consumes the mechanism and accounting established in Differential Privacy. A differentially private stochastic gradient descent (DP-SGD) deployment must retain the clipping, noise, sampling, and composition configuration that supports its reported bound (Abadi et al. 2016). Reviewers then evaluate that bound alongside utility, subgroup performance, and the private-data accesses outside training. Naming the method is insufficient evidence for approving the complete service.

Abadi, M., A. Chu, I. Goodfellow, H. B. McMahan, I. Mironov, K. Talwar, and L. Zhang. 2016. “Deep Learning with Differential Privacy.” Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, CCS ’16, 308–18. https://doi.org/10.1145/2976749.2978318.

Differential privacy introduces system-level trade-offs on the path where private data is accessed. Training noise can reduce utility, and attempts to recover it through additional data or optimization steps must be evaluated with the resulting privacy accounting and compute cost. If training occurs centrally, those costs do not automatically become extra work for an edge device performing ordinary inference on the released model. Local training or local randomization places different demands on the device. Data minimization, retention limits, and access controls remain separate requirements; feature obfuscation alone provides no differential privacy guarantee.

Systems Perspective 16.1: The price of privacy
Training a large language model on sensitive messages with DP-SGD reduces training-data extraction risk, but the protection is priced in compute and accuracy.

With the neighboring relation and \(\PrivacyAdditiveSlack\) fixed, a smaller \(\PrivacyBudget\) gives a stronger bound, and every change that lowers it (more noise, a smaller sampling rate, fewer steps) tends to cost accuracy or extra training; Differential Privacy derives these effects and lists the accountant inputs a reproducible DP-SGD result must record. Those recorded inputs, not the \(\PrivacyBudget\) value alone, are what a governance review retains. The three configurations below are planning assumptions whose \(\PrivacyBudget\) values an external accountant would have to confirm, as the CIFAR-10 accountant inputs of DP-SGD accountant inputs for image classification illustrate. Read them for the direction of each trade. The stronger configuration doubles the noise multiplier of the weaker one but also trains for more epochs, and more steps by themselves raise \(\PrivacyBudget\); only the accountant can confirm that the extra noise more than offsets the extra steps.

Illustrative stronger-privacy configuration (assumed accountant result \(\PrivacyBudget=\) 1): The scenario assumes per-example gradients are clipped to norm \(\GradientClippingNorm= 1.0\), 40 percent of updates are affected by clipping, and the noise multiplier is \(\PrivacyNoiseMultiplier= 1.0\). It further assumes 3× more epochs, a training-cost increase from a GPT-3-scale baseline of $4.6M to approximately $13.8M, and an accuracy drop of 6 percent.

Illustrative weaker-privacy configuration (assumed accountant result \(\PrivacyBudget=\) 8): The scenario assumes a noise multiplier of \(\PrivacyNoiseMultiplier= 0.5\), training overhead of 30 percent, and an accuracy drop of 1 percent.

Illustrative weakest configuration (assumed accountant result \(\PrivacyBudget=\) 10): The scenario assumes less noise and less than 1 percent accuracy loss, with a weaker formal privacy bound than the other two configurations under otherwise comparable accounting assumptions.

These scenarios compare formal privacy bounds, utility, and training cost; none of those quantities alone establishes user trust. Once a fixed model has been trained with differential privacy, ordinary inference is post-processing and does not consume additional training-data privacy budget. Additional privacy loss must be accounted for when a postdeployment mechanism makes new accesses to private data or releases additional differentially private statistics. The key engineering decision is to document and account for every private-data access and communicate the resulting trade-offs to users and regulators.

Released datasets need a boundary of their own. A \(\Glyph{k}\)-anonymous release (De-identification and k-anonymity) hides each record among at least \(\AnonymitySetSize\) that share its quasi-identifiers, a property of a specified release rather than of one transformed request. Differential privacy likewise requires a defined release mechanism, neighboring relation, and privacy accountant; noise injection alone does not establish a guarantee.

Privacy enforcement also depends on infrastructure beyond the model itself. Data collection interfaces must support informed consent and transparency. Logging systems must avoid retaining sensitive inputs unless strictly necessary, and must support access controls, expiration policies, and auditability. Model serving infrastructure must be designed to prevent overexposure of outputs that could leak internal model behavior or allow reconstruction of private data. These system-level mechanisms require close coordination between ML engineering, platform security, and organizational governance.

Privacy must be enforced throughout the machine learning lifecycle. Retraining pipelines must respect the approved deletion and data-use policies. Monitoring should collect only the identifying information justified by its purpose, with access and retention controls appropriate to that information. Privacy-aware telemetry collection and protected per-user audit trails can support investigation and remedy without making sensitive records broadly available in logs or dashboards.

The privacy assurance case therefore spans the whole pipeline. The formal privacy accountant covers the private-data accesses in its stated mechanism; interface controls, retention policies, and access records support separate claims about the surrounding service. Keeping these claims distinct makes gaps visible when a model, telemetry path, or data source changes.

Privacy preservation techniques create complex sociotechnical tensions that extend well beyond technical implementation. Differential privacy mechanisms may reduce model accuracy in ways that disproportionately affect underrepresented groups, creating conflicts between privacy and fairness objectives. These challenges require ongoing stakeholder engagement as detailed in section 16.9.4.3, where organizations must navigate competing values around data control, personalization, and regulatory compliance. These privacy challenges become even more complex when considering the dynamic nature of user rights and data governance.

16.6.4 Machine unlearning

Deleting a user’s row from a production database after a GDPR erasure request leaves their influence intact inside a 175-billion-parameter model that was trained on last month’s snapshot. When the approved deletion policy also requires addressing retained model state, machine unlearning supplies a technical response. The requirement and the evidence of removal must be specified separately; retained influence alone does not establish that every deployment violates a deletion obligation.

Privacy preservation does not end at training time. In many real-world systems, users may have rights to revoke consent or request deletion of their data, even after a model has been trained and deployed (European Parliament and Council of the European Union 2016; California Legislature 2023). When the approved response requires removing training influence, the architecture must support the chosen method and its verification. An endpoint without sufficient data, training state, or compute may need a replacement model trained elsewhere; a device with the required resources may perform the work locally. Placement follows those requirements rather than the deployment label alone.

Full retraining requires access to the permitted remaining training data and a defined training procedure. Three update strategies differ in what they recompute and what removal they guarantee (figure 8). Retraining from scratch on the retained data, the training set with the forget set \(\ForgetDataset\) removed, supplies a reference for exact removal relative to that procedure. Gradient ascent on the forget set increases its loss through updates of the form \(\ModelParameters + \LearningRate \nabla \LossFunction\), but increased loss alone does not demonstrate removal. Sharded, isolated, sliced, and aggregated (SISA) training partitions data into isolated shards \(\SisaTrainingShard_1, \SisaTrainingShard_2, \SisaTrainingShard_3\) and aggregates their predictions. A deletion affects the constituent model trained on its shard; saved states before the affected slice can reduce the retraining work.

Figure 8: Model Update Strategies: Three approaches to removing a data point’s influence. Full retraining gives exact unlearning at the highest cost; gradient ascent provides an approximate update by maximizing loss on the forget set; and SISA training partitions data into shards so only the affected shard is retrained. The accompanying cost model quantifies the full-retraining and SISA cases.

Full retraining is a useful reference, but its feasibility depends on access to the permitted remaining data, the training procedure, and sufficient compute within the response deadline. A retention policy may remove data that retraining would need; a large training run may exceed the available budget. An alternative unlearning method must state its own data and state requirements rather than assume that avoiding full retraining also eliminates those dependencies.

Machine unlearning seeks to remove specified training influence without repeating the entire training run. Cao and Yang (2015) proposed converting suitable learning algorithms into a summation form, allowing a deletion to update the affected summaries and recompute the model. SISA instead localizes retraining to affected shards (Bourtoule et al. 2021). It still needs the retained data and training state required by that procedure. The removal claim must specify its reference and verification method; a loss increase on deleted examples is different evidence from retraining without them. Method selection therefore depends on retained state, model quality, operational cost, and the removal guarantee the deployment must support.

Cao, Yinzhi, and Junfeng Yang. 2015. “Towards Making Systems Forget with Machine Unlearning.” 2015 IEEE Symposium on Security and Privacy, 463–80. https://doi.org/10.1109/sp.2015.35.
Bourtoule, Lucas, Varun Chandrasekaran, Christopher A. Choquette-Choo, Hengrui Jia, Adelin Travers, Baiwu Zhang, David Lie, and Nicolas Papernot. 2021. “Machine Unlearning.” 2021 IEEE Symposium on Security and Privacy (SP), 141–59. https://doi.org/10.1109/sp40001.2021.00019.

Two-rung cost ladder on a log scale. Top rung, full retraining at 4.6 million dollars; bottom rung, SISA sharded unlearning at 46 thousand dollars, about 100× cheaper.

For one isolated erasure, SISA cuts retraining cost about 100 times; a daily batch that touches most shards erodes the saving.

Napkin Math 16.6: The cost of forgetting
A user requests erasure of personal data under GDPR Article 17 (“Right to Erasure”). This scenario assumes that the approved response includes removing its influence from a model trained on 1 TB of data; that model-removal requirement is a scenario premise, not a conclusion derived from invoking the article.

Baseline (full retraining): In this sizing scenario, a 175B-parameter model at GPT-3 scale retrains on 1,024 NVIDIA A100 (80 GB SXM4) GPUs (dense FP16 \(\PeakRate =\) 312 TFLOP/s per accelerator at an assumed model FLOPs utilization (MFU) of about 32 percent) for approximately 36 days at a cost of roughly $4.6M.

Engineering fix: SISA training partitions data into \(\SisaShardCount=\) 100 independent shards, training 100 sub-models. For one datum confined to one shard, the example retrains that shard (1 percent of data). Assuming cost and elapsed time scale linearly with the data fraction at the same resource allocation gives $46,000 and approximately 8.6 hours. This simplified estimate omits slicing, checkpoint storage, validation, and deployment overhead; it is not a measured GPT-scale SISA result.

Trade-off: The scenario assumes an accuracy drop of 3–7 percent; the cost calculation does not establish that quality result. Serving must evaluate and aggregate 100 sub-models, with latency depending on parallelism and aggregation. Batch removal cost depends on how many of the 100 shards are touched. If the 1,000 requests/day arrive independently and uniformly across shards, a daily batch is likely to touch nearly all of them, eroding the sharding-only saving. Concentrated requests, batching policy, and saved slice states change the work. The operating comparison must therefore include the request distribution and response deadline, rather than the shard count alone.

The motivation for machine unlearning is reinforced by regulatory frameworks. Deletion or erasure rights under laws such as GDPR, CCPA, and similar statutes in other jurisdictions can create pressure to account for personal data used in training (European Parliament and Council of the European Union 2016; California Legislature 2023). Machine unlearning is a technical strategy for reducing or removing a deleted record’s influence where model state itself may retain personal data, but the legal requirements are context-dependent and not a universal statutory command to retrain every model. High-profile incidents in which generative models have reproduced personal content or copyrighted data highlight the practical urgency of integrating deletion-aware mechanisms into responsible system design.

From a systems perspective, machine unlearning introduces nontrivial architectural and operational requirements. Systems must be able to track data lineage, including which datapoints contributed to a given model version. This often requires structured metadata capture and training pipeline instrumentation. Additionally, systems must support user-facing deletion workflows, including authentication, submission, and feedback on deletion status. Verification may require maintaining versioned model registries, along with mechanisms for testing the stated removal guarantee against its reference training procedure. These operations must span data storage, training orchestration, model deployment, and auditing infrastructure, and they must be robust to failure or rollback.

Resource-constrained deployments amplify these challenges further. A TinyML device may lack the compute needed for retraining while still accepting a replacement model trained elsewhere. Unlearning then requires fleet inventory, authenticated updates, and evidence that affected versions have been replaced or retired. If no update path exists, operators must plan for physical servicing or withdrawal; initial data minimization reduces exposure but does not erase influence already present in deployed weights. Even in cloud-based systems, unlearning must coordinate model replicas, snapshots, and logs.

The need to remove training influence should be assessed during architecture and policy design, when teams can still plan the required lineage, retained state, and update paths. Retrofitting those capabilities after deployment may require reconstructing provenance or rebuilding training infrastructure. The assurance case should specify which removal obligations apply, how the chosen method will be evaluated, and how approved replacement models reach deployed instances.

Machine unlearning represents a shift in privacy thinking, from protecting what data is collected to controlling how long that data continues to affect system behavior. This lifecycle-oriented perspective introduces new challenges for model design, infrastructure planning, and regulatory compliance, while also providing a foundation for more user-controllable, transparent, and adaptable machine learning systems.

Self-Check: Question
  1. An engineering team implements Sharded, Isolated, Sliced, and Aggregated (SISA) training with \(\SisaShardCount = 100\) independent shards to support GDPR Article 17 (‘Right to Erasure’) for a 175B-parameter model. Under what operational workload does this sharded unlearning strategy lose its computational cost advantage over full model retraining?

    1. When the model is quantized from FP16 to INT8 for edge deployment
    2. When the daily volume of data erasure requests is high enough that requests touch essentially all \(\SisaShardCount\) shards in every retraining batch
    3. When the primary storage system transitions from NVMe SSDs to distributed object storage
    4. When the training pipeline uses Adam optimizer instead of stochastic gradient descent
  2. In Differentially Private Stochastic Gradient Descent (DP-SGD), what are the two core operations applied to gradients before weight updates, and what are their primary systems impacts?

    1. Gradient quantization to 4 bits and dropout pruning, reducing GPU memory by \(50\%\)
    2. Gradient checkpointing and layer freezing, eliminating backpropagation overhead
    3. Per-example gradient clipping to a maximum norm \(\GradientClippingNorm\) and calibrated Gaussian noise addition, whose privacy bound requires sampling and composition accounting and whose compute and utility costs depend on the configuration
    4. Spectral normalization of weight matrices and label smoothing, which eliminate adversarial vulnerability with zero compute overhead
  3. Why can deleting a user’s record from a primary database leave an incomplete ML deletion workflow, and what evidence must a machine-unlearning procedure provide?

  4. True or False: Once a neural network has been trained with DP-SGD under a privacy budget \(\PrivacyBudget = 1.0\), executing standard user inference queries in production consumes additional training-data privacy budget.

See Answers →

16.7 Explainability and Transparency

A rejected loan applicant, a clinician questioning a risk score, and an auditor reconstructing a contested decision each need a different account of the same model output, on a different deadline. Serving them requires disclosure about the system as a whole, explanation methods whose cost and fidelity fit the deployment, and an appeal path through which the affected person can act on what is disclosed.

16.7.1 The need for transparency

When ProPublica audited the COMPAS recidivism-risk score used in U.S. courts, it found that Black defendants were falsely flagged as future offenders at nearly twice the rate of white defendants (Angwin et al. 2016),11 while the vendor’s trade-secret claims prevented defendants, judges, and external investigators from inspecting the scoring formula or training provenance. Machine learning models often operate as opaque “black boxes,” producing outputs that users, developers, and regulators struggle to scrutinize. In high-stakes domains such as criminal justice, healthcare, and finance, that opacity blocks investigation and remediation even when external outcome audits expose a disparity.

11 COMPAS (Correctional Offender Management Profiling for Alternative Sanctions): ProPublica’s 2016 analysis found Black defendants were falsely flagged as future criminals at nearly twice the rate of white defendants (45 percent vs. 23 percent false positive rate) (Angwin et al. 2016). The proprietary, black-box nature of the system limited full inspection of model internals and training data, making the source of the observed error-rate disparity harder to investigate. Error-rate parity and predictive parity are distinct criteria, so the evaluation must name the criterion rather than treating one rate as a complete fairness verdict.

Angwin, Julia, Jeff Larson, Surya Mattu, and Lauren Kirchner. 2016. Machine Bias. ProPublica investigation.

The COMPAS case separates the two properties defined among the core principles. What investigators lacked was transparency, meaning disclosure of data sources, training procedures, evaluation protocols, and known limitations. Explanations of individual scores would have been a different kind of evidence, about particular decisions rather than the system. An attribution describes how a method assigns influence under its assumptions rather than supplying a causal account, a normative justification, or a path to recourse. Section 16.7.2 develops the methods, their costs, and their limits; the principle established here is that both properties are obligations the architecture must provision.

The importance of explainability and transparency extends beyond technical considerations to legal requirements. In many jurisdictions, these principles are legal obligations rather than optional guidance. Under the General Data Protection Regulation (GDPR), solely automated decisions with legal or similarly significant effects trigger Article 22 safeguards and related transparency duties, including meaningful information about the logic involved under access and notice provisions, subject to statutory exceptions (European Parliament and Council of the European Union 2016; European Data Protection Board 2018).12 Similar regulatory pressures in other domains reinforce the need to treat explainability and transparency as core architectural requirements.

12 GDPR (General Data Protection Regulation) Article 22: Article 22 gives data subjects protections against decisions based solely on automated processing that produce legal or similarly significant effects, with exceptions for contract necessity, authorization by law, or explicit consent plus safeguards (European Parliament and Council of the European Union 2016). Related notice and access provisions, including Article 15, require meaningful information about the logic involved for qualifying automated decision-making, and EDPB guidance treats those duties as part of a broader profiling and automated-decision governance regime (European Data Protection Board 2018).

European Parliament, and Council of the European Union. 2016. Regulation (EU) 2016/679 of the European Parliament and of the Council of 27 April 2016. Official Journal of the European Union.
European Data Protection Board. 2018. Guidelines on Automated Individual Decision-Making and Profiling for the Purposes of Regulation 2016/679.

Implementing these principles requires anticipating the needs of different stakeholders, whose competing values and priorities are examined comprehensively in section 16.9.4.3. Designing for explainability and transparency therefore requires decisions about how and where to surface relevant information across the system lifecycle.

Transparency and explainability also support system reliability over time. As models are retrained or updated, mechanisms for interpretability and traceability allow detection of unexpected behavior, enable root cause analysis, and support governance. Embedded into the structure and operation of a system, these mechanisms provide the foundation for trust, oversight, and alignment with institutional and societal expectations.

While transparency and explainability enable stakeholders to understand system behavior, they do not guarantee that this behavior is equitable. A model can be fully transparent about how it makes decisions while still systematically disadvantaging certain groups. This distinction is why the fairness criteria of section 16.5.1 remain a separate test even for a fully transparent model.

16.7.2 Models of interpretability

A loan officer using a traditional rules-based system can identify the rule that produced a rejection: “The debt-to-income ratio exceeds 40 percent.” A neural network, however, produces a score through many interacting operations for which no single rule supplies the decision rationale. Explainability and interpretability provide bounded evidence about model behavior, such as feature influence, sensitivity, representative examples, or counterfactual changes. That evidence can support investigation and communication, but it becomes a justification only when the institution connects it to a valid decision policy, and it becomes recourse only when the user can take a feasible action that the system will honor.

Explanation evidence plays a role in system validation, error analysis, incident investigation, user communication, and some compliance workflows. In high-stakes domains such as healthcare, financial services, and autonomous decision systems, explanation methods can generate hypotheses about spurious correlations that engineers must test independently. For instance, a saliency13 or sensitivity analysis might indicate that a diagnostic model responds to image artifacts rather than medical features; controlled evaluation must then determine whether that dependence is causal and operationally significant. For qualifying automated decisions under GDPR-style access and notice provisions, systems may need to provide meaningful information about the logic involved, reinforcing the need for systematic support for explanation, documentation, and contestability.

13 Saliency maps: Gradient-based explanation that highlights which input regions most influenced a prediction by computing a backward pass, the same infrastructure used for training. Saliency methods are often cheaper than perturbation-heavy or subset-enumeration methods, making them attractive for edge and mobile deployments when the model supports gradients. The trade-off is that raw gradients can be noisy and may highlight input artifacts rather than meaningful features, so smoothing or repeated-gradient variants trade additional compute for more stable visualizations.

Two scopes of explanation place different demands on the system. Local explanations characterize influences or sensitivities around an individual prediction, so their cost depends on which decisions are explained and whether results can be reused. Global explanations characterize broader model behavior, using model structure, representative inputs, or aggregated decision evidence. They may be computed offline or updated as new evidence arrives. Scope describes what the explanation covers; the method and delivery requirement determine where and when it runs.

Explainability methods can be broadly categorized based on when they operate and how they relate to model structure. Post-hoc methods are applied after training, but they are not necessarily black-box methods. Model-agnostic approaches such as LIME (Ribeiro et al. 2016) and KernelSHAP can operate through model queries, whereas input gradients, integrated gradients14 (Sundararajan et al. 2017), and gradient-weighted class activation mapping (GradCAM)15 (Selvaraju et al. 2017) require differentiable-model access to gradients or internal activations. Other SHAP implementations (Lundberg and Lee 2017) may exploit model structure.

Ribeiro, Marco Tulio, Sameer Singh, and Carlos Guestrin. 2016. “Why Should I Trust You?: Explaining the Predictions of Any Classifier.” Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 1135–44. https://doi.org/10.1145/2939672.2939778.

14 Integrated gradients: An attribution method that integrates gradients along the straight path from a baseline input to the actual input. Sensitivity requires a nonzero attribution when a single changed feature accounts for a changed prediction; implementation invariance requires identical attributions for functionally equivalent models (Sundararajan et al. 2017). The authors argued that most earlier attribution methods violate at least one of these axioms. These properties concern the exact method, while numerical integration introduces an approximation whose accuracy depends on the sampling of the path. The deployment must therefore budget repeated gradient evaluations and check approximation error rather than treating a fixed step count as sufficient for every model and input.

Sundararajan, Mukund, Ankur Taly, and Qiqi Yan. 2017. “Axiomatic Attribution for Deep Networks.” International Conference on Machine Learning (ICML), Proceedings of machine learning research, vol. 70: 3319–28.

15 GradCAM (gradient-weighted class activation mapping): Selvaraju et al. (2017) generalized Class Activation Mapping to any convolutional neural network (CNN) architecture by using gradients flowing into the final convolutional layer to produce spatial importance maps. Because it reuses gradient computation, GradCAM can be far cheaper than perturbation-heavy explanation methods, but whether it fits real-time medical imaging or autonomous-vehicle pipelines depends on the model, hardware, batch size, and explanation-frequency budget.

Selvaraju, R. R., M. Cogswell, A. Das, R. Vedantam, D. Parikh, and D. Batra. 2017. “Grad-CAM: Visual Explanations from Deep Networks via Gradient-Based Localization.” 2017 IEEE International Conference on Computer Vision (ICCV), 618–26. https://doi.org/10.1109/iccv.2017.74.

16 Shapley values: From cooperative game theory, Shapley values fairly distribute a payoff among players based on marginal contributions across all possible orderings. In ML explainability, features are “players” and the prediction is the “payoff.” The mathematical guarantees (efficiency, symmetry, null player) make SHAP a widely used attribution framework with clear axiomatic appeal, but exact subset enumeration grows as \(2^{\AttributionFeatureCount}\) for \(\AttributionFeatureCount\) features, which is why production systems often rely on model-specific algorithms, sampling approximations, caching, or asynchronous explanation paths (Lundberg and Lee 2017).

Lundberg, Scott M., and Su-In Lee. 2017. “A Unified Approach to Interpreting Model Predictions.” Advances in Neural Information Processing Systems (NeurIPS) 30: 4765–74.

Post-hoc approaches are widely used in image and tabular domains, where explanations can be rendered as saliency maps or feature rankings. To illustrate how SHAP attribution works in practice, consider a trained random forest model predicting loan approval (\(\text{approve}=1\), \(\text{deny}=0\)) based on three features: income, debt_ratio, and credit_score. For a specific applicant who was denied, with income of $45,000, debt ratio of 0.55 (55 percent of income goes to debt), and credit score of 620, the model outputs \(\Pr(\text{approve}) = 0.08\), that is, denial with probability 0.92. SHAP values, based on Shapley values from cooperative game theory,16 measure each feature’s contribution to moving the approval probability from a baseline (the expected prediction over a declared background distribution, here \(\Pr(\text{approve}) = 0.50\)) to this individual prediction.

The contribution of a feature depends on which other features are already known, so adding income first and adding it last can shift the prediction by different amounts. SHAP resolves that ambiguity by averaging a feature’s marginal contribution over every order in which the features could be added, under a specified value function. In this illustrative decomposition the averaged contributions are \(-0.05\) for income, \(-0.25\) for debt_ratio, and \(-0.12\) for credit_score.

Shapley values are additive, so the contributions sum from the baseline to the prediction: \(0.50 - 0.05 - 0.25 - 0.12 = 0.08 = \Pr(\text{approve})\), which is \(\Pr(\text{deny}) = 0.92\). Under this attribution setup, debt ratio has the largest assigned contribution to the output, followed by credit score and income. This ranking is a hypothesis about model sensitivity under the chosen background distribution, not evidence that debt ratio caused the decision or that lowering it below 40 percent would flip the output. A recourse claim requires a separately validated counterfactual that respects feature dependencies, immutable attributes, feasible user actions, and the decision policy that will apply when the user returns.

Two-bar log-scale ladder: 3 features need 8 subset evaluations, 20 features need about 1 million, with a double arrow labeled 2 to the n subsets between them.

Exact subset enumeration grows exponentially; model-specific algorithms can avoid it.

The computational cost depends on the attribution algorithm. Enumerating all subsets would evaluate \(2^3=8\) coalitions in this example and \(2^{20}\approx1\) million for twenty features. A random forest need not use enumeration: TreeSHAP exploits tree structure to compute exact attributions under its supported value-function assumptions. KernelSHAP estimates contributions from sampled coalitions, while DeepSHAP propagates approximations through network components. Gradient-based attribution can need fewer model evaluations still, but only where the deployed runtime supports gradient computation, and lower cost does not establish explanation fidelity. Explanation capacity must therefore be budgeted for the chosen method rather than inferred from feature count alone.

Another post-hoc approach involves counterfactual explanations, which estimate how a model output changes under specified input modifications. These are relevant for decision-facing applications such as credit or hiring systems, but a mathematical output flip is not automatically recourse. A useful counterfactual must distinguish mutable from immutable features, preserve domain constraints and feature dependencies, identify an action within the user’s control, and remain valid under the institution’s future decision policy (Wachter et al. 2017). Counterfactual generation and validation therefore require domain models, policy versioning, and operational commitments in addition to constrained optimization.

Wachter, Sandra, Brent Mittelstadt, and Chris Russell. 2017. “Counterfactual Explanations Without Opening the Black Box: Automated Decisions and the GDPR.” SSRN Electronic Journal 31: 841. https://doi.org/10.2139/ssrn.3063289.
Kim, B., M. Wattenberg, J. Gilmer, C. Cai, J. Wexler, F. Viegas, and R. Sayres. 2018. “Interpretability Beyond Feature Attribution: Quantitative Testing with Concept Activation Vectors (TCAV).” Proceedings of the 35th International Conference on Machine Learning (ICML) 80: 2668–77.

A third class of techniques relies on concept-based explanations, which attempt to align learned model features with human-interpretable concepts. For example, testing with concept activation vectors (TCAV) represents user-defined concepts as vectors in activation space and tests how sensitive a model’s predictions are to those concepts in its internal representation (Kim et al. 2018). These methods are especially useful in domains where subject matter experts expect explanations in familiar semantic terms. However, they require training data with concept annotations or auxiliary models for concept detection, which introduces additional infrastructure dependencies.

Post-hoc methods answer method-specific questions about model behavior. Even an exact attribution under a chosen value function does not recover a causal rationale or justify the decision policy. Approximate methods add estimation or surrogate error to those interpretive limits. Evaluation must therefore establish both what the method computes and whether that evidence serves the intended debugging, communication, or review task.

Inherently interpretable models expose a decision structure that the intended audience can inspect. Small decision trees, short rule lists, and sparse linear models with meaningful features can support this goal; a very large tree or high-dimensional linear model may not. Nearest-neighbor comparisons likewise require an understandable similarity metric and representative examples. Interpretability therefore depends on structure, features, and audience, not merely the model-family label. In high-stakes applications, model selection should evaluate whether a sufficiently accurate, inspectable model meets the task before assuming that post-hoc explanations are necessary (Rudin 2019).

Rudin, C. 2019. “Stop Explaining Black Box Machine Learning Models for High Stakes Decisions and Use Interpretable Models Instead.” Nature Machine Intelligence 1 (5): 206–15. https://doi.org/10.1038/s42256-019-0048-x.

Six common model families fall along an interpretability continuum in three groups (figure 9). Sparse linear models (explained via coefficients) and small decision trees (via split paths) are interpretable by design; prototype and concept models are hybrid architectures explained via exemplars; and tree ensembles (via TreeSHAP), deep networks (via gradients and SHAP), and foundation models (via probing) require post-hoc explanation. While this ordering provides a structural heuristic across model families, dimensionality and scale can shift boundaries; a million-node decision tree or dense linear regression can prove just as opaque as a deep neural network. This distinction is central to choosing an appropriate model for a given application, particularly in settings where regulatory scrutiny or stakeholder trust is essential.

Figure 9: Model Interpretability Spectrum: A heuristic ordering by model family. Small linear models and shallow decision trees can offer transparent reasoning, while neural networks typically require post-hoc explanation techniques; size, feature meaning, and audience can move any model along the spectrum. This distinction guides model selection based on application needs, prioritizing transparency in regulated domains or when stakeholder trust is important. The label under each family names the handle an explanation typically uses.

Hybrid approaches aim to combine the representational capacity of deep models with the transparency of interpretable components. Concept bottleneck models (Koh et al. 2020), for example, first predict intermediate, interpretable variables and then use a simple classifier to produce the final prediction. ProtoPNet models (Chen et al. 2019) classify examples by comparing them to learned prototypes, offering visual analogies for users to understand predictions. These hybrid methods are attractive in domains that demand partial transparency, but they introduce new system design considerations, such as the need to store and index learned prototypes and surface them at inference time.

Koh, Pang Wei, Thao Nguyen, Yew Siang Tang, Stephen Mussmann, Emma Pierson, Been Kim, and Percy Liang. 2020. “Concept Bottleneck Models.” Proceedings of the 37th International Conference on Machine Learning, ICML 2020, 13-18 July 2020, Virtual Event, Proceedings of machine learning research, vol. 119: 5338–48.
Chen, Chaofan, Oscar Li, Daniel Tao, Alina Barnett, Cynthia Rudin, and Jonathan Su. 2019. “This Looks Like That: Deep Learning for Interpretable Image Recognition.” In Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, December 8-14, 2019, Vancouver, BC, Canada, edited by Hanna M. Wallach, Hugo Larochelle, Alina Beygelzimer, Florence d’Alché-Buc, Emily B. Fox, and Roman Garnett. Curran Associates.
Olah, C., N. Cammarata, L. Schubert, G. Goh, M. Petrov, and S. Carter. 2020. “Zoom in: An Introduction to Circuits.” Distill 5 (3): e00024–001. https://doi.org/10.23915/distill.00024.001.
Geiger, Atticus, Hanson Lu, Thomas Icard, and Christopher Potts. 2021. “Causal Abstractions of Neural Networks.” In Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, Virtual, edited by Marc’Aurelio Ranzato, Alina Beygelzimer, Yann N. Dauphin, Percy Liang, and Jennifer Wortman Vaughan. Curran Associates.

Work such as Olah et al. (2020) and Geiger et al. (2021) applies mechanistic interpretability to reverse-engineer the internal operations of neural networks. This line of work, inspired by program analysis and neuroscience, attempts to map neurons, layers, or activation patterns to specific computational functions. Claims about such mechanisms require instrumentation and tests that support the proposed interpretation. These research methods can contribute evidence about internal computation, but do not establish a complete audit of every deployed model.

From a systems perspective, explainability introduces a number of architectural dependencies. Explanations must be generated, stored, surfaced, and evaluated within system constraints. The required infrastructure may include explanation APIs, memory for storing attribution maps, visualization libraries, and logging mechanisms that capture intermediate model behavior. Models must often be instrumented with hooks or configured to support repeated evaluations, particularly for explanation methods that require sampling, perturbation, or backpropagation.

The sociotechnical challenges of explainability center on the gap between technical explanations and human understanding. While algorithms can generate feature attributions and gradient maps, stakeholders often need explanations that align with their mental models, domain expertise, and decision-making processes. A radiologist reviewing an AI-generated diagnosis needs explanations that reference medical concepts and visual patterns, not abstract neural network activations. This translation challenge requires ongoing collaboration between technical teams and domain experts to develop explanation formats that are both technically accurate and practically meaningful. Explanations can shape human decision-making in unexpected ways, creating new responsibilities for how explanatory information is presented and interpreted. That gap between a technically valid explanation and a usable one is the first instance of a broader problem: every control in this chapter operates inside human workflows and institutions that no model-level method governs, and where explanation work runs is fixed by the audience, the question it must answer, and the deadline for answering it.

16.7.3 Explanation placement

Logging 1 to 10 MB gradient attribution maps for 1 million daily image predictions fills 30 to 300 TB of storage every month, and running sampled KernelSHAP inline on a microcontroller or a 10 ms control loop will miss the deadline before a single attribution finishes. Computational capacity, latency budget, interface design, and data access constrain both the explanation method and where it runs. A cloud worker can execute expensive SHAP or LIME attribution; a constrained endpoint may use a cheaper gradient-based saliency map if its runtime supports gradients. Devices unable to generate explanations locally may preserve bounded decision records for later analysis by a backend or during servicing, the per-tier split that the explainability row of table 4 records.

Audience and timing further constrain explanation design. An end user may need a concise summary (“elevated heart rate during sleep”), while a developer or auditor may need attribution maps, concept activations, or decision traces. The required evidence depends on what each person must understand or do. A drone or industrial controller must keep explanation work within its control deadline or move that work off the critical path. Financial and clinical workflows likewise need a specified delivery deadline, which may allow analysis after the automated decision but before review or appeal. Planning for the audience and deadline, within the deployment’s resource limits, makes interpretability a design constraint.

Storage requirements also scale significantly with explanation needs. Storing SHAP values for tabular data requires approximately 4–8 bytes per feature per prediction, so monthly storage is 30 million predictions times the feature count times 4–8 bytes for a system logging 1 million predictions daily. Gradient attribution maps for images can require 1–10 MB per explanation depending on resolution; logging every image explanation at the same 1 million-per-day rate would require roughly 30–300 TB per month unless explanations are sampled, compressed, or retained for a shorter window. These volumes require careful data lifecycle management and retention policies.

Compression and optimization techniques also affect explainability. Pruning, quantization, and architectural simplifications often used in TinyML or mobile settings can distort internal representations or disable gradient flow, degrading the reliability of attribution-based explanations. In such cases, interpretability must be validated postoptimization to ensure that it remains meaningful and trustworthy. If explanation quality is important, these transformations must be treated as part of the design constraint space.

16.7.4 Transparency and contestability

Showing a rejected loan applicant a feature-attribution chart accomplishes nothing if the app offers no button to dispute an error in the credit file, no human reviewer with authority to overturn the rejection, and no immutable snapshot of the inputs that produced the score. Explanations serve accountability only when stakeholders can both understand and challenge system decisions. Transparency allows users, developers, auditors, and regulators to inspect how a system functions, assess its limitations, and identify sources of harm, but disclosure alone is not enough. In high-stakes domains, individuals and institutions need contestability: the operational ability to interrogate, appeal, and reverse an automated decision.

Transparency in machine learning systems typically focuses on disclosure of how models are trained, what data they rely on, what assumptions are embedded in their design, and what known limitations affect their use. Documentation tools such as model cards and datasheets for datasets support this goal by formalizing system metadata in a structured, reproducible format. These resources can improve governance, support compliance, and inform user expectations. However, transparency as disclosure does not guarantee meaningful control. Even when technical details are available, users may lack institutional support, interface tools, or procedural access to contest a decision that adversely affects them.

To move from transparency to contestability, machine learning systems must integrate mechanisms for explanation, recourse, and feedback. Explanation provides understandable reasons for system outputs, tailored to the operational context and needs of the person receiving them. Recourse identifies feasible changes through which individuals could receive a different outcome under the stated decision policy. A proposed change needs to be actionable for that person; a counterfactual prediction alone does not guarantee an outcome after the model or policy changes. Feedback enables users and domain experts to dispute outcomes, report errors, or signal concerns, routing those signals into oversight processes and model updates.

These mechanisms can be missing from the user-facing workflow even when internal documentation exists. A mobile loan application might display a rejection without explaining how to submit additional information or reach an appeal reviewer. An external appeal process can still exist, but users need a discoverable route to it and access to the evidence relevant to their case. Similarly, a clinical model may produce a risk score without giving the physician enough context to question its use for a particular patient. If subgroup errors are neither observable nor contestable, the resulting harm becomes harder to diagnose and correct.

From a systems perspective, enabling contestability requires coordination across technical and institutional components: models must expose sufficient information to support explanation, and interfaces must surface that information in a usable and timely way so that organizational processes can review feedback, respond to appeals, and update system behavior while logging and auditing infrastructure tracks user interventions and override decisions alongside model outputs. Human overrides and decision abstention can support this process only when qualified reviewers have capacity, evidence, and authority to resolve the deferred cases within the required deadline.

Implementing contestability imposes concrete infrastructure costs that scale with system throughput and complexity. Storing the necessary metadata to reconstruct a decision (input features, model version, and decision thresholds) requires persistent storage whose footprint depends on feature dimensionality, explanation payloads, and retention windows. Generating on-demand explanations using Shapley values or counterfactuals can add enough latency that contested decisions often need asynchronous processing queues to preserve serving service level agreements (SLAs). Meeting record-keeping and automatic-logging obligations for high-risk systems under frameworks such as the EU AI Act requires storage, provenance, retention controls, and oversight capacity to be budgeted as part of the inference fleet rather than as a separate policy artifact (European Parliament and Council of the European Union 2024).

War Story 16.1: Apple Card: A systems reconstruction of contested decisions (2019)
Context: In 2019, Apple and Goldman Sachs faced intense public scrutiny after a customer reported a credit limit 20\(\times\) that offered to his wife despite joint tax filings. Other customers raised similar concerns about unequal terms (New York State Department of Financial Services 2021).

Evidence boundary: The public record documents complaints, the investigation, the regulator’s finding, and changes to appeal policy. It does not disclose the underwriting pipeline’s latency target or internal explanation architecture. The systems account below is therefore an explicit reconstruction, not a report of Apple or Goldman Sachs implementation details.

Reconstructed mechanism: A low-latency underwriting service that returns only a limit and generic adverse-action reason leaves support staff unable to inspect the decision snapshot, distinguish data errors from policy effects, or route a contested outcome to a reviewer. The missing interface is broader than feature attribution. It includes versioned input provenance, policy and model versions, reasons appropriate to the decision process, appeal state, and authority to correct an error.

Observed impact: The New York Department of Financial Services found no violation of fair-lending law in its investigation, but the complaints still exposed a trust and contestability failure. Customers and frontline staff lacked a satisfactory account of how apparently inconsistent outcomes could be reviewed (New York State Department of Financial Services 2021).

Systems lesson: High-stakes decision systems need a contestability interface, not merely an attribution API. A defensible architecture preserves the decision-time evidence needed for audit, generates appropriate reasons without claiming that attribution is causation, routes appeals to an authorized human, records remediation, and tests the full workflow under its latency and retention constraints.

New York State Department of Financial Services. 2021. Report on Apple Card Investigation. New York State Department of Financial Services.

The Apple Card reconstruction names the pieces such a system lacks. One architectural pattern that supplies them is a contestability stack, analogous to distributed tracing in microservices, that coordinates four coupled stages across the operational pipeline. Decision provenance preserves a verifiable link from each output back to its governing policy, model version, and input snapshot, protected by authenticated logs or cryptographic integrity checks. Explanation generation budgets explanation methods tailored for appeals, audits, and routine communication, offloading compute-intensive methods to asynchronous workers while keeping lightweight techniques on the request path. When decisions are challenged, appeal routing directs contested cases to qualified human reviewers equipped with domain context. Closing the loop, outcome tracking records whether the appeal upheld or overturned the machine decision, feeding empirical discrepancies back into evaluation and retraining. Missing decision-time records can prevent investigators from reconstructing a contested decision, even if aggregate debugging remains possible; the required records follow the investigation and remedy contract.

Vertical chain of four stages joined by downward arrows: provenance in dark blue, then explanation, appeal, and outcome in gray. A return arrow labeled retrain runs from outcome up the left side back to provenance.

Provenance anchors every appeal; tracked outcomes loop back into retraining.

The stack need not run where the decision runs. An edge or TinyML endpoint can hand its decision records to a backend review process at the next synchronization or servicing visit, which lengthens the appeal’s evidence path without removing the obligation to offer one. In every tier, transparency supports accountability only when users and institutions can use the disclosed information to question and correct automated decisions.

Self-Check: Question
  1. A model-agnostic explanation service enumerates all feature coalitions for 20 input features, taking at least one microsecond per coalition. Why does this exhaustive Shapley calculation exceed a 100 ms inline serving budget?

    1. It evaluates \(2^{20}\) coalitions, requiring more than one second even at one microsecond per coalition; a cheaper method or separate explanation path is needed.
    2. Because Shapley values can only be computed using double-precision arithmetic that crashes GPU tensor cores
    3. Because cooperative game theory axioms prohibit computing feature contributions on tabular data
    4. Because exact SHAP requires accessing the client’s raw hardware registers during inference
  2. Explain the two fundamental axioms satisfied by Integrated Gradients (Sensitivity and Implementation Invariance) and why they make Integrated Gradients superior to vanilla input gradients.

  3. Why do local and global explanations place different demands on explanation infrastructure?

    1. Local explanations characterize an individual prediction; global explanations characterize broader model behavior using model structure, representative inputs, or aggregated evidence. Their methods and delivery deadlines determine execution and capacity needs.
    2. Local explanations require no model access, whereas global explanations require retraining the model on every request.
    3. Global explanations must run inline on every request, whereas local explanations can only be generated during training.
    4. Local and global explanations have identical cost because both are computed from the same Shapley enumeration.
  4. A counterfactual explanation shows that a denied loan applicant would have been approved with a debt ratio below 40 percent. Explain why this output flip does not by itself give the applicant recourse.

  5. True or False: Any decision tree or linear model is inherently interpretable, so choosing one of those model families removes the need for explanation evidence.

  6. For an appeal workflow that retrieves decision evidence before explanation, then sends both to a reviewer and records the outcome, order these actions: (1) Route the case and explanation to an authorized credit reviewer, (2) Retrieve the decision record and governing model and policy versions, (3) Record the review outcome and propagate any authorized remedy, (4) Generate explanation evidence, checking any proposed recourse for feasibility and policy validity.

See Answers →

16.8 AI Safety, Robustness, and Generative Controls

A model that withstands every tested perturbation can still cause harm when the operating environment leaves its validated envelope or when its objective rewards the wrong behavior. Safety governance therefore spans robustness claims bounded by a threat model, control surfaces for generative systems whose outputs cannot be enumerated in advance, and the alignment of the objective itself as systems act with greater autonomy.

16.8.1 Safety and robustness

A perception model that passes every \(\ell_\infty\) adversarial benchmark in the lab can still contribute to a fatal crash if the vehicle’s motion planner suppresses emergency braking or waits too long to alert a distracted safety driver. Safety and robustness connect technical failure behavior to its consequences for people. Robust AI owns the attack models, robustness evaluations, adversarial training, certification, corruption testing, drift detection, and abstention mechanisms; governance consumes those mechanisms through an evidence interface. Evidence that a model tolerates specified hardware faults, adversarial attacks, or distribution shifts supports a bounded robustness claim. It does not establish that every deployment is safe or that the objective serves users’ interests. A model may tolerate the tested bit flips and perturbations yet fail under untested conditions, or reliably optimize an objective misaligned with user welfare.

↩︎ The three robustness pillars, environmental shifts, input-level attacks, and system-level faults such as bit flips, are established in The three pillars of robust AI.

The responsible-AI question is therefore not which attack or defense to implement, but whether the robustness claim has a bounded operating envelope, evidence appropriate to the threat model, an accountable owner, and a rule that invalidates approval. An evaluation may bound errors under a specified input variation without establishing that the surrounding workflow is safe. Automated-driving failures show why the envelope must cover more than the model, because they can combine perception, prediction, safety-driver, and organizational-control problems rather than reduce to a single model error; section 16.8.4 examines one such crash.

A robustness claim should specify the protected task and population, attacker knowledge and capabilities, perturbation or corruption set, evaluation distribution, model and preprocessing versions, quality and latency constraints, fallback behavior, and known exclusions. Adversarial inputs (Adversarial Attacks) and covariate, label, and concept shift (Distribution shift and concept drift) are the failure sources such a claim most often has to bound. Empirical attack results show observed failures under a test protocol; they do not establish robustness against adaptive or untested attacks. A certificate proves a property only for its stated norm, radius, confidence, and model configuration; it does not establish safety for the end-to-end workflow. Governance records those boundaries so a narrow result cannot be promoted into a general safety assertion.

The latency budget constrains which safety checks can run before an action. A cloud service may combine uncertainty estimators, distributional-change detectors, adversarial input filtering, and API rate limiting. A control loop with a millisecond budget needs bounded local checks and fallback actions that meet its deadline, with heavier analysis deferred to fleet services, the division the safety row of table 4 records by tier. Even a disconnected TinyML endpoint can execute input-range checks or watchdog logic; the absence of a remote update channel instead limits how operators change those controls after deployment.

Fallback is itself a latency-budget problem. A delivery robot that abstains17 when pedestrian-detection confidence is low still needs a validated response before the physical safety deadline. A bounded local maneuver may place it in a safe state while a human reviewer resolves the case on a longer timescale. The response and review paths therefore need separate deadlines and capacity budgets. Whether the system can fail visibly, controllably, and safely depends on sensing, confidence estimation, fallback routing, and recovery. Those choices also define who can observe harm, who can intervene, and who remains accountable for the outcome.

17 Abstention: The practice of refusing predictions when confidence falls below a threshold. Abstention can reduce high-risk errors, but only by shifting some cases to fallback infrastructure such as human reviewers, rule-based defaults, or escalation queues. A driving system must select a validated fallback, such as a minimal-risk maneuver; handing control to a driver is viable only if a driver is present, ready, and has sufficient response time. Medical AI may route ambiguous cases to specialist review, subject to its own queue-capacity and response-time budget.

↩︎ The per-request competence contract, which combines calibration and out-of-distribution scores into a selective-prediction policy to answer, abstain, or escalate, is established in Per-request competence and selective prediction.

The evidence bundle must also connect model behavior to system action. It identifies who owns the robustness claim, which team can stop serving, how abstentions and low-confidence cases are routed, which telemetry detects departure from the approved envelope, and how an incident reaches affected users and downstream operators. A fallback must meet the relevant safety deadline. A monitoring signal becomes an operational safeguard only when it reaches an authorized response path, whether that response is local containment, restricted use, or a validated rollback.

Approval expires when the threat model, model, preprocessing, sensor, data distribution, deployment environment, or fallback path changes materially. The invalidation rule should state which change triggers a full red-team evaluation, which permits a narrower regression suite, and which requires restricted operation while evidence is rebuilt. This ownership-and-invalidation contract is the governance contribution, turning those robustness mechanisms into a reviewable claim that remains bounded over time.

16.8.2 Generative control surfaces

A binary loan classifier has two possible outputs to audit, whereas a large language model (LLM) such as Archetype A (GPT-4/Llama-3) can be steered by a user prompt or a poisoned retrieved document into generating defamatory claims, leaking personal data, or refusing benign requests from one dialect more often than another. Generative AI does not replace core fairness, privacy, and explainability concerns; it changes the control surface. Instead of only auditing labels or feature attributions, operators must govern prompts, retrieved context, reward models, and open-ended outputs. Fairness remains concerned with how quality, refusals, errors, representation, and access are distributed across people and groups, but open-ended outputs make those quantities harder to define and sample. Alignment introduces a separate problem, which is keeping stochastic outputs and actions consistent with intended objectives and policies across a combinatorial range of prompts. The two questions differ in kind. Fairness asks how benefits, errors, and burdens are distributed among affected people; alignment asks whether an optimizing system pursues the objective its designers and legitimate stakeholders intended. An aligned system can implement an unfair objective faithfully, and a statistically fair classifier can still optimize the wrong social goal, so production systems need both fairness evaluation and behavioral alignment rather than relabeling one as the other. A common multi-stage alignment pipeline runs in two coupled lanes (figure 10). An upper execution path advances the policy from pretraining through supervised fine-tuning (SFT) to proximal policy optimization (PPO), and a lower supervision path uses human preference comparisons to train a reward model \(\RewardModel(\ModelInput, \GeneratedResponse)\). The reward signal drives PPO updates, while the frozen SFT checkpoint supplies a reference for a Kullback-Leibler (KL) divergence penalty. The penalty discourages departure from that reference; it does not impose a hard bound on every response or establish policy compliance.

Figure 10: Reinforcement Learning from Human Feedback (RLHF) Alignment Pipeline: The top lane carries the policy from a pretrained model through supervised fine-tuning (SFT) and proximal policy optimization (PPO) to the aligned policy. The bottom lane turns human judgment into an objective: raters compare sampled SFT outputs, and those comparisons train a reward model whose score drives PPO. The SFT model also serves as the KL reference that limits how far PPO moves the policy, so every human preference reaches the weights only through the learned reward model.

A common instruction-tuning pipeline in LLMs circa 2022–2024 uses reinforcement learning from human feedback (RLHF)18 as a sociotechnical bridge between human preferences and model weights. Training a reward model on human comparisons produces a scalar scoring function for sampled responses, and collecting those judgments carries a direct cost. In this scenario, 50,000 to 500,000 pairwise comparisons at $0.50 to $5 per label put the labeling budget between $25,000 and $2.5M, a hundredfold spread set by how many judgments the organization buys and how expert its raters must be. Proximal policy optimization (PPO) then updates the policy using those rewards and a penalty for divergence from the supervised baseline. This process can create an alignment tax, a regression in some capability metrics when optimization shifts toward preference or safety objectives; its direction and magnitude depend on the model, data, objectives, and evaluation suite rather than following a universal percentage. The reliance on human raters also introduces a representativeness gap. If the labeling budget buys judgments from only a narrow demographic slice, the resulting model may encode that pool’s preferences while performing differently for other populations. Constitutional AI offers an alternative engineering path, using explicit principles to guide AI feedback on outputs (Bai et al. 2022), which changes rather than eliminates the questions of whose values are represented and how they are governed.

18 RLHF (reinforcement learning from human feedback): Christiano et al. (2017) demonstrated deep reinforcement learning from human preferences by training agents from non-expert comparisons between trajectory segments. In the LLM setting, Ouyang et al. (2022) adapted this pipeline for InstructGPT: supervised fine-tuning from demonstrations, reward-model training from ranked model outputs, and reinforcement-learning fine-tuning against the learned reward model. The systems cost is an additional human-feedback data pipeline, reward-model training and evaluation, and governance over rater instructions; the representativeness of the rater pool and labeling policy shapes whose preferences the model internalizes.

Christiano, P. F., J. Leike, T. B. Brown, M. Martic, S. Legg, and D. Amodei. 2017. “Deep Reinforcement Learning from Human Preferences.” In Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, December 4-9, 2017, Long Beach, CA, USA, edited by Isabelle Guyon, Ulrike von Luxburg, Samy Bengio, Hanna M. Wallach, Rob Fergus, S. V. N. Vishwanathan, and Roman Garnett. Curran Associates.
Ouyang, L., J. Wu, X. Jiang, D. Almeida, C. L. Wainwright, P. Mishkin, C. Zhang, et al. 2022. “Training Language Models to Follow Instructions with Human Feedback.” Advances in Neural Information Processing Systems (NeurIPS) 35: 27730–44. https://doi.org/10.52202/068431-2011.
Bai, Yuntao et al. 2022. Constitutional AI: Harmlessness from AI Feedback.

↩︎ The four-model coordination that a PPO-style RLHF step imposes on distributed training is established in The multi-model coordination problem.

In retrieval-augmented generation architectures, responsibility extends beyond the core model. An LLM may pass alignment evaluations yet generate harmful responses when retrieval supplies context outside those evaluations. A retrieval index that disproportionately surfaces biased historical documents can influence the resulting answers despite safety training. Context filtering is one possible control, alongside source selection, retrieval evaluation, and output checks. Its effectiveness must be tested on the intended use; a toxicity filter does not establish that retrieved material or generated answers are unbiased.

In many LLM serving stacks, the system prompt operates as an early configuration control alongside retrieval filtering, policy classifiers, telemetry, and rollout gates. These instructions (for example, “You are a helpful assistant. Do not provide medical advice.”) express intended behavior; they do not independently enforce authorization or prevent every prohibited output. When one model serves many products, each with its own system prompt, managing the prompts becomes a distributed configuration-management problem akin to weight distribution. An unversioned prompt change can alter behavior across many interactions, so prompt version control, alignment regression testing, and gradual rollouts belong in the release process.

Together, system prompts and RLHF alignments act as important, yet fragile, technical guardrails. Jailbreaks and other edge cases can violate the policy learned during training; the reward model is not necessarily a runtime filter. Safety therefore requires evaluating the deployed control system as well as its training objective. Each of these guardrails, like the privacy and robustness controls before it, is credible only with evidence that it still holds in the system that actually runs.

↩︎ Jailbreaks, which bypass alignment controls, and prompt injection, which crosses the boundary between instructions and data, are established in LLM-specific attack vectors.

16.8.3 AI safety and value alignment

When a system acts faster than anyone can review its individual decisions, the governing question changes. It is no longer only whether the outputs are fair, private, or explainable, but whether the objective the system optimizes still serves the people it acts on, and what bounds its actions before review. Human launch authority remains necessary, but continuous human intervention may be unavailable. AI safety examines how systems can optimize objectives misaligned with human intentions, operate in unpredictable environments, or pursue goals through methods their designers never anticipated, and which controls can bound those actions.

The controls of the preceding sections retain their roles, but none governs autonomous action by itself. Bias detection (section 16.5.2.1) yields metrics rather than a remediation policy. A perception system that under-detects pedestrians with mobility aids needs an operating envelope that connects the metric to bounded runtime responses and to fleet-level investigation or suspension. Explanation (section 16.7.2) needs an audience and an action path; SHAP attributions from an autonomous trading system cannot influence a decision if no control consumes them before thousands of trades execute. Differential privacy (section 16.6.3) bounds leakage about a protected unit without determining whether the objective serves that person’s welfare, so a recommender can satisfy a local differential privacy guarantee while optimizing an engagement metric that rewards harmful content. Each method needs a defined connection to the runtime controls and human authority that can respond to its findings.

Alignment work emphasizes keeping a system’s pursued objectives consistent with human intentions over time (Russell 2021). A central challenge is that capable ML models often optimize proxy metrics, such as loss functions, reward functions, or engagement signals, that do not fully capture human values.

Covington, Paul, Jay Adams, and Emre Sargin. 2016. “Deep Neural Networks for YouTube Recommendations.” Proceedings of the 10th ACM Conference on Recommender Systems, 191–98. https://doi.org/10.1145/2959100.2959190.
Ribeiro, M. H., R. Ottoni, R. West, V. A. F. Almeida, and Jr. Meira Wagner. 2020. “Auditing Radicalization Pathways on YouTube.” Proceedings of the 2020 Conference on Fairness, Accountability, and Transparency, 131–41. https://doi.org/10.1145/3351095.3372879.

19 Reward hacking: When an AI system maximizes its reward function through unintended means that violate designer intent. A hypothetical cleaning robot rewarded for collected dirt might create messes it can clean up, illustrating how a proxy can reward behavior contrary to the intended task. Specification gaming is an overlapping term; the gap may lie in the stated objective or in its implementation, so neither term is restricted to software bugs. For production ML systems, reward hacking manifests subtly, as in recommendation models that maximize engagement by promoting addictive content, or chatbots that maximize helpfulness ratings by being sycophantic rather than accurate. The failure mode scales with model capability.

Goodhart, Charles A. E. 1984. “Problems of Monetary Management: The UK Experience.” In Monetary Theory and Practice. Palgrave. https://doi.org/10.1007/978-1-349-17295-5_4.

Recommendation systems illustrate why a measurable engagement proxy such as click-through rate (CTR) or watch time needs evaluation against broader user welfare. A published production architecture optimizes expected watch time (Covington et al. 2016), while a separate audit examines recommendation paths through politically extreme content (Ribeiro et al. 2020). Those observations motivate investigating proxy misalignment; together they do not prove that a particular reward objective caused an individual user’s beliefs or behavior. Specification gaming and reward hacking19 describe the risk that optimizing a measured objective defeats its intended purpose (Amodei et al. 2016). Goodhart’s law names the general pattern, in which a measure that becomes a target stops measuring what it was chosen for (Goodhart 1984). In one possible feedback mechanism, engagement rewards content that undermines long-term user value, and the resulting interactions become new training data (figure 11). Establishing that mechanism in a deployment requires evidence about both the policy’s effects and the welfare criterion it is meant to serve.

Figure 11: Reward Hacking Loop: Maximizing measurable rewards, like clicks, can incentivize unintended model behaviors that undermine the intended goal of user satisfaction. In the illustrated possible feedback loop, the recommender serves content and the resulting clicks enter later training data. If optimizing clicks rewards behavior that undermines long-term user value, retraining can reinforce the mismatch. Establishing this mechanism requires evidence about the deployed policy and the user-value criterion; targeting a proxy does not by itself prove that it has ceased to provide useful information.

Norbert Wiener wrote, “if we use, to achieve our purposes, a mechanical agency with whose operation we cannot interfere effectively… we had better be quite sure that the purpose put into the machine is the purpose which we desire” (Wiener 1960). Wiener’s warning becomes a systems requirement when optimization runs beyond continuous human intervention. Value alignment asks whether the objective embedded in the model, reward function, and deployment policy continues to represent the human purpose the system was meant to serve.

Wiener, N. 1960. “Some Moral and Technical Consequences of Automation: As Machines Learn They May Develop Unforeseen Strategies at Rates That Baffle Their Programmers.” Science 131 (3410): 1355–58. https://doi.org/10.1126/science.131.3410.1355.
Friedman, B. 1996. “Value-Sensitive Design.” Interactions 3 (6): 16–23. https://doi.org/10.1145/242485.242493.

In deployment, the hard part is specifying an objective that remains valid as systems interact with dynamic environments, multiple stakeholders, and feedback loops. Static objective functions and reward signals cannot encode all of those conditions. Value-Sensitive Design (Friedman 1996) supplies a formal process for eliciting stakeholder values and incorporating them into system design, but the systems obligation is broader, because objective design, oversight, and postdeployment monitoring must be treated as coupled controls.

Without that coupling, a system can meet a narrow objective such as accuracy, engagement, or throughput while producing outcomes its designers would reject, the reward hacking pattern of figure 11. RLHF (section 16.8.2) narrows the gap by learning the reward from human preferences, but policy optimization still maximizes a learned scalar, so its success depends on that signal’s fidelity (Christiano et al. 2017; Ouyang et al. 2022).

Ngo, Richard, Lawrence Chan, and Sören Mindermann. 2022. “The Alignment Problem from a Deep Learning Perspective.” ArXiv Preprint abs/2209.00626.

Human-feedback training can improve behavior on its evaluations while leaving deeper governance risks unresolved. In their analysis of learned-reward optimization, Ngo et al. (2022) examine possible failure modes beyond RLHF, including exploitation of human evaluation blind spots, misaligned goals outside the training distribution, and behavior that undermines oversight. These are risks to investigate under specified assumptions, not evidence that every deployed model shows them. An assurance case must distinguish a proposed failure mechanism from an observed capability and from a demonstrated deployment failure.

These concerns are not limited to speculative scenarios. In their foundational taxonomy of concrete AI safety problems, Amodei et al. (2016) outline five practical systems challenges: avoiding negative side effects during policy execution, mitigating reward hacking, ensuring scalable oversight when ground-truth evaluation is costly, designing safe exploration strategies that prevent catastrophic damage, and achieving robustness to distributional shift. For fleet operators, the five challenges map in order onto five control-plane requirements: constraining side effects, instrumenting reward-hack monitors, budgeting scalable review capacity, bounding exploration envelopes, and stress-testing distribution shift prior to rollout. Each requirement becomes more acute as systems are scaled up, deployed across diverse settings, and integrated with real-time feedback or continual learning.

Amodei, D., C. Olah, J. Steinhardt, P. Christiano, J. Schulman, and D. Mané. 2016. “Concrete Problems in AI Safety.” arXiv Preprint arXiv:1606.06565, ahead of print. https://doi.org/10.48550/arXiv.1606.06565.

16.8.4 Autonomous systems and trust

In October 2023, the California Department of Motor Vehicles suspended Cruise’s driverless deployment and testing permits over safety concerns (CNBC 2023), and five years earlier an Uber test vehicle in Tempe, Arizona struck and killed a pedestrian pushing a bicycle after its perception, prediction, safety-driver, and organizational controls all failed together (National Transportation Safety Board 2019). Value alignment concerns the objective; autonomy concerns the operating envelope within which a system pursues that objective without a human reviewing each action. In the Tempe crash, the National Transportation Safety Board found that the vehicle failed to classify the pedestrian as requiring avoidance and that detecting an object did not establish that the system would act safely on the detection. For governance, the lesson is that no single component owner could have certified the outcome alone.

CNBC. 2023. California DMV Suspends Cruise’s Self-Driving Car Permits. CNBC news article.
National Transportation Safety Board. 2019. Collision Between Vehicle Controlled by Developmental Automated Driving System and Pedestrian, Tempe, Arizona, March 18, 2018. HAR-19/03. National Transportation Safety Board.

↩︎ The Uber crash timeline, from unstable classification through suppressed action to the late operator alert, is established in Edge and embedded failures.

Reuters. 2023. Human-Machine Teams Driven by AI Are about to Reshape Warfare. Reuters news article.
Centre for International Governance Innovation. 2023. Who Is Responsible When Autonomous Systems Fail? CIGI policy article.

While autonomous driving systems are often the focal point of public concern, similar risks arise in other domains. Reports from recent conflicts have documented increasing use of remotely piloted and autonomous military systems (Reuters 2023), raising safety and operational concerns alongside difficult questions about ethical oversight, rules of engagement, and responsibility. These debates concern how accountability applies across developers, deployers, and operators (Centre for International Governance Innovation 2023); they do not justify treating every autonomous-system failure as an absence of applicable responsibility. The engineering task is to preserve the evidence and authority needed to investigate the specific failure.

At its core, this challenge concerns the authority delegated to an automated system. Productivity and throughput gains do not establish that a system can act safely outside its validated operating envelope. Runtime controls must detect relevant boundary violations and invoke a fallback whose assumptions and response time fit the hazard. Human intervention is an available safeguard only when the operator can recognize the condition and act before harm occurs; faster hazards require an appropriate local response.

Specifying that operating envelope is difficult in dynamic environments because the model may omit conditions that matter for safe action. Two classical representation problems help explain this difficulty (McCarthy 1981). The frame problem concerns representing what changes and what remains unchanged after an action without listing every unaffected fact. The qualification problem concerns the potentially unlisted preconditions needed for an action to have its intended effect. These motivate explicit operating assumptions and fallback behavior, rather than constituting a universal proof that safe action is impossible. In practice, such limitations manifest as brittle autonomy: systems that appear competent under nominal conditions but fail silently or dangerously when faced with ambiguity or distributional shift.

McCarthy, J. 1981. “Epistemological Problems of Artificial Intelligence.” In Readings in Artificial Intelligence. Elsevier. https://doi.org/10.1016/b978-0-934613-03-3.50035-0.
Shalev-Shwartz, Shai, Shaked Shammah, and Amnon Shashua. 2017. “On a Formal Model of Safe and Scalable Self-Driving Cars.” ArXiv Preprint abs/1708.06374.

To address this, researchers have proposed formal safety frameworks such as Responsibility-Sensitive Safety (RSS) (Shalev-Shwartz et al. 2017), which decompose abstract safety goals into mathematically defined constraints on system behavior, such as minimum distances, braking profiles, and right-of-way conditions. These formulations allow safety properties to be verified under specific assumptions and scenarios. However, such approaches remain vulnerable to the same limitations they aim to solve, because they are only as good as the assumptions encoded into them and often require extensive domain modeling that may not generalize well to unanticipated edge cases.

For an ML systems team, the practical artifact is a safety case rather than a statement of trust. The case names the operating envelope, the evidence that the model has been tested inside that envelope, and the controls that halt or roll back the fleet when the evidence no longer holds (table 8).

Table 8: Autonomous System Safety Case: Trustworthy autonomy takes the form of an auditable safety case: a validated operating envelope, coverage evidence, runtime guardrails, and fleet-level rollback controls. The same pattern applies beyond vehicles to drones, robots, trading systems, and other ML systems that act faster than continuous human review permits.
Safety-case element Systems evidence Operational gate
Operating envelope Operational design domain, sensor assumptions, weather, geography, speed, and autonomy level Block deployment outside validated envelope
Scenario coverage Rare-event corpus, simulation coverage, replay logs, disengagements, and near-miss telemetry Require coverage thresholds before canary expansion
Runtime guardrails RSS-style distance rules, confidence thresholds, fallback maneuvers, and human override latency Trigger safe stop, human takeover, or constrained mode when guardrails trip
Fleet control Canary rollout, centralized safety dashboard, violation budget, and circuit-breaker rollback path Halt rollout or revert model when fleet-level safety metrics exceed threshold

16.8.5 Safety at fleet scale

A model that achieves 99.9 percent per-request safety in isolation still produces millions of expected safety failures every day once deployed across 10,000 inference nodes serving billions of daily queries. The technical safety challenges examined in section 16.8.3 become fleet-level design constraints at production volume, where rare per-request failures accumulate into routine operational incidents.

Rising curve that flattens toward the top, labeled rare near its low left end and certain along its plateau, over a horizontal axis marked fleet scale.

At fleet scale, rare failures become expected incidents.

Safety must also be engineered as a fleet-level property rather than a model-level attribute alone. A single model with 99.9 percent safety compliance seems robust in isolation, but when deployed across 10,000 inference nodes serving billions of requests per day, a sustained 0.1 percent per-request failure probability implies millions of expected safety failures daily. The realized count can differ, and correlated failures can concentrate harm across the fleet. Mitigating this requires distributed safety patterns borrowed from reliability engineering: circuit breakers that automatically halt serving when aggregate safety metrics degrade below a threshold, canary deployments that bound exposure while collecting release evidence, with sample size and allowed risk chosen for the failure modes being tested, and centralized telemetry dashboards that aggregate per-node safety violations into a global view. The operational infrastructure must treat safety violations as critical system alerts, invoking a validated containment or fallback policy. A rollback is appropriate only if the previous version and transition are safe; active physical control may require a minimal-risk maneuver instead.

↩︎ The circuit-breaker states and backpressure contract that isolate a failing serving path are established in Circuit breakers and backpressure.

Exposure is the multiplier that turns a small per-mile rate into many incidents. Waymo’s driverless fleet logged about 22 million rider-only miles by June 2024 and 271 million by June 2026, a 12× increase in two years (figure 12, panel a) (Waymo 2026). Its published crash rates sit well below a human-driver benchmark on the same roads, for example 0.67 injury crashes per million miles against 3.8 (panel b) (Waymo 2026). At that exposure its vehicles were still involved in 183 injury crashes and 2 fatal ones, so a fleet’s safety case must budget for incidents in absolute numbers as well as in rates. At any constant per-mile rate, a 12× rise in exposure raises the expected cumulative incident count by the same factor, even though no individual vehicle became less safe. The count is an expectation, not a realized outcome, and it is cumulative; an operator sizing weekly incident-response capacity needs weekly mileage instead.

Figure 12: Measured Driverless Exposure and Crash Rates: (a) Cumulative rider-only miles, driven with no human driver, by Waymo’s fleet in its published releases from June 2024 to June 2026. (b) Crash outcomes per million miles through June 2026 for that driving (red) and for Waymo’s human-driver benchmark on the same roads (gray), with 95 percent confidence intervals on a logarithmic axis. Lower rates still produce a growing number of incidents as exposure grows. Benchmarks follow the method of Kusano et al. (2024); data from Waymo (2026).
Kusano, Kristofer D., John M. Scanlon, Yin-Hsiu Chen, Timothy L. McMurry, Ruoshu Chen, Tilia Gode, and Trent Victor. 2024. “Comparison of Waymo Rider-Only Crash Data to Human Benchmarks at 7.1 Million Miles.” Traffic Injury Prevention 25 (sup1). https://doi.org/10.1080/15389588.2024.2380786.
Waymo. 2026. Waymo Safety Impact Data Hub.

Even a fleet whose per-mile crash rate beats a human benchmark still accumulates absolute incidents as exposure scales, so technical excellence alone does not make a system safe. Safe systems also require attention to the human and organizational context in which they operate, including the economic incentives that shape design decisions and the understanding that end users bring to their interactions with autonomous systems. Those institutional obligations are the subject of accountability, governance, and sociotechnical analysis.

Self-Check: Question
  1. A robustness report for a deployed model includes a randomized-smoothing certificate and an empirical attack evaluation. What must the assurance case record about each before a launch authority relies on it?

    1. Nothing beyond the headline accuracy, because both results already establish that the end-to-end workflow is safe
    2. Only the empirical result, because a certificate is a mathematical proof and needs no stated scope
    3. Only the certificate, because empirical attack results guarantee immunity against all unseen attacks
    4. The certificate’s norm, radius, confidence, and model configuration, and the empirical evaluation’s attack protocol, since each supports a claim only within those stated boundaries
  2. In high-speed autonomous control loops (e.g., drone navigation or collision avoidance), explain why implementing prediction abstention creates an immediate latency-budget challenge.

  3. Order the 6 stages of the canonical Reinforcement Learning from Human Feedback (RLHF) alignment pipeline from initial training to deployment: (1) Supervised Fine-Tuning (SFT) on curated instruction demonstrations, (2) Proximal Policy Optimization (PPO) fine-tuning of the policy against the reward model, (3) Base model pretraining on massive web-scale corpora, (4) Aligned model safety validation and deployment, (5) Human rater pairwise preference data collection, (6) Reward Model training on preference comparisons.

  4. In Retrieval-Augmented Generation (RAG), why does RLHF of the core LLM fail to establish safety for the complete service, and what retrieval-path controls should be evaluated?

  5. Explain Goodhart’s law in the context of production recommendation algorithms and describe how optimizing for Click-Through Rate (CTR) can create value misalignment.

  6. In autonomous vehicle safety engineering, explain the purpose of formal frameworks like Responsibility-Sensitive Safety (RSS) and identify their fundamental operational limitation.

See Answers →

16.9 Accountability, Governance, and Sociotechnical Dynamics

When a deployed model harms someone, two questions decide whether the harm is corrected: who has the authority to investigate and remedy the decision, and whether the evidence needed to do so still exists. Accountability answers both by assigning owners, preserving traceable records, and monitoring behavior after launch, and it must hold inside the human workflows and institutions that surround the system.

16.9.1 Accountability and governance

When a third-party hiring platform rejects qualified applicants from one demographic group, the employer blames the model vendor, the vendor blames the historical resume corpus, and the rejected applicants have no remedy unless a contract and an audit trail assign responsibility across all three. Accountability in machine learning is the capacity to identify, attribute, and address the consequences of automated decisions. It extends beyond diagnosing technical failures to ensuring that responsibility for system behavior is explicitly assigned, that harms can be remedied, and that standards are maintained through oversight and institutional processes. Without those mechanisms, even well-intentioned systems can generate harm without recourse, undermining public trust.

Accountability already spans vendors and operators in distributed software. Machine learning extends those dependencies through data collection, labeling, and the choice of prediction targets and proxies. Model outputs are shaped by upstream data collection, training objectives, pipeline design, interface behavior, and postdeployment feedback. These interconnected components often involve multiple actors across technical, legal, and organizational domains. Responsible system design requires that these relationships be explicitly mapped and governed.

Inadequate governance can prevent institutions from recognizing or correcting harmful model behavior. The Google Flu Trends analysis identified persistent overestimation despite model updates and examined how changes in search behavior and the search service could undermine a predictor trained on earlier correlations (Lazer et al. 2014). Its comparison with CDC surveillance data supports a concrete governance requirement, namely an owner responsible for ongoing validation and recalibration against an independent measurement process. Legal frameworks reinforce that requirement, because some of the obligations mapped onto the assurance lifecycle (section 16.2) assign these owners and records by law.

Lazer, David, Ryan Kennedy, Gary King, and Alessandro Vespignani. 2014. “The Parable of Google Flu: Traps in Big Data Analysis.” Science 343 (6176): 1203–5. https://doi.org/10.1126/science.1248506.

20 Model cards: Proposed by Mitchell et al. (2019) as standardized documentation accompanying trained ML models. Cards report evaluation across relevant groups, intended uses, and known limitations. Production systems must link this documentation to the actual deployed model and its provenance; a card alone neither establishes that linkage nor supplies every record required for an audit.

Mitchell, Margaret, Simone Wu, Andrew Zaldivar, Parker Barnes, Lucy Vasserman, Ben Hutchinson, Elena Spitzer, Inioluwa Deborah Raji, and Timnit Gebru. 2019. “Model Cards for Model Reporting.” Proceedings of the Conference on Fairness, Accountability, and Transparency, 220–29. https://doi.org/10.1145/3287560.3287596.

21 Datasheets for datasets: Proposed by Gebru et al. (2021), modeled after electronics component datasheets that specify operating conditions and tolerances. Each datasheet documents a dataset’s motivation, composition, collection process, and recommended uses. For ML pipelines, this provenance and coverage information helps engineers identify assumptions and design evaluations. A datasheet does not itself validate a model’s operating envelope or predict all deployment failures.

Gebru, Timnit, Jamie Morgenstern, Briana Vecchione, Jennifer Wortman Vaughan, Hanna Wallach, Hal Daumé III, and Kate Crawford. 2021. “Datasheets for Datasets.” Communications of the ACM 64 (12): 86–92. https://doi.org/10.1145/3458723.

Designing for accountability entails supporting traceability at every stage of the system lifecycle. This includes documenting data provenance, recording model versioning, enabling human overrides, and retaining sufficient logs for retrospective analysis. Tools such as model cards20 (Mitchell et al. 2019) and datasheets for datasets21 (Gebru et al. 2021) exemplify practices that make system behavior interpretable and reviewable. However, accountability is not reducible to documentation alone; it also requires mechanisms for feedback, contestation, and redress.

Within organizations, governance structures help formalize this responsibility. Ethics review processes, cross-functional audits, and model risk committees provide forums for anticipating downstream impact and responding to new concerns. These structures must be supported by infrastructure that allows users to contest decisions and developers to respond with corrections. For instance, systems that allow explanations or user-initiated reviews help bridge the gap between model logic and user experience, especially in domains where the impact of error is significant.

Architectural decisions also play a role. Interfaces can be designed to surface uncertainty, allow escalation, or suspend automated actions when appropriate. Logging and monitoring pipelines must be configured to detect signs of ethical drift, such as performance degradation across subpopulations or unanticipated feedback loops. In distributed systems, where uniform observability is difficult to maintain, accountability must be embedded through architectural safeguards such as secure protocols, update constraints, or trusted components.

Accountability is realized through traceability infrastructure distributed across the endpoint and its operator. A cloud platform supports model registries, telemetry dashboards, and structured event pipelines that trace a prediction back to a specific model, input, or configuration. A TinyML endpoint may retain only a firmware identifier and bounded event records, while the operator maintains deployment inventories, validation evidence, and any servicing or update history. If a device cannot preserve event evidence or accept updates, the assurance case must state those limits and define a recall or retirement path, the obligation the accountability and governance rows of table 4 assign to each tier.

Mobile deployment makes this division of responsibility concrete. A local model, remote service, and user interface can each contribute to a decision, so the operating contract must assign investigation and remediation across their owners. Governance depends on accessible recourse pathways and mechanisms for surfacing, explaining, and contesting decisions, embedded into both the interface and the surrounding service architecture. Across every environment, sustaining accountability means planning for failure as deliberately as for success. Operators must define how anomalies are detected, how roles are assigned, how records are maintained, and how remediation occurs, with each step traceable in logs and enforceable through interfaces.

Governance does not imply centralized control. Instead, it involves distributing responsibility in ways that are transparent, actionable, and sustainable. Technical teams, legal experts, end users, and institutional leaders must all have access to the tools and information necessary to evaluate system behavior and intervene when necessary. As machine learning systems become more complex and embedded in important infrastructure, accountability must scale accordingly by becoming a foundational consideration in both architecture and process, not a reactive layer added after deployment.

Checkpoint 16.2: Principles as engineering constraints

Fairness, privacy, explainability, and safety now each carry a measurable claim and a cost, and accountability names who must answer for them. Before the chapter follows those owners into validation and monitoring, check that each principle works as an engineering constraint rather than an aspiration.

From principle to mechanism

Judging the trade-off

Accountability decides whether the claims tested above can be enforced. Enforcement begins before release, with the validation evidence a launch authority reviews, and continues after it through monitoring.

16.9.2 Validation approaches

A release candidate that passes a single held-out accuracy test in continuous integration can still ship with a 20-point subgroup error gap, an unverified privacy accountant, or explanations that collapse under quantization if no pre-launch gate requires that evidence. While detection identifies a problem and mitigation attempts to fix it, validation supplies the evidence bundle to the evaluation-and-assurance stage of table 1. Validation is not a separate pillar or a blanket claim that the system is safe; it tests bounded requirements and records residual uncertainty for the launch authority. Different stakeholders need different evidence: developers need diagnostics, auditors need reproducible statistical analyses, regulators may require conformity artifacts, and affected users need understandable reasons and a functioning contestability path. The evidence bundle can include fairness audits, privacy-accounting checks, robustness and distribution-shift tests, explanation-fidelity checks, and revalidation triggers tied to material changes.

Fairness audits, adversarial robustness testing, and explanation verification require evaluation capacity before release. Finding a defect at that stage can avoid exposing users and reduce subsequent recovery work. Validation therefore continues after release, whenever a material change invalidates the claims it supported.

↩︎ Continuous integration, release validation gates, and canary deployment pipelines are established in CI/CD for ML at Scale.

Organizing the evidence bundle by risk class makes residual risk explicit before deployment, with each class tied to a measurable artifact and an owner (table 9). Separating these artifacts ensures that passing a technical benchmark in one risk class never masks an unverified obligation in another.

Table 9: Validation Evidence by Risk Class: Responsible validation combines several kinds of evidence because no single metric proves that a system is safe to deploy. Each risk class needs a measurable artifact and an operational owner.
Risk class Evidence artifact Operational owner
Fairness Disaggregated metrics, thresholds, confidence intervals Product owner and model-risk reviewer
Privacy Privacy budget, deletion evidence, retention and access logs Data-governance and privacy engineering teams
Robustness Drift tests, corruption tests, canaries, red-team probes ML platform and incident-response teams
Explanation Fidelity tests, stability checks, recourse documentation Model team and user-facing operations
Governance Approval record, residual-risk owner, revalidation trigger Review board or accountable launch authority

Explanation can be a visible and computationally demanding form of validation evidence. Fairness metrics characterize aggregate disparities under selected definitions, while local explanation methods characterize influences, sensitivities, or contrastive alternatives for a particular output. Neither supplies a general guarantee, and an attribution cannot verify why a decision was justified. Together with behavioral tests, provenance, documentation, and contestability, these artifacts help operators investigate whether a decision relied on inappropriate signals and help affected users formulate a challenge.

16.9.3 Monitoring responsible behavior after deployment

A credit or clinical model that passed every pre-launch fairness and calibration check in January can drift out of compliance by July as seasonal traffic, applicant demographics, or user behavior shift underneath fixed weights. The real-time monitor of section 16.5.5.2 computes fairness metrics and their fleet-scale cost, but responsible behavior can erode slowly and across every property at once. Input distributions shift with seasonality, user behavior responds to system outputs, and policy or regulation changes what counts as acceptable. The shift taxonomy and detectors of Distribution shift and concept drift apply here unchanged; the governance question is what each detected change does to the claims that justified deployment.

The implications of such drift extend beyond raw accuracy. Fairness guarantees may break down if subgroup distributions shift relative to the training set, or if features that previously correlated with outcomes become unreliable in new contexts. Interpretability demands may also evolve, for instance as new stakeholder groups seek explanations, or as regulators introduce new transparency requirements. Trustworthiness, therefore, is not a static property conferred at training time, but a dynamic system attribute shaped by deployment context and operational feedback.

To ensure responsible behavior over time, machine learning systems must incorporate mechanisms for continual monitoring, evaluation, and corrective action. Monitoring carries the subgroup slicing of section 16.5.5 beyond fairness, to input-distribution shifts, anomalous outputs, and meaningful user feedback. These signals must then be compared to predefined expectations around fairness, robustness, and transparency, and linked to actionable system responses such as model retraining, recalibration, or rollback.

The architecture of figure 6 already carries this loop. FPR and TPR still wait for matched outcome labels, the delay the real-time monitor separates from prediction-only metrics. A disparity exceeding the approved gap tolerance \(\FairnessGapTolerance\), such as the \(|\text{SPD}| > 0.15\) alert rule (the subscript keeps it distinct from the privacy budget \(\PrivacyBudget\)), opens an investigation. Recalibration is one possible response; only a validated change approved through the release gate (Fairness gates) returns to serving.

That loop depends on telemetry that captures model versioning, input characteristics, prediction confidence, and postinference feedback. These logs support drift detection and provide evidence for retrospective audits of fairness and robustness. Monitoring systems must also be integrated with alerting, update scheduling, and policy review processes to support timely and traceable intervention.

Monitoring also supports feedback-driven improvement. For example, repeated user disagreement, correction requests, or operator overrides can signal problematic behavior. This feedback must be aggregated, validated, and translated into updates to training datasets, data labeling processes, or model architecture. However, such feedback loops carry risks. Biased user responses can introduce new inequities, and excessive logging can compromise privacy. Designing these loops requires careful coordination between user experience design, system security, and ethical governance.

Monitoring is useful only when its signals reach an owner in time to intervene, because observation is not remediation. The privacy, unlearning, and generative-system controls examined earlier need the same evidence, ownership, and response paths.

16.9.4 Sociotechnical system dynamics

Consider a constructed scenario in which a hospital deploys a sepsis predictor with strong held-out accuracy, but clinicians overwhelmed by alerts, a condition called alert fatigue, do not act on its warnings. Predictive performance alone cannot establish a mortality benefit, because the intervention must reach an appropriate clinician in time and support a useful action. The deployment therefore needs evaluation of the human workflow as well as the model.

The technical tools of the previous sections address bounded problems in bias measurement, privacy protection, explanation, and robustness. The sepsis scenario shows why those controls must connect to the human workflow. Engineers must examine who receives an alert, what action is feasible, and which incentives influence that action alongside model performance. Optimization can compare alternatives under stated objectives and constraints, but it cannot establish whose interests those objectives should represent. That judgment requires stakeholder participation and accountable governance.

Deployed systems create feedback loops that reshape future data, distribute decisions between people and models, and expose disagreements about acceptable outcomes. Each mechanism can invalidate an assurance claim even when the implementation still meets its original technical specification. The analysis must therefore follow the consequences of deployment through the surrounding workflow and back into system design.

System feedback loops

The sociotechnical feedback invariant (principle 27) captures this dynamic. Deployed models shape the environment they operate in, so that future data \(\ProbabilityFunction_{\FeedbackStepIndex+1}(\ModelInput)\) is a function of the model’s past decisions \(\ModelPredictor_{\FeedbackStepIndex}(\ModelInput)\). Here, \(\ModelInput\) is the model’s input, as in \(\BinaryClassifier(\ModelInput)\) earlier in the chapter; \(\ProbabilityFunction_{\FeedbackStepIndex}(\ModelInput)\) denotes the input distribution observed by the system at time \(\FeedbackStepIndex\), while \(\ModelPredictor_{\FeedbackStepIndex}(\ModelInput)\) denotes the deployed model or decision policy acting on those inputs. Such systems require closed-loop governance; reliability requires modeling the closed feedback loop rather than feed-forward inference alone.

Machine learning systems do not merely observe and model the world; they also shape it. Once deployed, their predictions and decisions often influence the environments they are intended to analyze. This feedback alters future data distributions, modifies user behavior, and affects institutional practices, creating a recursive loop between model outputs and system inputs. Over time, such dynamics can amplify biases, entrench disparities, or unintentionally shift the objectives a model was designed to serve. The compounding cycle passes through four interconnected stages (figure 13), from biased training data through model predictions and disparate real-world outcomes to reinforced bias in newly collected data. The three intervention points of section 16.5.5.1 each cut one arc of the cycle: preprocessing audits and reweighting at data ingestion, in-processing fairness constraints during training, and postprocessing threshold calibration at the serving layer.

Figure 13: Bias Amplification Feedback Loop: When ML systems retrain on their own outputs, historical bias in training data propagates through model predictions, downstream outcomes, and reinforced data before feeding back as even more biased retraining data. The edges (‘trains on’, ‘produces’, ‘creates’, ‘feeds into’) show a possible reinforcing mechanism, not a guarantee that every iteration increases disparity. Green intervention arrows mark where preprocessing (data audit and reweighting), in-processing (fairness constraints), and postprocessing (threshold calibration) can break the cycle.

A static post-hoc fairness audit can miss closed-loop reinforcement (figure 13). When a system retrains on outcomes selected by its own decisions, the resulting sample may reinforce initial skews without revealing what would have happened under a different policy. The feedback policy and available evidence determine whether disparities grow or shrink; an effective intervention need not modify every stage. Fairness therefore becomes a lifecycle constraint, in which data visibility determines what can be measured, threshold policy determines where errors land, and feedback infrastructure determines whether disparities decay or compound.

Predictive policing illustrates how this feedback can arise. A model trained on recorded arrests may direct more patrols to a neighborhood. If greater patrol presence produces more recorded incidents and the training pipeline treats those records as an unbiased measure of underlying crime, later predictions can reinforce the original allocation. The loop depends on how deployment changes observation and how retraining uses that evidence; it is not an inevitable consequence of every predictive model.

Recommender systems such as Archetype B (DLRM at Scale) show similar dynamics in digital environments. A content recommendation model that prioritizes engagement may gradually narrow the range of content a user is exposed to, leading to feedback loops that reinforce existing preferences or polarize opinions. These effects can be difficult to detect using conventional performance metrics, as the system continues to optimize its training objective even while diverging from broader social or epistemic goals.

Feedback loops undermine the assumption of independently and identically distributed data, so validation on a static test set can miss the model’s evolving effect on the data-generating process. Once a loop is established, interventions aimed at fairness or accuracy may have limited effect unless the underlying data dynamics are addressed. Responsible design therefore monitors how system outputs reshape the environment, how those changes enter new data, and whether retraining mitigates or exacerbates them.

In cloud-based systems, these updates may occur frequently and at scale, with extensive telemetry available to detect behavior drift. In contrast, edge and embedded deployments often operate offline or with limited observability. A smart home system that adapts thermostat behavior based on user interactions may reinforce energy consumption patterns or comfort preferences in ways that alter the home environment, and subsequently affect future inputs to the model. Without connectivity or centralized oversight, these loops may go unrecognized despite their effect on user behavior and system performance. Feedback loops are not inherently harmful, but they must be detected and managed; the drift detection and alerting of section 16.9.3 expose them only when the deployment can return the evidence.

Human-AI collaboration

Human operators turn feedback-loop risk into a shared-control problem. Machine learning systems are often deployed not as standalone agents, but as components in larger workflows that involve human decision-makers. In many domains, such as healthcare, finance, and transportation, models serve as decision-support tools, offering predictions, risk scores, or recommendations that are reviewed and acted upon by human operators. The collaborative configuration raises questions about how responsibility is shared between humans and machines, how trust is calibrated, and how oversight mechanisms are implemented in practice.

Human-AI collaboration introduces both opportunities and risks. When designed appropriately, systems can augment human judgment, reduce cognitive burden, and enhance consistency in decision-making. However, when poorly designed, they may lead to automation bias,22 where users over-rely on model outputs even in the presence of clear errors. Conversely, excessive distrust can result in algorithm aversion, where users disregard useful model predictions due to a lack of transparency or perceived credibility. The effectiveness of collaborative systems depends on how the system communicates uncertainty, provides explanations, and enables human override or correction, rather than on model accuracy alone.

22 Automation bias: Inappropriate reliance on automated recommendations, including acceptance of erroneous outputs. Its prevalence depends on the task, interface, workload, and users’ ability to check the output. Strong average performance can encourage reliance without making rare errors easier to recognize. Uncertainty displays, selective review, or requests for justification should be evaluated for their effects on correction rates, workload, and response time rather than assumed to improve safety.

Center, Pew Research. 2023. What Americans Know about AI, Cybersecurity and Big Tech.
Schäfer, Mike S. 2023. “The Notorious GPT: Science Communication in the Age of Artificial Intelligence.” Journal of Science Communication 22 (02): Y02. https://doi.org/10.22323/2.22020402.

Public knowledge about AI is uneven (Center 2023), and science-communication failures can amplify misunderstandings about how AI systems work (Schäfer 2023). That matters for deployment safety, because when users lack understanding of model uncertainty, data bias, or decision boundaries, they may trust system outputs in contexts where human judgment should intervene. From a systems engineering perspective, public comprehension is part of the deployment context, because the safety properties of a human-AI system depend on whether users can appropriately calibrate their trust and recognize situations requiring human override, not on technical mechanisms alone.

Automation changes work organization in ways that influence safety design decisions. The MIT Work of the Future task force (Work of the Future 2020) argues that technological change and labor-market institutions jointly determine whether automation improves job quality or concentrates harms. For ML systems, the safety implication is that removing human roles can also remove contextual judgment and system-level debugging that remain difficult to encode in models. Metrics focused solely on throughput may inadvertently penalize human-in-the-loop designs that preserve oversight capability.

Work of the Future, MIT Task Force on the. 2020. The Work of the Future: Building Better Jobs in an Age of Intelligent Machines. Massachusetts Institute of Technology.

Institutional incentives can reinforce automation bias when operators expect greater scrutiny for overriding a model than for accepting it. Consider an illustrative pair of judicial decisions. In Scenario A, a judge overrides a “high risk” algorithmic score and releases a defendant who later re-offends. The judge anticipates criticism for departing from the recommendation. In Scenario B, the judge follows the score and detains the defendant unnecessarily, but the institution treats agreement with the model as evidence of proper procedure. The incentive comes from that review policy, not from the model’s measured accuracy.

This asymmetry can encourage institutional deference, where human oversight becomes a “rubber stamp” for algorithmic decisions. Review procedures should evaluate the evidence behind both agreement and disagreement, rather than treating agreement as inherently correct. The required documentation must fit the decision’s stakes and the operator’s workload so that justification supports scrutiny rather than becoming another routine approval.

Oversight mechanisms must be tailored to the deployment context. In high-stakes domains, such as medical triage or autonomous driving, humans may be expected to supervise automated decisions in real time. This configuration places cognitive and temporal demands on the human operator and assumes that intervention will occur quickly and reliably when needed. In practice, however, continuous human supervision is often impractical or ineffective, particularly when the operator must monitor multiple systems or lacks clear criteria for intervention.

From a systems design perspective, supporting effective oversight requires more than providing access to raw model outputs. Interfaces must be constructed to surface relevant information at the right time, in the right format, and with appropriate context. Confidence scores, uncertainty estimates, explanations, and change alerts can all play a role in enabling human oversight. Workflows must define when and how intervention is possible, who is authorized to override model outputs, and how such overrides are logged, audited, and incorporated into future system updates.

Consider a hospital triage system that uses a machine learning model to prioritize patients in the emergency department. The model generates a risk score for each incoming patient, which is presented alongside a suggested triage category. In principle, a human nurse is responsible for confirming or overriding the suggestion. However, if the model’s outputs are presented without sufficient justification, such as an explanation of the contributing features or the context for uncertainty, the nurse may defer to the model even in borderline cases. Over time, the model’s outputs may become the de facto triage decision, especially under time pressure. If a distribution shift occurs (for instance, due to a new illness or change in patient demographics), the nurse may lack both the situational awareness and the interface support needed to detect that the model is underperforming. In such cases, the appearance of human oversight masks a system in which responsibility has effectively shifted to the model without clear accountability or recourse.

In such systems, human oversight depends on infrastructure design as much as on policy, including how predictions are surfaced, what information is retained, how intervention is enacted, and how feedback loops connect human decisions to system updates. Without integration across these components, oversight becomes fragmented, and responsibility may shift invisibly from human to machine.

Napkin Math 16.7: The automation bias paradox
Consider a radiology department deploying an AI assistant for tumor detection, where standalone human sensitivity is \(\HumanStandaloneSensitivity=\) 92 percent and standalone AI sensitivity is \(\AiStandaloneSensitivity=\) 95 percent. One might assume the combined system performance would exceed 95 percent. However, this illustrative scenario assumes that humans accept the AI’s missed detections at rates of 60–80 percent. Among patients with tumors, the AI misses a tumor with probability \(1 - \AiStandaloneSensitivity = 0.05\); if the human accepts that miss (\(\MissAcceptanceProbability = 0.7\)), these accepted misses alone create a conditional failure probability of \(0.05 \times 0.7 = 0.035\). In this simplified upper-bound case, where every other AI miss is corrected and no correct detection is overturned, sensitivity is 96.5 percent. False positives require separate evaluation among patients without tumors, while fatigue and interface delays can further affect the workflow.

This conditional error-acceptance probability matters more than the overall override rate. A low override rate may reflect few model errors or failures to detect them; those interpretations require different interventions. The trust calibration gap arises when reliance exceeds what the evidence supports. Evaluate interface changes against the fraction of actual errors corrected, errors introduced by overrides, and response delay before adopting them.

The boundary between decision support and automation is often fluid. Systems initially designed to assist human decision-makers may gradually assume greater autonomy as trust increases or organizational incentives shift. This transition can occur without explicit policy changes, resulting in de facto automation without appropriate accountability structures. Responsible system design must therefore anticipate changes in use over time and ensure that appropriate checks remain in place even as reliance on automation grows.

Normative pluralism and value conflicts

Human-AI collaboration exposes a deeper systems constraint, because different stakeholders often hold conflicting values and priorities. Algorithms can help identify feasible compromises, but they cannot establish whose priorities should govern a deployment. Technical excellence is necessary but insufficient for trustworthy AI because choosing among conceptions of fairness, privacy, and accountability requires a legitimate decision process as well as evidence about their consequences.

Responsible machine learning cannot be reduced to the optimization of a single objective. In real-world settings, machine learning systems are deployed into environments shaped by diverse, and often conflicting, human values. A high-stakes deployment makes these tensions concrete.

Example 16.2: Conflicting values in practice
Scenario: An adolescent mental health crisis detection pipeline must balance competing stakeholder objectives across real-time inference and data retention paths.

Diagnosis: Optimizing clinical efficacy via aggressive alert dispatch conflicts with patient autonomy and privacy protocols. Restricting data retention to protect user privacy limits offline retraining and explanation auditing, while routing high-confidence alerts to human counselors increases per-query serving cost and the end-to-end latency \(\EndToEndRequestLatency\), measured from the incoming message to an acknowledged alert. A local differential privacy mechanism would need a specified privacy unit, accountant, and clinical utility evaluation. The automated dispatch SLA covers producing and acknowledging an alert, not completing human counseling. Human response needs a separate deadline, staffed queue capacity, and an escalation policy for overload.

Systems lesson: Responsible AI trade-offs are hard architectural requirements, not after-the-fact policy notes. The deployment pipeline must encode stakeholder choices into explicit latency (\(\EndToEndRequestLatency\)) and privacy budgets before optimization begins.

What constitutes a fair outcome for one stakeholder may be perceived as inequitable by another. Similarly, decisions that prioritize accuracy or efficiency may conflict with goals such as transparency, individual autonomy, or harm reduction. These tensions are structural rather than incidental, reflecting the pluralistic societies and institutional settings in which machine learning systems operate. Fairness is a particularly prominent site of value conflict because its criteria can be incompatible (section 16.5.1.5) and choosing among them is a normative decision rather than a purely technical one, yet similar conflicts arise between interpretability and predictive performance, privacy and personalization, or short-term utility and long-term consequences.

Each deployment tier gives these conflicts a different form, adding to the tier comparison of section 16.4.1 the question of who decides. A voice assistant that personalizes on a mobile device keeps raw data local, which reduces transmission exposure without by itself establishing a privacy guarantee. Users with underrepresented usage patterns may still receive less accurate predictions, and detecting that disparity requires decisions about consent, aggregation, and access, so privacy, fairness, and personalization must be weighed against one another. A cloud credit-scoring or recommendation platform faces demands for explanations of consequential decisions while relying on complex ensembles or proprietary training data whose disclosure may be commercially sensitive or technically infeasible, which sets institutional accountability against business confidentiality. An edge camera or drone that compresses its model to meet latency and energy budgets trades efficiency against robustness; the effect must be measured on the deployed candidates under the expected shifts and threat model rather than assumed, and a more resilient candidate may exceed the memory or power budget. A TinyML device without persistent connectivity cannot absorb new fairness requirements through local retraining, so whether servicing or intermittent synchronization can deliver a revised model, and whether explanations and appeals can run off-device on preserved evidence, becomes part of the value decision. In every tier the conflict extends beyond what the model optimizes to what the system can support after deployment.

The recurring systems constraint is normative pluralism, not an abstract philosophical challenge. Technical approaches such as multi-objective optimization, constrained training, and fairness-aware evaluation can help surface and formalize trade-offs, but they do not eliminate the need for judgment. Decisions about whose values to represent, which harms to mitigate, and how to balance competing objectives cannot be made algorithmically. They require deliberation, stakeholder input, and governance structures that extend beyond the model itself. Machine learning systems are not neutral tools; they embed value judgments whether those judgments are specified or assumed.

Participatory methods and the Value-Sensitive Design process introduced with value alignment (section 16.8.3) offer paths forward. Rather than treating values as parameters to be optimized after deployment, these approaches seek to engage stakeholders during the requirements phase, define ethical trade-offs explicitly, and trace how they are instantiated in system architecture. Some requirements can be satisfied together; others require a documented choice or a decision not to deploy. Making these judgments explicit gives affected stakeholders something concrete to question and revise.

Value-Sensitive Design also governs the autonomy of the people a system serves. Applied to human control, it explicitly considers factors such as capability, complexity, misrepresentation, and the fluidity of user control. The METUX model (Motivation, Engagement, and Thriving in the User Experience) extends this thinking to six spheres of technology experience, namely adoption, interface, tasks, behavior, life, and society, each of which can support or undermine human flourishing (Peters et al. 2018). Both draw on self-determination theory’s account of autonomy as the ability to act in accordance with one’s own values and goals, rather than as control in a technical sense (Ryan and Deci 2000). In an ML system those requirements become concrete artifacts, namely interface affordances, user controls, feedback channels, escalation paths, and audit evidence. A recommender that optimizes engagement, for instance, can shape user preferences in ways the user cannot see. Evaluating it across the outer spheres of behavior, life, and society exposes effects that a short-term engagement metric never measures, so preserving autonomy requires controls and evidence beyond that metric.

Peters, D., R. A. Calvo, and R. M. Ryan. 2018. “Designing for Motivation, Engagement and Wellbeing in Digital Experience.” Frontiers in Psychology 9: 797. https://doi.org/10.3389/fpsyg.2018.00797.
Ryan, R. M., and E. L. Deci. 2000. “Self-Determination Theory and the Facilitation of Intrinsic Motivation, Social Development, and Well-Being.” American Psychologist 55 (1): 68–78. https://doi.org/10.1037/0003-066x.55.1.68.

Feedback loops, human-AI collaboration, and value conflicts show why the technical foundations from section 16.5 through section 16.8 cannot ensure responsible AI on their own. Without organizational authority, operational telemetry, and escalation paths, a fairness metric with no owner, an explanation with no appeal process, or a monitoring signal with no remediation budget becomes evidence without action.

Checkpoint 16.3: When correct code fails in deployment

Mathematically sound, fair, and explainable models can still fail in human institutions through feedback loops that reshape the data, automation bias and institutional deference, and normative pluralism among stakeholders.

Diagnosing the human-system interaction

Reasoning about loops and stakeholders

Self-Check: Question
  1. In dataset governance, standardized documentation of motivation, composition, collection process, and recommended uses, modeled on electronic-component specification sheets, is called ____.

  2. Order the stages of the Bias Amplification Feedback Loop in an unconstrained retraining pipeline: (1) Reinforced data bias is captured in operational logs, (2) Biased model produces skewed deployment predictions, (3) New model retrained on reinforced data exhibits compounded disparity, (4) Historical bias in initial training data is learned during initial model fit, (5) Real-world discriminatory outcomes occur based on automated decisions.

  3. True or False: In a closed-loop system where future data distribution \(\ProbabilityFunction_{\FeedbackStepIndex+1}(\ModelInput)\) is dynamically altered by current model decisions \(\ModelPredictor_{\FeedbackStepIndex}(\ModelInput)\) (such as predictive policing or recommendation engines), validating model performance on a static held-out test set guarantees long-term fairness and stability.

  4. In human-AI collaborative decision-making, what is the ‘paradox of reliability’ and what is its primary engineering implication for interface design?

    1. A model with \(50\%\) accuracy causes hardware crashes more frequently than a model with \(90\%\) accuracy
    2. As a model’s latency decreases, network packet loss increases proportionally
    3. Highly compressed models consume more DRAM memory than uncompressed models
    4. High apparent reliability can encourage over-reliance; interface design must be evaluated by how often users accept erroneous recommendations, correct errors, or introduce new errors, not by the overall override rate alone.
  5. A hospital deploys a sepsis predictor with high offline accuracy, yet mortality does not improve and clinicians often ignore alerts. What workflow explanations remain possible, and what evidence would distinguish them before choosing a remedy?

  6. Define normative pluralism in machine learning system design and explain why value conflicts cannot be resolved through purely algorithmic optimization.

See Answers →

16.10 Governing Responsible AI at Fleet Scale

The data science team wants to hold back deployment for a month to conduct rigorous fairness audits on a new generative model. The executive team, watching a competitor launch a similar feature, demands the model be deployed by Friday. Even when engineers know how to evaluate the relevant risks, the organizational structure, budget, and business priorities must give them the time and authority to act on that knowledge.

The scenario exposes the implementation gap between technical capability and operational authority. Responsible AI methods provide necessary tools, but their effectiveness depends on organizational structures, data infrastructure, evaluation processes, and sustained commitment that extends far beyond algorithm development. Systems maintain responsible behavior over time only when those implementation supports survive deadline pressure, product incentives, and postdeployment drift.

The practical barriers to embedding responsible AI in production ML systems span the classical People-Process-Technology framework. People challenges, the subject of section 16.10.1, encompass the organizational structures, authority, role definitions, and incentives that determine whether ethical commitments translate into durable operational behavior. Technology challenges begin with the data itself (section 16.10.2), where quality gaps and acquisition costs decide what a team can fix. Process challenges cover how competing objectives are resolved (section 16.10.3) and how responsibility constraints survive scaling, maintenance, and continuous delivery (section 16.10.4). A decision framework (section 16.10.5) then turns the three dimensions into deployment-specific priorities.

These dimensions matter because responsible AI fails when organizational incentives, development workflows, and production infrastructure pull in conflicting directions. The framework connects each technical claim to the process and owner needed to act on it. A fairness metric without an accountable owner produces no remediation, while a governance process lacking telemetry cannot detect drift. A formal privacy guarantee also does not implement deletion; that requires lineage and a removal workflow for the relevant data and model state. Effective implementation therefore demands systems-level strategies that embed responsibility into the architecture, infrastructure, and operating practices of machine learning deployment across all three dimensions simultaneously.

16.10.1 Organizational structures and incentives

When a modeling team is evaluated on quarterly engagement lift, data pipelines belong to a separate platform org, user appeals land in customer support, and compliance reviews happen in legal, a subgroup error gap or broken explanation path can sit unfixed for months because no single owner has both the budget and the stop-ship authority to repair it. Transparency and contestability fail when responsibility is distributed without corresponding authority. Institutional design must connect model, data, product, legal, and operational roles through a named escalation path, review capacity, and authority to restrict deployment or provide remedy.

Within companies, research labs, and public institutions, responsibility must be translated into concrete roles, workflows, and incentives. In practice, however, organizational structures often fragment responsibility, making it difficult to coordinate ethical objectives across engineering, product, legal, and operational teams.

Responsible AI requires sustained investment in practices such as subgroup performance evaluation, explainability analysis, adversarial robustness testing, and the integration of privacy-preserving techniques like differential privacy or federated training. These activities can be time-consuming and resource-intensive, yet they often fall outside the formal performance metrics used to evaluate team productivity. For example, teams may be incentivized to ship features quickly or meet performance benchmarks, even when doing so undermines fairness or overlooks potential harms. When ethical diligence is treated as a discretionary task, instead of being an integrated component of the system lifecycle, it becomes vulnerable to deprioritization under deadline pressure or organizational churn.

Responsibility is further complicated by ambiguity over ownership. In many organizations, no single team is responsible for ensuring that a system behaves ethically over time. Model performance may be owned by one team, user experience by another, data infrastructure by a third, and compliance by a fourth. When issues arise, including disparate impact in predictions or insufficient explanation quality, there may be no clear protocol for identifying root causes or coordinating mitigation. As a result, concerns raised by developers, users, or auditors may go unaddressed, not because of malicious intent, but due to lack of process and cross-functional alignment.

Establishing effective organizational structures for responsible AI requires more than policy declarations. It demands operational mechanisms: designated roles with responsibility for ethical oversight, documented escalation pathways, accountability for postdeployment monitoring, and incentives that reward teams for ethical foresight and system maintainability. Some organizations also embed domain experts or user advocates in product teams to anticipate downstream impacts and evaluate value trade-offs in context.

Technical infrastructure such as versioned model registries, model cards, and audit logs must be coupled with organizational structures such as ethics review boards, model risk committees, and red-teaming23 procedures. Their effectiveness depends on whether findings reach an authorized owner, receive a timely response, and lead to a verified correction when one is required. The existence of a committee or audit log alone does not establish that concerns have been addressed.

23 Red teaming: From Cold War military simulations where the “Red Team” acted as the Soviet adversary to probe US defenses. In Responsible AI, red teaming is the adversarial audit phase: specialized teams (hackers, linguists, ethicists) deliberately probe models for jailbreaks, bias, or toxic outputs before deployment. This discovery process identifies the long-tail risks that standard unit tests cannot catch.

Operational rigor comes with a measurable cost. Public responsible-AI standards and internal review processes illustrate that governance can add release latency through impact assessments, model reviews, red-team exercises, and documentation gates. Review capacity therefore becomes part of deployment planning. If every high-risk launch needs specialized review, the review queue becomes a bottleneck just like security review or capacity approval. That cost must be budgeted alongside remediation and residual risk; preventive review can reduce exposure, but does not guarantee that every incident will be avoided or that remediation will always cost more.

Third-party and foundation-model dependencies do not transfer accountability to the supplier. A deploying organization may inherit weights, safety evaluations, data documentation, or contractual controls, but it still chooses the use, interface, retrieved context, user population, monitoring, and response process. Procurement therefore needs the same rigor as an internal model gate: documented intended and prohibited uses, evaluation scope, version and change notification, incident disclosure, audit access, data handling, service dependencies, fallback behavior, and an exit plan. When supplier evidence is unavailable, the assurance case must record the gap as residual risk rather than silently treating a vendor assertion as a verified control.

The organization must provide these functions across the actual deployment lifecycle. A cloud team may operate continuous review and monitoring services; an embedded-device operator may rely on certification, firmware inventories, servicing, and recall. Domain experts, affected parties, and regulators remain part of the evidence and authority structure in either case. The operating arrangement must still support correction of an individual decision.

Accountability becomes visible at the point of remedy. Affected people need a discoverable channel to challenge an outcome, a record of the evidence considered, a reviewer with authority to correct the decision, a response deadline, and a way to propagate the correction into downstream systems. Aggregate model improvement is not a substitute for individual remedy, because retraining next quarter does not correct a benefit denied today. Incident procedures must therefore connect technical containment and rollback to notification, correction, compensation where applicable, root-cause analysis, and verification that the remedy reached every dependent decision record. Retirement does not end these duties: shutting down a model closes its execution path, but an appeal owner remains responsible for unresolved decisions after inference stops (section 16.2). England’s 2020 exam-grading algorithm showed how quickly an aggregate method can outrun the remedy path its decisions require.

War Story 16.2: The algorithmic grading failure (2020)
Context: In August 2020, following exam cancellations during COVID-19, England’s qualifications regulator (Ofqual) deployed a statistical standardization algorithm to grade ~280,000 A-level students (Ofqual 2020; Department for Education and Ofqual 2020).

Mechanism: To control grade inflation, the standardization method combined historical results with the cohort’s prior attainment to estimate grade distributions, then allocated grades using teachers’ student rankings. Small subject cohorts received greater weight on teacher-assessed grades. The method therefore used individual ranking evidence, but constrained its interpretation through cohort-level predictions that could differ from teachers’ assessments of individual achievement.

Impact: The calculated grade was lower than the teacher-assessed grade in 39.1 percent of cases (Ofqual 2020). Public outcry and student protests prompted a reversal of the grading policy days later.

Fix: Students were awarded the higher of the center-assessed grade and the calculated grade, replacing the earlier standardization policy.

Systems lesson: An aggregate prediction does not establish that every individual outcome is justified. An appeal channel must specify which evidence can change the decision, who can review it, and how quickly a correction can take effect; the existence of a procedural appeal alone does not answer those questions.

Ofqual. 2020. Awarding GCSE, AS, A Level, Advanced Extension Awards and Extended Project Qualifications in Summer 2020: Interim Report. Office of Qualifications; Examinations Regulation.
Department for Education, and Ofqual. 2020. GCSE and A Level Students to Receive Centre Assessment Grades. GOV.UK News Story.
Shneiderman, B. 2022. Human-Centered AI. Oxford University Press. https://doi.org/10.1093/oso/9780192845290.001.0001.
Shneiderman, B. 2020. “Bridging the Gap Between Ethics and Practice: Guidelines for Reliable, Safe, and Trustworthy Human-Centered AI Systems.” ACM Transactions on Interactive Intelligent Systems 10 (4): 1–31. https://doi.org/10.1145/3419764.

The responsibility for ethical system behavior is distributed across multiple constituencies, including industry, academia, civil society, and government. The resulting governance hierarchy surrounds the AI system with four concentric tiers (figure 14). The development team executes technical controls (fairness testing, model cards, red-teaming); the organization governs operational processes (impact assessments, ethical review boards); industry establishes consensus baselines (ISO standards, external audits); and government and society enforce legal boundaries (GDPR, the EU AI Act, sector-specific statutes) (Shneiderman 2022, 2020). Within organizations, this distribution must be mirrored by mechanisms that connect technical design with strategic oversight and operational control. Without these linkages, responsibility becomes diffuse, and well-intentioned efforts may be undermined by systemic misalignment.

Figure 14: Layers of Responsibility: Effective human-centered AI implementation requires shared accountability across nested layers. From the core Development Team outward through the Organization, Industry, and Government/Society, each surrounding layer enforces norms the inner layers cannot self-impose. External anchors, including ISO AI management standards, fairness testing, model cards, red-teaming, impact assessments, GDPR, the EU AI Act, and sector-specific law, bind these layers to practice (International Organization for Standardization and International Electrotechnical Commission 2023b; European Parliament and Council of the European Union 2016; European Parliament and Council of the European Union 2024).
International Organization for Standardization, and International Electrotechnical Commission. 2023b. ISO/IEC 42001:2023 Information Technology – Artificial Intelligence – Management System. ISO/IEC standard.

Technical excellence and regulatory compliance are therefore insufficient on their own. Responsible AI requires aligning ethical objectives with the institutional structures through which machine learning systems are designed, deployed, and maintained, so that responsibility is embedded in the organization that governs deployment as well as in the model itself. The same ownership problem becomes concrete at the data layer, where teams can know how to audit a dataset and still lack the authority, access, or infrastructure needed to change it.

16.10.2 Data constraints and quality gaps

A clinical imaging model trained on five urban teaching hospitals can achieve 94 percent accuracy overall while dropping to 78 percent on rural and elderly patients, yet acquiring and harmonizing replacement images across 50 partner hospitals can cost over $160 million and years of legal and schema negotiations. Improving data pipelines remains one of the hardest implementation challenges in practice, even when developers and researchers understand the need for representative coverage, accurate labels, and historical-bias mitigation. Responsibility for data is often split across teams, locked inside legacy systems, or governed by external institutions that a modeling team cannot unilaterally change.

Data engineering principles, including data validation, schema management, versioning, lineage tracking, and quality monitoring, provide the technical foundation for addressing these challenges. However, applying these principles to responsible AI introduces additional complexity. Fairness requires assessing representativeness across demographic groups, bias mitigation demands understanding historical data collection practices, and privacy preservation constrains which validation techniques are permissible. The organizational challenges described here reflect the gap between having robust data engineering infrastructure and using it effectively to support responsible AI objectives.

Subgroup imbalance, label ambiguity, and distribution shift, each of which affect generalization and performance across domains, are well-established concerns in responsible ML. These issues often manifest in the form of poor calibration, out-of-distribution failures, or demographic disparities in evaluation metrics. However, addressing them in real-world settings requires more than technical knowledge. It requires access to relevant data, institutional support for remediation, and sufficient time and resources to iterate on the dataset itself. Teams may lack the authority or infrastructure to modify a training dataset even after discovering performance disparities. Versioning and lineage make controlled correction possible by identifying the affected datasets and downstream models; they do not remove the need to acquire replacement data, retrain, and revalidate those models.

In domains like healthcare, education, and social services, these challenges are especially pronounced. Data acquisition may be subject to legal constraints, privacy regulations, or cross-organizational coordination. For example, a team developing a triage model may discover that their training data underrepresents patients from smaller or rural hospitals. Correcting this imbalance would require negotiating data access with external partners, aligning on feature standards, and resolving inconsistencies in labeling practices. The logistical and operational costs can be prohibitive even when all parties agree on the need for improvement.

Efforts to collect more representative data may also run into ethical and political concerns. In some cases, additional data collection could expose marginalized populations to new risks. This paradox of exposure, in which the individuals most harmed by exclusion are also those most vulnerable to misuse, complicates efforts to improve fairness through dataset expansion. For example, gathering more data on nonbinary individuals to support fairness in gender-sensitive applications may improve model coverage, but it also raises serious concerns around consent, identifiability, and downstream use. Teams must navigate these tensions carefully, often without clear institutional guidance.

Napkin Math 16.8: The representation cost
Problem: A medical imaging model trained on data from 5 hospitals achieves 94 percent accuracy overall but only 78 percent on underrepresented populations (rural patients, elderly patients, patients with darker skin tones). A proposed acquisition plan seeks data from 50+ hospitals across diverse geographies, demographics, and equipment types. This budget is an illustrative proposal, not a sample-size requirement derived from the accuracy gap; validation must establish whether it improves the relevant outcomes.

Math:

  1. Data acquisition cost: $50–$200 per labeled medical image, with 100,000 images budgeted per underrepresented subgroup.
  2. Representation-cost scenario: For 10 subgroups, at the midpoint of the cost range, 10 times 100,000 images per subgroup times $125 per image yields $125M in data acquisition alone. This calculation assumes distinct purchased examples for each allocation; overlapping demographic groups require deduplication or explicit shared-cost allocation.
  1. Data harmonization: Data harmonization across different scanners, protocols, and labeling conventions adds 30 percent–50 percent overhead, bringing the total to $162.5M–$187.5M.

Systems insight: The acquisition budget makes coverage goals explicit, but spending does not guarantee that an accuracy gap closes. Teams should prioritize identified coverage deficiencies using harm, data quality, privacy, and expected benefit criteria, then validate the resulting model on the intended populations.

One horizontal bar on a linear dollar scale from zero. A solid orange segment is labeled 125 million dollars; a lighter two-tone extension is labeled plus 30 to 50 percent, and a bracket under the 30 to 50 percent part reads 162.5 to 187.5 million dollars total.

Harmonizing scanners, protocols, and labels adds 30–50 percent to the acquisition cost.

Himmelstein, Gracie, David Bates, and Li Zhou. 2022. “Examination of Stigmatizing Language in the Electronic Health Record.” JAMA Network Open 5 (1): e2144967. https://doi.org/10.1001/jamanetworkopen.2021.44967.

Upstream biases in data collection systems can persist unchecked even when data is plentiful. Many organizations rely on third-party data vendors, external APIs, or operational databases that were not designed with fairness or interpretability in mind. For instance, Electronic Health Records, which are commonly used in clinical machine learning, often reflect systemic disparities in care, as well as documentation habits that encode racial or socioeconomic bias (Himmelstein et al. 2022). Teams working downstream may have little visibility into how these records were created, and few levers for addressing embedded harms.

Improving dataset quality is often not the responsibility of any one team. Data pipelines may be maintained by infrastructure or analytics groups that operate independently of the ML engineering or model evaluation teams. This organizational fragmentation makes it difficult to coordinate data audits, track provenance, or implement feedback loops that connect model behavior to underlying data issues. In practice, responsibility for dataset quality tends to fall through the cracks, recognized as important, but rarely prioritized or resourced.

Addressing these challenges requires long-term investment in infrastructure, workflows, and cross-functional communication. Data validation and automated audits can identify defects, while datasheets and the Data Nutrition Project24 document dataset properties. Model cards connect model evaluation and intended use to that evidence. These tools help only when teams have the mandate and support to act on their findings.

24 Data Nutrition Project: A nonprofit initiative that develops standardized dataset documentation modeled on nutrition labels, summarizing provenance, composition, distribution, and known issues for datasets used in ML pipelines. The project’s labels make dataset risks legible to downstream engineers who lack access to the original collection process, which bridges the organizational fragmentation described here.

Improving data quality is therefore fundamentally a question of how responsibility for data is assigned, shared, and sustained across the system lifecycle, not merely a matter of better tooling. Once that responsibility is in place, teams still have to decide which responsible-AI objective should dominate when valid goals conflict.

16.10.3 Balancing competing objectives

When a modeling team tunes for aggregate accuracy, a compliance team injects differential-privacy noise that degrades minority-group recall, and a serving team prunes the network to hit a 15 ms latency target, their uncoordinated local optimizations can break the deployment’s fairness and explanation guarantees even though every team met its own metric. Machine learning system design is often framed as optimizing a single loss or accuracy objective, yet production systems must balance accuracy against fairness, interpretability, robustness, privacy, and resource efficiency, objectives that routinely pull in opposite directions. The accuracy-interpretability, personalization-fairness, and privacy-utility conflicts of section 16.4.1 recur here, and each must be measured on the path where its mechanism actually executes rather than assumed. Those trade-offs are not purely technical; they reflect deeper normative judgments about what a system is designed to achieve and for whom, as explored in detail in section 16.9.4.3. Responsible ML development requires making these judgments explicit, evaluating them in context, and subjecting them to stakeholder input and institutional oversight.

What makes this challenge particularly difficult in implementation is that these competing objectives are rarely owned by a single team or function. Performance may be optimized by the modeling team, fairness monitored by a responsible AI group, and privacy handled by legal or compliance departments. Without deliberate coordination, system-level trade-offs can be made implicitly, piecemeal, or without visibility into long-term consequences. Over time, the result may be a model that appears well-behaved in isolation but fails to meet its ethical goals when embedded in production infrastructure.

Balancing competing objectives requires transparency, deliberation, and cross-team alignment alongside technical fluency. Systems must be designed to surface trade-offs rather than obscure them, to make room for constraint-aware development rather than pursue narrow optimization. In practice, this may require redefining what “success” looks like, not as performance on a single metric, but as sustained alignment between system behavior and its intended role in a broader social or operational context.

Organizational structures, data quality, and competing objectives explain why technical competence alone does not secure responsible behavior. A team can understand fairness metrics and still lack authority to change a dataset or delay a release. When modeling teams optimize performance, compliance teams address privacy, and product teams prioritize engagement independently, their local decisions may violate a shared requirement. Clear ownership across those boundaries connects evaluation to action, while data infrastructure and deliberative review make the evidence and trade-offs inspectable. Maintaining those connections becomes harder as deployments scale and their data, models, and teams change.

16.10.4 Scalability, maintenance, and evaluation standards

Fairness audits are often conducted during initial evaluation, interpretability methods applied during model selection, and privacy-preserving techniques considered during training, but these practices frequently degrade or disappear as systems move from research prototypes to production. Fairness checks run on a static dataset never join the ingestion pipeline, explanation methods never reach a user-facing interface, and privacy constraints enforced during training are overlooked in postdeployment monitoring or model updates. The gap between what is possible in principle and what is sustainable in production is a core implementation challenge for responsible AI.

Production environments introduce new pressures that reshape system priorities. Models must operate across diverse hardware configurations, interface with evolving APIs, serve millions of users with low latency, and maintain availability under operational stress. These constraints demand continuous adaptation and rapid iteration, often deprioritizing activities that are difficult to automate or measure. Responsible AI practices, especially those that involve human review, stakeholder consultation, or post-hoc evaluation, may not be easily incorporated into fast-paced DevOps25 pipelines.

25 MLOps (machine learning operations): ML CI/CD pipelines must handle data versioning, training reproducibility, and A/B testing of algorithm changes beyond traditional software concerns. High-velocity ML organizations may deploy model or configuration changes far more often than responsible-AI reviews can be completed manually, creating a velocity gap in which deployment cycles measured in hours compete against ethical validation requiring days or weeks. This tension explains why responsible AI commitments present at the prototype stage can be deprioritized as systems scale.

Maintenance introduces further complexity. Machine learning systems are rarely static. New data is ingested, retraining is performed, features are deprecated or added, and usage patterns shift over time. In the absence of rigorous version control, changelogs, and impact assessments, it can be difficult to trace how system behavior evolves or whether responsibility-related properties such as fairness or robustness are being preserved. Organizational turnover and team restructuring can erode institutional memory. Teams responsible for maintaining a deployed model may not be the ones who originally developed or audited it, leading to unintentional misalignment between system goals and deployed behavior. These issues are especially acute in continual or streaming learning. Drift calls for investigation and a response matched to its consequences, which may mean restricting use or invoking fallback while a revised model undergoes validation, rather than immediately updating production weights.

These challenges are magnified in multi-model systems and cross-platform deployments. A recommendation engine may consist of dozens of interacting models, each optimized for a different subtask or user segment. A voice assistant deployed across mobile and edge environments may maintain different versions of the same model, tuned to local hardware constraints. Coordinating updates, ensuring consistency, and sustaining responsible behavior in such distributed systems requires infrastructure that tracks governing values and constraints alongside code and data. Addressing these challenges means treating responsible AI as a lifecycle property rather than a one-time evaluation: audit hooks, metadata tracking, and monitoring protocols built into infrastructure, with documentation and accountability structures that survive team handoffs.

Maintenance also exposes a gap in how responsible-AI evidence is standardized. A model evaluated under demographic parity on one benchmark has not thereby satisfied equalized odds in another deployment. The criterion, population, labels, threshold policy, and uncertainty belong to the claim. Changing any of them can invalidate the evidence even when the weights remain unchanged. Standardization must make those conditions explicit so teams can compare results and identify what needs revalidation.

The evaluation boundary must also match the deployment boundary. A model-only result can miss effects introduced by feature transformations, request routing, caching, or human review. Separate fairness, explanation, and compliance tools therefore need compatible identifiers and records linking their results to the same model, data, policy, and workflow versions. Otherwise, an assurance case can combine individually valid results that describe different systems.

Reusing that evidence after launch requires lifecycle controls. Production observations must be comparable with the acceptance criteria, and material changes must trigger a documented revalidation scope. Evidence must therefore remain interpretable across teams, components, and time. The implementation decision is then which obligations take priority for the intended use, which controls can satisfy them, and which authority may accept the remaining risk.

16.10.5 Implementation decision framework

An intensive-care diagnostic model, a 10,000-query-per-second consumer recommender, and a milliwatt microcontroller sensor cannot run the same safeguards on the same path: the ICU model needs clinician-legible explanations and contested-case routing, the recommender needs continuous slice-drift monitoring and feedback-loop breakers, and the microcontroller must lock in its safety envelope and energy budget before firmware ships. Practitioners therefore need a systematic way to prioritize responsible AI controls by deployment context and stakeholder risk.

Four decision heuristics guide these trade-offs in practice. Where multiple principles conflict, engineering teams must engage domain stakeholders to establish which failure modes present the most severe harms; as the adolescent mental health crisis-detection example in section 16.9.4.3 demonstrated, such value tensions require deliberate institutional policy rather than mathematical optimization alone. Under tight computational budgets, teams must first identify mandatory requirements, then allocate evaluation and response capacity according to risk. Sampling is adequate only if it can detect the relevant failures, and expensive audits need not run on the inference path. Whenever the deployment context changes, as when a cloud model migrates to edge execution with intermittent centralized monitoring, teams must re-evaluate principle priorities, establishing local fallback safeguards and evidence-synchronization plans for constrained connectivity. Finally, when stakeholder values diverge, engineers must document trade-offs explicitly and construct contestability mechanisms that permit affected individuals to challenge automated outcomes.

Each deployment context suggests candidate priorities and trade-offs for deployment-specific review (table 10). Applicable obligations, the threat model, and accountable stakeholder decisions determine which controls and trade-offs are acceptable.

Table 10: Practitioner Decision Framework: Prioritizing responsible AI principles based on deployment context, showing candidate principles, controls, and trade-offs for different system types. Deployment-specific review must establish applicable requirements and justify the selected controls; no row waives mandatory obligations.
Deployment context Primary principles Implementation priority Trade-offs to evaluate
High-Stakes Individual Decisions (healthcare diagnosis, credit and loans, criminal justice, employment) Fairness, explainability, accountability Mandatory fairness metrics across protected groups; explanations for negative outcomes; human oversight for edge cases A measured accuracy budget for interpretability; bounded explanation latency; higher computational cost
Safety-Critical Systems (autonomous vehicles, medical devices, industrial control) Safety, robustness, accountability Threat-model-specific evaluation; bounded certification where applicable; fail-safe mechanisms; comprehensive logging Significant validation and adversarial-training overhead; conservative confidence thresholds; redundant inference
Privacy-Sensitive Applications (health records, financial data, personal communications) Privacy, security, transparency Data minimization and appropriate consent mechanisms; evaluate local processing and differential privacy with stated \((\PrivacyBudget, \PrivacyAdditiveSlack)\), privacy unit, and accountant Privacy-utility trade-offs; higher client-side compute; limited model updates; reduced personalization
Large-Scale Consumer Systems (content recommendation, search, advertising) Fairness, transparency, safety Bias monitoring across demographics; explanation mechanisms; content-policy enforcement; feedback-loop detection Sampled or asynchronous explanations at scale; serving-path latency budgeted for fairness checks; investment in monitoring infrastructure
Resource-Constrained Deployments (mobile, edge, TinyML) Privacy, efficiency, safety Local inference; data locality; input validation; graceful degradation Expensive audits moved off-device, while local safety checks, fleet or servicing audits, update authority, and retirement criteria are retained
Research and Exploratory Systems (internal tools, prototypes, A/B tests) Transparency, safety (harm prevention) Documented known limitations; restricted user populations; monitoring for unintended harms Evaluation depth matched to potential harm and applicable obligations; observability and bounded iteration

Lighthouse 16.1: Lighthouse archetypes: Evidence and decision authority
The lighthouse workloads in Three systems archetypes require different evidence because they expose different harms, and they assign decision authority to different operating paths.

Workload Minimum decision evidence Required authority
Archetype A (GPT-4/Llama-3) Capability- and use-specific safety evaluations, harmful-output and misuse tests, uncertainty and fallback behavior, and versioned deployment evidence Model and safety owners approve the allowed use envelope; service owners can halt or roll back when monitoring invalidates it
Archetype B (DLRM at Scale) Disaggregated ranking quality, exposure and error rates, feedback-loop analysis, and online effects under the serving policy Product and responsible-AI owners choose the welfare and fairness criteria; operators can disable a model or policy that breaches them
Archetype C (Federated MobileNet) Per-device and subgroup quality, participation bias, privacy accounting, update integrity, and behavior across client versions Device, privacy, and model owners approve participation and update policy; fleet control can suspend aggregation or revert clients

A metric becomes a control only when the named authority can act on it. Evidence that is sufficient for a recommender policy review does not establish safety for a general-purpose language model, and aggregate federated accuracy does not authorize an update whose participation or privacy assumptions have failed.

The framework provides starting guidance, but it should be read as a triage mechanism rather than a complete governance program. Legal obligations depend on intended use, jurisdiction, and organizational role, not whether inference runs in a cloud or on a microcontroller (European Parliament and Council of the European Union 2024; European Parliament and Council of the European Union 2016). The framework identifies which constraints deserve first attention, with reassessment as deployment conditions change. The lifecycle assigns human authority over deployment even when individual actions are automated. Engineers investigate bias, operators review fairness metrics, and developers respond to drift. Some systems must also act faster than humans can review an individual decision. Autonomous vehicles respond in milliseconds; trading algorithms execute thousands of transactions before human review is possible; content moderation systems process billions of posts daily. For these systems, the implementation framework must be paired with the value-alignment and fallback controls of section 16.8.3, which keep objectives aligned with human values even when operation runs beyond continuous human supervision.

European Parliament and Council of the European Union. 2024. Regulation (EU) 2024/1689 of the European Parliament and of the Council of 13 June 2024 Laying down Harmonised Rules on Artificial Intelligence (AI Act). Official Journal of the European Union, L 2024/1689.

Systems Perspective 16.2: Responsibility is infrastructure, not a feature
Retrofitting responsible AI controls can require architectural redesign and revalidation, just as adding fault tolerance can. The structural costs cataloged in table 5 each carry a provisioning consequence: bias-drift monitoring needs a sampling and analysis budget; expensive or exact explanation workloads may need a dedicated asynchronous worker fleet, whereas model-specific TreeSHAP, sampling, caching, or selective generation may fit smaller budgets; DP-SGD requires budgeting its clipping, noise, and accounting work under the chosen implementation; and impact assessments need review capacity in the release process. These are not optional add-ons but load-bearing components of production ML systems. In high-risk or regulated deployments, failing to provision the evidence required by the assurance case can block release or force redesign even when core model performance is strong.

Self-Check: Question
  1. In medical imaging ML pipelines, what is the ‘representation cost’ and why does the cost of acquiring representative training data scale with subgroup coverage rather than total image volume?

    1. It is an annual government licensing fee levied on deep learning medical devices
    2. It represents the network bandwidth consumed when downloading public datasets from cloud buckets
    3. It reflects the substantial financial and logistical cost ($125M+ in the chapter’s sizing scenario) of acquiring, curating, and harmonizing clinical data from diverse geographic hospitals, specialized scanners, and underrepresented patient demographics
    4. It is the GPU memory overhead required to store floating-point feature embeddings during distributed backpropagation
  2. A company builds a customer-facing assistant on a third-party foundation model whose vendor publishes safety evaluations and contractual controls. How does this dependency change the deploying organization’s accountability?

    1. Accountability transfers to the vendor, because the vendor trained the weights and evaluated their safety
    2. Accountability is shared equally by contract, so the deploying organization need only monitor uptime
    3. Accountability stays with the deploying organization, which still chooses the use, interface, retrieved context, user population, monitoring, and response process, so procurement needs the same rigor as an internal model gate
    4. Accountability disappears for inherited components, because the vendor’s evaluations already cover every downstream use
  3. True or False: When an automated decision system wrongly denies some individuals a benefit, retraining the model next quarter to improve aggregate accuracy provides those individuals with adequate remedy.

  4. A team’s assurance case combines a demographic-parity result from one benchmark, a model-only explanation audit, and a compliance report produced by a separate tool. Explain why these individually valid results may not support a claim about the deployed system.

See Answers →

16.11 Fallacies and Pitfalls

Responsible AI involves counterintuitive trade-offs where ethical principles conflict mathematically and technically. Practitioners from traditional software backgrounds often assume ethical guidelines translate directly to implementation without recognizing the impossibility theorems and computational costs involved. The following fallacies and pitfalls expose misconceptions that hide the structural costs of responsibility or mistake a local technical result for system-level assurance, leading to deployed systems that appear fair in development but violate fairness criteria in production or impose prohibitive computational overhead.

Fallacy: Bias will disappear with more data and better algorithms.

More representative data and better algorithms can reduce some disparities, but they do not determine whether the prediction target is appropriate. The healthcare algorithm described in section 16.5.1 underestimated Black patients’ health needs at a given risk score because expenditure was an imperfect proxy for need. Improving prediction of that proxy would not by itself repair the target. Separately, with unequal base rates and imperfect prediction, groupwise score calibration cannot coexist with equal mean scores across groups in both outcome classes. Engineers must distinguish a remediable data or modeling defect from incompatible requirements, then use stakeholder deliberation to justify the criteria the deployment will pursue.

Pitfall: Treating explainability as an optional feature to be added after core functionality works.

This approach ignores the displacement of overhead, because producing attribution evidence about model behavior demands compute, storage, and interfaces that constrain the architecture. Approximate SHAP explanations are not compute-free (table 5); even a bounded explanation budget can increase request latency and memory pressure. In this sizing example, a recommendation system serving 100 ms latency requirements at 10,000 QPS cannot retrofit explanation work without revisiting the SLA: the illustrative explanation budget adds 50 ms to 200 ms per request, increasing total latency to 150 ms–300 ms (requiring 1.5–3× capacity only under the simplifying assumption that occupied resource time grows in direct proportion to latency, at fixed utilization and parallelism). The assurance case must specify the audience, claim, method, fidelity test, and delivery budget, then choose an architecture such as model-specific TreeSHAP, sampled or cached attribution, selective asynchronous generation, or an inherently interpretable model. Additional replicas can preserve throughput under that assumption, but they do not restore the original per-request latency if explanation remains on the serial path. None of these attribution paths exposes a model’s internal reasoning or establishes causation.

Fallacy: Achieving one fairness metric guarantees overall system fairness.

Practitioners often optimize for demographic parity, which equalizes approval rates across groups, and then assume fair treatment follows. In reality, fairness metrics can conflict mathematically. In the credit-scoring scenario of notebook 16.4, reaching approval parity cost 4 percentage points of accuracy and left approvals in the two groups carrying different default risk. The score-balance impossibility result shows that, with unequal base rates and imperfect prediction, groupwise calibration and equal mean scores across groups in both outcome classes cannot all hold; demographic parity can add a separate selection-rate constraint. Passing one metric therefore leaves other criteria to evaluate. A metric disparity is evidence for investigation, while a legal conclusion depends on the applicable rule and the facts of the deployment.

Pitfall: Implementing fairness constraints without analyzing threshold trade-offs and calibration impacts.

Moving a threshold can equalize one metric while leaving the underlying score calibration unchanged, and in production the threshold is an operational policy embedded in serving code, human review, audit records, and downstream decisions rather than a standalone cutoff in a notebook. Group-specific thresholds can satisfy equal true positive rates, but they also change decision semantics. If the Group A threshold is 0.75 and the Group B threshold is 0.45, as in figure 5, identical scores can yield different decisions, and the positive predictive value of approved applicants can diverge across groups even when the underlying score model remains calibrated. A loan officer seeing an approval cannot know whether it represents the same repayment-risk meaning across groups without documentation of the group-specific threshold policy. Production systems therefore need documented metric selection, uncertainty estimates, staff training, legal review, and audit trails explaining why identical scores can yield different decisions. No generic training objective resolves incompatible fairness definitions; the appropriate response is to choose and justify the criteria for the deployment context, quantify the resulting trade-offs, and monitor whether the approved policy remains valid.

Fallacy: Monitoring dashboards create accountability by themselves.

Dashboards can expose fairness drift, explanation failures, or abuse trends, but they do not decide who must act. Teams often instrument fairness, safety, or privacy metrics because a policy requires visibility, then leave the response path undefined, which creates a false sense of control. A metric that no team owns is not a control; it is a log entry. The system accumulates evidence without changing behavior, so alerts age out, fairness regressions become accepted baselines, and affected users receive no route to contest the decision. Production responsibility requires binding each monitoring signal to an owner, a threshold, an escalation path, and a remediation budget, whether that is a release gate, an incident owner, rollback authority, or human-review capacity.

Pitfall: Treating responsible AI as pure compliance overhead.

This perspective misses the value of identifying and responding to risk. Differential privacy can enable organizations to work with sensitive data under clearer privacy guarantees, but it also imposes privacy-utility trade-offs that must be planned in the training budget. Fairness-aware training and monitoring can support that risk-management process. The employment-selection screen discussed in section 16.5.2.1 illustrates one context-specific disparity threshold, rather than a universal legal test. Monitoring need-adjusted outcomes by group could reveal a disparity such as the healthcare algorithm’s underestimate of Black patients’ needs. Reducing the resulting harm still requires an owner with authority, capacity, and a validated remedy; detection alone does not protect affected people.

Treating a local metric or control as sufficient system assurance is the common failure behind these examples. A mathematical fairness constraint is only responsible when the system also accounts for downstream population effects, documentation requirements, operational capacity, and legal exposure.

Self-Check: Question
  1. A service uses 100 ms of baseline processing per request at 10,000 QPS. Adding inline explanations requires another 50–200 ms of processing. What is the approximate capacity increase needed to preserve throughput, and does it also preserve a 100 ms latency limit?

    1. Approximately \(1.5\times\)–\(3.0\times\) capacity can preserve throughput, but serial request latency rises to 150–300 ms; meeting 100 ms requires reducing or moving explanation work off the critical path.
    2. No capacity increase is needed because SHAP values are precomputed during compiler optimization
    3. Serving capacity can be reduced by \(50\%\) because explanations compress network bandwidth
    4. The system requires upgrading DRAM from DDR4 to DDR5 with zero additional server nodes
  2. A study of a widely used healthcare risk-prediction algorithm found that predicted healthcare expenditure could reproduce racial disparities in access to care. Why does this example challenge the claim that more data and better algorithms alone eliminate bias?

    1. The training dataset contained fewer than 1,000 total medical records
    2. The deep neural network suffered from gradient vanishing across recurrent layers
    3. The engineers selected healthcare expenditure as a proxy variable for health need; because Black patients faced historical access barriers and lower healthcare spending, the model inferred they were less sick than white patients with identical medical severity
    4. An external cyber adversary poisoned the training dataset labels with malicious random noise
  3. Explain why launching real-time fairness monitoring dashboards without assigning an operational remediation owner constitutes a dangerous production pitfall (‘evidence without action’).

  4. True or False: Adjusting post-hoc decision thresholds per group to equalize true positive rates resolves algorithmic unfairness without altering the business risk meaning or calibration of positive predictions.

See Answers →

16.12 Summary

Responsible AI connects the fleet’s technical controls to justified decisions about deployment and remedy. Fairness metrics expose disparities, privacy and robustness controls support bounded claims, and explanations provide evidence that people must be able to inspect or contest. None of these mechanisms establishes responsibility on its own. A versioned assurance case connects the intended use, affected population, evidence, assumptions, and accountable authority, while monitoring and revalidation keep those claims tied to the system that actually runs.

Responsible AI is a systems engineering concern because its controls reshape the production architecture: fairness monitoring consumes compute and can affect latency, explainability methods such as SHAP and LIME add inference work that must be factored into capacity planning and SLO compliance, and system prompts, model versions, and audit logs require ownership, versioning, and CI/CD gates. These costs must be budgeted during design rather than added after deployment.

Selective explanation generation illustrates the C³ choice. Producing an explanation synchronously adds compute to the request path and may add communication to retrieve features; moving it to an asynchronous worker protects serving latency but adds coordination among the decision, evidence record, and appeal workflow. The bottleneck then moves from inference capacity to evidence freshness or reviewer throughput. The acceptable architecture depends on who needs the explanation and how quickly that person must be able to act on it. Read through the Fleet Law (equation 1.3), private or adversarial training can add compute through mechanism-specific operations or additional evaluations. Launch approvals and revalidation gates add coordination delays that replication alone cannot remove. Asynchronous evidence generation permits overlap only when the evidence still arrives before the decision or remedy that depends on it.

Key Takeaways: Responsibility needs evidence and authority
  • Responsibility gates deployment: In high-risk or regulated settings, accuracy and latency cannot substitute for documentation, audit, and ownership. A versioned assurance case justifies one stated use, and a material change expires its approval.
  • Fairness requires justified criteria: The running loan model violates every criterion at once, and the disaggregated-metrics table shows a second loan model with a 0 percentage-point false-positive gap while still carrying 15 percentage-point approval and 30 percentage-point true-positive gaps. The impossibility result shows that, with unequal base rates and imperfect prediction, no score can be calibrated within each group and also give equal mean scores across groups in both outcome classes, so the chosen criteria need an explicit justification.
  • A gap is evidence, not a verdict: A subgroup disparity supports a decision only with denominators, confidence intervals, and intersectional coverage, and even a significant gap does not identify its cause. A causal claim needs an explicit structural model and assumptions that observational data cannot supply.
  • Safeguards are budgeted capacity: Fairness monitoring, audit logs, explanations, private training, and generative guardrails such as system prompts and output filters each consume compute, storage, or review capacity on a specific path, and each is a versioned artifact. Where a control runs decides its cost and whom it protects.
  • Deletion must reach the weights: A privacy guarantee bounds exposure but does not remove a record from trained parameters. Removing its influence needs lineage, a removal method with evidence, and an architecture, such as sharded training, chosen before training begins.
  • Deployed models reshape their data: Predictions change the populations, behaviors, and labels that later training sees, so a static test set cannot detect a self-fulfilling loop. Human oversight helps only when it is designed against both automation bias and alert fatigue.
  • Evidence needs an owner and a remedy: Dashboards and explanations protect people only when an owner can investigate, roll back, or escalate, and an affected person can challenge a decision and obtain correction. Every measured obligation needs an accountable operating path.

Quantification can show which groups bear a policy’s errors and what its safeguards cost, but it cannot decide whose interests should take priority. The engineering responsibility is to make those choices explicit, preserve the evidence behind them, and provide authority to revisit them when the system or its consequences change. Governance makes the fleet’s objective itself accountable, as well as the machinery used to pursue it.

What’s Next: From responsibility to synthesis
Responsible governance joins performance, security, robustness, and sustainability as a constraint the fleet must satisfy before it may run. The four parts have now traversed the fleet from physical silicon, networks, and storage in Part I, through distributed coordination and recovery in Part II and fleet efficiency and serving in Part III, to the governance safeguards of Part IV. Each part examined its constraints largely one at a time, yet a production fleet couples them all. An optimization at the kernel layer reverberates into cluster power budgets, and a governance rule reshapes the serving architecture. The final chapter returns to the scale moment where the volume began and follows the binding constraint as it leaves the node, condensing the four parts into six principles of distributed ML systems, read through the Fleet Law and placed on the fleet stack.

↪ System synthesis, cross-layer co-design, and emerging fleet frontiers are developed in Conclusion.

16.13 Self-Check Answers

Self-Check: Answer
  1. In the ML fleet stack, why does Responsible AI constitute the Governance band rather than existing as a supplementary post-training checklist?

    1. Because it replaces lower-level distributed execution frameworks with legal compliance parsers
    2. Because it serves solely to optimize training throughput and hardware acceleration efficiency
    3. Because it establishes requirements, evidence, and accountable owners for why the system runs and whom it serves, including risks that statistical optimization alone does not resolve
    4. Because it operates exclusively as a hardware watchdog circuit to prevent physical server overheating

    Answer: The correct answer is C. Governance defines the intended use, requirements, evidence, owners, and response paths for the fleet. These constraints make optimization answerable to stated human and legal requirements; their existence does not guarantee absence of harm. Replacing execution frameworks, maximizing throughput, and preventing server overheating describe different infrastructure functions.

    Learning Objective: Analyze how the Governance band establishes coordination constraints on the ML fleet stack.

  2. Contrast the engineering objectives of Responsible AI with those of Robust AI.

    Answer: Robust AI focuses on defending system integrity against external threats, hardware faults, and deliberate adversarial perturbations to ensure availability and nominal correctness. In contrast, Responsible AI evaluates whether a properly functioning, uncompromised system produces equitable, transparent, and legally accountable outcomes that align with societal welfare.

    Learning Objective: Compare the system objectives of Responsible AI and Robust AI.

  3. True or False: Responsible AI is primarily an ethical review process applied to a finished model artifact at the end of the deployment pipeline.

    Answer: False. Responsible AI requires technical mechanisms (representative data curation, differential privacy, bias-aware training objectives, and audit trails) designed directly into every stage of the ML lifecycle. Post-hoc interventions cannot easily correct representations learned from biased data without fundamental retraining.

    Learning Objective: Evaluate why Responsible AI must be integrated throughout the ML lifecycle rather than treated as a post-hoc compliance gate.

  4. How does the Amazon hiring algorithm incident illustrate that statistical optimization can coexist with severe societal harm?

    Answer: The experimental hiring model was statistically optimized on historical resume data where past successful hires were predominantly male. Consequently, the model learned to encode historical bias by penalizing resumes containing terms like ‘women's’, demonstrating that an algorithmically sound model can achieve high predictive fidelity to historical data while perpetuating systemic discrimination.

    Learning Objective: Explain how historical data bias causes statistically optimized models to generate discriminatory outcomes.

← Back to Questions

Self-Check: Answer
  1. A global ML platform serves inference traffic across the European Union (EU AI Act), the United States, and Asia. How does this fragmented regulatory landscape reshape the serving control plane of the ML fleet?

    1. The platform must shut down all cloud datacenters and operate exclusively on local microcontrollers
    2. The platform must completely retrain its foundation models with new random seeds for each country
    3. The platform can ignore regional regulations by routing all traffic through international satellite links
    4. The control plane must bind approved policies to the applicable use, organizational role, and jurisdiction; regional gateways and shared model weights are one possible implementation.

    Answer: The correct answer is D. The fleet must preserve the identity and version of the policies approved for each deployment and enforce them at the relevant components. Jurisdiction is one input alongside intended use and organizational role, not merely server location. Regional gateways can apply distinct policies while sharing weights, but that is a design option rather than a universal requirement. Neither closing every cloud site nor retraining separately for every country follows from differing obligations; routing alone does not determine which obligations apply.

    Learning Objective: Design a distributed ML serving control plane capable of enforcing geo-specific regulatory and safety policies.

  2. A product team submits a fairness dashboard showing small subgroup gaps as proof that its loan-screening system is responsible. Within an assurance case, what role should the dashboard play?

    1. It is sufficient proof, because a fairness dashboard already covers the system’s privacy, security, and contestability obligations
    2. It is evidence for a bounded claim, valid only under stated assumptions, and it becomes operational only when an accountable owner can act on it and affected people can contest decisions
    3. It replaces the claim and argument, because measured results speak for themselves
    4. It is irrelevant once the model registry records which weights reached production

    Answer: The correct answer is B. A fairness dashboard, privacy accountant, red-team report, or carbon inventory is evidence for a bounded claim; none is itself proof that the full system is responsible. The assurance case links an explicit claim, the argument connecting controls and observations to it, the supporting evidence, its stated assumptions, an accountable owner who can block or restrict use, and an invalidation rule. A registry proves which weights shipped, not that the deployment was justified.

    Learning Objective: Distinguish evidence for a bounded claim from a complete assurance case.

  3. True or False: A team swaps the retrieval corpus behind an approved generative service without changing any application code, so the prior launch approval remains valid.

    Answer: False. Approval expires when its supporting assumptions no longer hold. A change of foundation model, training distribution, retrieval corpus, deployment region, user population, decision purpose, or human workflow can be material even when the application code is unchanged. The change record should identify which claims the new corpus invalidates and select the smallest defensible revalidation scope.

    Learning Objective: Apply the material-change rule to decide when prior approval must be revalidated.

  4. Order the following stages of the governance and assurance lifecycle from earliest to latest: (1) launch authority signs a decision record with rollback and appeal paths, (2) define intended use, prohibited uses, and affected parties, (3) retire the system, revoking credentials and preserving required audit evidence, (4) build the harm model and measurable acceptance criteria, (5) operate with monitoring thresholds, escalation owners, and a remedy workflow.

    Answer: The correct order is: (2) define intended use, prohibited uses, and affected parties, (4) build the harm model and measurable acceptance criteria, (1) launch authority signs a decision record with rollback and appeal paths, (5) operate with monitoring thresholds, escalation owners, and a remedy workflow, (3) retire the system. Context must come first because harms and requirements depend on the use and the people affected; launch authority acts on evidence assembled against those criteria; and governance continues through operation and retirement rather than ending at the release decision.

    Learning Objective: Sequence the governance lifecycle stages from context definition through retirement.

← Back to Questions

Self-Check: Answer
  1. Why do resource-constrained TinyML deployments emphasize validated local safety envelopes and lightweight checks rather than continuous on-device SHAP explanations or large rolling fairness analyses?

    1. Tight compute, memory, power, and connectivity budgets limit heavy runtime analysis; local checks must be paired with fleet or servicing evidence and a defined update or retirement path.
    2. Because TinyML devices execute exclusively on cloud tensor processing units where telemetry logging is prohibited by law
    3. Because embedded C++ compilers automatically convert nonlinear deep neural networks into linear decision trees
    4. Because differential privacy guarantees are mathematically impossible on 32-bit microcontroller registers

    Answer: The correct answer is A. TinyML limits the cost and availability of runtime analysis, but does not universally prohibit storage, monitoring, or firmware updates. Bounded event records, input checks, and watchdogs may fit locally; heavier subgroup analysis can occur during fleet synchronization or servicing. The assurance case must state actual connectivity and update limits. Cloud TPUs and register-width claims confuse implementation constraints with the mathematical definitions.

    Learning Objective: Compare responsible AI capabilities and architectural constraints across Cloud, Edge, Mobile, and TinyML environments.

  2. Why does federated learning across mobile devices make group-level fairness auditing substantially more difficult than in centralized cloud architectures?

    Answer: Local data and protected attributes are not automatically visible to the coordinator. Group-level metrics therefore require an authorized evidence path, such as suitable client summaries, privacy-preserving aggregation, or carefully governed evaluation data. Such measurements must account for client participation and missing labels; keeping training records local alone neither provides global fairness evidence nor proves fairness measurement impossible.

    Learning Objective: Explain the tension between data locality in federated learning and global observability required for fairness auditing.

  3. Order the following engineering actions for embedding responsible AI constraints across the ML lifecycle from earliest to latest development phase: (1) In-processing bias-aware loss constraints and DP-SGD noise injection, (2) Representative sampling and consent collection protocols, (3) Decision threshold policy calibration and human override routing, (4) Subgroup drift telemetry and rolling metric alerting, (5) Group-level disaggregated metric evaluation and stress testing.

    Answer: The correct order is (2) Representative sampling and consent collection protocols [Data Collection], (1) In-processing bias-aware loss constraints and DP-SGD noise injection [Model Training], (5) Group-level disaggregated metric evaluation and stress testing [Evaluation], (3) Decision threshold policy calibration and human override routing [Deployment], (4) Subgroup drift telemetry and rolling metric alerting [Monitoring]. Responsible AI begins at data ingestion, guides training optimization, verifies constraints during evaluation, configures serving policies at deployment, and tracks behavioral drift in continuous production monitoring.

    Learning Objective: Classify and sequence responsible AI interventions across the ML lifecycle.

← Back to Questions

Self-Check: Answer
  1. A loan approval model evaluates two demographic groups (Group A and Group B). Group A has a baseline approval rate of \(70\%\) (\(\text{PPV} = 57.1\%\)), while Group B has a baseline approval rate of \(40\%\) (\(\text{PPV} = 75.0\%\)). If the engineering team lowers the decision threshold for Group B to enforce demographic parity (\(70\%\) approval for both groups), what is the immediate system-level consequence?

    1. Group B’s positive predictive value increases while overall model accuracy remains completely unchanged
    2. Lowering the threshold admits additional applicants with lower predicted repayment scores; the effects on approval precision and overall accuracy must be evaluated rather than inferred from approval rates alone.
    3. The model automatically satisfies equalized odds without any change to false positive rates
    4. The underlying true default base rates of both populations become mathematically equalized

    Answer: The correct answer is B. A lower threshold changes the selection policy and admits applicants previously rejected, potentially changing precision and error rates. The supplied approval rates and PPVs do not determine the outcomes of those additional approvals or the new overall accuracy. Demographic parity does not automatically establish equalized odds, and changing a threshold does not change population base rates.

    Learning Objective: Analyze how a demographic-parity threshold policy changes selection while leaving its accuracy and precision effects to be measured.

  2. For risk scores, the chapter’s score-balance impossibility result combines calibration within each group with equal mean scores across groups among positive outcomes and, separately, among negative outcomes. Which cases escape the stated incompatibility?

    1. Whenever the training dataset contains more than \(10^6\) balanced records across all demographic slices
    2. Whenever the model is trained with \(L_2\) regularization and post-hoc isotonic calibration
    3. Whenever demographic parity is explicitly enforced via multi-task adversarial training
    4. Only in degenerate or trivial cases, such as perfect prediction (zero error) or identical base rates across groups

    Answer: The correct answer is D. With unequal base rates and imperfect prediction, groupwise calibration and balance of mean scores within both outcome classes cannot all hold. Equal base rates or perfect prediction are exceptional cases. This score-level result is distinct from equalized odds at a particular decision threshold. More data, regularization, or adversarial training does not remove the stated mathematical conflict.

    Learning Objective: Explain the conditional incompatibility of groupwise score calibration and balance of mean scores within both outcome classes.

  3. Explain how single-axis fairness audits can enable ‘fairness gerrymandering’ and describe the evaluation strategy required to detect it.

    Answer: Single-axis audits evaluate protected attributes independently (e.g., race alone or gender alone), which can report high aggregate fairness while masking severe error concentrations at intersecting identities (such as the Gender Shades finding of \(99.7\%\) accuracy for lighter-skinned men versus \(65.3\%\) for darker-skinned women). To detect fairness gerrymandering, engineering teams must evaluate multi-slice intersectional subgroups (e.g., \(\text{Race} \times \text{Gender}\)) or implement multicalibration across overlapping population slices.

    Learning Objective: Analyze the vulnerability of single-axis audits to fairness gerrymandering and design intersectional evaluation protocols.

  4. Which statement correctly differentiates Preprocessing, In-processing, and Postprocessing fairness interventions with respect to ML system infrastructure requirements?

    1. Preprocessing modifies serving thresholds at inference, In-processing requires anonymizing logs, and Postprocessing alters training labels in feature stores
    2. All three methods require identical runtime compute overhead on the live model serving path
    3. Preprocessing is only applicable to TinyML devices, while In-processing and Postprocessing can only run in cloud clusters
    4. Preprocessing changes training data and needs lineage; in-processing changes training optimization; group-specific threshold postprocessing requires authorized group information at the component applying the decision rule.

    Answer: The correct answer is D. Preprocessing changes the training distribution; in-processing changes optimization; postprocessing changes the decision policy. Costs depend on the chosen method. Group-specific thresholds need authorized group information at the decision component, but other postprocessing rules need different inputs. Reversing the stages confuses training-data changes with serving policy; hardware tier alone does not restrict these methods.

    Learning Objective: Compare preprocessing, in-processing, and postprocessing fairness interventions across the ML systems infrastructure.

  5. A streaming loan-approval service records authorized group attributes and decisions immediately, but repayment outcomes arrive months later. Why can demographic-parity statistics update earlier than equalized-odds statistics?

    1. Demographic Parity depends only on model predictions and input demographics available at inference time, whereas Equalized Odds requires true outcome labels that arrive with substantial real-world latency
    2. Demographic Parity requires calculating matrix inverses that execute faster on GPU tensor cores
    3. Equalized Odds is a convex optimization problem that cannot be evaluated on streaming CPU worker nodes
    4. Demographic Parity violates privacy regulations if processed asynchronously in background databases

    Answer: The correct answer is A. Demographic parity uses group membership and decisions, while equalized odds also needs matched positive and negative outcome labels. Both aggregations may run asynchronously; label delay additionally limits the freshness of error-rate metrics. Request rate, matrix inversion, and convexity do not establish that deadline.

    Learning Objective: Analyze the operational differences between prediction-only and label-dependent fairness monitoring in production serving.

  6. A production ML fleet serving 864 million daily inferences tracks 150 distinct subgroup fairness metrics. With an unadjusted per-metric false alarm rate of \(5\%\), the system experiences roughly 7.5 false alerts per evaluation interval. Explain the operational consequence of this false alarm volume and describe how the monitoring architecture should mitigate it.

    Answer: With one evaluation per metric per interval, a 5% false-alarm probability across 150 null metrics produces 7.5 expected false alerts per interval; request volume does not determine that count. Repeated testing, subgroup sample sizes, delayed labels, and multiple comparisons must inform thresholds. Use uncertainty estimates, persistence criteria, and an accountable investigation path rather than treating every crossing as proven discrimination.

    Learning Objective: Design fleet-scale fairness monitoring architectures that mitigate alert fatigue.

← Back to Questions

Self-Check: Answer
  1. An engineering team implements Sharded, Isolated, Sliced, and Aggregated (SISA) training with \(\SisaShardCount = 100\) independent shards to support GDPR Article 17 (‘Right to Erasure’) for a 175B-parameter model. Under what operational workload does this sharded unlearning strategy lose its computational cost advantage over full model retraining?

    1. When the model is quantized from FP16 to INT8 for edge deployment
    2. When the daily volume of data erasure requests is high enough that requests touch essentially all \(\SisaShardCount\) shards in every retraining batch
    3. When the primary storage system transitions from NVMe SSDs to distributed object storage
    4. When the training pipeline uses Adam optimizer instead of stochastic gradient descent

    Answer: The correct answer is B. The chapter assumes retraining cost scales with the data fraction: one isolated deletion affects one of 100 shards, while a batch that touches essentially all shards erodes the sharding-only saving. Request distribution, batching, saved slice states, validation, and deployment overhead affect actual cost. A high request count alone does not prove every shard is touched; quantization and storage medium do not determine those boundaries.

    Learning Objective: Analyze the operational scaling limits and compute trade-offs of SISA machine unlearning under high deletion request rates.

  2. In Differentially Private Stochastic Gradient Descent (DP-SGD), what are the two core operations applied to gradients before weight updates, and what are their primary systems impacts?

    1. Gradient quantization to 4 bits and dropout pruning, reducing GPU memory by \(50\%\)
    2. Gradient checkpointing and layer freezing, eliminating backpropagation overhead
    3. Per-example gradient clipping to a maximum norm \(\GradientClippingNorm\) and calibrated Gaussian noise addition, whose privacy bound requires sampling and composition accounting and whose compute and utility costs depend on the configuration
    4. Spectral normalization of weight matrices and label smoothing, which eliminate adversarial vulnerability with zero compute overhead

    Answer: The correct answer is C. Clipping bounds each example’s gradient contribution; noise, sampling, and composition accounting determine the reported privacy bound. Compute and utility changes must be measured for the selected configuration; extra epochs are not guaranteed and increase privacy loss unless offset by other changes. Quantization and checkpointing address representation or memory, not differential privacy.

    Learning Objective: Explain the algorithmic mechanisms of DP-SGD and their impact on training compute and model accuracy.

  3. Why can deleting a user’s record from a primary database leave an incomplete ML deletion workflow, and what evidence must a machine-unlearning procedure provide?

    Answer: Deleting one database row does not necessarily remove copies, derived datasets, checkpoints, or training influence in released models. Unlearning must specify its reference training procedure and demonstrate the claimed removal guarantee; approximate weight changes do not automatically prove erasure. Lineage, replica replacement, rollback controls, and audit evidence connect the method to an operational deletion workflow. Whether that workflow satisfies a legal duty depends on the applicable context.

    Learning Objective: Justify the requirement for machine unlearning beyond database record deletion for regulatory compliance.

  4. True or False: Once a neural network has been trained with DP-SGD under a privacy budget \(\PrivacyBudget = 1.0\), executing standard user inference queries in production consumes additional training-data privacy budget.

    Answer: False. Inference using only fixed, differentially private weights is postprocessing and adds no training-data privacy loss beyond the established bound. This does not mean zero leakage. Further private-data access, updated models, or additional releases require accounting under the stated privacy unit and composition rules.

    Learning Objective: Apply the post-processing property of differential privacy to ML inference workloads.

← Back to Questions

Self-Check: Answer
  1. A model-agnostic explanation service enumerates all feature coalitions for 20 input features, taking at least one microsecond per coalition. Why does this exhaustive Shapley calculation exceed a 100 ms inline serving budget?

    1. It evaluates \(2^{20}\) coalitions, requiring more than one second even at one microsecond per coalition; a cheaper method or separate explanation path is needed.
    2. Because Shapley values can only be computed using double-precision arithmetic that crashes GPU tensor cores
    3. Because cooperative game theory axioms prohibit computing feature contributions on tabular data
    4. Because exact SHAP requires accessing the client’s raw hardware registers during inference

    Answer: The correct answer is A. Exhaustive enumeration visits \(2^{20}=1{,}048{,}576\) coalitions; at one microsecond each, that exceeds one second. A coalition value may itself require multiple evaluations. This is not a universal cost for every exact SHAP algorithm: TreeSHAP exploits supported tree structure. Approximation, caching, selective generation, or asynchronous delivery may fit other budgets; arithmetic precision and client hardware access do not explain this count.

    Learning Objective: Calculate the computational complexity of exact vs approximate Shapley value attribution and analyze its serving-path latency impact.

  2. Explain the two fundamental axioms satisfied by Integrated Gradients (Sensitivity and Implementation Invariance) and why they make Integrated Gradients superior to vanilla input gradients.

    Answer: Sensitivity requires nonzero attribution when input and baseline differ in one feature and the prediction changes. Implementation Invariance requires functionally equivalent models to receive identical attributions. Integrated Gradients integrates gradients along a baseline-to-input path, addressing saturation that can make a vanilla input gradient zero despite a prediction change. Ordinary gradients can satisfy Implementation Invariance; their central failure in this example is Sensitivity. Baseline choice still affects interpretation.

    Learning Objective: Evaluate the axiomatic guarantees of Integrated Gradients over vanilla gradient attribution.

  3. Why do local and global explanations place different demands on explanation infrastructure?

    1. Local explanations characterize an individual prediction; global explanations characterize broader model behavior using model structure, representative inputs, or aggregated evidence. Their methods and delivery deadlines determine execution and capacity needs.
    2. Local explanations require no model access, whereas global explanations require retraining the model on every request.
    3. Global explanations must run inline on every request, whereas local explanations can only be generated during training.
    4. Local and global explanations have identical cost because both are computed from the same Shapley enumeration.

    Answer: The correct answer is A. Local explanation capacity depends on how many decisions are explained and whether results can be reused. Global explanations may use model structure, representative inputs, or aggregated decision evidence, with offline or updated analyses as appropriate. Scope does not fix execution timing; the method and delivery deadline determine cost and placement. Neither scope requires retraining per request.

    Learning Objective: Distinguish local and global explanation scopes and their infrastructure costs.

  4. A counterfactual explanation shows that a denied loan applicant would have been approved with a debt ratio below 40 percent. Explain why this output flip does not by itself give the applicant recourse.

    Answer: A counterfactual shows how the modeled output changes under a specified input change; it does not establish why the decision occurred. Recourse additionally requires that the change be feasible and within the applicant’s control, respect feature dependencies and immutable attributes, and remain valid under the decision policy that will apply when the applicant returns. Supporting recourse therefore needs policy versioning, domain constraints, and an operational commitment to honor the promised action.

    Learning Objective: Differentiate counterfactual explanations from actionable recourse.

  5. True or False: Any decision tree or linear model is inherently interpretable, so choosing one of those model families removes the need for explanation evidence.

    Answer: False. Interpretability depends on structure, feature meaning, and audience, not the model-family label. A very large tree or a high-dimensional linear model can be as hard to inspect as a neural network. High-stakes model selection should test whether a sufficiently accurate, inspectable model meets the task for its intended audience.

    Learning Objective: Evaluate when a model is inherently interpretable for its intended audience.

  6. For an appeal workflow that retrieves decision evidence before explanation, then sends both to a reviewer and records the outcome, order these actions: (1) Route the case and explanation to an authorized credit reviewer, (2) Retrieve the decision record and governing model and policy versions, (3) Record the review outcome and propagate any authorized remedy, (4) Generate explanation evidence, checking any proposed recourse for feasibility and policy validity.

    Answer: The order in this specified workflow is (2), (4), (1), (3). The reviewer receives traceable decision and explanation evidence, and outcome tracking records and propagates an authorized remedy. This is one workflow arrangement, not a requirement to deploy four serial services; counterfactual generation alone does not establish recourse.

    Learning Objective: Apply and sequence the workflow of the Contestability Stack for contested automated decisions.

← Back to Questions

Self-Check: Answer
  1. A robustness report for a deployed model includes a randomized-smoothing certificate and an empirical attack evaluation. What must the assurance case record about each before a launch authority relies on it?

    1. Nothing beyond the headline accuracy, because both results already establish that the end-to-end workflow is safe
    2. Only the empirical result, because a certificate is a mathematical proof and needs no stated scope
    3. Only the certificate, because empirical attack results guarantee immunity against all unseen attacks
    4. The certificate’s norm, radius, confidence, and model configuration, and the empirical evaluation’s attack protocol, since each supports a claim only within those stated boundaries

    Answer: The correct answer is D. A certificate proves a property only for its stated norm, radius, confidence, and model configuration, and an empirical evaluation reports resistance only under the tested attack protocol. Neither establishes safety for the complete workflow, so governance records those boundaries to keep a narrow result from being promoted into a general safety claim.

    Learning Objective: Specify the boundaries an assurance case must record for certified and empirical robustness evidence.

  2. In high-speed autonomous control loops (e.g., drone navigation or collision avoidance), explain why implementing prediction abstention creates an immediate latency-budget challenge.

    Answer: Abstention shifts the immediate decision to a fallback that must meet the physical hazard deadline. A validated local maneuver may act within milliseconds while human review follows on a longer timescale. Human takeover is a suitable immediate fallback only when a ready operator has enough time to act; referral alone does not satisfy the control deadline.

    Learning Objective: Design fallback and abstention mechanisms under tight real-time latency budgets.

  3. Order the 6 stages of the canonical Reinforcement Learning from Human Feedback (RLHF) alignment pipeline from initial training to deployment: (1) Supervised Fine-Tuning (SFT) on curated instruction demonstrations, (2) Proximal Policy Optimization (PPO) fine-tuning of the policy against the reward model, (3) Base model pretraining on massive web-scale corpora, (4) Aligned model safety validation and deployment, (5) Human rater pairwise preference data collection, (6) Reward Model training on preference comparisons.

    Answer: The correct order is (3) Base model pretraining on massive web-scale corpora, (1) Supervised Fine-Tuning (SFT) on curated instruction demonstrations, (5) Human rater pairwise preference data collection, (6) Reward Model training on preference comparisons, (2) Proximal Policy Optimization (PPO) fine-tuning of the policy against the reward model, (4) Aligned model safety validation and deployment. The pipeline progresses from unsupervised foundation pretraining to supervised task tuning, preference modeling, reinforcement learning policy alignment, and final deployment gating.

    Learning Objective: Classify and sequence the stages of the RLHF alignment pipeline.

  4. In Retrieval-Augmented Generation (RAG), why does RLHF of the core LLM fail to establish safety for the complete service, and what retrieval-path controls should be evaluated?

    Answer: Retrieved material can influence answers outside the conditions covered by the core model’s alignment evaluations. A biased retrieval index is one possible source of harmful output, not proof that the model must reproduce every document. Evaluate source selection, retrieval quality, context filtering, or output checks for the intended use; filtering alone does not establish absence of bias or harmful responses.

    Learning Objective: Design safety and alignment guardrails for Retrieval-Augmented Generation architectures.

  5. Explain Goodhart’s law in the context of production recommendation algorithms and describe how optimizing for Click-Through Rate (CTR) can create value misalignment.

    Answer: Goodhart’s law warns that optimizing a proxy can weaken its connection to the intended goal. A CTR objective may reward clickbait or other behavior that increases clicks without improving long-term welfare. Establishing that failure in production requires evidence about the policy’s effects and the welfare criterion; choosing CTR alone does not prove harmful behavior.

    Learning Objective: Analyze how Goodhart’s law drives proxy metric misalignment in recommender systems.

  6. In autonomous vehicle safety engineering, explain the purpose of formal frameworks like Responsibility-Sensitive Safety (RSS) and identify their fundamental operational limitation.

    Answer: Responsibility-Sensitive Safety (RSS) expresses driving constraints such as safe distances and right-of-way rules and supports verification under specified assumptions. Its guarantee covers the stated model and conditions, not every accident or the full perception-and-control pipeline. Unmodeled preconditions, sensing failures, and environmental departures must remain explicit in the operating envelope and fallback plan.

    Learning Objective: Explain the capabilities and boundary limitations of formal safety frameworks like Responsibility-Sensitive Safety (RSS).

← Back to Questions

Self-Check: Answer
  1. In dataset governance, standardized documentation of motivation, composition, collection process, and recommended uses, modeled on electronic-component specification sheets, is called ____.

    Answer: The term is Datasheets for Datasets (or Datasheets). This documentation supports provenance review and evaluation design; it does not itself validate a model’s operating envelope or prevent distribution-shift failures.

    Learning Objective: Apply standardized documentation frameworks like Datasheets for Datasets to ML pipeline governance.

  2. Order the stages of the Bias Amplification Feedback Loop in an unconstrained retraining pipeline: (1) Reinforced data bias is captured in operational logs, (2) Biased model produces skewed deployment predictions, (3) New model retrained on reinforced data exhibits compounded disparity, (4) Historical bias in initial training data is learned during initial model fit, (5) Real-world discriminatory outcomes occur based on automated decisions.

    Answer: The correct order is (4) Historical bias in initial training data is learned during initial model fit, (2) Biased model produces skewed deployment predictions, (5) Real-world discriminatory outcomes occur based on automated decisions, (1) Reinforced data bias is captured in operational logs, (3) New model retrained on reinforced data exhibits compounded disparity. This order traces the specified amplifying scenario. A closed loop does not inevitably increase disparity; its direction depends on the policy and how outcomes are observed and reused.

    Learning Objective: Analyze the sequential stages of the bias amplification cycle.

  3. True or False: In a closed-loop system where future data distribution \(\ProbabilityFunction_{\FeedbackStepIndex+1}(\ModelInput)\) is dynamically altered by current model decisions \(\ModelPredictor_{\FeedbackStepIndex}(\ModelInput)\) (such as predictive policing or recommendation engines), validating model performance on a static held-out test set guarantees long-term fairness and stability.

    Answer: False. A fixed test set measures behavior on its recorded cases; it does not establish long-term behavior after deployment changes decisions, observations, or the training population. Feedback can amplify or reduce disparities depending on the policy and observation process. Monitor matched outcomes and consequential groups over time, and evaluate governed interventions rather than infer a continuing fairness guarantee from the original test.

    Learning Objective: Evaluate the invalidity of static i.i.d. evaluation assumptions in closed-loop sociotechnical systems.

  4. In human-AI collaborative decision-making, what is the ‘paradox of reliability’ and what is its primary engineering implication for interface design?

    1. A model with \(50\%\) accuracy causes hardware crashes more frequently than a model with \(90\%\) accuracy
    2. As a model’s latency decreases, network packet loss increases proportionally
    3. Highly compressed models consume more DRAM memory than uncompressed models
    4. High apparent reliability can encourage over-reliance; interface design must be evaluated by how often users accept erroneous recommendations, correct errors, or introduce new errors, not by the overall override rate alone.

    Answer: The correct answer is D. Automation bias can cause users to accept a wrong recommendation because they over-trust the system. A low overall override rate cannot distinguish few model errors from failure to notice errors. Test verification prompts or other interface changes using error-conditional acceptance, successful corrections, errors introduced by overrides, and response delay. Reliability does not mechanically determine a universal human error rate; the hardware and networking distractors do not describe this behavioral mechanism.

    Learning Objective: Analyze how the paradox of reliability and automation bias impact human-AI system safety.

  5. A hospital deploys a sepsis predictor with high offline accuracy, yet mortality does not improve and clinicians often ignore alerts. What workflow explanations remain possible, and what evidence would distinguish them before choosing a remedy?

    Answer: Excessive low-value alerts could cause fatigue, but alerts could also arrive too late, reach the wrong clinician, or lack a feasible response path. Measure alert volume and precision on matched outcomes, delivery and action timestamps, recipients, workload, and reasons for nonresponse. Test a candidate workflow change against timely useful action, errors corrected or introduced, workload, and patient outcomes; these observations alone do not identify a false-positive cause or establish causal mortality benefit.

    Learning Objective: Diagnose clinical alert-workflow failures using discriminating evidence before selecting and evaluating an intervention.

  6. Define normative pluralism in machine learning system design and explain why value conflicts cannot be resolved through purely algorithmic optimization.

    Answer: Normative pluralism refers to the existence of multiple, legitimate, and often mathematically incompatible human values and fairness definitions across diverse stakeholders (e.g., patient autonomy vs. clinical paternalism vs. privacy). Purely algorithmic optimization cannot resolve these tensions because selecting an objective function inherently prioritizes one moral value over another, requiring human deliberation, policy trade-offs, and governance frameworks before optimization begins.

    Learning Objective: Explain why normative pluralism necessitates human governance and stakeholder deliberation over pure algorithmic optimization.

← Back to Questions

Self-Check: Answer
  1. In medical imaging ML pipelines, what is the ‘representation cost’ and why does the cost of acquiring representative training data scale with subgroup coverage rather than total image volume?

    1. It is an annual government licensing fee levied on deep learning medical devices
    2. It represents the network bandwidth consumed when downloading public datasets from cloud buckets
    3. It reflects the substantial financial and logistical cost ($125M+ in the chapter’s sizing scenario) of acquiring, curating, and harmonizing clinical data from diverse geographic hospitals, specialized scanners, and underrepresented patient demographics
    4. It is the GPU memory overhead required to store floating-point feature embeddings during distributed backpropagation

    Answer: The correct answer is C. The representation cost captures the reality that underrepresented patient populations (rural clinics, minority demographics, uncommon imaging equipment) are expensive to source, annotate, and harmonize ($50–$200/image plus 30%–50% harmonization overhead across 50+ hospital systems). Improving performance for marginalized groups requires budgeting specifically for demographic coverage gaps rather than simply acquiring more majority-class data. Government licensing fees are legal charges, not data engineering costs, network bandwidth cost is negligible by comparison, and GPU memory overhead is a hardware constraint.

    Learning Objective: Calculate and analyze the representation cost in medical imaging and subgroup data acquisition.

  2. A company builds a customer-facing assistant on a third-party foundation model whose vendor publishes safety evaluations and contractual controls. How does this dependency change the deploying organization’s accountability?

    1. Accountability transfers to the vendor, because the vendor trained the weights and evaluated their safety
    2. Accountability is shared equally by contract, so the deploying organization need only monitor uptime
    3. Accountability stays with the deploying organization, which still chooses the use, interface, retrieved context, user population, monitoring, and response process, so procurement needs the same rigor as an internal model gate
    4. Accountability disappears for inherited components, because the vendor’s evaluations already cover every downstream use

    Answer: The correct answer is C. Third-party and foundation-model dependencies do not transfer accountability to the supplier. The deploying organization may inherit weights, safety evaluations, documentation, or contractual controls, but it still decides how the model is used and monitored. Procurement therefore records intended and prohibited uses, evaluation scope, version and change notification, incident disclosure, audit access, data handling, fallback behavior, and an exit plan. A vendor’s evaluation covers its stated scope, not every downstream use.

    Learning Objective: Explain why inherited model components leave accountability with the deploying organization.

  3. True or False: When an automated decision system wrongly denies some individuals a benefit, retraining the model next quarter to improve aggregate accuracy provides those individuals with adequate remedy.

    Answer: False. Aggregate model improvement is not a substitute for individual remedy, because retraining next quarter does not correct a benefit denied today. Affected people need a discoverable channel to challenge an outcome, a record of the evidence considered, a reviewer with authority to correct the decision, a response deadline, and a way to propagate the correction downstream. The 2020 A-level standardization, which produced a calculated grade below the teacher-assessed grade in 39.1 percent of cases, showed how quickly an aggregate method can outrun the remedy path its decisions require.

    Learning Objective: Distinguish aggregate model improvement from individual remedy in accountable deployments.

  4. A team’s assurance case combines a demographic-parity result from one benchmark, a model-only explanation audit, and a compliance report produced by a separate tool. Explain why these individually valid results may not support a claim about the deployed system.

    Answer: The criterion, population, labels, threshold policy, and uncertainty belong to each claim, so a demographic-parity result on one benchmark does not establish equalized odds, or parity, in another deployment. A model-only result can also miss effects introduced by feature transformations, request routing, caching, or human review, so the evaluation boundary must match the deployment boundary. Unless the tools share identifiers linking their results to the same model, data, policy, and workflow versions, the assurance case may combine results that describe different systems.

    Learning Objective: Analyze why responsible-AI evidence must share a claim scope and an evaluation boundary with the deployed system.

← Back to Questions

Self-Check: Answer
  1. A service uses 100 ms of baseline processing per request at 10,000 QPS. Adding inline explanations requires another 50–200 ms of processing. What is the approximate capacity increase needed to preserve throughput, and does it also preserve a 100 ms latency limit?

    1. Approximately \(1.5\times\)–\(3.0\times\) capacity can preserve throughput, but serial request latency rises to 150–300 ms; meeting 100 ms requires reducing or moving explanation work off the critical path.
    2. No capacity increase is needed because SHAP values are precomputed during compiler optimization
    3. Serving capacity can be reduced by \(50\%\) because explanations compress network bandwidth
    4. The system requires upgrading DRAM from DDR4 to DDR5 with zero additional server nodes

    Answer: The correct answer is A. Processing demand rises from 100 ms to 150–300 ms per request, a \(1.5\times\)–\(3.0\times\) capacity ratio under the simplified sizing assumptions. More replicas can preserve throughput but cannot remove serial work from an individual request. A 100 ms deadline therefore requires a cheaper explanation path, caching, selective generation, or asynchronous delivery; a DRAM upgrade alone does not establish that result.

    Learning Objective: Calculate the serving capacity expansion required when retrofitting explainability workloads onto low-latency inference fleets.

  2. A study of a widely used healthcare risk-prediction algorithm found that predicted healthcare expenditure could reproduce racial disparities in access to care. Why does this example challenge the claim that more data and better algorithms alone eliminate bias?

    1. The training dataset contained fewer than 1,000 total medical records
    2. The deep neural network suffered from gradient vanishing across recurrent layers
    3. The engineers selected healthcare expenditure as a proxy variable for health need; because Black patients faced historical access barriers and lower healthcare spending, the model inferred they were less sick than white patients with identical medical severity
    4. An external cyber adversary poisoned the training dataset labels with malicious random noise

    Answer: The correct answer is C. Expenditure was a flawed proxy for health need: patients with similar illness burden could incur different costs because access to care differed. In the study’s simulated correction, Black patients’ share among those selected for additional care rose from 17.7% to 46.5%. These are shares of the selected group, not nationwide enrollment rates. The roughly 200 million patients estimate describes the broader industry class of tools, not this single algorithm’s study population.

    Learning Objective: Analyze how proxy variable selection causes systemic bias that cannot be resolved by scaling dataset size or model parameters.

  3. Explain why launching real-time fairness monitoring dashboards without assigning an operational remediation owner constitutes a dangerous production pitfall (‘evidence without action’).

    Answer: Monitoring dashboards expose metric violations, fairness drift, and subgroup disparities, but they cannot take corrective action. Without an accountable operational owner, clear threshold triggers, and budgeted remediation pathways (such as automated rollback, model recalibration, or human review queues), alerts will simply age out, turning ethical oversight into meaningless log entries that provide a false sense of control.

    Learning Objective: Justify the requirement for operational ownership and remediation pipelines in production fairness monitoring.

  4. True or False: Adjusting post-hoc decision thresholds per group to equalize true positive rates resolves algorithmic unfairness without altering the business risk meaning or calibration of positive predictions.

    Answer: False. Group-specific thresholds can change which applicants are approved and the predictive value of those approvals, even while the underlying risk scores remain calibrated. Equalizing one error rate does not establish all fairness criteria or identical decision meaning across groups. The threshold policy and resulting trade-offs must be evaluated and documented.

    Learning Objective: Evaluate the consequences of group-specific threshold adjustments on positive predictive value and decision semantics.

← Back to Questions

Back to top