pith. sign in

arxiv: 2502.04867 · v4 · submitted 2025-02-07 · 📊 stat.AP

Invariant Image Reparameterisation: Bridging Symbolic and Numerical Methods for Identifiability Analysis and Model Reduction

Oliver J. Maclaren , Ruanui Nicholson , Joel A. Trent , Joshua Rottenberry , Matthew Simpson This is my paper

Pith reviewed 2026-05-23 04:21 UTC · model grok-4.3

classification 📊 stat.AP
keywords invariant image reparameterisationparameter identifiabilitymodel reductionnumerical Jacobianstructural identifiabilitypractical identifiabilityrepressilatorprofile-wise analysis
0
0 comments X

The pith

When observables depend only on fixed linear combinations after a componentwise transformation, one numerical Jacobian determines the reduced reparameterisation space.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper shows that structural and practical non-identifiability in mathematical models can be addressed by invariant image reparameterisation. This method replaces symbolic reparameterisation conditions with numerical derivative calculations at a single reference point. It applies when a one-to-one componentwise transformation makes observable behaviour depend only on fixed linear combinations of the transformed parameters. The approach provides a basis-independent representation of controlling parameter combinations and enables uncertainty quantification. Demonstrations include normal models with Poisson limits and the repressilator gene regulation model.

Core claim

When a one-to-one componentwise transformation makes observable behaviour depend only on fixed linear combinations of the transformed parameters, a single numerical Jacobian determines the associated lower-dimensional reparameterisation space. This includes models depending on monomial combinations of the original parameters. A first-order invariance condition distinguishes minimal from non-minimal but exact reductions via the invariant part of the local null space. In structurally identifiable but practically weakly informed settings, the same calculations separate strongly and weakly informed parameter combinations.

What carries the argument

The invariant image, a reduced, basis-independent representation of the parameter combinations controlling observable model behaviour.

If this is right

  • The SVD gives a default orthonormal basis ordered by local identifiability.
  • Sparse monomial bases are often more interpretable.
  • The calculations separate strongly and weakly informed parameter combinations in structurally identifiable but practically weakly informed settings.
  • Treating the coordinates as interest parameters in Profile-Wise Analysis gives likelihood-based uncertainty quantification.
  • The method applies to parameterised normal models with Poisson-limit, extended Poisson-limit, and non-limit cases, and to the repressilator nonlinear differential equation model.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The single-point Jacobian approach could speed identifiability analysis for high-dimensional models by reducing reliance on full symbolic computation.
  • The first-order invariance condition might be extended to higher orders to handle a broader class of reductions.
  • Applying profile-wise analysis to the invariant image coordinates could guide experimental design toward weakly informed parameter combinations in biological systems.
  • Hybrid pipelines combining this numerical step with existing symbolic tools could handle models outside the exact componentwise transformation class.

Load-bearing premise

The model admits a one-to-one componentwise transformation such that observable behaviour depends only on fixed linear combinations of the transformed parameters.

What would settle it

For a model satisfying the transformation property, if the symbolic reparameterisation conditions do not match the span obtained from the single numerical Jacobian at a reference point, the claim is falsified.

Figures

Figures reproduced from arXiv: 2502.04867 by Joel A. Trent, Joshua Rottenberry, Matthew Simpson, Oliver J. Maclaren, Ruanui Nicholson.

Figure 1
Figure 1. Figure 1: The basic decomposition of the auxiliary mapping into an identifiable reparameteri [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Implementation of parameter space linearisation using an initial componentwise [PITH_FULL_IMAGE:figures/full_fig_p007_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Poisson-limit example analysis in original (top row) and reparameterised (bottom [PITH_FULL_IMAGE:figures/full_fig_p014_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Non-limit (approximate Binomial) example analysis in original (top row) and repa [PITH_FULL_IMAGE:figures/full_fig_p015_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Michaelis-Menten example analysis in original (top row) and reparameterised (bot [PITH_FULL_IMAGE:figures/full_fig_p017_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Reparameterised Michaelis-Menten limit example: (Left) joint contour in the [PITH_FULL_IMAGE:figures/full_fig_p018_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Flow in heterogeneous media example analysis in original (top two rows) and repa [PITH_FULL_IMAGE:figures/full_fig_p020_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Profile-wise prediction intervals for the mean in the flow in heterogeneous media [PITH_FULL_IMAGE:figures/full_fig_p021_8.png] view at source ↗
read the original abstract

Structural and practical parameter non-identifiability issues are common when mathematical models are used to interpret data. Such issues motivate model reparameterisation and reduction methods. Here, we consider Invariant Image Reparameterisation (IIR), which asks when symbolic reparameterisation conditions can be replaced by numerical derivative calculations at a single reference point. The central object is the invariant image: a reduced, basis-independent representation of the parameter combinations controlling observable model behaviour. We show that when a one-to-one componentwise transformation makes observable behaviour depend only on fixed linear combinations of the transformed parameters, a single numerical Jacobian determines the associated lower-dimensional reparameterisation space. This includes models depending on monomial combinations of the original parameters. We also give a first-order invariance condition that distinguishes minimal from non-minimal but exact reductions via the invariant part of the local null space. In structurally identifiable but practically weakly informed settings, the same calculations separate strongly and weakly informed parameter combinations. The invariant image admits multiple coordinate representations: the SVD gives a default orthonormal basis ordered by local identifiability, while sparse monomial bases are often more interpretable. Treating these coordinates as interest parameters in Profile-Wise Analysis gives likelihood-based uncertainty quantification. We demonstrate the method on parameterised normal models with Poisson-limit, extended Poisson-limit, and non-limit cases, and on the repressilator, a nonlinear differential equation model of gene regulation. A Julia implementation of IIR, with these and further examples, is available at https://github.com/omaclaren/reparam.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 1 minor

Summary. The manuscript introduces Invariant Image Reparameterisation (IIR) for structural and practical identifiability analysis and model reduction. It claims that when a one-to-one componentwise transformation exists such that observable model behaviour depends only on fixed linear combinations of the transformed parameters (including monomial cases), a single numerical Jacobian at one reference point determines the associated lower-dimensional reparameterisation space (the 'invariant image'). The method also provides a first-order invariance condition to distinguish minimal reductions and separates strongly/weakly informed combinations; coordinates are obtained via SVD or sparse monomial bases and used in Profile-Wise Analysis. Demonstrations are given for parameterised normal models (Poisson-limit, extended, non-limit) and the repressilator nonlinear ODE model, with a Julia implementation provided.

Significance. If the central claims hold, IIR supplies a practical numerical bridge between symbolic reparameterisation conditions and derivative-based calculations, reducing reliance on full symbolic manipulation for complex models. The open-source Julia code, multiple worked examples, and integration with likelihood-based uncertainty quantification via profile-wise analysis constitute concrete strengths that would make the contribution useful for applied statisticians and modellers working with ODE systems.

major comments (2)
  1. [Abstract] Abstract (central result paragraph): the claim that 'a single numerical Jacobian determines the associated lower-dimensional reparameterisation space' is load-bearing, yet the manuscript provides no explicit derivation showing that the Jacobian at one point recovers the full invariant image when the componentwise transformation condition holds; without this step the numerical construction remains first-order and pointwise.
  2. [Repressilator demonstration] Repressilator demonstration: the first-order invariance condition that distinguishes minimal from non-minimal reductions via 'the invariant part of the local null space' is asserted to work for the nonlinear ODE, but no verification is given that this null-space component is independent of the chosen reference point, leaving open the possibility that the reported reduction is only locally valid.
minor comments (1)
  1. [Implementation and code availability] The GitHub repository is cited but the manuscript does not list the principal exported functions or the exact command sequence used to reproduce the repressilator results, which would aid immediate use.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their constructive comments and positive assessment of the manuscript's potential utility. We respond point-by-point to the major comments below.

read point-by-point responses

  1. Referee: [Abstract] Abstract (central result paragraph): the claim that 'a single numerical Jacobian determines the associated lower-dimensional reparameterisation space' is load-bearing, yet the manuscript provides no explicit derivation showing that the Jacobian at one point recovers the full invariant image when the componentwise transformation condition holds; without this step the numerical construction remains first-order and pointwise.

    Authors: The central result follows from the assumption of a one-to-one componentwise transformation under which observables depend on fixed linear combinations of the transformed parameters. In this setting the tangent space to the invariant image is spanned by the image of the Jacobian of the observable map (composed with the transformation derivative) and is independent of the evaluation point because the linear coefficients are constant. This is derived in Section 2. To address the request for greater explicitness we will insert a step-by-step derivation in the revised manuscript clarifying why a single reference point recovers the full space. revision: yes

  2. Referee: [Repressilator demonstration] Repressilator demonstration: the first-order invariance condition that distinguishes minimal from non-minimal reductions via 'the invariant part of the local null space' is asserted to work for the nonlinear ODE, but no verification is given that this null-space component is independent of the chosen reference point, leaving open the possibility that the reported reduction is only locally valid.

    Authors: The invariance condition is a first-order consequence of the global monomial-combination structure satisfied by the repressilator. To confirm that the invariant component of the local null space is independent of the reference point we will add, in the revised manuscript, explicit numerical checks at multiple distinct reference points within the model's parameter domain and report the resulting consistency. revision: yes

Circularity Check

0 steps flagged

No significant circularity; central claim is an independent numerical-symbolic bridge

full rationale

The abstract and provided text present the core result as a shown implication: existence of a one-to-one componentwise transformation (making observables depend on fixed linear combinations) implies that a single numerical Jacobian suffices to determine the reparameterisation space. This is not shown to reduce by construction to its inputs, nor is any parameter fitted and then relabeled a prediction. No self-citations appear in the load-bearing steps, no uniqueness theorem is imported from prior author work, and no ansatz is smuggled. The method is described as first-order and pointwise but is not equated to the symbolic condition it replaces. The derivation chain therefore remains self-contained; the numerical Jacobian step is independent of the transformation condition it is claimed to replace.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Abstract-only review yields limited visibility into free parameters or invented entities; the central result rests on the existence of the required transformation.

axioms (1)
  • domain assumption Existence of a one-to-one componentwise transformation making observable behaviour depend only on fixed linear combinations of transformed parameters
    Invoked as the condition under which the single-Jacobian result holds (abstract).

pith-pipeline@v0.9.0 · 5829 in / 1173 out tokens · 29913 ms · 2026-05-23T04:21:53.071153+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

74 extracted references · 74 canonical work pages · 2 internal anchors

  1. [1]

    Aitkin , Statistical inference: an integrated Bayesian/likelihood approach , CRC Press, 2010

    M. Aitkin , Statistical inference: an integrated Bayesian/likelihood approach , CRC Press, 2010

    work page 2010

  2. [2]

    Aitkin and M

    M. Aitkin and M. Stasinopoulos , Likelihood analysis of a binomial sample size problem , Contributions to probability and statistics: Essays in honor of I ngram O lkin, (1989), pp. 496--499

    work page 1989

  3. [3]

    G. I. Barenblatt , Scaling , Cambridge University Press, 2003

    work page 2003

  4. [4]

    Bear , Dynamics of fluids in porous media , American Elsevier Publishing Company, 1972

    J. Bear , Dynamics of fluids in porous media , American Elsevier Publishing Company, 1972

    work page 1972

  5. [5]

    Bellu, M

    G. Bellu, M. P. Saccomani, S. Audoly, and L. D'Angi\' o , DAISY : A new software tool to test global identifiability of biological and physiological systems , Computer Methods and Programs in Biomedicine, 88 (2007), pp. 52--61

    work page 2007

  6. [6]

    R. Bird, W. Stewart, and E. Lightfoot , Transport phenomena , no. v. 1 in Transport Phenomena, Wiley, 2006

    work page 2006

  7. [7]

    A. F. Brouwer and M. C. Eisenberg , The underlying connections between identifiability, active subspaces, and parameter space dimension reduction , arXiv preprint arXiv:1802.05641, (2018)

    work page internal anchor Pith review Pith/arXiv arXiv 2018

  8. [8]

    K. S. Brown, C. C. Hill, G. A. Calero, C. R. Myers, K. H. Lee, J. P. Sethna, and R. A. Cerione , The statistical mechanics of complex signaling networks: nerve growth factor signalling , Physical Biology, 1 (2004), p. 184

    work page 2004

  9. [9]

    K. S. Brown and J. P. Sethna , Statistical mechanical approaches to models with many poorly known parameters , Physical Review E, 68 (2003), p. 021904

    work page 2003

  10. [10]

    A. P. Browning, D. J. Warne, K. Burrage, R. E. Baker, and M. J. Simpson , Identifiability analysis for stochastic differential equation models in systems biology , Journal of the Royal Society Interface, 17 (2020), p. 20200652

    work page 2020

  11. [11]

    Buckingham , On physically similar systems; illustrations of the use of dimensional equations , Physical review, 4 (1914), p

    E. Buckingham , On physically similar systems; illustrations of the use of dimensional equations , Physical review, 4 (1914), p. 345

    work page 1914

  12. [12]

    Carslaw and J

    H. Carslaw and J. Jaeger , Conduction of heat in solids , Oxford science publications, Clarendon Press, 1959

    work page 1959

  13. [13]

    E. A. Catchpole and B. J. Morgan , Detecting parameter redundancy , Biometrika, 84 (1997), pp. 187--196

    work page 1997

  14. [14]

    E. A. Catchpole, B. J. T. Morgan, and S. N. Freeman , Estimation in parameter-redundant models , Biometrika, 85 (1998), pp. 462--468

    work page 1998

  15. [15]

    M. J. Chappell and R. N. Gunn , A procedure for generating locally identifiable reparameterisations of unidentifiable non-linear systems by the similarity transform approach , Mathematical Biosciences, 148 (1998), pp. 21--41

    work page 1998

  16. [16]

    Chi s , J

    O. Chi s , J. R. Banga, and E. Balsa-Canto , Structural identifiability of systems biology models: a critical comparison of methods , Plos One, 6 (2011), p. e27755

    work page 2011

  17. [17]

    Chi s , A

    O. Chi s , A. F. Villaverde, J. R. Banga, and E. Balsa-Canto , On the relationship between sloppiness and identifiability , Mathematical Biosciences, 282 (2016), pp. 147--161

    work page 2016

  18. [18]

    Cole , Parameter redundancy and identifiability , CRC Press, 2020

    D. Cole , Parameter redundancy and identifiability , CRC Press, 2020

    work page 2020

  19. [19]

    D. J. Cole, B. J. T. Morgan, and D. M. Titterington , Determining the parameteric structure of models , Mathematical Biosciences, 228 (2010), pp. 16--30

    work page 2010

  20. [20]

    P. G. Constantine, C. Kent, and T. Bui-Thanh , Accelerating markov chain monte carlo with active subspaces , SIAM Journal on Scientific Computing, 38 (2016), pp. A2779--A2805

    work page 2016

  21. [21]

    D. R. Cox , Principles of statistical interence , Cambridge University Press, 2006

    work page 2006

  22. [22]

    D. R. Cox and N. Reid , Parameter orthogonality and approximate conditional inference , Journal of the Royal Statistical Society: Series B (Methodological), 49 (1987), pp. 1--18

    work page 1987

  23. [23]

    Crank , The mathematics of diffusion , Oxford university press, 1979

    J. Crank , The mathematics of diffusion , Oxford university press, 1979

    work page 1979

  24. [24]

    T. Cui, J. Martin, Y. M. Marzouk, A. Solonen, and A. Spantini , Likelihood-informed dimension reduction for nonlinear inverse problems , Inverse Problems, 30 (2014), p. 1100998

    work page 2014

  25. [25]

    Cui and X

    T. Cui and X. Tong , A unified performance analysis of likelihood-informed subspace methods , Bernoulli, 28 (2022), pp. 2788--2815

    work page 2022

  26. [26]

    Díaz-Seoane, X

    S. Díaz-Seoane, X. Rey Barreiro, and A. F. Villaverde , STRIKE-GOLDD 4.0: User-friendly, efficient analysis of structural identifiability and observability , Bioinformatics, 39 (2022), p. btac748

    work page 2022

  27. [27]

    M. C. Eisenberg and M. A. Hayashi , Determining identifiable parameter combinations using subset profiling , Mathematical biosciences, 256 (2014), pp. 116--126

    work page 2014

  28. [28]

    C. R. Elevitch and C. R. Johnson Jr , A procedure for ranking parameter importance for estimation in predictive mechanistic models , Ecological Modelling, 419 (2020), p. 108948

    work page 2020

  29. [29]

    N. D. Evans and M. J. Chappell , Extensions to a procedure for generating locally identifiable reparameterisations of unidentifiable systems , Mathematical Biosciences, 168 (2000), pp. 137--159

    work page 2000

  30. [30]

    C. R. Fitts , Groundwater science , Elsevier, 2002

    work page 2002

  31. [31]

    Gelman , Parameterization and bayesian modeling , Journal of the American Statistical Association, 99 (2004), pp

    A. Gelman , Parameterization and bayesian modeling , Journal of the American Statistical Association, 99 (2004), pp. 537--545

    work page 2004

  32. [32]

    Griewank and A

    A. Griewank and A. Walther , Evaluating derivatives: principles and techniques of algorithmic differentiation , SIAM, 2008

    work page 2008

  33. [33]

    R. N. Gutenkunst, J. J. Waterfall, F. P. Casey, K. S. Brown, C. R. Myers, and J. P. Sethna , Universally sloppy parameter sensitivities in systems biology models , PLOS Computational Biology, 3 (2007), p. e189

    work page 2007

  34. [34]

    D. F. Hendry and M. S. Morgan , The foundations of econometric analysis , Cambridge University Press, 1997

    work page 1997

  35. [35]

    K. E. Hines, T. R. Middendorf, and R. W. Aldrich , Determination of parameter identifiability in nonlinear biophysical models: A B ayesian approach , Journal of General Physiology, 143 (2014), p. 401

    work page 2014

  36. [36]

    Holmberg , On the practical identifiability of microbial growth models incorporating michaelis-menten type nonlinearities , Mathematical Biosciences, 62 (1982), pp

    A. Holmberg , On the practical identifiability of microbial growth models incorporating michaelis-menten type nonlinearities , Mathematical Biosciences, 62 (1982), pp. 23--43

    work page 1982

  37. [37]

    Horn and R

    F. Horn and R. Jackson , General mass action kinetics , Archive for Rational Mechanics and Analysis, 47 (1972), pp. 81--116

    work page 1972

  38. [38]

    Howell, G

    P. Howell, G. Kozyreff, and J. Ockendon , Applied Solid Mechanics , Cambridge University Press, 2008

    work page 2008

  39. [39]

    K. A. Johnson and R. S. Goody , The original michaelis constant: Translation of the 1913 michaelis–menten paper , Biochemistry, 50 (2011), pp. 8264--8269

    work page 1913

  40. [40]

    Kot , Elements of Mathematical Ecology , Cambridge University Press, 2001

    M. Kot , Elements of Mathematical Ecology , Cambridge University Press, 2001

    work page 2001

  41. [41]

    W. B. Krantz , Scaling Analysis in Modeling Transport and Reaction Processes , Wiley Interscience, 2007

    work page 2007

  42. [42]

    Kreutz, A

    C. Kreutz, A. Raue, D. Kaschek, and J. Timmer , Profile likelihood in systems biology , The FEBS Journal, 280 (2013), pp. 2564--2571

    work page 2013

  43. [43]

    Kreutz, A

    C. Kreutz, A. Raue, and J. Timmer , Likelihood-based observability analysis and confidence intervals for predictions of dynamics models , BMC Systems Biology, 6 (2012)

    work page 2012

  44. [44]

    Lawrie and J

    J. Lawrie and J. Hearne , Reducing model complexity via output sensitivity , Ecological Modelling, 207 (2007), pp. 137--144

    work page 2007

  45. [45]

    F. W. Lawvere and R. Rosebrugh , Sets for mathematics , Cambridge University Press, 2003

    work page 2003

  46. [46]

    Lee , Introduction to smooth manifolds , Graduate Texts in Mathematics, Springer New York, 2013

    J. Lee , Introduction to smooth manifolds , Graduate Texts in Mathematics, Springer New York, 2013

    work page 2013

  47. [47]

    T. S. Ligon, F. Fr\" o lich, O. Chi s , J. R. Banga, E. Balsa-Canto, and J. Hasenauer , Genssi 2.0: multi-experimental structural identifiability analysis of sbml models , Bioinformatics, 34 (2018), pp. 1421--1423

    work page 2018

  48. [48]

    O. J. Maclaren and R. Nicholson , What can be estimated? identifiability, estimability, causal inference and ill-posed inverse problems , arxiv preprint, 1904.02826 (2019)

    work page arXiv 1904

  49. [49]

    O. J. Maclaren and R. Nicholson , Models, identifiability, and estimability in causal inference , in Workshop on the Neglected Assumptions in Causal Inference (NACI) at the 38th International Conference on Machine Learning, 2021, 2021

    work page 2021

  50. [50]

    J. R. Magnus and H. Neudecker , Matrix differential calculus with applications in statistics and econometrics , John Wiley & Sons, 2019

    work page 2019

  51. [51]

    Maiwald, H

    T. Maiwald, H. Hass, B. Steiert, J. Vanlier, R. Engesser, A. Raue, F. Kipkeew, H. H. Bock, D. Kaschek, C. Kreutz, and J. Timmer , Driving the model to its limit: Profile likelihood based model reduction , Plos One, 11 (2016), p. e0162366

    work page 2016

  52. [52]

    Meshkat, M

    N. Meshkat, M. Eisenberg, and J. J. DiStefano III , An algorithm for finding globally identifiable parameter combinations of nonlinear ode models using G röbner bases , Mathematical Biosciences, 222 (2009), pp. 61--72

    work page 2009

  53. [53]

    Meshkat, S

    N. Meshkat, S. Sullivant, and M. Eisenberg , Identifiability results for several classes of linear compartment models , Bulletin of Mathematical Biology, 77 (2015), p. 1620–1651

    work page 2015

  54. [54]

    Monod , The growth of bacterial cultures , Annual Review of Microbiology, 3 (1949), pp

    J. Monod , The growth of bacterial cultures , Annual Review of Microbiology, 3 (1949), pp. 371--394

    work page 1949

  55. [55]

    G. M. Monsalve-Bravo, B. A. J. Lawson, C. Drovandi, K. Burrage, K. S. Brown, C. M. Baker, S. A. Vollert, K. Mengersen, E. McDonald-Madden, and M. P. Adams , Analysis of sloppiness in model simulations: unveiling parameter uncertainty when mathematical models are fitted to data , Science Advances, 8 (2022), p. eabm5952

    work page 2022

  56. [56]

    G. M. Monsalve-Bravo, B. A. J. Lawson, C. Drovandi, K. Burrage, K. S. Brown, C. M. Baker, S. A. Vollert, K. Mengersen, E. McDonald-Madden, and M. P. Adams , Analysis of sloppiness in model simulations: Unveiling parameter uncertainty when mathematical models are fitted to data , Science Advances, 8 (2022)

    work page 2022

  57. [57]

    R. J. Murphy, O. J. Maclaren, and M. J. Simpson , Implementing measurement error models with mechanistic mathematical models in a likelihood-based framework for estimation, identifiability analysis and prediction in the life sciences , Journal of the Royal Society Interface, 21 (2024), p. 20230402

    work page 2024

  58. [58]

    Murray , Mathematical biology I: An introduction , Springer, 2002

    J. Murray , Mathematical biology I: An introduction , Springer, 2002

    work page 2002

  59. [59]

    Olkin, A

    I. Olkin, A. J. Petkau, and J. V. Zidek , A comparison of n estimators for the binomial distribution , Journal of the American Statistical Association, 76 (1981), pp. 637--642

    work page 1981

  60. [60]

    Pace and A

    L. Pace and A. Salvan , Principles of statistical inference from a neo-Fisherian perspective , World Scientific, 1997

    work page 1997

  61. [61]

    Pawitan , In all likelihood: statistical modelling and inference using likelihood , Oxford University Press, 2001

    Y. Pawitan , In all likelihood: statistical modelling and inference using likelihood , Oxford University Press, 2001

    work page 2001

  62. [62]

    A. Raue, J. Karlsson, M. P. Saccomani, M. Jirstrand, and J. Timmer , Structural and practical identifiability analysis of partially observed dynamical models by exploiting the profile likelihood , Bioinformatics, 30 (2014), pp. 1440--1448

    work page 2014

  63. [63]

    Forward-Mode Automatic Differentiation in Julia

    J. Revels, M. Lubin, and T. Papamarkou , Forward-mode automatic differentiation in J ulia , arXiv preprint arXiv:1607.07892, (2016)

    work page internal anchor Pith review Pith/arXiv arXiv 2016

  64. [64]

    K. R. Rushton , Groundwater hydrology: conceptual and computational models , John Wiley & Sons, 2004

    work page 2004

  65. [65]

    M. J. Simpson, R. E. Baker, S. T. Vittadello, and O. J. Maclaren , Parameter identifiability analysis for spatiotemporal models of cell invasion , Journal of the Royal Society Interface, 17 (2020)

    work page 2020

  66. [66]

    M. J. Simpson and O. J. Maclaren , Profile-wise analysis: A profile likelihood-based workflow for identifiability analysis, estimation, and prediction with mechanistic mathematical models , PLOS Computational Biology, 19 (2023), p. e1011515

    work page 2023

  67. [67]

    M. J. Simpson and O. J. Maclaren , Making predictions from nonidentifiable models. , Bulletin of Mathematical Biology, 86 (2024), p. 80

    work page 2024

  68. [68]

    Stewart , Matrix perturbation theory , Computer Science and Scientific Computing/Academic Press, Inc, (1990)

    G. Stewart , Matrix perturbation theory , Computer Science and Scientific Computing/Academic Press, Inc, (1990)

    work page 1990

  69. [69]

    Trent , Likelihood-based computational analysis and uncertainty quantification for mechanistic models , master's thesis, University of Auckland, 2024

    J. Trent , Likelihood-based computational analysis and uncertainty quantification for mechanistic models , master's thesis, University of Auckland, 2024

    work page 2024

  70. [70]

    A. F. Villaverde, E. Raimúndez, J. Hasenauer, and J. R. Banga , Assessment of prediction uncertainty quantification methods in systems biology , IEEE/ACM Transactions on Computational Biology and Bioinformatics, 30 (2023), pp. 1725--1736

    work page 2023

  71. [71]

    S. A. Vollert, C. Drovandi, G. M. Monsalve-Bravo, and M. P. Adams , Strategic model reduction by analysing model sloppiness: A case study in coral calcification , Environmental Modelling & Software, 159 (2023), p. 105578

    work page 2023

  72. [72]

    Wieland, A

    F.-G. Wieland, A. L. Hauber, M. Rosenblatt, T. C, and J. Timmer , On structural and practical identifiability. , Current Opinion in Systems Biology, 25 (2021)

    work page 2021

  73. [73]

    Barndorff-Nielsen , Information and exponential families: in statistical theory , John Wiley & Sons, 2014

    O. Barndorff-Nielsen , Information and exponential families: in statistical theory , John Wiley & Sons, 2014

    work page 2014

  74. [74]

    write newline

    " write newline "" before.all 'output.state := FUNCTION fin.entry add.period write newline FUNCTION new.block output.state before.all = 'skip after.block 'output.state := if FUNCTION not #0 #1 if FUNCTION and 'skip pop #0 if FUNCTION or pop #1 'skip if FUNCTION new.block.checka empty 'skip 'new.block if FUNCTION field.or.null duplicate empty pop "" 'skip ...

    work page