skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Local Identifiability Analysis, Parameter Subset Selection and Verification for a Minimal Brain PBPK Model
Physiologically-based pharmacokinetic (PBPK) modeling is important for studying drug delivery in the central nervous system, including determining antibody exposure, predicting chemical concentrations at target locations, and ensuring accurate dosages. The complexity of PBPK models, involving many variables and parameters, requires a consideration of parameter identifiability; i.e., which parameters can be uniquely determined from data for a specified set of concentrations. We introduce the use of a local sensitivity-based parameter subset selection algorithm in the context of a minimal PBPK (mPBPK) model of the brain for antibody therapeutics. This algorithm is augmented by verification techniques, based on response distributions and energy statistics, to provide a systematic and robust technique to determine identifiable parameter subsets in a PBPK model across a specified time domain of interest. The accuracy of our approach is evaluated for three key concentrations in the mPBPK model for plasma, brain interstitial fluid and brain cerebrospinal fluid. The determination of accurate identifiable parameter subsets is important for model reduction and uncertainty quantification for PBPK models.  more » « less
Award ID(s):
1745654
PAR ID:
10520977
Author(s) / Creator(s):
; ;
Publisher / Repository:
Bulletin of Mathematical Biology
Date Published:
Journal Name:
Bulletin of Mathematical Biology
Volume:
86
Issue:
2
ISSN:
0092-8240
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Dielectric elastomers are employed for a wide variety of adaptive structures. Many of these soft elastomers exhibit significant rate-dependencies in their response. Accurately quantifying this viscoelastic behavior is non-trivial and in many cases a nonlinear modeling framework is required. Fractional-order operators have been applied to modeling viscoelastic behavior for many years, and recent research has shown fractional-order methods to be effective for nonlinear frameworks. This implementation can become computationally expensive to achieve an accurate approximation of the fractional-order derivative. Accurate estimation of the elastomer’s viscoelastic behavior to quantify parameter uncertainty motivates the use of Markov Chain Monte Carlo (MCMC) methods. Since MCMC is a sampling based method, requiring many model evaluations, efficient estimation of the fractional derivative operator is crucial. In this paper, we demonstrate the effectiveness of using quadrature techniques to approximate the Riemann–Liouville definition for fractional derivatives in the context of estimating the uncertainty of a nonlinear viscoelastic model. We also demonstrate the use of parameter subset selection techniques to isolate parameters that are identifiable in the sense that they are uniquely determined by measured data. For those identifiable parameters, we employ Bayesian inference to compute posterior distributions for parameters. Finally, we propagate parameter uncertainties through the models to compute prediction intervals for quantities of interest. 
    more » « less
  2. Differential equation models are crucial to scientific processes across many disciplines, and the values of model parameters are important for analyzing the behaviour of solutions. Identifying these values is known as a parameter estimation, a type of inverse problem, which has applications in areas that include industry, finance and biomedicine. A parameter is called globally identifiable if its value can be uniquely determined from the input and output functions. Checking the global identifiability of model parameters is a useful tool when exploring the well-posedness of a given model. This problem has been intensively studied for ordinary differential equation models, where theory, several efficient algorithms and software packages have been developed. A comprehensive theory for PDEs has hitherto not been developed due to the complexity of initial and boundary conditions. Here, we provide theory and algorithms, based on differential algebra, for testing identifiability of polynomial PDE models. We showcase this approach on PDE models arising in the sciences. 
    more » « less
  3. In this paper, we develop parameter-robust numerical algorithms for Biot model and apply the algorithms in brain edema simulations. By introducing an intermediate variable, we derive a multiphysics reformulation of the Biot model. Based on the reformulation, the Biot model is viewed as a generalized Stokes subproblem combining with a reaction–diffusion subproblem. Solving the two subproblems together or separately leads to a coupled or a decoupled algorithm. We conduct extensive numerical experiments to show that the two algorithms are robust with respect to the key physical parameters. The algorithms are applied to study the brain swelling caused by abnormal accumulation of cerebrospinal fluid in injured areas. The effects of the key physical parameters on brain swelling are carefully investigated. It is observed that the permeability has the biggest influence on intracranial pressure (ICP) and tissue deformation; the Young’s modulus and the Poisson ratio do not affect the maximum value of ICP too much but have big influence on the tissue deformation and the developing speed of brain swelling. 
    more » « less
  4. This paper describes a geometric approach to parameter identifiability analysis in models of power systems dynamics. When a model of a power system is to be compared with measurements taken at discrete times, it can be interpreted as a mapping from parameter space into a data or prediction space. Generically, model mappings can be interpreted as manifolds with dimensionality equal to the number of structurally identifiable parameters. Empirically it is observed that model mappings often correspond to bounded manifolds. We propose a new definition of practical identifiability based the topological definition of a manifold with boundary. In many ways, our proposed definition extends the properties of structural identifiability. We construct numerical approximations to geodesics on the model manifold and use the results, combined with insights derived from the mathematical form of the equations, to identify combinations of practically identifiable and unidentifiable parameters. We give several examples of application to dynamic power systems models. 
    more » « less
  5. This work aims to jointly estimate the arrival rate of customers to a market and the nested logit model that forecasts hierarchical customer choices from an assortment of products. The estimation is based on censored transactional data, where lost sales are not recorded. The goal is to determine the arrival rate, customer taste coefficients, and nest dissimilarity parameters that maximize the likelihood of the observed data. The problem is formulated as a maximum likelihood estimation model that addresses two prevailing challenges in the existing literature: Estimating demand fromdata with unobservable lost salesand capturingcustomer taste heterogeneity arising from hierarchical choices. However, the model is intractable to solve or analyze due to the nonconcavity of the likelihood function in both taste coefficients and dissimilarity parameters. We characterize conditions under which the model parameters are identifiable. Our results reveal that the parameter identification is influenced by thediversity of products and nests. We also develop a sequential minorization-maximization algorithm to solve the problem, by which the problem boils down to solving a series of convex optimization models with simple structures. Then, we show the convergence of the algorithm by leveraging the structural properties of these models. We evaluate the performance of the algorithm by comparing it with widely used benchmarks, using both synthetic and real data. Our findings show that the algorithm consistently outperforms the benchmarks in maximizing in-sample likelihood and ranks among the top two in out-of-sample prediction accuracy. Moreover, our algorithm is particularly effective in estimating nested logit models with low dissimilarity parameters, yielding higher profitability compared to the benchmarks. 
    more » « less