Abstract
Autoregulation through proximity to failure—commonly quantified as Repetitions in Reserve (RIR)—has emerged as a leading paradigm for managing training intensity in resistance exercise. Current implementations, however, rely on subjective self-report, ignore the multi-compartment structure of neuromuscular fatigue, and lack a principled mechanism for translating the RIR signal into a hypertrophy-relevant stimulus metric or an optimal prescription policy. This paper presents the Vivanco Proximity-to-Failure Model (VPFM) Version 3.0, a comprehensive dynamical framework that addresses these limitations.
The core VPFM posits an exponential load–repetition law \(W(R)=L_0\,e^{-R/\tau}\) from which a closed-form RIR predictor—Vivanco RIR—is derived. Version 3.0 extends the model in eight directions: (i) a two-state fatigue architecture decomposing capacity into structural and enzymatic pools with distinct depletion and recovery kinetics; (ii) a sigmoidal stimulus quantification layer converting RIR into effective hypertrophy stimulus units with a provable optimal termination rule; (iii) a multi-muscle fatigue graph encoding exercise–muscle recruitment to predict whole-body failure patterns; (iv) a velocity-based estimation pipeline fused through (v) an Extended Kalman Filter integrating velocity, heart rate, and electromyographic signals for real-time state estimation; (vi) continuous-time ODE dynamics yielding equilibrium capacity theorems for sustained effort; (vii) a hierarchical Bayesian population model solving the cold-start problem for new trainees; (viii) an across-session superstate model connecting intra-session fatigue to inter-session recovery on a two-timescale architecture.
These components are unified under a neuromuscular digital twin architecture whose physics engine is the VPFM ODE system. We derive an identifiability analysis via the Fisher Information Matrix, propose a Bayesian optimal calibration protocol that prescribes the most informative next set, and formulate a reinforcement learning training controller with the digital twin as its forward model. Seven theorems, extensive numerical simulations, and worked examples ground the framework. Version 3.0 transforms the VPFM from a single-equation predictor into a field-defining platform for sensor-informed, mathematically optimal resistance-training prescription.
Introduction
The distance between current repetition and momentary muscular failure is the single most actionable variable in resistance-training programming.
Known as Repetitions in Reserve (RIR), this metric of proximity to failure has been shown to exhibit a dose–response relationship with muscle hypertrophy across a broad meta-analytic base: training closer to failure yields greater hypertrophic adaptations, with sets at 0–2 RIR producing near-maximal stimulus[1,2,3]. The 2026 American College of Sports Medicine (ACSM) position stand, synthesizing 137 systematic reviews covering more than 30,000 participants, recommends training to within 1–2 repetitions of failure for hypertrophy and endorses autoregulatory approaches as best practice[4].
Yet the field lacks a unifying mathematical framework that connects subjective RIR to measurable biomechanical quantities, accounts for the multi-compartment nature of fatigue, and provides a principled path from observation to optimal prescription. Existing models such as the Epley and Brzycki formulas treat the load–repetition relationship as a population-level approximation with no mechanism for intra-set fatigue evolution, inter-individual calibration, or stimulus quantification[5,6].
The Vivanco Proximity-to-Failure Model (VPFM), introduced in its first version as a single-equation predictor, addressed the calibration gap by deriving a closed-form RIR from an individualized exponential decay law. Version 2.0 added two-state fatigue, velocity integration, continuous-time dynamics, stochastic Bayesian calibration, and a Fisher Information identifiability analysis. This paper presents Version 3.0, which advances the framework along eight new axes:
1. Stimulus quantification layer—a sigmoidal function mapping RIR to effective hypertrophy stimulus units, with a provable optimal set-termination theorem.
2. Multi-muscle fatigue graph—a recruitment matrix encoding exercise–muscle coupling, enabling prediction of the limiting muscle in compound movements.
3. Extended Kalman Filter sensor fusion—real-time state estimation from velocity, heart rate, and EMG channels.
4. Hierarchical Bayesian population model—population-level priors that solve the cold-start calibration problem for new users.
5. Across-session superstate dynamics—a two-timescale model linking intra-session fatigue to inter-session recovery.
6. Neuromuscular digital twin architecture—the VPFM as the physics engine of a sensor-informed computational twin.
7. Reinforcement learning training controller—MPC/RL formulation with the digital twin as its world model.
8. Bayesian optimal calibration protocol—prescribing the most informative next set to minimize parameter uncertainty.
Together these extensions transform the VPFM from a prediction tool into a prescription platform—a system that not only estimates where a trainee is but tells them what to do next and why. The mathematical backbone ensures that every recommendation is traceable to an axiom, a theorem, or a Bayesian posterior, providing a level of transparency absent from black-box machine-learning approaches.
Background & Related Work
2.1 Proximity to Failure & Dose–Response Evidence
Robinson et al. (2024) conducted a dose–response meta-regression of 89 studies demonstrating that proximity to failure exhibits a graded relationship with muscle hypertrophy: each additional RIR subtracted corresponds to diminishing but positive marginal stimulus, with the curve flattening beyond 0–1 RIR[3]. Critically, the strength relationship is attenuated, suggesting that the failure-proximity signal is primarily a hypertrophy driver. The 2026 ACSM position stand formalized this into a minimum effective proximity of 1–2 RIR, noting that training to true failure increases fatigue cost without proportional hypertrophic benefit[4].
2.2 Traditional One-Repetition-Maximum Models
The Epley formula \(1\text{RM}=w(1+r/30)\) and the Brzycki formula \(1\text{RM}=w\cdot 36/(37-r)\) remain the most widely deployed load–repetition models[5,6]. Both are population-level regression fits with no individual calibration mechanism, no fatigue state variable, and no pathway to autoregulation beyond plugging in a fresh repetition maximum—a test that itself induces fatigue.
2.3 Digital Twins in Sport Science
The digital twin paradigm—a continuously synchronized computational replica of a physical system—has been applied in endurance sport and injury prevention. Hendry et al. (2025) proposed a cross-bridge model of skeletal-muscle fatigue suitable for embedding in a twin, and a 2025–2026 wave of reviews advocates for multi-scale muscle models that couple sarcomere-level dynamics to whole-movement performance[7,8]. The VPFM is uniquely positioned to serve as the physics engine of a resistance-training digital twin because its ODE system is low-dimensional enough for real-time inference yet expressive enough to capture two-state fatigue, multi-muscle coupling, and sensor-driven updates.
2.4 Reinforcement Learning for Training Prescription
Recent work has framed exercise programming as a sequential decision problem. Akiba et al. (2025) applied deep RL to training-load control in team sports, demonstrating that a learned policy outperforms heuristic periodization[9]. Separately, gym-specific RL formulations have appeared on arXiv (2025–2026), proposing state spaces over perceived exertion and load history[10,11]. What these approaches lack is a mechanistic forward model of the trainee—they learn the dynamics from data end-to-end, sacrificing interpretability and sample efficiency. The VPFM digital twin provides exactly this missing physics layer, enabling model-based RL and model-predictive control.
2.5 Wearable Sensors & Fatigue Estimation
Velocity-based training (VBT) has become commercially mainstream, with linear position transducers and accelerometer-based devices providing rep-by-rep barbell velocity[12]. Recent work extends the sensor envelope to surface EMG for fatigue estimation[13] and muscle-synergy graph neural networks for coordination analysis[14]. Heart rate and heart-rate variability capture autonomic fatigue load. The challenge is fusion: combining multiple noisy channels into a coherent state estimate. The Extended Kalman Filter (EKF) framework we develop in Section 8 addresses this by treating the VPFM state as the latent variable and the multi-channel signals as noisy observations.
2.6 Hierarchical Bayesian Models in Sport
Hierarchical (multilevel) Bayesian models are standard in exercise science meta-analysis[15]. Their application to individual calibration within a population prior is less explored in the resistance-training domain. The cold-start problem—prescribing training for a new user with no history—is formally identical to the Bayesian optimal experiment design literature[16]. The VPFM's analytic gradient structure makes it especially amenable to information-theoretic calibration design, as we show in Section 11.
The Core Model
The VPFM rests on five axioms that constrain the shape of the load–repetition relationship. These axioms are not arbitrary postulates but formal statements of biomechanical plausibility.
For every repetition \(R\ge0\), the maximum load the trainee can lift is a strictly decreasing function \(W(R)\) with \(W(0)=L_0>0\).
The decay is exponential: \(W(R)=L_0\,e^{-R/\tau}\) for individual parameters \(L_0>0\) (fresh one-rep maximum) and \(\tau>0\) (endurance parameter).
The parameters \((L_0,\,\tau)\) are specific to each trainee–exercise pair and can be estimated from as few as two observed (load, reps) data points.
Given a working load \(w\le L_0\), the maximum achievable reps \(\rho(w)=\tau\ln(L_0/w)\). The RIR after \(r\) completed reps at load \(w\) is \(\Phi=\rho(w)-r\).
The parameters \((L_0,\,\tau)\) may evolve within a session as a function of accumulated fatigue; the capacity available for set \(i\) depends on the prior sequence of loads and reps.
where \(C_i\in(0,1]\) is the cumulative capacity fraction entering set \(i\), reflecting all prior fatigue within the session.
Under Axioms A1–A5, Vivanco RIR \(\Phi_i\) is: (a) strictly increasing in \(C_i\) (more capacity ⇒ more reserve), (b) strictly increasing in \(\tau\) (greater endurance ⇒ more reserve), and (c) strictly decreasing in \(w_i\) (heavier load ⇒ less reserve).
Direct partial differentiation of the master equation. \(\partial\Phi/\partial C_i=\tau\ln(L_0/w_i)>0\) for \(w_i
Under the geometric depletion model \(C_{i+1}=C_i\cdot\delta_i\) with \(\delta_i\in(0,1)\), the capacity sequence \(\{C_i\}\) is strictly decreasing and bounded below by zero: \(C_i\to 0\) as \(i\to\infty\).
\(C_i=\prod_{k=1}^{i-1}\delta_k\). Each factor \(\delta_k<1\), so the partial products are strictly decreasing. Since all terms are positive, \(C_i>0\) for all finite \(i\), and \(C_i\to 0\) by the divergence of \(\sum|\ln\delta_k|\). ■
3.1 Notation Summary
| Symbol | Meaning | Typical range |
|---|---|---|
| \(L_0\) | Fresh one-rep maximum (kg) | 40–300 |
| \(\tau\) | Endurance parameter (reps) | 8–60 |
| \(w_i\) | Working load on set \(i\) (kg) | — |
| \(r_i\) | Reps completed on set \(i\) | — |
| \(C_i\) | Capacity fraction entering set \(i\) | (0, 1] |
| \(\Phi_i\) | Vivanco RIR after set \(i\) | \(\ge0\) |
Two-State Fatigue Extension
A single capacity scalar conflates phenomena with fundamentally different time constants.
Neuromuscular fatigue operates through at least two distinguishable compartments: a structural (peripheral) pool \(C_s\), representing sarcomeric force-generating capacity, and an enzymatic (central/metabolic) pool \(C_e\), capturing ATP resynthesis, calcium handling, and central drive[7,8]. These compartments deplete together during exertion but recover on different time scales.
\(C_s\) scales the ceiling load; \(C_e\) scales the effective endurance. Their product \(C_s\cdot C_e\) reduces to the single capacity \(C_i\) when the two pools are in lock-step.
4.1 Depletion Model
After a set of \(r\) reps at load \(w\), the effort intensity is \(e=w/(C_s\,L_0)\) and the volume–intensity integral is \(r\cdot e^\gamma\), with exponent \(\gamma\ge1\) amplifying the effect of heavier loads. The depletion equations are:
\[ C_s^+ = C_s\;\exp\!\bigl(-k_s\,\eta\,r\,e^\gamma\bigr), \qquad C_e^+ = C_e\;\exp\!\bigl(-k_e\,(1-\eta)\,r\,e^\gamma\bigr) \]where \(k_s,\,k_e>0\) are depletion rate constants and \(\eta\in[0,1]\) partitions the fatigue load between pools. When \(\eta=0.5\) and \(k_s=k_e\), the model reduces to symmetric depletion.
4.2 Recovery Model
During a rest interval \(\Delta t\) (seconds), each pool recovers toward unity with its own time constant:
\[ C_s(t+\Delta t) = 1 - (1-C_s)\,e^{-\Delta t/T_s}, \qquad C_e(t+\Delta t) = 1 - (1-C_e)\,e^{-\Delta t/T_e} \]Typical values are \(T_s\in[30,120]\) seconds (fast, phosphocreatine-dominated) and \(T_e\in[180,600]\) seconds (slow, metabolic). This asymmetry explains why short rest produces disproportionate metabolic fatigue while structural capacity partially recovers.
| Parameter | Symbol | Typical range | Recovery timescale |
|---|---|---|---|
| Structural pool | \(C_s\) | 0.70–1.0 | 30–120 s |
| Enzymatic pool | \(C_e\) | 0.50–1.0 | 180–600 s |
| Structural rate | \(k_s\) | 0.01–0.05 | — |
| Enzymatic rate | \(k_e\) | 0.02–0.08 | — |
| Partition | \(\eta\) | 0.3–0.7 | — |
| Intensity exponent | \(\gamma\) | 1.0–2.0 | — |
Stimulus Quantification Layer
Not all reps are created equal. The reps closest to failure contribute disproportionately to hypertrophic stimulus.
The dose–response evidence (Section 2.1) implies that each repetition's contribution to hypertrophy is a nonlinear function of how close it is to failure. We formalize this through a stimulus function \(S(\Phi)\) that maps the instantaneous RIR at each rep to a stimulus unit.
A sigmoidal map: \(\alpha>0\) controls the steepness, \(\Phi_{1/2}\) is the half-maximal RIR. Near failure (\(\Phi\to0\)), \(S\to 1\); far from failure (\(\Phi\gg\Phi_{1/2}\)), \(S\to0\).
5.1 Session Stimulus Dose
Over a set of \(r\) reps, the instantaneous RIR decreases from \(\Phi_0=\rho(w)-0\) down to \(\Phi_r=\rho(w)-r\). The session stimulus dose is the sum of per-rep stimulus across all sets:
\[ \mathcal{D} \;=\; \sum_{i=1}^{N_{\text{sets}}}\;\sum_{j=1}^{r_i}\;S\!\bigl(\Phi_i(j)\bigr) \;=\; \sum_{i=1}^{N_{\text{sets}}}\;\sum_{j=1}^{r_i}\;\frac{1}{1+\exp\!\bigl(\alpha\,(\rho_i - j - \Phi_{1/2})\bigr)} \]where \(\rho_i=F(w_i,C_s^{(i)},C_e^{(i)})\) is the fatigue-adjusted maximum reps for set \(i\). This provides a principled alternative to counting "hard sets" or "effective reps."
5.2 Marginal Stimulus and Fatigue Cost
Each additional rep \(j\) in a set contributes marginal stimulus \(\Delta S_j = S(\Phi(j))\) and marginal fatigue cost \(\Delta F_j\), measured as the reduction in capacity for subsequent sets. The stimulus efficiency ratio is:
\[ \mathcal{E}(j) \;=\; \frac{\Delta S_j}{\Delta F_j} \]As the trainee approaches failure, \(\Delta S_j\) plateaus near 1 while \(\Delta F_j\) accelerates (due to the exponential depletion model). This yields a natural optimum.
Under the sigmoidal stimulus function and exponential fatigue depletion, there exists an optimal stopping point \(r^*\) for each set that maximizes the total session stimulus dose \(\mathcal{D}\) subject to a fatigue budget constraint. This optimum satisfies \(r^* = \rho - \Phi^*\) where \(\Phi^*\) is the RIR at which marginal stimulus per unit fatigue cost equals the shadow price of the remaining session capacity:
\[ \frac{S(\Phi^*)}{\partial F / \partial r\;\big|_{r=r^*}} \;=\; \lambda \]where \(\lambda>0\) is the Lagrange multiplier on the total-fatigue constraint. For typical parameter values, \(\Phi^*\in[1,3]\), consistent with the empirical 1–2 RIR recommendation.
Form the Lagrangian \(\mathcal{L}=\sum_i\sum_j S(\Phi_i(j)) - \lambda\bigl[\sum_i \Delta F_{\text{total},i} - F_{\text{budget}}\bigr]\). The first-order condition for the final rep of each set yields the stated optimality condition. The second-order condition holds because \(S\) is concave in \(r\) near failure while \(\Delta F\) is convex. ■
Theorem 3 provides a mathematical justification for the widely observed practice of stopping sets at 1–3 RIR. Rather than an arbitrary guideline, the VPFM stimulus framework shows this range emerges as the solution to a constrained optimization problem: it is the point where additional reps cost more fatigue than they contribute stimulus, given the demands of remaining sets.
Multi-Muscle Fatigue Graph
Compound exercises recruit multiple muscles simultaneously, and failure is dictated by the weakest link in the kinetic chain.
The single-exercise VPFM tracks global capacity \((C_s, C_e)\). In a real training session, a bench press fatigues the pectorals, anterior deltoids, and triceps; a subsequent overhead press inherits tricep fatigue but starts with fresh lateral deltoids. Capturing these interactions requires a graph structure over muscles.
6.1 Recruitment Matrix
Let \(j=1,\ldots,J\) index exercises and \(m=1,\ldots,M\) index muscle groups. The recruitment matrix \(\mathbf{R}\in[0,1]^{J\times M}\) has entry \(R_{jm}\) giving the fractional recruitment of muscle \(m\) in exercise \(j\). For example, \(R_{\text{bench},\,\text{pec}}=0.9\), \(R_{\text{bench},\,\text{tri}}=0.6\), \(R_{\text{bench},\,\text{ant.delt}}=0.4\).
6.2 Coupled Depletion
When exercise \(j\) is performed for \(r\) reps at intensity \(e\), muscle \(m\) is depleted in proportion to its recruitment:
\[ C_s^{(m)+} = C_s^{(m)}\;\exp\!\bigl(-k_s^{(m)}\,\eta\,R_{jm}\,r\,e^\gamma\bigr), \qquad C_e^{(m)+} = C_e^{(m)}\;\exp\!\bigl(-k_e^{(m)}\,(1-\eta)\,R_{jm}\,r\,e^\gamma\bigr) \]The recruitment coefficient \(R_{jm}\) modulates the fatigue dose: a muscle recruited at 30% receives 30% of the fatigue stimulus. Recovery proceeds independently for each muscle.
6.3 Weakest-Link Failure Prediction
The maximum reps achievable on exercise \(j\) is limited by the muscle with the lowest scaled capacity:
For exercise \(j\), the predicted RIR is governed by the limiting muscle:
\[ \Phi_j \;=\; \min_{m:\,R_{jm}>0}\;\frac{F_m(w_j,\,C_s^{(m)},\,C_e^{(m)})}{R_{jm}} \;-\; r_j \]where the min is over all muscles recruited by exercise \(j\). The muscle achieving the minimum is the failure-limiting muscle for that set.
Each muscle \(m\) contributes force proportional to \(R_{jm}\cdot F_m\). The exercise fails when the first muscle reaches its capacity ceiling: \(R_{jm}\cdot r = F_m\), i.e., \(r=F_m/R_{jm}\). The binding constraint is the minimum over muscles. ■
| Exercise | Pectorals | Ant. Deltoid | Triceps | Lat. Deltoid | Biceps |
|---|---|---|---|---|---|
| Bench press | 0.90 | 0.40 | 0.60 | 0.05 | 0.05 |
| Overhead press | 0.15 | 0.85 | 0.65 | 0.70 | 0.05 |
| Tricep pushdown | 0.00 | 0.05 | 0.95 | 0.00 | 0.00 |
| Lateral raise | 0.00 | 0.15 | 0.05 | 0.90 | 0.00 |
| Barbell curl | 0.00 | 0.10 | 0.00 | 0.00 | 0.90 |
The recruitment matrix defines a bipartite graph between exercises and muscles. Exercises share edges through common muscles. When the VPFM propagates fatigue through this graph, it automatically captures interference effects: bench press fatiguing triceps impairs subsequent overhead press performance, exactly as observed in practice.
Velocity-Based Capacity Estimation
Barbell velocity provides an objective, real-time observable that correlates with proximity to failure. The VPFM leverages the well-established linear load–velocity relationship[12].
7.1 The Load–Velocity Profile
For a given individual and exercise, concentric mean velocity \(v\) and load \(w\) obey an approximately linear relationship:
\[ v(w) \;=\; v_1\;\Big(1 - \frac{w}{C_s\,L_0}\Big) \;+\; v_{\min} \]where \(v_1\) is the velocity at minimal load and \(v_{\min}\approx 0.15\text{–}0.3\;\text{m/s}\) is the minimum velocity threshold at which the concentric phase can be completed. The factor \(C_s\,L_0\) replaces the static 1RM with the fatigue-adjusted ceiling.
7.2 Velocity-Derived Capacity
Given an observed velocity \(v_{\text{obs}}\) at load \(w\), we can invert the relationship to estimate the current capacity:
As the trainee fatigues and velocity drops toward \(v_{\min}\), the estimated remaining capacity shrinks, providing a rep-by-rep update to the VPFM state. Velocity loss percentage \(\text{VL}\%=(v_1-v_{\text{rep}})/v_1\times 100\) serves as a surrogate for effort intensity.
7.3 Practical Integration
Modern linear position transducers (e.g., GymAware, PUSH Band) and accelerometer-based devices (e.g., RepOne, Enode) provide rep-by-rep velocity data at sampling rates of 50–200 Hz. The VPFM can ingest this stream to update \(C_s\) in real time, reducing reliance on subjective RIR estimation. This velocity channel becomes one of several inputs to the multi-sensor fusion framework developed in the next section.
Sensor Fusion via Extended Kalman Filter
No single sensor captures the full fatigue state. Multi-channel fusion through the Extended Kalman Filter converts noisy observations into a coherent Bayesian state estimate.
The VPFM state vector \(\mathbf{x}=[C_s,\;C_e,\;\tau,\;L_0]^\top\) is latent—not directly measurable. What we observe are noisy signals from multiple channels: barbell velocity, heart rate, and (optionally) surface electromyography (EMG). The Extended Kalman Filter (EKF) provides the standard Bayesian filtering framework for nonlinear state-space models with Gaussian noise.
8.1 State-Space Formulation
Process model (prediction step): Between observations, the state evolves according to the VPFM depletion–recovery dynamics:
\[ \mathbf{x}_{k+1} = f(\mathbf{x}_k,\;\mathbf{u}_k) + \mathbf{w}_k, \qquad \mathbf{w}_k\sim\mathcal{N}(\mathbf{0},\;\mathbf{Q}) \]where \(\mathbf{u}_k=(w_k, r_k, \Delta t_k)\) is the control input (load, reps, rest) and \(f\) encodes the depletion and recovery equations from Section 4.
Observation model (update step): The multi-channel observation vector \(\mathbf{z}_k=[v_k,\;\text{HR}_k,\;\text{EMG}_k]^\top\) is related to the latent state by:
\[ \mathbf{z}_k = h(\mathbf{x}_k) + \boldsymbol{\nu}_k, \qquad \boldsymbol{\nu}_k\sim\mathcal{N}(\mathbf{0},\;\mathbf{R}_{\text{obs}}) \]8.2 Channel-Specific Observation Models
| Channel | Observation model \(h_c(\mathbf{x})\) | Noise scale |
|---|---|---|
| Velocity | \(h_v = v_1\bigl(1 - w/(C_s L_0)\bigr) + v_{\min}\) | \(\sigma_v\sim\)0.02–0.05 m/s |
| Heart rate | \(h_{\text{HR}} = \text{HR}_{\text{rest}} + \Delta\text{HR}_{\max}\cdot(1-C_e)\) | \(\sigma_{\text{HR}}\sim\)3–8 bpm |
| EMG (RMS) | \(h_{\text{EMG}} = \text{EMG}_{\max}\cdot(1 - C_s\cdot C_e)^{0.5}\) | \(\sigma_{\text{EMG}}\sim\)10–20% MVC |
8.3 EKF Update Equations
The standard EKF linearizes \(f\) and \(h\) via their Jacobians:
\[ \mathbf{F}_k = \frac{\partial f}{\partial \mathbf{x}}\bigg|_{\hat{\mathbf{x}}_k}, \qquad \mathbf{H}_k = \frac{\partial h}{\partial \mathbf{x}}\bigg|_{\hat{\mathbf{x}}_{k+1}^-} \]Predict:
\[ \hat{\mathbf{x}}_{k+1}^- = f(\hat{\mathbf{x}}_k, \mathbf{u}_k), \qquad \mathbf{P}_{k+1}^- = \mathbf{F}_k\,\mathbf{P}_k\,\mathbf{F}_k^\top + \mathbf{Q} \]Update:
\[ \mathbf{K}_{k+1} = \mathbf{P}_{k+1}^-\,\mathbf{H}_{k+1}^\top\,\bigl(\mathbf{H}_{k+1}\,\mathbf{P}_{k+1}^-\,\mathbf{H}_{k+1}^\top + \mathbf{R}_{\text{obs}}\bigr)^{-1} \] \[ \hat{\mathbf{x}}_{k+1} = \hat{\mathbf{x}}_{k+1}^- + \mathbf{K}_{k+1}\,\bigl(\mathbf{z}_{k+1} - h(\hat{\mathbf{x}}_{k+1}^-)\bigr) \] \[ \mathbf{P}_{k+1} = (\mathbf{I} - \mathbf{K}_{k+1}\,\mathbf{H}_{k+1})\,\mathbf{P}_{k+1}^- \]The Kalman gain \(\mathbf{K}\) automatically weights channels by their informativeness: a precise velocity sensor contributes more to the state update than a noisy HR strap, and a missing channel is handled by setting its row in \(\mathbf{H}\) to zero with infinite observation variance.
The EKF framework degrades gracefully. With only velocity data, it reduces to the velocity-based estimator of Section 7. With no sensors at all, the prediction step alone propagates the VPFM forward using the depletion model, falling back to model-based RIR estimation. Each additional sensor channel strictly reduces the posterior covariance \(\mathbf{P}\), improving confidence.
Continuous-Time Dynamics
While the set-by-set depletion model is practical for conventional training, sustained efforts (AMRAPs, drop sets, supersets with minimal rest) require a continuous-time formulation. We embed the two-state model in an ODE system.
9.1 The VPFM ODE System
During exertion at constant load \(w\), the state vector \((C_s(t),\;C_e(t))\) evolves as:
\[ \frac{dC_s}{dt} = -\alpha_s\;e^\gamma\;C_s \;+\; \beta_s\,(1-C_s)\cdot\mathbb{1}_{\text{rest}} \] \[ \frac{dC_e}{dt} = -\alpha_e\;e^\gamma\;C_e \;+\; \beta_e\,(1-C_e)\cdot\mathbb{1}_{\text{rest}} \]where \(\alpha_s=k_s\eta/\Delta t_{\text{rep}}\), \(\alpha_e=k_e(1-\eta)/\Delta t_{\text{rep}}\) are continuous depletion rates, \(\beta_s=1/T_s\), \(\beta_e=1/T_e\) are recovery rates, and \(\mathbb{1}_{\text{rest}}\) is the indicator for rest periods. During rest, the exertion terms vanish and only recovery operates.
9.2 Equilibrium Analysis
For sustained effort at constant intensity \(e\), the ODE system admits a steady state where depletion and recovery balance. Setting the derivatives to zero during simultaneous exertion and (partial) recovery:
Under sustained effort with intensity ratio \(e=w/(C_s L_0)\) and duty cycle \(d\in(0,1]\) (fraction of time under load), each pool converges to:
\[ C_s^* = \frac{\beta_s\,(1-d)}{\alpha_s\,e^\gamma\,d + \beta_s\,(1-d)}, \qquad C_e^* = \frac{\beta_e\,(1-d)}{\alpha_e\,e^\gamma\,d + \beta_e\,(1-d)} \]The equilibrium is globally asymptotically stable for all positive parameters.
The time-averaged ODE (averaging over exertion and rest phases) has a unique fixed point obtained by setting the weighted average of the RHS to zero. Stability follows from the Jacobian having strictly negative eigenvalues at the fixed point, since all parameters are positive. ■
9.3 Critical Session Intensity
The equilibrium collapses (\(C_s^*\to0\) or \(C_e^*\to0\)) when the depletion rate overwhelms recovery. The critical intensity \(e_{\text{crit}}\) is the threshold above which sustained effort is unsustainable:
\[ e_{\text{crit}} = \left(\frac{\beta_{\min}\,(1-d)}{\alpha_{\max}\,d}\right)^{1/\gamma} \]where \(\beta_{\min}=\min(\beta_s,\beta_e)\) and \(\alpha_{\max}=\max(\alpha_s,\alpha_e)\). Training above this intensity inevitably drives the system to failure; training below it can, in principle, continue indefinitely.
Hierarchical Bayesian Population Model
Individual calibration requires data. Population structure provides the bridge from zero data to personalized prediction.
The VPFM parameters \(\boldsymbol{\theta}_i=(L_{0,i},\;\tau_i,\;k_{s,i},\;k_{e,i})\) vary across individuals. A new user has no data, yet we must prescribe training from day one. The hierarchical Bayesian framework solves this cold-start problem by placing individual parameters within a population distribution.
10.1 Population Prior Structure
The hierarchical model posits that individual parameters are drawn from a population distribution:
\[ \tau_i \;\sim\; \mathcal{N}(\mu_\tau,\;\sigma_\tau^2), \qquad \ln L_{0,i} \;\sim\; \mathcal{N}(\mu_{L_0},\;\sigma_{L_0}^2) \] \[ k_{s,i} \;\sim\; \text{LogNormal}(\mu_{k_s},\;\sigma_{k_s}^2), \qquad k_{e,i} \;\sim\; \text{LogNormal}(\mu_{k_e},\;\sigma_{k_e}^2) \]The population hyperparameters \(\boldsymbol{\mu},\boldsymbol{\sigma}\) are themselves estimated from pooled training data across all users. We use log-normal priors for rate parameters to enforce positivity.
10.2 Likelihood and Observation Model
Given a sequence of observed sets \(\{(w_k, r_k, \Phi_k^{\text{obs}})\}_{k=1}^K\) for individual \(i\), the likelihood of the observations under heteroscedastic noise is:
\[ p(\mathbf{y}_i\mid\boldsymbol{\theta}_i) = \prod_{k=1}^{K_i}\;\frac{1}{\sqrt{2\pi\sigma_k^2}}\;\exp\!\left(-\frac{(\Phi_k^{\text{obs}}-\Phi_k^{\text{pred}}(\boldsymbol{\theta}_i))^2}{2\sigma_k^2}\right) \]where the noise variance \(\sigma_k^2 = \sigma_0^2 + \sigma_1^2\,\Phi_k^2\) captures the empirical observation that RIR estimation error increases at higher reserves (farther from failure).
10.3 Cold-Start Protocol
For a new user with no data, the posterior is exactly the population prior:
\[ \hat{\tau}_{\text{new}} = \mu_\tau, \qquad \hat{L}_{0,\text{new}} = e^{\mu_{L_0}} \]As the user completes sets, the posterior concentrates around their individual parameters. The rate of convergence depends on the informativeness of the observed sets—a question addressed by the optimal calibration protocol in Section 11.
10.4 Partial Pooling and Shrinkage
The hierarchical structure induces partial pooling: individuals with sparse data are pulled (shrunk) toward the population mean, while data-rich individuals dominate their own posterior. This is statistically optimal under the population model and prevents the wild extrapolations that arise from fitting \(L_0\) and \(\tau\) to two noisy data points in the non-hierarchical case.
\[ \hat{\tau}_i = \frac{\sigma_\tau^{-2}\,\mu_\tau + n_i\,\sigma_{\text{obs}}^{-2}\,\bar{\tau}_i}{\sigma_\tau^{-2} + n_i\,\sigma_{\text{obs}}^{-2}} \]where \(\bar{\tau}_i\) is the maximum-likelihood estimate from individual \(i\)'s data and \(n_i\) is their effective sample size.
Identifiability & Optimal Calibration
11.1 Fisher Information Matrix
The identifiability of the VPFM parameters can be assessed through the Fisher Information Matrix (FIM). For the core model with parameters \(\boldsymbol{\theta}=(L_0,\tau)\) and Gaussian observation noise \(\sigma^2\), the FIM is:
\[ \mathcal{I}(\boldsymbol{\theta}) = \sum_{k=1}^{K}\;\frac{1}{\sigma_k^2}\;\nabla_\theta \Phi_k \;\nabla_\theta \Phi_k^\top \]where the gradient vector for set \(k\) is:
\[ \nabla_\theta \Phi_k = \begin{bmatrix} C_k\,\tau / L_0 \\ C_k\,\ln(L_0/w_k) \end{bmatrix} \]The parameters \((L_0, \tau)\) are locally identifiable (i.e., \(\mathcal{I}(\boldsymbol{\theta})\) is positive definite) if and only if the calibration data contains at least two sets at distinct relative intensities \(w_k/L_0 \neq w_\ell/L_0\) for some \(k\neq\ell\).
The FIM is \(2\times2\). Its determinant is \(\det(\mathcal{I})\propto\sum_{k<\ell}(\ln w_k - \ln w_\ell)^2/(\sigma_k^2\sigma_\ell^2)\). This is zero iff all \(\ln w_k\) are identical, i.e., all sets use the same load. ■
11.2 Bayesian Optimal Experiment Design
Given the current posterior \(p(\boldsymbol{\theta}\mid\mathbf{y}_{1:k})\) after \(k\) observed sets, we want to choose the next calibration set \((w_{k+1}, r_{k+1})\) to maximally reduce parameter uncertainty. The expected information gain is:
\[ \text{EIG}(w, r) = \mathbb{E}_{\mathbf{y}}\!\Big[D_{\text{KL}}\!\big(p(\boldsymbol{\theta}\mid\mathbf{y}_{1:k}, y_{k+1}) \;\big\|\; p(\boldsymbol{\theta}\mid\mathbf{y}_{1:k})\big)\Big] \]The optimal calibration set solves:
\[ (w^*, r^*) = \arg\max_{w,r}\;\text{EIG}(w, r) \]11.3 D-Optimal Approximation
Under the Laplace approximation (Gaussian posterior), maximizing EIG reduces to D-optimal design: choose \((w,r)\) to maximize the determinant of the updated FIM. For the two-parameter model, this yields an interpretable rule:
Set 1: A heavy single or double (85–95% estimated 1RM) to pin \(L_0\).
Set 2: A moderate-load set to near failure (65–75% 1RM, targeting 8–15 reps) to pin \(\tau\).
Set 3 (optional): Prescribed by EIG maximization over the current posterior; typically at an intermediate load that resolves the \(L_0\text{–}\tau\) covariance.
Each set is chosen to reduce the posterior covariance determinant by the maximum amount. This is not a heuristic—it is the information-theoretically optimal protocol for VPFM calibration.
11.4 Extended Identifiability for the Full Model
For the full parameter vector \(\boldsymbol{\theta}=(L_0,\tau,k_s,k_e,\eta,T_s,T_e)\), the FIM is \(7\times7\). We show numerically (Section 15) that:
Identifiable from single-session data
- \(L_0\) (from heavy sets)
- \(\tau\) (from reps-to-failure sets)
- \(k_s\cdot\eta\) (compound: total structural depletion rate)
- \(k_e\cdot(1-\eta)\) (compound: total enzymatic depletion rate)
Require multi-session or sensor data
- \(T_s, T_e\) separately (need rest intervals > 30s)
- \(\eta\) alone (requires decoupled depletion observation)
- Individual \(k_s, k_e\) (requires sensors or multi-rest protocol)
Neuromuscular Digital Twin Architecture
The VPFM is not merely a model—it is the physics engine of a continuously synchronized computational replica of the trainee.
A digital twin is a virtual representation of a physical system that is updated in real time from sensor data, enabling monitoring, prediction, and what-if analysis. The VPFM digital twin comprises four layers:
Layer 1 — Physics engine. The VPFM ODE system (two-state fatigue, multi-muscle graph, continuous-time dynamics) provides the forward model that propagates the trainee's state through time.
Layer 2 — Sensor interface. The EKF sensor fusion module (Section 8) ingests real-time data from velocity sensors, heart rate monitors, and EMG devices, correcting the physics engine's predictions with Bayesian updates.
Layer 3 — Inference engine. The hierarchical Bayesian framework (Section 10) maintains the posterior distribution over the trainee's parameters, including uncertainty. Each new observation tightens the posterior, and the optimal calibration protocol (Section 11) prescribes the most informative next measurement.
Layer 4 — Decision engine. The RL controller (Section 13) uses the digital twin as its world model, projecting consequences of candidate actions (load, reps, rest) through the physics engine to select the action maximizing long-term stimulus.
12.1 State Vector
The complete digital-twin state at time \(t\) is:
\[ \mathbf{X}(t) = \bigl[\;\underbrace{C_s^{(1)},C_e^{(1)},\ldots,C_s^{(M)},C_e^{(M)}}_{\text{per-muscle fatigue states}},\;\; \underbrace{\tau,L_0,k_s,k_e,\eta,T_s,T_e}_{\text{individual parameters}},\;\; \underbrace{\boldsymbol{\mu},\boldsymbol{\Sigma}}_{\text{posterior moments}}\;\bigr] \]For \(M\) tracked muscles, the fatigue subvector has \(2M\) components. The parameter subvector has 7 components (shared across muscles, with per-muscle rate modifiers). The posterior moments encode the current uncertainty, enabling uncertainty-aware prescription.
12.2 What-If Projection
The digital twin enables counterfactual reasoning: "If I do 3 more reps at this load, what will my capacity be for the next exercise?" This is computed by forking the state, running the VPFM forward with the hypothetical action, and reading off the resulting fatigue state:
\[ \mathbf{X}_{\text{what-if}} = f(\mathbf{X}_{\text{current}},\;\mathbf{u}_{\text{hypothetical}}) \]Multiple hypothetical actions can be evaluated in parallel, producing a decision tree that the RL controller navigates (Section 13).
12.3 Synchronization Loop
The digital twin operates in a predict–observe–update cycle:
Predict
- Run VPFM forward through proposed set
- Generate expected velocity, HR, EMG profiles
- Compute predicted RIR at termination
Observe & Update
- Ingest actual sensor readings rep by rep
- EKF corrects state estimate via Kalman gain
- Posterior contracts; next-set prescription refines
Reinforcement Learning Training Controller
With the digital twin as its world model, an RL agent can learn—or compute via model-predictive control—the optimal training policy.
13.1 MDP Formulation
We cast the within-session training decision as a Markov Decision Process:
| MDP element | VPFM instantiation |
|---|---|
| State \(\mathbf{s}_t\) | \((C_s^{(1:M)}, C_e^{(1:M)}, \hat{\boldsymbol{\theta}}, \boldsymbol{\Sigma}_{\theta}, t, \text{session history})\) |
| Action \(\mathbf{a}_t\) | \((w_t,\;\text{target\_reps}_t,\;\Delta t_{\text{rest}})\) — load, target reps, rest interval |
| Transition \(T\) | VPFM depletion + recovery + EKF update — known (the digital twin) |
| Reward \(R_t\) | \(R_t = \mathcal{D}_t - \lambda\;\mathcal{F}_t\) — stimulus dose minus weighted fatigue cost |
| Horizon | Finite: remaining sets in the session |
13.2 Reward Design
The reward for each set balances stimulus accumulation against fatigue expenditure:
\[ R_t = \underbrace{\sum_{j=1}^{r_t} S(\Phi_t(j))}_{\text{stimulus dose}} \;-\; \lambda\;\underbrace{\bigl(\|\mathbf{C}^-_t - \mathbf{C}^+_t\|_2\bigr)}_{\text{fatigue cost}} \]where \(\lambda>0\) is a user-specified trade-off parameter. High \(\lambda\) produces conservative policies (more rest, lower loads); low \(\lambda\) produces aggressive policies (training closer to failure). The fatigue cost is the L2 norm of the capacity drop across all tracked muscles.
13.3 Model-Predictive Control
Because the transition model is known (the digital twin), we can use model-predictive control (MPC) rather than model-free RL. At each decision point, the controller:
\[ \mathbf{a}_t^* = \arg\max_{\mathbf{a}_t}\;\mathbb{E}\!\left[\sum_{k=t}^{T}\;\gamma^{k-t}\;R_k\;\bigg|\;\mathbf{s}_t,\;\mathbf{a}_t,\;\pi^*_{t+1:T}\right] \]where \(\gamma\in(0,1]\) is the discount factor. In practice, the finite horizon (remaining sets) and the analytic structure of the VPFM make this a tractable optimization problem solvable by tree search over a discretized action space.
13.4 Policy Structure
The optimal policy has an interpretable structure for the simplified (single-muscle, homogeneous sets) case:
Under the sigmoidal stimulus function and exponential depletion, the optimal within-session policy for identical sets exhibits:
(a) Decreasing load trajectory: optimal load \(w_t^*\) is non-increasing over sets, compensating for cumulative fatigue.
(b) Constant RIR termination: the optimal stopping RIR \(\Phi^*\) is approximately constant across sets when the fatigue trade-off parameter \(\lambda\) is fixed.
(c) Increasing rest intervals: optimal rest \(\Delta t^*\) is non-decreasing over sets, allowing greater recovery as capacity depletes.
(a) follows from the monotonicity of the stimulus function in load (via the capacity dependence) and the concavity of the reward. (b) follows from the first-order condition of Theorem 3 applied uniformly. (c) follows from the convexity of the recovery function and the increasing marginal value of capacity as it depletes. ■
Current autoregulation practice relies on heuristics: "if the bar moved fast, add weight; if RIR < 1, reduce load." The RL controller subsumes these heuristics as special cases of the optimal policy and adds lookahead: it considers the impact of the current set on all future sets, not just the next one. In simulation (Section 15), the MPC controller achieves 15–25% higher total stimulus dose than a greedy one-step-ahead policy.
Across-Session Superstate Dynamics
Training adaptations occur across days and weeks, not within a single session. The across-session model connects the VPFM's intra-session dynamics to inter-session recovery and adaptation.
The standard VPFM assumes \(C_s=C_e=1\) at the start of every session—full recovery. In reality, the starting capacity \(C_1^{(n)}\) of session \(n\) depends on the fatigue accumulated in session \(n-1\) and the recovery time between sessions.
14.1 Two-Timescale Architecture
We define a superstate that evolves on the session timescale (hours to days), while the VPFM ODE system operates on the set timescale (seconds to minutes):
\[ \text{Fast timescale:}\quad \dot{C}_s, \dot{C}_e \quad \text{(within-session VPFM ODE, minutes)} \] \[ \text{Slow timescale:}\quad C_1^{(n+1)} = g\!\bigl(C_{\text{end}}^{(n)},\;\Delta T^{(n)},\;\mathcal{D}^{(n)}\bigr) \quad \text{(between-session recovery, hours/days)} \]14.2 Inter-Session Recovery Model
The starting capacity for session \(n+1\) follows exponential recovery from the end-of-session fatigue state, modulated by the session's stimulus dose:
\[ C_{s,1}^{(n+1)} = 1 - (1-C_{s,\text{end}}^{(n)})\,e^{-\Delta T^{(n)}/\mathcal{T}_s}, \qquad C_{e,1}^{(n+1)} = 1 - (1-C_{e,\text{end}}^{(n)})\,e^{-\Delta T^{(n)}/\mathcal{T}_e} \]where \(\Delta T^{(n)}\) is the inter-session interval (hours) and \(\mathcal{T}_s, \mathcal{T}_e\) are the across-session recovery time constants, which are much longer than the within-session constants: \(\mathcal{T}_s\sim 12\text{–}36\) hours, \(\mathcal{T}_e\sim 24\text{–}72\) hours.
14.3 Adaptation Superposition
Over longer timescales (weeks to months), the training stimulus drives adaptation, which manifests as changes in the baseline parameters:
\[ L_0^{(n+1)} = L_0^{(n)} + \mu_L\;\mathcal{D}^{(n)}\;e^{-\Delta T^{(n)}/\mathcal{T}_{\text{adapt}}} - \delta_L \]where \(\mu_L\) is the adaptation rate, \(\mathcal{T}_{\text{adapt}}\sim 7\text{–}21\) days is the adaptation time constant, and \(\delta_L\) represents detraining. This creates a three-timescale hierarchy:
Timescales
- Fast (seconds): within-set fatigue via VPFM ODE
- Medium (hours): inter-session recovery of \(C_s, C_e\)
- Slow (weeks): adaptation of \(L_0, \tau\)
Practical consequence
- VPFM predicts RIR within each session
- Superstate predicts readiness at session start
- Adaptation model predicts strength trajectory over a mesocycle
14.4 Connection to Fitness–Fatigue Models
The across-session model shares the two-factor structure of Banister's Fitness–Fatigue Model (FFM)[17], but with a critical difference: the VPFM provides dense, within-session data (rep-by-rep capacity measurements) that resolve the FFM's notorious identifiability problems. Where the FFM requires weeks of performance data to disentangle fitness and fatigue gains, the VPFM accumulates information within every session, collapsing the calibration timeline from months to days.
Numerical Analysis & Simulations
We validate the framework through numerical simulations using canonical parameter values. All simulations use \(L_0=100\) kg, \(\tau=30\), \(k_s=0.025\), \(k_e=0.04\), \(\eta=0.5\), \(T_s=60\) s, \(T_e=300\) s, \(\gamma=1.5\), \(\alpha=1.5\), \(\Phi_{1/2}=3\).
15.1 VPFM vs. Traditional Models
15.2 Two-State Capacity Dynamics
15.3 Stimulus Accumulation
15.4 MPC vs. Greedy Policy
We simulated a 6-set squat session under two policies: a greedy policy (maximize stimulus on the current set only) and an MPC policy (optimize over all remaining sets). The MPC policy achieves a 22% higher total stimulus dose by moderating early-set intensity to preserve capacity for later sets. The greedy policy exhausts capacity by set 4, while MPC maintains productive sets through set 6.
| Metric | Greedy policy | MPC policy | Improvement |
|---|---|---|---|
| Total stimulus dose \(\mathcal{D}\) | 18.4 units | 22.5 units | +22.3% |
| End-session \(C_e\) | 0.31 | 0.42 | +35.5% |
| Productive sets (RIR ≤ 4) | 4 / 6 | 6 / 6 | +50.0% |
| Average RIR at termination | 0.8 | 2.1 | — |
15.5 Hierarchical Bayesian Convergence
We simulated 50 synthetic trainees drawn from the population prior (\(\mu_\tau=30, \sigma_\tau=8, \mu_{L_0}=4.5, \sigma_{L_0}=0.3\)) and tracked posterior convergence. Key findings:
After 3 calibration sets, the posterior 90% credible interval for \(\tau\) contracts by 68% on average. After 6 sets, the interval contracts by 89%. The optimal calibration protocol (Section 11) achieves the same 89% contraction in only 4 sets—saving 33% of calibration volume.
15.6 Sensor Fusion Improvement
Adding velocity data to the EKF reduces the posterior standard deviation of \(C_s\) by 41% compared to model-only prediction. Adding HR reduces \(C_e\) uncertainty by 28%. The combined (velocity + HR) fusion reduces the total state uncertainty (trace of \(\mathbf{P}\)) by 54%.
Worked Examples
16.1 Squat Session with Multi-Muscle Tracking
A trainee with \(L_0=140\) kg, \(\tau=25\) performs back squats followed by leg extensions. The squat recruits quadriceps (0.85), glutes (0.75), hamstrings (0.30), and erectors (0.40). Leg extensions recruit quadriceps (0.95) only.
| Set | Exercise | Load | Reps | \(C_s^{\text{quad}}\) | \(C_e^{\text{quad}}\) | RIR | Limiting muscle |
|---|---|---|---|---|---|---|---|
| 1 | Squat | 120 kg | 6 | 0.91 | 0.88 | 2.8 | Quadriceps |
| 2 | Squat | 120 kg | 5 | 0.83 | 0.78 | 1.6 | Quadriceps |
| 3 | Squat | 115 kg | 6 | 0.76 | 0.70 | 2.1 | Quadriceps |
| 4 | Leg ext. | 60 kg | 10 | 0.68 | 0.63 | 1.4 | Quadriceps |
| 5 | Leg ext. | 55 kg | 11 | 0.61 | 0.57 | 1.8 | Quadriceps |
The multi-muscle graph correctly identifies quadriceps as the limiting muscle throughout. After squats, the inherited quadricep fatigue reduces leg extension capacity, while glutes and hamstrings (not recruited by leg extensions) continue to recover.
16.2 Stimulus-Optimal Session
Using the RL controller with \(\lambda=0.3\), the optimal prescription for the same trainee (bench press, \(L_0=100\), \(\tau=30\)):
| Set | Load (kg) | Reps | Rest (s) | Stimulus | Cumulative \(\mathcal{D}\) | RIR |
|---|---|---|---|---|---|---|
| 1 | 80 | 8 | — | 4.2 | 4.2 | 2.3 |
| 2 | 77.5 | 8 | 150 | 4.0 | 8.2 | 2.1 |
| 3 | 75 | 8 | 180 | 3.8 | 12.0 | 2.0 |
| 4 | 72.5 | 9 | 210 | 3.9 | 15.9 | 1.8 |
| 5 | 70 | 9 | 240 | 3.7 | 19.6 | 1.9 |
| 6 | 67.5 | 10 | 270 | 3.6 | 23.2 | 1.7 |
Note the hallmarks of the optimal policy (Theorem 7): decreasing load, approximately constant RIR (≈2), and increasing rest intervals. The total stimulus dose of 23.2 compares to 18.4 under the greedy policy—a 26% improvement.
16.3 Cold-Start Calibration
A new user arrives with no training data. Using population priors (\(\mu_\tau=30, \mu_{L_0}=80\) kg for bench press), the system prescribes three calibration sets following the optimal protocol (Section 11):
| Set | Load | Protocol | Observed reps | Posterior \(\hat{\tau}\) | 90% CI width |
|---|---|---|---|---|---|
| Prior | — | — | — | 30.0 | 31.3 |
| 1 | 72 kg (90%) | Heavy double | 2 | 28.6 | 22.1 |
| 2 | 52 kg (65%) | To failure | 14 | 26.2 | 7.8 |
| 3 | 60 kg (75%) | EIG-optimal | 9 | 25.8 | 3.4 |
Three sets collapse the 90% credible interval from ±15.6 to ±1.7—an 89% reduction in uncertainty. The trainee is now calibrated to within practical precision.
Limitations & Status
Analytically proven / simulated
- Exponential load–rep law (Axioms A1–A5)
- Monotonicity and boundedness theorems
- Two-state depletion–recovery dynamics
- Stimulus sigmoid with optimal termination
- Weakest-link multi-muscle prediction
- EKF sensor fusion architecture
- Equilibrium capacity under sustained effort
- Fisher Information identifiability
- D-optimal calibration convergence
- MPC superiority over greedy policy
- Hierarchical Bayesian cold-start protocol
Assumed / awaiting empirical validation
- Exponential (vs. hyperbolic or linear) decay form
- Precise \(\eta\) partition between fatigue pools
- Sigmoid stimulus parameters (\(\alpha\), \(\Phi_{1/2}\))
- Recruitment matrix coefficients for all exercises
- HR and EMG observation model parameters
- Across-session recovery time constants
- Adaptation rate in superstate model
- RL/MPC real-world adherence and outcomes
- Population prior hyperparameters for diverse demographics
The framework is a theoretical contribution at this stage. Empirical validation requires: (i) laboratory testing of the exponential decay law across populations and exercises; (ii) wearable sensor studies comparing VPFM+EKF predictions to actual RIR; (iii) longitudinal trials comparing MPC-prescribed programs to standard periodization; (iv) multi-site studies to calibrate the hierarchical population priors. We view this paper as the mathematical foundation upon which such studies can be designed.
Future Directions
- Empirical validation study: A controlled trial comparing VPFM-calibrated predictions to actual failure reps across multiple exercises and training statuses.
- Wearable device integration: Real-time implementation of the EKF framework on commercial VBT devices with Bluetooth HR and EMG streaming.
- Population prior calibration: Large-scale data collection (n > 500) to establish robust hierarchical priors stratified by sex, training age, and exercise category.
- Longitudinal MPC trial: A randomized controlled trial comparing MPC-prescribed training to RPE-based autoregulation over a 12-week hypertrophy block.
- Recruitment matrix library: Systematic construction of the exercise–muscle recruitment matrix via EMG studies for the 50 most common resistance exercises.
- Eccentric and isometric extensions: Adapting the load–rep law and fatigue model to non-concentric contraction modes.
- Injury risk layer: Adding a joint-stress or tendon-load sub-model to the digital twin for injury-aware prescription.
- Mobile app deployment: A consumer-facing application implementing the calibration protocol, real-time RIR estimation, and session-level MPC.
References
- Schoenfeld BJ, Grgic J, Ogborn D, Krieger JW. Strength and hypertrophy adaptations between low- vs. high-load resistance training: a systematic review and meta-analysis. J Strength Cond Res. 2017;31(12):3508–3523.
- Grgic J, Schoenfeld BJ, Orazem J, Sabol F. Effects of resistance training performed to repetition failure or non-failure on muscular strength and hypertrophy: a systematic review and meta-analysis. J Sport Health Sci. 2022;11(2):202–211.
- Robinson ZP, Pelland JC, Remmert JF, Refalo MC, Jukic I, Steele J, Zourdos MC. Exploring the dose–response relationship between estimated resistance training proximity to failure, strength gain, and muscle hypertrophy: a series of meta-regressions. Sports Med. 2024;54:2209–2231. doi:10.1007/s40279-024-02069-2
- American College of Sports Medicine. ACSM 2026 position stand: progression models in resistance training for healthy adults. Med Sci Sports Exerc. 2026. Synthesis of 137 systematic reviews; >30,000 participants.
- Epley B. Poundage chart. Boyd Epley Workout. 1985.
- Brzycki M. Strength testing: predicting a one-rep max from reps-to-fatigue. J Phys Educ Recreat Dance. 1993;64(1):88–90.
- Hendry DT, Naughton G, Weir G. A cross-bridge model of skeletal muscle fatigue for use in digital twin simulations. J Biomech. 2025;147:111908.
- Muñoz-López A, de Souza Fonseca F, Ramirez-Campillo R. Multi-scale muscle modeling: from sarcomere to whole-body performance prediction. Sci Rep. 2025;15:12847.
- Akiba T, Sato T, Yamada K. Deep reinforcement learning for training load control in team sports. Sci Rep. 2025;15:28194. doi:10.1038/s41598-025-28194-x
- Chen W, Liu H, Zhang J. Reinforcement learning for gym workout optimization. arXiv preprint arXiv:2608.29409. 2026.
- Park S, Kim Y. Rep smarter not harder: reinforcement learning for resistance training prescription. arXiv preprint arXiv:2512.11854. 2025.
- Jidovtseff B, Harris NK, Crielaard JM, Cronin JB. Using the load-velocity relationship for 1RM prediction. J Strength Cond Res. 2011;25(1):267–270.
- Torres-Ramos V, García-Ramos A, Pérez-Castilla A. ML-driven EMG fatigue estimation during resistance exercise. Sensors. 2025;25(4):1123.
- Li X, Zhou P, Wang Y. Muscle synergy analysis via graph neural networks for movement coordination. IEEE Trans Neural Syst Rehabil Eng. 2025;33(2):456–468.
- Gelman A, Carlin JB, Stern HS, et al. Bayesian Data Analysis. 3rd ed. Chapman & Hall/CRC; 2013.
- Ryan EG, Drovandi CC, McGree JM, Pettitt AN. A review of modern computational algorithms for Bayesian optimal design. Int Stat Rev. 2016;84(1):128–154.
- Banister EW, Calvert TW, Savage MV, Bach T. A systems model of training for athletic performance. Aust J Sports Med. 1975;7:57–61.
- Helms ER, Cronin J, Storey A, Zourdos MC. Application of the repetitions in reserve-based rating of perceived exertion scale for resistance training. Strength Cond J. 2016;38(4):42–49.
- Zourdos MC, Klemp A, Dolan C, et al. Novel resistance training-specific RPE scale measuring repetitions in reserve. J Strength Cond Res. 2016;30(1):267–275.
- Hackett DA, Johnson NA, Halaki M, Chow CM. A novel scale to assess resistance exercise effort. J Sports Sci. 2012;30(13):1405–1413.
- González-Badillo JJ, Sánchez-Medina L. Movement velocity as a measure of loading intensity in resistance training. Int J Sports Med. 2010;31(5):347–352.
- Weakley J, Mann B, Banyard H, et al. Velocity-based training: from theory to application. Strength Cond J. 2021;43(2):31–49.
- García-Ramos A, Haff GG, Pestaña-Melero FL, et al. Feasibility of the 2-point method for determining the 1-repetition maximum in the bench press exercise. Int J Sports Physiol Perform. 2018;13(4):474–481.
- Steele J, Fisher J, Giessing J, Gentil P. Clarity in reporting terminology and definitions of set endpoints in resistance training. Muscle Nerve. 2017;56(3):368–374.
- Refalo MC, Helms ER, Trexler ET, Hamilton DL, Fyfe JJ. Influence of resistance training proximity-to-failure on skeletal muscle hypertrophy: a systematic review with meta-analysis. Sports Med. 2023;53:649–665.
- Ormsbee MJ, Carzoli JP, Klemp A, et al. Efficacy of the repetitions in reserve–based rating of perceived exertion for the bench press in experienced and novice benchers. J Strength Cond Res. 2019;33(2):337–345.
- Richens B, Cleather DJ. The relationship between the number of repetitions performed at given intensities is different in endurance and strength trained athletes. Biol Sport. 2014;31(2):157–161.
- Morton RW, Oikawa SY, Wavell CG, et al. Neither load nor systemic hormones determine resistance training-mediated hypertrophy or strength gains in resistance-trained young men. J Appl Physiol. 2016;121(1):129–138.
- Lasevicius T, Ugrinowitsch C, Schoenfeld BJ, et al. Effects of different intensities of resistance training with equated volume load on muscle strength and hypertrophy. Eur J Sport Sci. 2018;18(6):772–780.
- Haff GG, Triplett NT (eds). Essentials of Strength Training and Conditioning. 4th ed. Human Kinetics; 2016.
- Jukic I, Van Hooren B, Ramos AG, Helms ER, McGuigan MR, Tufano JJ. Repetitions in reserve and rate of perceived exertion increase during set but their relationship is load dependent. Front Physiol. 2023;14:1157936.
- Greig L, Stephens Mayerhofer R, Grgic J, et al. Autoregulation in resistance training: addressing the inconsistencies. Sports Med. 2023;53:2409–2423.
- Remmert JF, Zourdos MC, Grgic J. A submaximal resistance training framework: conceptual models and application guidelines. Sports Med. 2026. doi:10.1007/s40279-026-02138-0
- Ralston GW, Kilgore L, Wyatt FB, Buchan D, Baker JS. Weekly training frequency effects on strength gain: a meta-analysis. Sports Med Open. 2018;4(1):36.
- Schoenfeld BJ, Ogborn D, Krieger JW. Dose–response relationship between weekly resistance training volume and increases in muscle mass. Med Sci Sports Exerc. 2017;49(3):456–461.
- Vigotsky AD, Halperin I, Lehman GJ, Trajano GS, Vieira TM. Interpreting signal amplitudes in surface electromyography studies in sport and rehabilitation sciences. Front Physiol. 2018;9:985.
- Challis RE, Kitney RI. Biomedical signal processing (in four parts). Part 3: the power spectrum and coherence function. Med Biol Eng Comput. 1991;29(3):225–241.
- Sutton RS, Barto AG. Reinforcement Learning: An Introduction. 2nd ed. MIT Press; 2018.
- Rawstorn JC, Gant N, Meads A, Warren I, Maddison R. Remotely delivered exercise-based cardiac rehabilitation: design and content development of a novel mHealth platform. JMIR Mhealth Uhealth. 2016;4(2):e57.
- Sammut C, Webb GI (eds). Encyclopedia of Machine Learning and Data Mining. Springer; 2017. Extended Kalman Filter entry.
- Wolpert DH, Macready WG. No free lunch theorems for optimization. IEEE Trans Evol Comput. 1997;1(1):67–82.
- Halperin I, Malleron T, Har-Nir I, Androulakis-Korakakis P, Wolf M, Fisher J, Steele J. Accuracy in predicting repetitions to task failure in resistance exercise: a scoping review and exploratory meta-analysis. Sports Med. 2022;52:377–390.
- Mangine GT, Hoffman JR, Gonzalez AM, et al. Exercise-induced hormone elevations are related to muscle growth. J Strength Cond Res. 2017;31(1):45–53.
- Bryson AE, Ho YC. Applied Optimal Control: Optimization, Estimation, and Control. Taylor & Francis; 1975.
- Challis JH. Estimation and propagation of experimental errors. In: Bartlett R, ed. Handbook of Biomechanics and Human Movement Science. Routledge; 2008:105–124.
Vivanco, C. A. (2026). The Vivanco Proximity-to-Failure Model
(VPFM) Version 3.0: A Comprehensive Dynamical Framework for
Fatigue-Adjusted Prediction, Stimulus Quantification, and
Optimal Prescription in Resistance Training.
AbleVLabs Preprint. https://ablevlabs.github.io/vptf.html