Ill-Conditioning in Dictionary-Based Dynamic-Equation Learning: A Systems Biology Case Study
Not on the map. Why?
Abstract (arXiv)
Data-driven discovery of governing equations from time-series data provides a powerful framework for understanding complex biological systems. Library-based approaches that use sparse regression over candidate functions have shown considerable promise, but they face a critical challenge when candidate functions become strongly correlated: numerical ill-conditioning. Poor or restricted sampling, together with particular choices of candidate libraries, can produce strong multicollinearity and numerical instability. In such cases, measurement noise may lead to widely different recovered models, obscuring the true underlying dynamics and hindering accurate system identification. Although sparse regularization promotes parsimonious solutions and can partially mitigate conditioning issues, strong correlations may persist, regularization may bias the recovered models, and the regression problem may remain highly sensitive to small perturbations in the data. We present a systematic analysis of how ill-conditioning affects sparse identification of biological dynamics using benchmark models from systems biology. We show that combinations involving as few as two or three terms can already exhibit strong multicollinearity and extremely large condition numbers. We further show that orthogonal polynomial bases do not consistently resolve ill-conditioning and can perform worse than monomial libraries when the data distribution deviates from the weight function associated with the orthogonal basis. Finally, we demonstrate that when data are sampled from distributions aligned with the appropriate weight functions corresponding to the orthogonal basis, numerical conditioning improves, and orthogonal polynomial bases can yield improved model recovery accuracy across two baseline models.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 8 of its 60 references that are in the map. First posted on arXiv 11 Mar 2026.
Builds on
8 of 60 references.
References · 8
- 2018Neural Ordinary Differential Equationscited by 3,779
- 2020SINDy-PI: A Robust Algorithm for Parallel Implicit Sparse Identification of Nonlinear Dynamicscited by 125
- 2019A unified sparse optimization framework to learn parsimonious physics-informed models from datacited by 49
- 2020DLGA-PDE: Discovery of PDEs with incomplete candidate library via combination of deep learning and genetic algorithmcited by 46
- 2022Analysis of sloppiness in model simulations: unveiling parameter uncertainty when mathematical models are fitted to datacited by 4
- 2024Stabilizing black-box model selection with the inflated argmaxcited by 3
- 2025Information theory and discriminative sampling for model discoverycited by 3
- 2025SODAs: Sparse Optimization for the Discovery of Differential and Algebraic Equationscited by 1
Built on by
Citing papers per year: 2026: 2.
2 papers.