How far should a real-plant estimate be pulled toward its digital twin?
research/twin-shrinkage
Pulling a real-plant parameter estimate toward its twin (James–Stein): exact risk d−(d−2)²E[1/(d−2+2K)], never worse in total for d≥3, perfect twin risk 2 at any d, worth n+σ²/τ² real samples at large d, but one mismatched parameter takes ≈d/4 noise variances (25.5 at d=100) unless shrinkage is blockwise (1.65 at blocks of 5, d=30).
What it found
Shrinking a real estimate of d plant parameters toward the twin's prediction (James–Stein) has an exact risk d−(d−2)2E[1/(d−2+2K)], K~Poisson(λ/2): it never raises total error for d≥3, a perfect twin gives risk 2 at any d (saving 33% at d=3, 80% at d=10), and a twin as noisy as the data (λ/d=1) still saves 14–49% while using it alone saves nothing. At large d the twin is worth n+σ2/τ2 real samples (exact values 0.72–0.998 of that at d=5–100). The guarantee is aggregate only: one badly mismatched parameter among d takes about d/4 noise variances of damage (measured 2.9 at d=10, 25.5 at d=100 against 1), and blocks of 5 cap that at 1.65 (d=30) while keeping 72% of the perfect-twin saving. Stylised: Gaussian noise, orthogonal design, no robot data.
A figure from its own output
Paper, code and results
More in Digital twins & sim-to-real
- What does a twin that assumes the radar is aligned with the body get wrong about dead reckoning, and can loop-closure validation see it?A radar twin assuming the sensor is body-aligned: planar dead reckoning is exactly the true path rotated by the mount yaw (error
2 sin(e/2)·|displacement|, bounded, zero after loops, so loop-closure validation is blind), closed-form rotation fit with stdσ/√Σ|p|², but a pitched mount drifts verticallylaps·2πR sin e. - How many real rollouts does a biased digital twin save when certifying a policy?Certifying a policy with a biased digital twin: exact twin/plant cost correlation, optimal twin-to-real rollout split and speed-up (matched by simulation), bias first order but correlation second order in model error so the replayable-disturbance fraction caps the twin's value, and twin-only intervals cover ~0%.
- What does a Gaussian-clutter radar twin promise about detection, not just false alarms?What a Gaussian-clutter radar twin promises about detection: exact Pfa/Pd laws for CA- and OS-CFAR in textured clutter, OS inflated like CA, an SNR shortfall (6.3 dB at ν=2) larger than the threshold repair, and no CA/OS ranking reversal.
- How do you estimate a controller's real-world cost with a biased digital twin?Estimating a controller's real cost with a biased digital twin as a control variate: cost correlation in closed form (
0.985 → 0.472as the twin's gain error grows while its bias grows 300×), exactlyλ²under partial disturbance replay, optimal twin/real ratio√(c_rρ²/(c_t(1−ρ²)))and break-even twin price, simulated variance ratio 0.228 vs 0.225 predicted. - How fast can a deployed digital twin be caught going stale, and when is it invisible?Anytime-valid monitoring of a deployed twin: e-process on closed-loop residuals (2.3% vs 51.6% false alarms under peeking), rate = twin-transfer score gap, an invisible blind line
Δa = kΔbthat needs ditherv, and when dithering pays. - How far can DiLoCo reports be compressed?Compressing DiLoCo reports: unbiased compression multiplies the contraction (
c = 1+ω/M, stable iffαsc<2, participation isω = 1/p−1), dithered quantisation only addsΔ²/12and keeps stability, and at fixed bandwidth quantisation has an interior optimum near 1.3 bits per coordinate (~4× below 8-bit reports) while sparsification favours few full reports.
All 164 Digital twins & sim-to-real projects →
Other research topics
Proper scoring & elicitation28Effort & peer prediction9Verification games & slashing19Detection & tolerances14Markets as routers13Prediction-market design9Paying contributors8Decentralised training systems23Digital twins & sim-to-real164LLM chip design loops40Robot manufacturing loops53Ambient AI assistant46Self-replicating manufacturing34Simulation-first design64Engineered clothing45Task-specific AI accelerators40Algorithmic chip-design loops42Open-source purpose-built robots44The software-engineering loop43Adversarial human imitation41Open-source residential construction41Autonomous multi-angle capture34Sensing, imaging and 3D31Energy supply and dense energy storage39Robot societies among people31Agentic co-design of low-cost robots27Laundry-hanging robots25Machine learning on qualitative data23Robots on the building site27Civilizations & group psychology1History & human sciences1
Produced with AI assistance (Claude). Results are from the code in this repository and are simulated or stylised unless the abstract says otherwise; nothing here implies affiliation with or endorsement by any lab, researcher or company cited. MIT licensed.