Robust Parameter Identifiability Analysis via Column Subset Selection

05/09/2022
by   Katherine J. Pearce, et al.
0

We advocate a numerically reliable and accurate approach for practical parameter identifiability analysis: Applying column subset selection (CSS) to the sensitivity matrix, instead of computing an eigenvalue decomposition of the Fischer information matrix. Identifiability analysis via CSS has three advantages: (i) It quantifies reliability of the subsets of parameters selected as identifiable and unidentifiable. (ii) It establishes criteria for comparing the accuracy of different algorithms. (iii) The implementations are numerically more accurate and reliable than eigenvalue methods applied to the Fischer matrix, yet without an increase in computational cost. The effectiveness of the CSS methods is illustrated with extensive numerical experiments on sensitivity matrices from six physical models, as well as on adversarial synthetic matrices. Among the CSS methods, we recommend an implementation based on the strong rank-revealing QR algorithm because of its rigorous accuracy guarantees for both identifiable and non-identifiable parameters.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/14/2021

Optimizing Rayleigh quotient with symmetric constraints and their applications to perturbations of the structured polynomial eigenvalue problem

For a Hermitian matrix H ∈ℂ^n,n and symmetric matrices S_0, S_1,…,S_k ∈ℂ...
research
03/05/2022

pylspack: Parallel algorithms and data structures for sketching, column subset selection, regression and leverage scores

We present parallel algorithms and data structures for three fundamental...
research
07/25/2022

Decision-oriented two-parameter Fisher information sensitivity using symplectic decomposition

The eigenvalues and eigenvectors of the Fisher information matrix (FIM) ...
research
07/16/2021

Streaming and Distributed Algorithms for Robust Column Subset Selection

We give the first single-pass streaming algorithm for Column Subset Sele...
research
03/15/2019

Subset Selection for Matrices with Fixed Blocks

Subset selection for matrices is the task of extracting a column sub-mat...
research
06/06/2021

Deviation Maximization for Rank-Revealing QR Factorizations

In this paper we introduce a new column selection strategy, named here “...
research
09/20/2018

On constructing orthogonal generalized doubly stochastic matrices

A real quadratic matrix is generalized doubly stochastic (g.d.s.) if all...

Please sign up or login with your details

Forgot password? Click here to reset