Structural identifiability

Last updated

In the area of system identification, a dynamical system is structurally identifiable if it is possible to infer its unknown parameters by measuring its output over time. This problem arises in many branch of applied mathematics, since dynamical systems (such as the ones described by ordinary differential equations) are commonly utilized to model physical processes and these models contain unknown parameters that are typically estimated using experimental data. [1] [2] [3]

Contents

However, in certain cases, the model structure may not permit a unique solution for this estimation problem, even when the data is continuous and free from noise. To avoid potential issues, it is recommended to verify the uniqueness of the solution in advance, prior to conducting any actual experiments. [4] The lack of structural identifiability implies that there are multiple solutions for the problem of system identification, and the impossibility of distinguishing between these solutions suggests that the system has poor forecasting power as a model. [5] On the other hand, control systems have been proposed with the goal of rendering the closed-loop system unidentifiable, decreasing its susceptibility to covert attacks targeting cyber-physical systems. [6]

Examples

Linear time-invariant system

Source [2]

Consider a linear time-invariant system with the following state-space representation:

and with initial conditions given by and . The solution of the output is

which implies that the parameters and are not structurally identifiable. For instance, the parameters generates the same output as the parameters .

Non-linear system

Source [7]

A model of a possible glucose homeostasis mechanism is given by the differential equations [8]

where (c, si, p, α, γ) are parameters of the system, and the states are the plasma glucose concentration G, the plasma insulin concentration I, and the beta-cell functional mass β. It is possible to show that the parameters p and si are not structurally identifiable: any numerical choice of parameters p and si that have the same product psi are indistinguishable. [7]

Practical identifiability

Structural identifiability is assessed by analyzing the dynamical equations of the system, and does not take into account possible noises in the measurement of the output. In contrast, practical non-identifiability also takes noises into account. [1] [9]

The notion of structurally identifiable is closely related to observability, which refers to the capacity of inferring the state of the system by measuring the trajectories of the system output. It is also closely related to data informativity, which refers to the proper selection of inputs that enables the inference of the unknown parameters. [10] [11]

The (lack of) structural identifiability is also important in the context of dynamical compensation of physiological control systems. These systems should ensure a precise dynamical response despite variations in certain parameters. [12] [13] In other words, while in the field of systems identification, unidentifiability is considered a negative property, in the context of dynamical compensation, unidentifiability becomes a desirable property. [13]

Identifiability also appears in the context of inverse optimal control. Here, one assumes that the data comes from a solution of an optimal control problem with unknown parameters in the objective function. Here, identifiability refers to the possibility of infering the parameters present in the objective function by using the measured data. [14]

Software

There exist many software that can be used for analyzing the identifiability of a system, including non-linear systems: [15]

See also

Related Research Articles

Bayesian inference is a method of statistical inference in which Bayes' theorem is used to calculate a probability of a hypothesis, given prior evidence, and update it as more information becomes available. Fundamentally, Bayesian inference uses a prior distribution to estimate posterior probabilities. Bayesian inference is an important technique in statistics, and especially in mathematical statistics. Bayesian updating is particularly important in the dynamic analysis of a sequence of data. Bayesian inference has found application in a wide range of activities, including science, engineering, philosophy, medicine, sport, and law. In the philosophy of decision theory, Bayesian inference is closely related to subjective probability, often called "Bayesian probability".

A Bayesian network is a probabilistic graphical model that represents a set of variables and their conditional dependencies via a directed acyclic graph (DAG). While it is one of several forms of causal notation, causal networks are special cases of Bayesian networks. Bayesian networks are ideal for taking an event that occurred and predicting the likelihood that any one of several possible known causes was the contributing factor. For example, a Bayesian network could represent the probabilistic relationships between diseases and symptoms. Given symptoms, the network can be used to compute the probabilities of the presence of various diseases.

<span class="mw-page-title-main">Gamma distribution</span> Probability distribution

In probability theory and statistics, the gamma distribution is a versatile two-parameter family of continuous probability distributions. The exponential distribution, Erlang distribution, and chi-squared distribution are special cases of the gamma distribution. There are two equivalent parameterizations in common use:

  1. With a shape parameter k and a scale parameter θ
  2. With a shape parameter and an inverse scale parameter ⁠⁠, called a rate parameter.

In theoretical linguistics and computational linguistics, probabilistic context free grammars (PCFGs) extend context-free grammars, similar to how hidden Markov models extend regular grammars. Each production is assigned a probability. The probability of a derivation (parse) is the product of the probabilities of the productions used in that derivation. These probabilities can be viewed as parameters of the model, and for large problems it is convenient to learn these parameters via machine learning. A probabilistic grammar's validity is constrained by context of its training dataset.

The Bayes factor is a ratio of two competing statistical models represented by their evidence, and is used to quantify the support for one model over the other. The models in question can have a common set of parameters, such as a null hypothesis and an alternative, but this is not necessary; for instance, it could also be a non-linear model compared to its linear approximation. The Bayes factor can be thought of as a Bayesian analog to the likelihood-ratio test, although it uses the integrated likelihood rather than the maximized likelihood. As such, both quantities only coincide under simple hypotheses. Also, in contrast with null hypothesis significance testing, Bayes factors support evaluation of evidence in favor of a null hypothesis, rather than only allowing the null to be rejected or not rejected.

Bayesian experimental design provides a general probability-theoretical framework from which other theories on experimental design can be derived. It is based on Bayesian inference to interpret the observations/data acquired during the experiment. This allows accounting for both any prior knowledge on the parameters to be determined as well as uncertainties in observations.

<span class="mw-page-title-main">Hill equation (biochemistry)</span> Diagram showing the proportion of a receptor bound to a ligand

In biochemistry and pharmacology, the Hill equation refers to two closely related equations that reflect the binding of ligands to macromolecules, as a function of the ligand concentration. A ligand is "a substance that forms a complex with a biomolecule to serve a biological purpose", and a macromolecule is a very large molecule, such as a protein, with a complex structure of components. Protein-ligand binding typically changes the structure of the target protein, thereby changing its function in a cell.

The Kuramoto model, first proposed by Yoshiki Kuramoto, is a mathematical model used in describing synchronization. More specifically, it is a model for the behavior of a large set of coupled oscillators. Its formulation was motivated by the behavior of systems of chemical and biological oscillators, and it has found widespread applications in areas such as neuroscience and oscillating flame dynamics. Kuramoto was quite surprised when the behavior of some physical systems, namely coupled arrays of Josephson junctions, followed his model.

Uncertainty quantification (UQ) is the science of quantitative characterization and estimation of uncertainties in both computational and real world applications. It tries to determine how likely certain outcomes are if some aspects of the system are not exactly known. An example would be to predict the acceleration of a human body in a head-on crash with another car: even if the speed was exactly known, small differences in the manufacturing of individual cars, how tightly every bolt has been tightened, etc., will lead to different results that can only be predicted in a statistical sense.

The nested sampling algorithm is a computational approach to the Bayesian statistics problems of comparing models and generating samples from posterior distributions. It was developed in 2004 by physicist John Skilling.

Approximate Bayesian computation (ABC) constitutes a class of computational methods rooted in Bayesian statistics that can be used to estimate the posterior distributions of model parameters.

<span class="mw-page-title-main">One-way quantum computer</span> Method of quantum computing

The one-way quantum computer, also known as measurement-based quantum computer (MBQC), is a method of quantum computing that first prepares an entangled resource state, usually a cluster state or graph state, then performs single qubit measurements on it. It is "one-way" because the resource state is destroyed by the measurements.

In statistics, identifiability is a property which a model must satisfy for precise inference to be possible. A model is identifiable if it is theoretically possible to learn the true values of this model's underlying parameters after obtaining an infinite number of observations from it. Mathematically, this is equivalent to saying that different values of the parameters must generate different probability distributions of the observable variables. Usually the model is identifiable only under certain technical restrictions, in which case the set of these requirements is called the identification conditions.

<span class="mw-page-title-main">Exponential family random graph models</span>

Exponential Random Graph Models (ERGMs) are a family of statistical models for analyzing data from social and other networks. Examples of networks examined using ERGM include knowledge networks, organizational networks, colleague networks, social media networks, networks of scientific development, and others.

Iterated filtering algorithms are a tool for maximum likelihood inference on partially observed dynamical systems. Stochastic perturbations to the unknown parameters are used to explore the parameter space. Applying sequential Monte Carlo to this extended model results in the selection of the parameter values that are more consistent with the data. Appropriately constructed procedures, iterating with successively diminished perturbations, converge to the maximum likelihood estimate. Iterated filtering methods have so far been used most extensively to study infectious disease transmission dynamics. Case studies include cholera, Ebola virus, influenza, malaria, HIV, pertussis, poliovirus and measles. Other areas which have been proposed to be suitable for these methods include ecological dynamics and finance.

Identifiability analysis is a group of methods found in mathematical statistics that are used to determine how well the parameters of a model are estimated by the quantity and quality of experimental data. Therefore, these methods explore not only identifiability of a model, but also the relation of the model to particular experimental data or, more generally, the data collection process.

Multispecies Coalescent Process is a stochastic process model that describes the genealogical relationships for a sample of DNA sequences taken from several species. It represents the application of coalescent theory to the case of multiple species. The multispecies coalescent results in cases where the relationships among species for an individual gene can differ from the broader history of the species. It has important implications for the theory and practice of phylogenetics and for understanding genome evolution.

The quantum Fisher information is a central quantity in quantum metrology and is the quantum analogue of the classical Fisher information. It is one of the central quantities used to qualify the utility of an input state, especially in Mach–Zehnder interferometer-based phase or parameter estimation. It is shown that the quantum Fisher information can also be a sensitive probe of a quantum phase transition. The quantum Fisher information of a state with respect to the observable is defined as

Quantum artificial life is the application of quantum algorithms with the ability to simulate biological behavior. Quantum computers offer many potential improvements to processes performed on classical computers, including machine learning and artificial intelligence. Artificial intelligence applications are often inspired by the idea of mimicking human brains through closely related biomimicry. This has been implemented to a certain extent on classical computers, but quantum computers offer many advantages in the simulation of artificial life. Artificial life and artificial intelligence are extremely similar, with minor differences; the goal of studying artificial life is to understand living beings better, while the goal of artificial intelligence is to create intelligent beings.

In quantum computing, the variational quantum eigensolver (VQE) is a quantum algorithm for quantum chemistry, quantum simulations and optimization problems. It is a hybrid algorithm that uses both classical computers and quantum computers to find the ground state of a given physical system. Given a guess or ansatz, the quantum processor calculates the expectation value of the system with respect to an observable, often the Hamiltonian, and a classical optimizer is used to improve the guess. The algorithm is based on the variational method of quantum mechanics.

References

  1. 1 2 Miao, Hongyu; Xia, Xiaohua; Perelson, Alan S.; Wu, Hulin (2011). "On Identifiability of Nonlinear ODE Models and Applications in Viral Dynamics". SIAM Review. 53 (1): 3–39. doi:10.1137/090757009. ISSN   0036-1445. PMC   3140286 . PMID   21785515. (Erratum:  doi:10.1137/23M1568958)
  2. 1 2 Raue, A.; Karlsson, J.; Saccomani, M. P.; Jirstrand, M.; Timmer, J. (2014-05-15). "Comparison of approaches for parameter identifiability analysis of biological systems". Bioinformatics. 30 (10): 1440–1448. doi: 10.1093/bioinformatics/btu006 . ISSN   1367-4803. PMID   24463185. S2CID   10052322.
  3. ↑ Wensing, Patrick M.; Niemeyer, Günter; Slotine, Jean-Jacques E. (2024). "A geometric characterization of observability in inertial parameter identification". The International Journal of Robotics Research. arXiv: 1711.03896 . doi:10.1177/02783649241258215. ISSN   0278-3649.
  4. ↑ Villaverde, Alejandro F; Pathirana, Dilan; Fröhlich, Fabian; Hasenauer, Jan; Banga, Julio R (2022-01-17). "A protocol for dynamic model calibration". Briefings in Bioinformatics. 23 (1). doi:10.1093/bib/bbab387. ISSN   1467-5463. PMC   8769694 . PMID   34619769.
  5. ↑ Fiacchini, Mirko; Alamir, Mazen (2021). "The Ockham's razor applied to COVID-19 model fitting French data". Annual Reviews in Control. 51: 500–510. doi:10.1016/j.arcontrol.2021.01.002. PMC   7846253 . PMID   33551664.
  6. ↑ Mao, Xiangyu; He, Jianping (2023). "Unidentifiability of System Dynamics: Conditions and Controller Design". arXiv: 2308.15493 [eess.SY].
  7. 1 2 Villaverde, Alejandro F. (2019-01-01). "Observability and Structural Identifiability of Nonlinear Biological Systems". Complexity. 2019: 1–12. arXiv: 1812.04525 . doi: 10.1155/2019/8497093 . ISSN   1076-2787.
  8. ↑ Karin, Omer; Swisa, Avital; Glaser, Benjamin; Dor, Yuval; Alon, Uri (2016). "Dynamical compensation in physiological circuits". Molecular Systems Biology. 12 (11): 886. doi:10.15252/msb.20167216. ISSN   1744-4292. PMC   5147051 . PMID   27875241.
  9. ↑ Raue, A.; Kreutz, C.; Maiwald, T.; Bachmann, J.; Schilling, M.; Klingmüller, U.; Timmer, J. (2009-08-01). "Structural and practical identifiability analysis of partially observed dynamical models by exploiting the profile likelihood". Bioinformatics. 25 (15): 1923–1929. doi: 10.1093/bioinformatics/btp358 . ISSN   1460-2059. PMID   19505944.
  10. ↑ Van Waarde, Henk J.; Eising, Jaap; Camlibel, M. Kanat; Trentelman, Harry L. (2023). "The Informativity Approach: To Data-Driven Analysis and Control". IEEE Control Systems. 43 (6): 32–66. arXiv: 2302.10488 . doi:10.1109/MCS.2023.3310305. ISSN   1066-033X. S2CID   257050367.
  11. ↑ Gevers, Michel; Bazanella, Alexandre S.; Coutinho, Daniel F.; Dasgupta, Soura (2013). "Identifiability and excitation of polynomial systems". 52nd IEEE Conference on Decision and Control. Firenze: IEEE. pp. 4278–4283. doi:10.1109/CDC.2013.6760547. ISBN   978-1-4673-5717-3. S2CID   7796419.
  12. ↑ Karin, Omer; Swisa, Avital; Glaser, Benjamin; Dor, Yuval; Alon, Uri (2016). "Dynamical compensation in physiological circuits". Molecular Systems Biology. 12 (11): 886. doi:10.15252/msb.20167216. ISSN   1744-4292. PMC   5147051 . PMID   27875241.
  13. 1 2 Sontag, Eduardo D. (2017-04-06). Komarova, Natalia L. (ed.). "Dynamic compensation, parameter identifiability, and equivariances". PLOS Computational Biology. 13 (4): e1005447. Bibcode:2017PLSCB..13E5447S. doi: 10.1371/journal.pcbi.1005447 . ISSN   1553-7358. PMC   5398758 . PMID   28384175.
  14. ↑ Zhang, Han; Ringh, Axel (2024). "Inverse optimal control for averaged cost per stage linear quadratic regulators". Systems & Control Letters. 183: 105658. arXiv: 2305.15332 . doi:10.1016/j.sysconle.2023.105658.
  15. ↑ Barreiro, Xabier Rey; Villaverde, Alejandro F. (2023-01-31). "Benchmarking tools for a priori identifiability analysis". Bioinformatics. 39 (2): btad065. doi:10.1093/bioinformatics/btad065. ISSN   1367-4811. PMC   9913045 . PMID   36721336.
  16. ↑ Díaz-Seoane, Sandra; Rey-Barreiro, Xabier; Villaverde, Alejandro F. (2022-07-15). "STRIKE-GOLDD 4.0: user-friendly, efficient analysis of structural identifiability and observability". arXiv: 2207.07346 [eess.SY].
  17. ↑ Dong, Ruiwen; Goodbrake, Christian; Harrington, Heather A.; Pogudin, Gleb (2023-03-31). "Differential Elimination for Dynamical Models via Projections with Applications to Structural Identifiability". SIAM Journal on Applied Algebra and Geometry. 7 (1): 194–235. arXiv: 2111.00991 . doi:10.1137/22M1469067. ISSN   2470-6566. S2CID   245650629.
  18. ↑ Borisov, Ivan; Metelkin, Evgeny (2020). Beard, Daniel A. (ed.). "Confidence intervals by constrained optimization—An algorithm and software package for practical identifiability analysis in systems biology". PLOS Computational Biology. 16 (12): e1008495. doi: 10.1371/journal.pcbi.1008495 . ISSN   1553-7358. PMC   7785248 . PMID   33347435.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.