Cramer-Rao bound and absolute sensitivity in chemical reaction networks
원문 초록
Chemical reaction networks (CRN) comprise an important class of models to understand biological functions such as cellular information processing, the robustness and control of metabolic pathways, circadian rhythms, and many more. However, any CRN describing a certain function does not act in isolation but is a part of a much larger network and as such is constantly subject to external changes. In [Shinar, Alon, and Feinberg. "Sensitivity and robustness in chemical reaction networks." SIAM J App Math (2009): 977-998.], the responses of CRN to changes in the linear conserved quantities, called sensitivities, were studied in and the question of how to construct absolute, i.e., basis-independent, sensitivities was raised. In this article, by applying information geometric methods, such a construction is provided. The idea is to track how concentration changes in a particular chemical propagate to changes of all concentrations within a steady state. This is encoded in the matrix of absolute sensitivities. As the main technical tool, a multivariate Cramer-Rao bound for CRN is proven, which is based on the the analogy between quasi-thermostatic steady states and the exponential family of probability distributions. This leads to a linear algebraic characterization of the matrix of absolute sensitivities for quasi-thermostatic CRN. As an example, the core module of the IDHKP-IDH glyoxylate bypass regulation system is analyzed analytically and numerically by extensive random sampling of the concentration space. The experimentally known findings for the robustness of the IDH enzyme are confirmed and a hidden symmetry at the level of distributions is revealed, providing a blueprint for the analysis of the robustness properties of CRNs.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Personalized Exercise Recommendation with Semantically-Grounded Knowledge Tracing
Reasoning or Memorization? Unreliable Results of Reinforcement Learning Due to Data Contamination
Generative Latent Kernel Modeling for Blind Motion Deblurring
A Practical Two-Stage Recipe for Mathematical LLMs: Maximizing Accuracy with SFT and Efficiency with Reinforcement Learning
The Delta Learning Hypothesis: Preference Tuning on Weak Data can Yield Strong Gains
LLMThinkBench: Towards Basic Math Reasoning and Overthinking in Large Language Models
토론
이 논문과 연결된 포럼 글이 아직 없습니다.