mlsanityData to 7 Oct 2026

The Value of Mechanistic Priors in Sequential Decision Making

arXiv 2605.10018 ↗First posted 11 May 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Hybrid mechanistic models, physical priors with learned residuals, promise to reduce the data required for good decisions, but have no computable criterion to test this. We characterize the value of mechanistic priors in sequential decision-making within both asymptotic and burn-in regimes. To formalize this, we introduce the mechanistic information of a model: the mutual information between the model's recommended policy hatπ and the true optimal policy π^*, bounded via a centered, occupancy-weighted bias. In the asymptotic regime (large N), matched bounds reveal that Bayesian regret scales with the residual entropy Hmech, delivering a theoretical sample complexity reduction of H(μ)/Hmech compared to an uninformed baseline. We further provide a computable pre-trial model certificate. Complementarily, in the clinically relevant burn-in regime (small N), we establish a lower bound on the penalty incurred by confidently wrong priors. We demonstrate both the asymptotic and burn-in bounds on an illustrative in-silico 5-fluorouracil (5-FU) chemotherapy plant whose structure follows published FOLFOX pharmacokinetics. The hybrid prior reduces cumulative regret by 1.79× relative to standard body-surface-area dosing and 1.85× relative to an uninformed learner, and remains below both under every calibration bias tested. Finally, we show that priors sensitive to distribution shift can lose half of their mechanistic information under a small distribution shift, motivating physically grounded priors for safety-critical applications.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 16 of its 46 references that are in the map. First posted on arXiv 11 May 2026.

Builds on

16 of 46 references.

References · 16

  1. 2018Neural Ordinary Differential Equationscited by 3,733
  2. 2022Do As I Can, Not As I Say: Grounding Language in Robotic Affordancescited by 2,302
  3. 2019Provably Efficient Reinforcement Learning with Linear Function Approximationcited by 514
  4. 2017A Tutorial on Thompson Samplingcited by 420
  5. 2017On Kernelized Multi-armed Banditscited by 348
  6. 2020Universal Differential Equations for Scientific Machine Learningcited by 345
  7. 2014On the Complexity of Best Arm Identification in Multi-Armed Bandit Modelscited by 280
  8. 2013Learning to Optimize Via Posterior Samplingcited by 253
  9. 2014An Information-Theoretic Analysis of Thompson Samplingcited by 178
  10. 2017On the Sample Complexity of the Linear Quadratic Regulatorcited by 151
  11. 2020Augmenting Physical Models with Deep Networks for Complex Dynamics Forecastingcited by 93
  12. 2021Meta-Thompson Samplingcited by 62
4 more
  1. 2013Thompson Sampling for Complex Bandit Problemscited by 43
  2. 2022LISA: Learning Interpretable Skill Abstractions from Languagecited by 30
  3. 2015On the Prior Sensitivity of Thompson Samplingcited by 14
  4. 2024On Bits and Bandits: Quantifying the Regret-Information Trade-offcited by 3

Built on by

Not cited yet.