Statistical Mechanics of Dynamical System Identification
<|reference_start|>Statistical Mechanics of Dynamical System Identification: Recovering dynamical equations from observed noisy data is the central challenge of system identification. We develop a statistical mechanical approach to analyze sparse equation discovery algorithms, which typically balance data fit and parsimony through a trial-and-error selection of hyperparameters. In this framework, statistical mechanics offers tools to analyze the interplay between complexity and fitness, in analogy to that done between entropy and energy. To establish this analogy, we define the optimization procedure as a two-level Bayesian inference problem that separates variable selection from coefficient values and enables the computation of the posterior parameter distribution in closed form. A key advantage of employing statistical mechanical concepts, such as free energy and the partition function, is in the quantification of uncertainty, especially in in the low-data limit; frequently encountered in real-world applications. As the data volume increases, our approach mirrors the thermodynamic limit, leading to distinct sparsity- and noise-induced phase transitions that delineate correct from incorrect identification. This perspective of sparse equation discovery, is versatile and can be adapted to various other equation discovery algorithms.<|reference_end|>
@article{klishin2024statistical,
    title={Statistical Mechanics of Dynamical System Identification},
    author={Andrei A. Klishin, Joseph Bakarji, J. Nathan Kutz, Krithika Manohar},
    journal={arXiv preprint arXiv:2403.01723},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.01723},
    primaryClass={cond-mat.stat-mech cs.LG math.OC physics.comp-ph}
}