"Applied Science, Faculty of"@en .
"Chemical and Biological Engineering, Department of"@en .
"DSpace"@en .
"UBCV"@en .
"Jang, Seunghee Shelly"@en .
"2009-04-17T16:37:31Z"@en .
"2009"@en .
"Master of Applied Science - MASc"@en .
"University of British Columbia"@en .
"The dynamic behavior of many chemical and biological processes is defined by a set of nonlinear differential equations that constitute a model. These models typically contain parameters that need to be estimated using experimental data. A number of factors such as sampling intervals, number of measurements and noise level characterize the quality of data, and have a direct effect on the quality of estimated parameters. The quality of experimental data is rather poor in many processes due to instrument limitations or other physical and economical constraints. Traditional parameter estimation methods either yield inaccurate results or are not applicable when applied to such data. Despite this, it is common practice to apply them on a merged data set obtained by pooling together data from multiple experiments. Considering the difficulties in maintaining consistent experimental conditions, straightforward integration of multiple data sets will not provide the best estimates of parameters.\n\nIn this thesis, a new approach to estimate parameters of nonlinear dynamic models using multiple experimental data is proposed. The approach uses Bayesian inference, and sequentially updates prior probability distribution of parameters for systematic integration of multiple data sets. An expression for posterior probability distribution of parameters conditional on all experimental data sets is derived. This expression is often analytically intractable; therefore two instances of numerical approximation method called Markov Chain Monte Carlo - Metropolis-Hastings (MH) algorithm and Gibbs sampler (GS) - are implemented. The two algorithms form inner and outer levels of iterations, where the MH algorithm is used in the inner level to estimate conditional probability distributions of individual parameters, which is used in the outer level in conjunction with the GS to estimate joint probability distributions of the parameters. \n\nThe proposed method is applied to three nonlinear biological processes to estimate probability distribution of parameters with a small number of irregular samples. The approximated probability distribution provides a straightforward tool to calculate confidence interval of parameter estimates and is robust to initial guess of parameter value. Correlation among model parameters, quality of each model, and the approach taken to optimize the high cost of MCMC sampling are discussed."@en .
"https://circle.library.ubc.ca/rest/handle/2429/7294?expand=metadata"@en .
"2607184 bytes"@en .
"application/pdf"@en .
"Parameter Estimation of Stochastic Nonlinear Dynamic Processes using Multiple Experimental Data Sets with Biological Applications by Seunghee Shelly Jang Chemical Engineering B.S., The University of Washington, 2007 Mathematics & Chemistry Minor, The University of Washington, 2007 A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER OF APPLIED SCIENCE in The Faculty of Graduate Studies (Chemical and Biological Engineering) THE UNIVERSITY OF BRITISH COLUMBIA (Vancouver) April, 2009 c Seunghee Shelly Jang 2009 \u000CAbstract The dynamic behavior of many chemical and biological processes is defined by a set of nonlinear differential equations that constitute a model. These models typically contain parameters that need to be estimated using experimental data. A number of factors such as sampling intervals, number of measurements and noise level characterize the quality of data, and have a direct effect on the quality of estimated parameters. The quality of experimental data is rather poor in many processes due to instrument limitations or other physical and economical constraints. Traditional parameter estimation methods either yield inaccurate results or are not applicable when applied to such data. Despite this, it is common practice to apply them on a merged data set obtained by pooling together data from multiple experiments. Considering the difficulties in maintaining consistent experimental conditions, straightforward integration of multiple data sets will not provide the best estimates of parameters. In this thesis, a new approach to estimate parameters of nonlinear dynamic models using multiple experimental data is proposed. The approach uses Bayesian inference, and sequentially updates prior probability distribution of parameters for systematic integration of multiple data sets. An expression for posterior probability distribution of parameters conditional on all experimental data sets is derived. This expression is often analytically intractable; therefore two instances of numerical approximation method called Markov Chain Monte Carlo - MetropolisHastings (MH) algorithm and Gibbs sampler (GS) - are implemented. The two algorithms form inner and outer levels of iterations, where the MH algorithm is used in the inner level to estimate conditional probability distributions of individual parameters, which is used in the outer level in conjunction with the GS to estimate joint probability distributions of the parameters. ii \u000CAbstract The proposed method is applied to three nonlinear biological processes to estimate probability distribution of parameters with a small number of irregular samples. The approximated probability distribution provides a straightforward tool to calculate confidence interval of parameter estimates and is robust to initial guess of parameter value. Correlation among model parameters, quality of each model, and the approach taken to optimize the high cost of MCMC sampling are discussed. iii \u000CTable of Contents Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ii Table of Contents . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iv List of Tables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vii List of Figures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . viii Acknowledgements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xi Dedication . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xiii 1 Introduction to Modeling Nonlinear Dynamical Systems . . . . . . . . . . . . . 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.1 Modeling Framework 1.2 Previous Work 1.3 Motivation for a Bayesian Approach to Parameter Estimation . . . . . . . . . 7 1.4 Motivational Examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 1.4.1 Batch Fermentation Reaction . . . . . . . . . . . . . . . . . . . . . . 10 1.4.2 Feed-Forward Loop : Genetic Regulation Network . . . . . . . . . . . 11 1.4.3 JAK-STAT : Signal Transduction Pathway . . . . . . . . . . . . . . . 16 Thesis Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20 1.5.1 . . . . . . . . . . . . . . . . . . . . . . . . . . 21 2 Parameter Estimation for Ordinary Differential Equation models . . . . . . . . 23 1.5 2.1 Problem Formulation Probability Density Function . . . . . . . . . . . . . . . . . . . . . . . . . . . 23 iv \u000CTable of Contents 2.2 Maximum Likelihood Estimator . . . . . . . . . . . . . . . . . . . . . . . . . 25 2.3 Bayesian Parameter Estimation . . . . . . . . . . . . . . . . . . . . . . . . . 27 3 Multiple Experimental Data Sets for Parameter Estimation . . . . . . . . . . . . 31 3.1 Merging Multiple Experimental Data Sets . . . . . . . . . . . . . . . . . . . . 31 3.2 A priori and Timeline Shift . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 4 Markov Chain Monte Carlo (MCMC) for Approximating Probability Distribution Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42 4.1 Markov Chain Monte Carlo (MCMC) . . . . . . . . . . . . . . . . . . . . . . 42 4.2 Metropolis-Hastings Algorithm: Inner Level Estimation . . . . . . . . . . . . 43 4.2.1 Proposal distribution I : Gaussian distribution . . . . . . . . . . . . . . 48 4.2.2 Proposal distribution II : a priori distribution . . . . . . . . . . . . . . 49 Gibbs Sampler : Outer Level Estimation . . . . . . . . . . . . . . . . . . . . . 50 4.3.1 . . . . . . . . . . . . . . . . . . . . . . . 54 Sequential Metropolis-Hastings and Gibbs Algorithm . . . . . . . . . . . . . . 55 5 Case Studies . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 58 4.3 4.4 5.1 Multi-phase Gibbs sampler Batch Fermentation Reaction . . . . . . . . . . . . . . . . . . . . . . . . . . 58 5.1.1 Single Parameter Estimation . . . . . . . . . . . . . . . . . . . . . . . 58 5.1.2 Multiple Parameter Estimation . . . . . . . . . . . . . . . . . . . . . 64 5.2 Genetic Regulatory Network : Feed Forward Loop . . . . . . . . . . . . . . . 70 5.3 JAK-STAT Signal Transduction Pathway Model : Partially Observable States . 79 5.3.1 Comparison With Literature Parameter Values . . . . . . . . . . . . . 81 5.3.2 Quantitative Parameter Estimability and Sensitivity Analysis: Comparison with PDF . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 86 Effect of Initial Conditions on the Algorithm\u00E2\u0080\u0099s Performance . . . . . . 90 6 Conclusions and Future Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93 5.3.3 6.1 Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93 v \u000CTable of Contents 6.2 Future Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95 6.2.1 Further Investigation of the Algorithm . . . . . . . . . . . . . . . . . 95 6.2.2 Experiment Design . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95 Bibliography . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97 Appendices A Experimental Data Simulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 103 B Derivation of Likelihood Function for Nonlinear Dynamic Process . . . . . . . . 108 vi \u000CList of Tables 1.1 The true and normalized parameter values used to simulate the batch fermentation reaction data, and to implement the estimation algorithm . . . . . . . . . . 3.1 13 JAK-STAT signal pathway model parameter estimation results using six simulated data . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 5.1 Expected mean and 95% Highest Probability Density intervals of YXS . . . . . 62 5.2 Expected mean and 95% Highest Probability Density intervals of batch fermentation reaction model parameters . . . . . . . . . . . . . . . . . . . . . . . . . 5.3 62 The maximum a posteriori, the expected mean, the normalized error and the 95% confidence interval calculated from marginal distribution corresponding to each process parameter of batch fermentation reaction model. . . . . . . . . . . 5.4 The parameter vector value used in order to simulate the time series data of FFL genetic regulatory network. 5.5 74 . . . . . . . . . . . . . . . . . . . . . . . . . . . 74 The maximum a posteriori, the expected mean and the 95% confidence interval calculated from each marginal distribution corresponding to the process parameter of FFL genetic regulatory network model. . . . . . . . . . . . . . . . . . . 5.6 78 The maximum a posteriori, the expected mean and the 95% confidence interval calculated from each marginal distribution corresponding to the process parameter of JAK-STAT signal transduction pathway model. . . . . . . . . . . . . . . 5.7 83 Likelihood Values and Sum of Squared Errors calculated for different estimates of JAK-STAT process parameters . . . . . . . . . . . . . . . . . . . . . . . . . 85 vii \u000CList of Figures 1.1 Simulated batch fermentation reaction data . . . . . . . . . . . . . . . . . . . 13 1.2 Feed-Forward Loop genetic regulatory network . . . . . . . . . . . . . . . . . 13 1.3 FFL coherent type 1 experimental data : GCN4-LEU3-ILV5 in S. cerevisiae . . 15 1.4 JAK-STAT signal transduction pathway diagram . . . . . . . . . . . . . . . . . 17 1.5 JAK-STAT signal transduction pathway experimental data . . . . . . . . . . . 19 1.6 Illustration of parameter estimation framework . . . . . . . . . . . . . . . . . 22 2.1 Binomial distribution of a series of coin toss . . . . . . . . . . . . . . . . . . . 24 3.1 Three independent experimental data sets with overlapping sampling time . . . 32 3.2 Comprehensive estimation result of JAK-STAT signal transduction pathway model parameters using six simulated data . . . . . . . . . . . . . . . . . . . . . . . 3.3 34 Bayesian estimation of a1 probability distribution using six independent experimental data sets (D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) and the comprehensive estimation result obtained assuming Gaussian distribution . . . . . . . . . . . . . . . . . . . . . . . . . . 3.4 36 Two different probability distributions with identical expected mean and standard deviation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 3.5 Timeline shift of multiple experimental analysis . . . . . . . . . . . . . . . . . 40 3.6 Projected behavior of evolving posterior distributions obtained from the sequen- 4.1 tial Bayesian estimation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41 An example of iterative computation in Metropolis-Hastings algorithm 46 . . . . viii \u000CList of Figures 4.2 An example of histograms generated using Metropolis-Hastings algorithm and Simulated Annealing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47 4.3 Flowchart of Gibbs Sampler . . . . . . . . . . . . . . . . . . . . . . . . . . . 56 4.4 Flowchart of Metropolis-Hastings Algorithm . . . . . . . . . . . . . . . . . . 57 5.1 Evolving a posteriori distributions of YXS . . . . . . . . . . . . . . . . . . . . 60 5.2 Normalized posterior distributions of the parameter vector \u00CE\u00B8 of batch fermentation reaction model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5.3 63 Normalized uniform prior distribution of YXS and the corresponding posterior distributions, p(YXS | D1, \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 , \u00C2\u00B5m , ks , kP\u00E2\u0080\u00B2 , YP\u00E2\u0080\u00B2 X ) . . . . . . . . . . . . . . . 65 5.4 Gibbs sequence of \u00C2\u00B5m and approximated marginal distribution . . . . . . . . . 67 5.5 Moving average of Gibbs sequence and approximated marginal distributions obtained at various stages of the sequence . . . . . . . . . . . . . . . . . . . . . 5.6 67 Approximated posterior distributions of batch fermentation reaction model using Gibbs sequence Phase I . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 69 5.7 Approximated joint distributions of batch fermentation reaction process parameters 71 5.8 Simulated FFL genetic regulatory network data . . . . . . . . . . . . . . . . . 5.9 Gibbs sequences and approximated marginal distributions of FFL genetic regu- 74 latory network process parameters . . . . . . . . . . . . . . . . . . . . . . . . 76 5.10 Approximated joint distributions of FFL genetic regulatory network model . . . 77 5.11 Experimental and predicted gene expression profile . . . . . . . . . . . . . . . 78 5.12 JAK-STAT : Experimental data and the predicted output trajectory using the parameter estimation reported in previous literature . . . . . . . . . . . . . . . 80 5.13 Joint Probability Distributions of pairs of JAK-STAT signal transduction pathway model parameters . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 82 5.14 Approximated marginal distribution of JAK-STAT signal transduction pathway process parameters . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 82 5.15 Concentration profile of x1 (t) derived from experimental data . . . . . . . . . 83 ix \u000CList of Figures 5.16 Experimental data and predicted output variables of JAK-STAT signal transduction pathway model using three different estimated parameters . . . . . . . . . 85 5.17 Sensitivity analysis of JAK-STAT signal transduction pathway model . . . . . . 88 5.18 Approximated marginal distribution of JAK-STAT signal transduction pathway model parameters . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 88 5.19 Moving standard deviations of four different Markov chains and overall standard deviation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 92 A.1 Simulated data sets of Batch fermentation reaction process . . . . . . . . . . . 105 A.2 Simulated data sets of Feed-Forward Loop genetic regulatory network process . 106 A.3 Simulated data sets of JAK-STAT signal transduction pathway process . . . . . 107 x \u000CAcknowledgements My sincerest gratitude is due toward my supervisor, Dr. R. Bhushan Gopaluni, who guided and inspired me, and provided me with an incredible opportunity. His support and generosity during my first step in graduate school sparked my interest and opened up my eyes to the wonderful potential that awaits me. And most of all, he has shown me how to carry myself with grace and kindness through this challenging process. I would like to acknowledge Dr. Ryozo Nagamune for demonstrating the wit and senses required to keep up my courage. He was never hesitant to provide me with his insights when I was struggling with my direction. Dr. Amos Ben-Zvi from University of Alberta deserves a special mention for preparing me for some of the difficult obstacles that I will face in the future. Dr. Ezra Kwok and Dr. James Piret have been the most gracious members of my research committee and I am very thankful for their valuable advice. I am also grateful for the members of the UBC Control reading group, Drs. Oishi, Nagamune, Gopaluni, and Sassani and their students for their feedback, insights and advice. I would also like to thank the faculty and staff of Chemical and Biological Engineering Department for making up such a great environment for me to learn and grow, and for being my mentors. My appreciation goes out to my friends - Jackie, for being the truest friend a person can hope for; Roger, Nancy and Kathy for showing me that I\u00E2\u0080\u0099m never alone and being there for all the personal hardships; Adriana for always being the calming presence in my life; Denis for somehow convincing me to join his team; Brenda, Shelly and David, who make up my fondest memories of Vancouver; and Stefan for all the challenges and support that made me stronger everyday. xi \u000CAcknowledgements Lastly, I would like to express my deepest appreciation and respect for my family. I thank my grandparents for raising me with great discipline and integrity so that I can be true to my work. All the privileges and opportunities I\u00E2\u0080\u0099ve been given in this life would not be possible without them. Words cannot express the respect I have for my parents, for setting the standard of strength and brilliance in all that I must accomplish. Mom, I would count myself lucky if I can match the kind of passion and dedication you have for your work. Dad, whatever path I choose, I know I have your support and I am ever grateful for it. A big thank you to my big brother, Wonsik, and his wife, Sarah, for paving the way for their little sister. And lastly, I would like to thank my uncle, aunt and cousins, Grace and Carol, for being the home away from home. xii \u000CDedication To my parents. xiii \u000CChapter 1 Introduction to Modeling Nonlinear Dynamical Systems A variety of aspects of parameter estimation for nonlinear stochastic dynamical systems are defined in this chapter. Major components of dynamic modeling such as model structure, model identification, and model validation are discussed. The success of model identification and validation steps is largely influenced by the quality of experimental data, and hence aspects of data quality that have adverse effect on estimation accuracy are examined. Some commonly used modeling frameworks are presented. This is followed by a description of three nonlinear biological systems that are used throughout this thesis to illustrate the proposed algorithms. The chapter concludes with an overview of the thesis. 1.1 Modeling Framework The dynamic behavior of many chemical and biological processes is defined by a set of mathematical equations that constitute a model. A typical model consists of four major components viz., model structure, independent variables, dependent variables and model parameters. The structure refers to the way variables and model parameters are related to each other by mathematical operators. The independent variables, often called inputs, are those that affect other process variables but are not affected by them. Some input variables can be directly manipulated and are used to control the output of the system. The dependent variables can further be classified into states and outputs. The state variables are required to describe the internal dynamics of a process, however, they are usually not directly measured. The output variables are directly 1 \u000CChapter 1 measured and are generally functions of state and input variables. These output variables can be predicted given the model structure, measurements of input variables, and model parameters. The model parameters are usually constants that relate independent and dependent variables through the model structure. Once these major components - model structure, independent variables, dependent variables and model parameters - are defined (or estimated), the model can be used to infer the dynamic behavior of the corresponding process, and to develop algorithms for control, fault detection and process monitoring. Modeling of dynamic processes is an iterative approach that consists of i) identifying independent and dependent variables, ii) selecting a proper model structure, iii) estimating model parameters using experimental data, and iv) validating and revising the structure and model parameters based on certain model quality criteria. It is straightforward to identify the independent and dependent variables based on process information. The structure of a model can either be determined through physical laws, such as mass and energy balance equations, or through empirical approximations based on basis functions [35]. The emphasis in this thesis is on structures based on physical laws as they are very common in biotechnology and biomedical industries. Such structures provide intuition into the process behavior and its various measurements, and give physical meaning to its parameters. For instance, a simple batch fermentation reaction can be described by the following coupled ordinary differential equations, dCX dt dCS dt \u00C2\u00B5 m CS CX \u00E2\u0088\u0092 k d CX , k s + CS \u00C2\u00B5 m CS = \u00E2\u0088\u0092 CX , (ks + CS )Yxs = (1.1) (1.2) C\u00CC\u0082X = CX + \u00CE\u00B7X , (1.3) C\u00CC\u0082Y (1.4) = CY + \u00CE\u00B7Y . where CX and CS denote the concentration of biomass and substrate respectively, C\u00CC\u0082X and C\u00CC\u0082Y denote measured values of the concentrations corrupted with noise sequences \u00CE\u00B7X and \u00CE\u00B7Y . The structure of the model refers to the manner in which these two concentrations are related through 2 \u000CChapter 1 the above equations. This model is based on mass balance equations and hence provides physical meaning to various constants in it. The model parameters, \u00CE\u00B8 = [\u00C2\u00B5m , kd , ks , Yxs ], are the constants. They are estimated using experimental measurements of biomass and substrate concentrations. Once the parameters are estimated, the process can be quantitatively represented with the values of the parameters. In this case, the parameters are meaningful physical quantities in that \u00C2\u00B5m is the maximum growth rate of biomass, kd is the decay rate of biomass, ks is the Monod constant which is equal to the substrate concentration at which the biomass growth rate reaches half of its maximum growth rate, (\u00C2\u00B5m ), and Yxs is the stoichiometric yield coefficient of biomass to substrate. Once a model structure is in place, the parameters are chosen such that the model predictions are, in some sense, close to the actual process measurements. The accuracy of the estimated parameters depends on the quality of the process measurements. A detailed description of various aspects of the data that affect the parameter estimation are described in a latter section. Once the parameters are estimated, the model is tested for its accuracy against a new set of process measurements to verify the validity of the model on measurements not used in the estimation step. This step is called model validation. If a model fails the validation step, experiments are repeated to collect more data. Mathematical models can be broadly classified as linear or nonlinear, static or dynamic, deterministic or stochastic. A linear model is one where the variables of the system are related through linear differential equations. Within most biological and chemical processes, there are complex bio/chemical reactions that cannot be expressed using linear differential equations, thus many models developed for such processes are nonlinear in either variables or parameters and sometimes both. A dynamic model accounts for the rate of change of process variables while a static model assumes that the variables are constant. A deterministic model assumes that if multiple experiments were conducted with identical initial conditions and experimental variables, the observed time series of output variables will always be the same. However, this is 3 \u000CChapter 1 not the case in reality due to process and measurement noise. Multiple observations made of a system under identical experimental conditions vary with some probability distribution. Thus, a stochastic view that considers the process variables and parameters as random variables with probabilistic qualities is more appropriate for biological systems. Furthermore, such stochastic models are suitable for applications where the parameters are time varying [5]. The fermentation model described earlier is a stochastic nonlinear model with constant parameters. The focus of this thesis is on estimating model parameters for a generic nonlinear stochastic model. 1.2 Previous Work Modeling has been an active area of research for over a century and it is beyond the scope of this thesis to provide an exhaustive literature survey. However, the research in this area can be broadly classified into two areas - linear and nonlinear modeling. A number of textbooks have been written on the topic of linear modeling [12, 16, 35, 50], and many theoretical results on the quality of estimated parameters have been derived. Similarly, a number of approaches have been developed for modeling nonlinear dynamic processes [4, 19, 31, 35, 45, 46]. The most popular among them are black-box techniques such as neural network models, state space techniques such as hidden-Markov models, and continuous time modeling techniques such as ordinary differential equation (ODE) models. While an exhaustive literature survey of these techniques is beyond the scope of this thesis, applications of these approaches are briefly discussed below. The neural network models use the learning principles of mammalian brain. The relationship between input, output, and state variables is developed by training the neural network models with large amounts of process data. Some notable works using neural networks for model identification include Bohr et al.\u00E2\u0080\u0099s work on predicting 3-D structure of protein backbones [7]; Cai et al.\u00E2\u0080\u0099s work on predicting the content of protein 2-D structures [9]; Fukushima\u00E2\u0080\u0099s proposal on synaptic network between neurons [18]; Gupta and Achenie identified metabolic pathways, complex genetic disease and toxicology analysis through neural network modeling [25]; Laursena et al. 4 \u000CChapter 1 used gray-box model approach to identify the complex behavior of bacteria after induction [34]; Maraziotis and colleagues\u00E2\u0080\u0099 development of complex causal relationships among genes from microarray experimental data is based on novel neural fuzzy recurrent network [37]; and Zhang\u00E2\u0080\u0099s work on developing mechanistic model for batch process is based on using stacked neural network models [56]. Complex nonlinear relationships between various process variables can be implicitly detected using neural network models. However, there are a few drawbacks to using neural network models. Neural network models are known to require heavy computational effort, prone to over-fitting, require large amounts of data, and the developed models suffer from the disadvantages of black-box models [53]. Hidden-Markov models (HMM) were initially developed in the field of speech recognition in 1970s and later became popular in other disciplines because of their characteristically rich mathematical structure [43]. Major components of a HMM are states, observations, transition probabilities corresponding to each state, emission probabilities and initial state distribution. HMM is often portrayed with a diagram, in which the states are denoted with network of nodes and the transition and emission probabilities are denoted with arrows connecting the nodes. If some initial probability distribution of state is given, HMM can compute the probability distribution function of output variables. Since initial probability distribution of the states can be specified by the user, it is possible to incorporate prior knowledge regarding the probability of states when using HMM. Other advantages include ease of interpretability (because of the intuitive nodal network) and its modular nature, making it easy to combine several models to create a larger one [28]. The disadvantages are that the computational cost is very large and that there are several strong assumptions made regarding the process, such as Gaussian distribution of process variables, and Markov property of emission and transition probabilities. A number of applications of HMM framework can be found in computational biology field. Some notable works include Kimmel and Shamir\u00E2\u0080\u0099s development of a novel HMM for identifying haplotype and genotype generation [29]; Wu and Xie proposed a HMM of transcription factor binding sites and cisregulatory modules identification [54]; Siepel and Haussler combined phylogenetic model with 5 \u000CChapter 1 HMMs to explore the genome substitution that occurs through evolution [48]; Krogh et al.\u00E2\u0080\u0099s statistical model and multiple sequence alignment of protein families and protein domains is also based on HMM framework [32]. Ordinary differential equation (ODE) models are used in a wide range of scientific disciplines to describe biochemical systems, fluid mechanics, financial markets, etc. A generic ODE model can be represented by the following equations, dx(t) = f(x(t), u(t), \u00CE\u00B8) + v(t) dt (1.5) y(t) = h(x(t), u(t), \u00CE\u00B8) + \u00CE\u00B7(t) (1.6) where x(t) is the vector of state variables, u(t) is the vector of exogenous input variables, \u00CE\u00B8 is the vector of model parameters and y(t) is the vector of output variables. The process noise term, v(t), and measurement noise term, \u00CE\u00B7(t), are included in the model to account for the stochastic nature of the process; without these terms, the model is deterministic. The exact values of these noise variables are unknown, however, assumptions can be made regarding the probability distribution of these variables (e.g. \u00CE\u00B7 is usually assumed to be Normally distributed with zero mean and some variance \u00CF\u0083 2\u00CE\u00B7 , such that \u00CE\u00B7 \u00E2\u0088\u00BC N (0, \u00CF\u00832\u00CE\u00B7 )). f and h are vectors of functions that form the model structure and they determine whether the model is linear or nonlinear. If the model equations are nonlinear, it is often impossible to obtain analytical expressions for the states and outputs, and one has to approximate the model equations through numerical analysis. The ODE models are typically developed using physical laws, and hence various parameters in these models have physical significance. In this thesis, the focus is on estimating model parameters in a stochastic nonlinear ODE model described above. The parameters can be easily estimated through nonlinear least squares if there is no noise in the state dynamic equations. However, in presence of state noise, parameter estimation is a difficult problem. There are a few maximum likelihood approaches, that are based on expectation maximization, to estimate parameters in presence of state noise. These approaches require large amounts of data for good estimates. 6 \u000CChapter 1 Moreover, maximum likelihood approaches do not automatically provide confidence intervals on the estimated parameters. In this thesis, a Bayesian approach is proposed to estimate parameters in a set of stochastic nonlinear differential equations. The proposed approach does not require large data sets, it can easily handle multi-rate measurements, and provides confidence intervals on estimated parameters. This approach is also extended to handle data from multiple experiments. 1.3 Motivation for a Bayesian Approach to Parameter Estimation Once the structure of a model is defined, the parameters are estimated using the data obtained from the process. The quality of the data will therefore influence the quality of the estimated parameters. In this thesis, the goal is to develop a Bayesian approach to parameter estimation that accounts for three important features of data viz., noise, scarcity and irregular samples. Most experimental data are corrupt with measurement and process noise, making it difficult to obtain the precise values of model parameters. Thus, the estimated values contain some uncertainty, which is usually quantified with a confidence interval. The size of the confidence intervals of estimated parameters is an indication of the effectiveness of the proposed model in accurately representing the process. The accuracy of estimation and its reliability are affected by the level of noise present in the experimental data, and therefore a robust method to obtain as much information as possible from the noisy data is required. If the estimated parameters suffer from large levels of uncertainty (e.g. wide confidence interval) then the model is deemed to be a poor representation of the process. Therefore, in such a case, the proposed model needs to be examined for revision. This is done so that the revised model yields estimated parameters, using a new set of experimental data, with smaller level of uncertainty. Thus, the iterative process of proposing 7 \u000CChapter 1 a model - estimating the model parameters and revising the model - is required to obtain a model that is able to capture the key components of the process and is not excessively complex. The frequency of process measurements, in many biological processes, is determined by various physical and economical constraints. These constraints often lead to data sets that are too small and contain irregular samples. The parameters estimated from such data sets usually have large confidence intervals. Therefore, point estimates of the parameters obtained through methods such as maximum likelihood and nonlinear least squares, have to be qualified with a description of their confidence intervals. Various parameter estimation methods are adept at addressing poor quality of data - sparsity, irregularity and large amount of noise. For instance, Expectation Maximization (EM) algorithm, an instance of maximum likelihood estimation (MLE), has been shown to handle irregular process data well enough to obtain reliable parameter estimates. However, it still requires a large number of samples in order to overcome the loss in information due to irregularity in sampling intervals. It is known that MLE (or EM) yields asymptotically unbiased and minimum variance parameter estimates as the number of data points reaches infinity. However, MLE is prone to biased estimation when not enough data is provided. An alternative approach to address the problem of sample sparsity is to conduct multiple experiments and pool the data points together to create a large data set. Though this approach seems straightforward, it is difficult to maintain consistent process conditions during different experimental runs. Hence, when a nonlinear least-squares or MLE approach is applied on such pooled data the differences in experimental conditions are obfuscated. There are other challenges presented by least-squares (LS) approaches and frequentist methods, which refer to statistical point of view where probability of a given random event is obtained through large amount of observations. When estimating process parameters, the accuracy of the estimation can be improved by exploiting all of the available information. Aside from the 8 \u000CChapter 1 obvious choice of experimental data, a priori information can also be included in this information database. A priori information may refer to any knowledge regarding the parameters that is available before conducting experiments, such as constraints on the parameter value available through physical laws and other means. Unfortunately, in the currently used techniques for parameter estimation, these types of information are applied in a somewhat limited fashion. For instance, one can provide the upper and lower bounds of the parameter value to an optimization problem that solves nonlinear least-squares or MLE. However, if there\u00E2\u0080\u0099s a probabilistic a priori information, such that x is normally distributed with some mean \u00C2\u00B5 and variance \u00CF\u0083 2 , it is difficult to incorporate this information into LS or frequentist estimation methods. Lastly, for computational convenience, these methods make an assumption that state variables and parameter vector have a fixed time invariant distribution (e.g. Gaussian). However, it has been shown that this assumption may be inaccurate in many nonlinear processes. In the work by Chen et al., simulated posterior distribution of a CSTR concentration was shown to exhibit time-variant behavior with multimodal, asymmetric distribution [13]. Bayesian approaches are naturally suited to handle not only a priori information but also scarce, irregularly sampled noisy data. In this thesis, a parameter estimation method that resolves the above mentioned challenges by incorporating a priori information is developed. The proposed algorithms are illustrated through three ordinary differential equation models: i) a batch fermentation reaction, ii) a genetic regulatory network and iii) a signal transduction pathway. These models are referred to throughout this work to demonstrate the proposed algorithm and the theories behind it. 9 \u000CChapter 1 1.4 Motivational Examples 1.4.1 Batch Fermentation Reaction First example is the simplified version of Michaelis-Menten reaction model in a batch reactor. Following set of coupled ordinary differential equations is used to describe the uninhibited growth of biomass and increasing concentration of its by-products (e.g. alcohol), as well as depletion of substrate present in a batch fermentor. dCX (t) = \u00C2\u00B5CX (t) + v1 (t), dt \u00C2\u00B5 dCS (t) = \u00E2\u0088\u0092 CX (t) + v2 (t), dt YXS dCP (t) = \u00C2\u00B5YP X CX (t) + v3 (t). dt (1.7) (1.8) (1.9) The state variables CX , CS and CP are concentrations of biomass, substrate and by-products, respectively. The stochastic process noise is indicated by v1 , v2 and v3 . The specific growth rate of biomass, \u00C2\u00B5, is defined using Michaelis-Menten kinetics as follows. \u00C2\u00B5m CS (t) \u00C2\u00B5 = ks + CS (t) \u0012 \u0013 CP (t) 1\u00E2\u0088\u0092 kP (1.10) The model is nonlinear with respect to the five parameters: (i) \u00C2\u00B5m , upper limit to the growth rate of biomass, (ii) ks , Monod constant, (iii) kp , product inhibition term, (iv) YXS , yield ratio of biomass concentration to the substrate uptake and (v) YP X , yield ratio of by-product to biomass. Thus, the model parameter vector is defined as \u00CE\u00B8 = [\u00C2\u00B5m , ks , kp , YXS , YP X ]. The details of simulation data sets for this stochastic dynamic system are provided in Appendix A. For a numerically stable implementation of the algorithm, two of the parameters kp and YP X were normalized using the following convention and the normalized values are shown in 10 \u000CChapter 1 Table 1.1 along with their pre-normalized values. kP\u00E2\u0080\u00B2 = 10/kp , YP\u00E2\u0080\u00B2 X = YP X /100. (1.11) (1.12) A total of six independently simulated data sets (D = {D1 , D2 , D3 , D4 , D5 , D6 }), each data set consisting of N = 15 irregularly sampled data points spanning the time interval of [0, 24] hours, are collected. A single set of experimental data is shown in Figure 1.1. The true trajectories of the state variables, without measurement noise, are indicated with solid lines and the measured sample points are indicated with x\u00E2\u0080\u0099s. It is ensured that the sampling intervals are irregular and the measurements are corrupt with noise. 1.4.2 Feed-Forward Loop : Genetic Regulation Network Gene expression is the foundation of regulatory biological functions [1]. Within cells, transcription factors are triggered by various environmental changes or self-serving signals. Through the recent development in molecular biology technology, it has become possible to closely study the dynamic behavior of networks formed by a group of transcription factors present in living organisms. Recently, a number of predominantly recurring wiring patterns within genetic networks, called network motifs, were identified in bacterium Escherichia coli and yeast Saccharomyces cerevisiae. Their observed abundance is assumed to be due to their significant role in the transcription network. One of the identified motifs is called the Feed-Forward Loop (FFL) [36, 47] and it shows similarities in its regulation action to a feed-forward action in process control. Two different regulating actions are present in a general form of FFL, where they involve two transcription factors, X and Y, and a gene Z. The first action is regulation of Y expression by X and the second action is regulation of Z expression by both X and Y. A graphical illustration of FFL mechanism is shown in Figure 1.2, where SX and SY are the inducers of X and Y, respectively. The inducers are either saturating stimulus or absent, and they trigger the transcription 11 \u000CChapter 1 factors. There are three transcription interactions (denoted with the three arrows in the figure) which can either act as an activator or a repressor, resulting in eight possible configurations of FFL. The following set of coupled ordinary differential equations is the general form of FFL. dY (t) = \u00E2\u0088\u0092\u00CE\u00B1y Y (t) + \u00CE\u00B2y f (X(t), KXY ) + v1 (t), dt dZ(t) = \u00E2\u0088\u0092\u00CE\u00B1z Z(t) + \u00CE\u00B2z g(X(t), Y (t), KXZ , KY Z ) + v2 (t), dt (1.13) (1.14) where X(t), Y (t) and Z(t) denote the gene expression rate of transcription factor X, Y and gene Z at time t. In all FFL configurations, the expression of X is assumed to be constitutive, which means that it is continuously produced within the organism regardless of the cell\u00E2\u0080\u0099s need. For each different configuration of FFL, the functional forms of f and g have different expressions. The regulation function f , when it is an activator, is defined as follows. f (\u00CF\u0087, Kij ) = (\u00CF\u0087/Kij )H /(1 + (\u00CF\u0087/Kij )H ), \u00CF\u0087 = X(t), Y (t). (1.15) where coefficient H indicates the steepness of the activation function f and Kij is the activation or repression coefficient of gene j by transcription factor gene i. The gate function g can either be an AND-gate or an OR-gate, where in an AND-gate it is assumed that X and Y regulate Z independently and not compete with each other, making the activation function of X and Y to Z equal to the product of two activation functions, f (X(t), KXZ ) and f (Y (t), KY Z ). On the other hand, for an OR-gate, the transcription factors X and Y compete for the binding site in a promoter, and the gate function is expressed as a linear combination of the two activation functions. There are eight possible configurations of FFL, four coherent types and four incoherent types. When a given FFL\u00E2\u0080\u0099s indirect causal regulation of X to Z through Y agrees with its direct causal regulation of X to Z (e.g. both regulations activate or both regulations repress), then it is a coherent type of FFL, otherwise it is an incoherent type of FFL. In this thesis, coherent type 1 FFL is considered. In it, transcription factor X activates both gene Z and transcription factor 12 \u000CChapter 1 Table 1.1: The true and normalized parameter values used to simulate the batch fermentation reaction data, and to implement the estimation algorithm. Process Parameter Value Normalized Value \u00C2\u00B5m 0.15 [1/hr] 0.15 [1/hr] 1 ks 0.5 [g/L] 0.5 [g/L] kP YXS 40 [g/L] 0.25 [g/g] 0.25 [L/g] 0.25 [g/g] 2.5 YP X 20 [g/g] 0.2 [g/g] 12 2 0.75 0.5 CP [g/L] CS [g/L] CX [g/L] 8 1.5 1 4 0.25 0 0.5 0 6 12 t [hr] 18 24 0 0 6 12 t [hr] 18 24 0 0 6 12 t [hr] 18 24 Figure 1.1: Batch fermentation reaction from t = 0 hr to t = 24 hr. From left, each panel corresponds to the concentration of biomass (CX ), substrate (CS ) and by-product (CP ). Measured data points are denoted with \u00E2\u0080\u0098x\u00E2\u0080\u0099 and the solid curve denotes the \u00E2\u0080\u0098true\u00E2\u0080\u0099 trajectory of each state variables. Figure 1.2: Feed-Forward Loop model where transcription factor X regulates the expression of Y and both X and Y regulate the expression of Z. SX and SY are inducers of X and Y, respectively [36]. 13 \u000CChapter 1 Y , which in turn activates the expression of gene Z. The inducers of X and Y , SX and SY , both have a strong effect in the expression level of Z in coherent type 1, unlike in types 3 and 4. This is suggested to be a possible explanation for the dominance of coherent type 1 in the evolutionary process of transcription networks. Observations show that coherent type 1 FFL is the most frequently observed FFL type in E. coli and S. cerevisiae with 28 occurrence out of 42 identified FFLs and 26 occurrence out of 56 identified FFLs, respectively [36]. In [20], the expression levels of yeast S. cerevisiae gene were identified under a number of stimulations, including heat shock, toxicity level, and substrate concentration, in order to study the gene expression patterns. There were around 6,200 genes that were identified and about 900 among them showed similar pattern that can be further studied to identify the role of each genomic response. Since FFL is a recurring pattern involving a group of three genes X-Y-Z, a number of different FFLs can be identified within a single organism, each with a different group of X-Y-Z. One of the identified coherent type 1 FFL in S. cerevisiae is GCN4-LEU3-ILV5 group and in Figure 1.3 the expression level time series of these genes published in [20] are shown. The expression levels of GCN4, LEU3 and ILV5 are denoted with X(t), Y (t) and Z(t), respectively. The expression levels were measured at t = 5, 10, 15, 20, 30, 40, 60, 80 minutes (N = 8 samples) where at t = 0 min, the environmental temperature was raised from 25\u00E2\u0097\u00A6 C to 37\u00E2\u0097\u00A6 C. The FFL model has a total of eight process parameters, which are \u00CE\u00B8 = [\u00CE\u00B2y , \u00CE\u00B2z , \u00CE\u00B1y , \u00CE\u00B1z , KXY , KXZ , KY Z , H]. The parameters, \u00CE\u00B1y , \u00CE\u00B1z , represent the sum of degradation rate and dilution rate of Y and Z, respectively. Using these parameters, the half-time of Y and Z decay (t1/2 ) is obtained as log(2)/\u00CE\u00B1y and log(2)/\u00CE\u00B1z . In order to obtain simplified version of the FFL interactions, a few parameters are assigned approximate values based on a priori information (\u00CE\u00B2y = 1, \u00CE\u00B2z = 1 and H = 2). 14 \u000CChapter 1 0.8 X(t) 0.7 0.6 0.5 0.4 0 10 20 30 40 50 60 70 80 10 20 30 40 50 60 70 80 10 20 30 40 t [min] 50 60 70 80 1 Y(t) 0.8 0.6 0.4 0.2 0 0.8 Z(t) 0.6 0.4 0.2 0 0 Figure 1.3: Experimental time series data of coherent type 1 FFL gene expression level where X(t) denotes the expression level of GCN4, Y (t) denotes the expression level of LEU3 and Z(t) denotes the expression level of ILV5. [20]. 15 \u000CChapter 1 1.4.3 JAK-STAT : Signal Transduction Pathway The third example is that of signal transduction pathways. The Janus family of kinases (JAK) signal transducer and activator of transcription (STAT) pathway describes the series of reactions taking place across cytoplasm and nucleus to trigger transcription of key genes. The signaling pathway occurs through multiple cell surface receptors, one of them being the erythropoietin receptor (EpoR). EpoR plays an important role in the proliferation and differentiation of erythroid progenitor cells [51], which refer to cells that are able to grow into a specific type of cell - in this case, red blood cell - through cell-division [33]. Figure 1.4 shows the diagram of the JAKSTAT signal transduction pathway. Through a series of reactions, EpoR creates docking sites for STAT5, a latent transcription factor. The key actions taken by STAT5 are phosphorylation (x1 to x2 , in Figure 1.4), formation of dimers (x2 to x3 , in Figure 1.4), and migration from cytoplasm into nucleus (x3 to x4 , in Figure 1.4). Once present in the nucleus, STAT5 is able to trigger the transcription of target genes. There are several hypotheses for the termination mechanism of JAK-STAT pathway, including degradation of STAT5 within the nucleus and migration of STAT5 from nucleus back to cytoplasm. The mathematical model of JAK-STAT signaling pathway was originally developed in [51]. There are four state variables which represent the concentrations of unphosphorylated STAT5 (x1 ), tyrosine phosphorylated monomeric STAT5 (x2 ), tyrosine phosphorylated dimeric STAT5 (x3 ) and STAT5 within the nucleus (x4 ). The exogenous input variable of the model, u(t), is the concentration of EpoR. The original model was adapted following the suggestion in [42, 57] and expressed as a set of four coupled ordinary differential equations as follows. dx1 (t) dt dx2 (t) dt dx3 (t) dt dx4 (t) dt = \u00E2\u0088\u0092a1 x1 (t)u(t) + 2a4 x4 (t)I{t\u00E2\u0089\u00A5\u00CF\u0084 } , (1.16) = a1 x1 (t)u(t) \u00E2\u0088\u0092 2a4 x22 (t), (1.17) = \u00E2\u0088\u0092a3 x3 (t) + x22 (t), (1.18) = a3 x3 (t) \u00E2\u0088\u0092 a4 x4 (t)I{t\u00E2\u0089\u00A5\u00CF\u0084 } , (1.19) 16 \u000CChapter 1 Figure 1.4: JAK-STAT signal transduction pathway diagram [51]. Initially, EpoR creates docking sites for STAT5. This triggers a series of STAT5 reaction where unphosphorylated monomeric STAT5 (x1 ) becomes phosphorylated monomeric STAT5 (x2 ), which in turn forms phosphorylated dimeric STAT5 (x3 ) that migrates into the nucleus. Once inside the nucleus, phosphorylated dimeric STAT5 (x4 ) triggers the expression of target gene. The signal transduction pathway terminates, by migration of STAT5 from nucleus back to cytoplasm 17 \u000CChapter 1 where I{t\u00E2\u0089\u00A5\u00CF\u0084 } is an indicator function that is equal to zero when t < \u00CF\u0084 and is equal to one when t \u00E2\u0089\u00A5 \u00CF\u0084 . Since there is a time delay from the initial addition of EpoR into the system, triggering the activation of STAT5 signal transduction pathway, to the time STAT5 actually migrates into nucleus, \u00CF\u0084 is present in the model to account for such time delay. Though this model is suggested to be a simplified version of the original model developed in [51], one aspect of the model seems to result in over-lumping of the parameters in order to reduce the dimension of the parameter space. This aspect is regarding the reduction of phosphorylated STAT5 (x2 ) due to the formation of phosphorylated dimeric STAT5 (x3 ). These are allegedly represented with the second terms in (1.17) and (1.18). However, the lack of 2a4 term in (1.18) seems inconsistent with the physical explanation of the process, and is a worthwhile problem to be addressed in the context of model validation.1 It is proven to be very difficult to monitor the population of individual types of STAT5 within the process. Thus, the following two output variables were measured, instead of direct measurement of each state variable. y1 (t) = x2 (t) + 2x3 (t), y2 (t) = x1 (t) + x2 (t) + 2x3 (t), (1.20) where y1 denotes the amount of tyrosine phosphorylated STAT5 in cytoplasm and y2 denotes the total amount of STAT5 in cytoplasm. These output variables are expressed as linear combination of the state variables that depict their stoichiometric relationship. The JAK-STAT model is more complex compared to the FFL model introduced in the previous section, because the direct measurements of state variables are not available. Furthermore, x4 is not accounted for in the output measurements at all, but only present in the state equations as a functional component of rate of change for x1 and x4 . This is because making measurements of population of STAT5 within the nucleus is difficult. 1 One speculation is that when the simplified model was devised, the modelers accounted for degradation of x2 in the rate of \u00E2\u0088\u0092(2a4 \u00E2\u0088\u0092 1)x22 , which would account for the difference in the decrease in x2 population and the increase in the x3 population. This is just one conjecture among many, though following this logic would place a constraint on the parameter such that a4 \u00E2\u0089\u00A5 0.5. 18 \u000CChapter 1 An experimental data set published by [51] is shown in Figure 1.5, where the output variables y1 and y2 are measured at t = 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 25, 30, 40, 60 minutes. At t = 0 minutes, the population of phosphorylated STAT5 is 0 (y2 (t = 0) = 0). This is because phosphorylation of STAT5 is triggered by the addition of EpoR into the system which occurs at t = 0 minute. 0.14 0.12 0.1 y 1 0.08 0.06 0.04 0.02 0 0 10 20 30 40 50 60 10 20 30 t [min] 40 50 60 0.2 0.18 y 2 0.16 0.14 0.12 0.1 0 Figure 1.5: Experimental time series data of JAK-STAT signal transduction pathway experimental data. y1 (t) and y2 (t) were measured at t = [0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 25, 30, 40, 60] minutes. Certain constraints can be readily imposed on the parameters a1 , a3 and a4 . It is straightforward to place the following constraints by relating the state equations, (1.16) - (1.19), and the reactions taking place in the process. Upon injecting EpoR, unphosphorylated STAT5 becomes phospho19 \u000CChapter 1 rylated, thereby reducing the initial population of x1 from its initial value, x1 (t0 ) (a non-negative value), and increasing the x2 population. This reaction is described by the first term in (1.16) with a negative sign, which is mirrored by the positive sign in the first term of (1.17). In order for this reaction to be feasible, a1 \u00E2\u0089\u00A5 0, needs to be satisfied. The second term in (1.16) indicates the increasing population in x1 ; this term is present under the assumption that STAT5 that traveled to nucleus (x4 ) becomes monomeric, and migrates back out to cytoplasm, thus adding to the x1 population. This observation is mirrored in the second term of (1.19), indicating the decrease in x4 population. Also, the indicator function conveys that until t = \u00CF\u0084 , not enough x4 will have formed within the nucleus to migrate back out to the cytoplasm. Thus a4 \u00E2\u0089\u00A5 0 needs to be satisfied for physical feasibility. Lastly, the first terms in (1.18) and (1.19) show the mirroring effect of decreasing x3 and x4 . Therefore, the lower limit on a3 \u00E2\u0089\u00A5 0 needs to be satisfied for physical coherence of the model. 1.5 Thesis Overview An overview of the two most widely-used parameter estimation methods for ordinary differential equation models, Maximum Likelihood Estimator (MLE) and Bayesian Inference based method, is presented in Chapter 2. The basic theory, advantages and disadvantages of each method are discussed along with their performances of handling irregularly sampled data sets. Chapter 3 discusses the issue of handling multiple experimental data sets. For some biological processes, multiple experiments are conducted in order to create a larger merged data set so that traditional estimation methods that require larger data sets can yield reliable results. However, due to varying experimental conditions between multiple runs, the question of how the data sets can be systematically merged arises. This challenge is addressed with sequential Bayesian inference approach which is illustrated through examples. In Chapter 4, the methodology of Markov Chain Monte Carlo (MCMC) approximation is dis20 \u000CChapter 1 cussed. Two instances of MCMC are explored in this thesis, and they are Metropolis-Hastings algorithm and Gibbs sampler. The two methods form two separate levels of iterative estimation in order to approximate the asymmetric probability distribution of nonlinear parameter vector. Chapter 5 presents the case study results, along with the analysis of the quality of each model used in the case study. The last chapter of the thesis presents some conclusions and recommendation for future research. 1.5.1 Problem Formulation Consider a nonlinear process model as follows. x(t) = f(x(t), u(t), \u00CE\u00B8) + v(t), dt (1.21) y(t) = h(x(t), u(t), \u00CE\u00B8) + \u00CE\u00B7(t) (1.22) where \u00CE\u00B8 = [\u00CE\u00B81 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , \u00CE\u00B8m ]T is an m-dimensional vector of model parameters; x = [x1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , xp ]T is a p-dimensional vector of state variables; x\u00CC\u0087(t) is a time derivative vector of state variables; u = [u1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , ur ]T is an r-dimensional vector of input variables which are pre-determined by the experimentalist or are measured precisely and the numerical values are known; y = [y1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , yq ]T is a q-dimensional vector of output variables, i.e. the set of variables that are measured experimentally; f = [f1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , fp ] and h = [h1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , hq ] are a p-dimensional vector and a q-dimensional vector of functions and the form of each function is known; v = [v1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , vp ]T is a p-dimensional vector of process noise variables; and \u00CE\u00B7 = [\u00CE\u00B71 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , \u00CE\u00B7q ] is a q-dimensional vector of measurement noise variables. The objective of parameter estimation problem is to estimate \u00CE\u00B8 from experimental data, y(t), which is related to the state variables, x(t), corrupted with noise, v(t) through some functions h. In this thesis, the noise variables are assumed to have Gaussian distribution with zero mean and standard deviation, \u00CF\u0083, i.e. v \u00E2\u0088\u00BC N (0, \u00CF\u0083 2). 21 \u000CChapter 1 ,-#(-')-3.*' ./*0' !\"#$%&&'()*+',-#(-' &*\".$*.\"%'/!0'1-2'' .-,-#(-'31\"14%*%\"&'/50' 3\"#$%&&'-#)&%' 9/*0' &*1*%'91\")1:;%' /*0'?'+/ L(\u00CE\u00B82 | D), then it can be concluded that the observation D was more likely to have occurred when \u00CE\u00B8 = \u00CE\u00B81 [11]. Therefore, by evaluating the likelihood function in the parameter space, S, where \u00CE\u00B8 \u00E2\u0088\u0088 S \u00E2\u008A\u0086 \u00E2\u0084\u009Cm , the value of \u00CE\u00B8 that maximizes the likelihood function can be obtained. The MLE of the parameter vector is obtained as, \u00CE\u00B8\u00E2\u0088\u0097 = arg max L(\u00CE\u00B8 | D). \u00CE\u00B8 2 3 (2.3) MLE is also an acronym for maximum likelihood estimate when referred to as estimated result t = t0 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , tN \u00E2\u0088\u00921 25 \u000CChapter 2 MLE is easy to implement if the likelihood function is differentiable in S, such that the opti\u00E2\u0088\u0082 mum can be located by finding the values of \u00CE\u00B8 such that L(\u00CE\u00B8 | D) = 0 and verifying that the \u00E2\u0088\u0082\u00CE\u00B8 optimum is global maximum. However, in nonlinear processes, the likelihood function is usually too complex, and to derive an analytical expression for the \u00CE\u00B8 derivative is difficult. Hence, derivative free optimization methods are often required to implement MLE [6]. It is well-known that derivative free optimization methods are slow and require a very good initial guess of the parameters. These optimization methods lead to poor parameter estimates if the dimensionality of the parameter space is large or if a good initial guess is not provided. Another disadvantage of MLE is that the sensitivity of the parameters to the likelihood function dictates the accuracy of the estimates. For instance, if the change in likelihood function is negligible for relatively large changes in a particular parameter, then that parameter is difficult to estimate. Moreover, MLE is prone to a large bias in the estimate parameters when the size of the data set is small. However, as the data size approaches infinity, the MLE asymptotically approaches the true parameter values with no bias and minimum variance [39]. The likelihood function of dynamic processes is dependent on the assumptions made about the probabilistic distribution of noise (and hence the process measurements) in the process. For instance, if the probability distribution of observations D = [y1 (t0 , \u00CE\u00B8), \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , y1 (tN \u00E2\u0088\u00921 , \u00CE\u00B8)]4 is Gaussian, independent and identically distributed with some mean (\u00C2\u00B5) and variance (\u00CF\u0083 2 ), then the likelihood function is defined as follows, L(\u00CE\u00B8 | D) = = N \u00E2\u0088\u00921 Y i=1 1 \u00E2\u0088\u009A exp 2\u00CF\u0080\u00CF\u0083 \u0012 1 (2\u00CF\u0080)(N \u00E2\u0088\u00921)/2 \u00CF\u0083 N \u00E2\u0088\u00921 \u00E2\u0088\u0092(y1 (ti , \u00CE\u00B8) \u00E2\u0088\u0092 \u00C2\u00B5)2 2\u00CF\u0083 2 exp \u0013 N \u00E2\u0088\u00921 \u00E2\u0088\u00921 X (y1(ti , \u00CE\u00B8) \u00E2\u0088\u0092 \u00C2\u00B5)2 2\u00CF\u0083 2 i=1 ! (2.4) 4 consider a single output variable case. t0 to tN \u00E2\u0088\u00921 are the sample times. Note that the parameter, \u00CE\u00B8, dependence of the observations is explicitly shown. In the rest of this thesis, the dependence of observations on parameters is not explicitly mentioned. 26 \u000CChapter 2 Then, maximizing the likelihood function reduces to (assuming the variance is known), max log[L(\u00CE\u00B8 | D)] = max = min N \u00E2\u0088\u00921 X i=1 N \u00E2\u0088\u00921 X i=1 \u00E2\u0088\u0092 (y1 (ti , \u00CE\u00B8) \u00E2\u0088\u0092 \u00C2\u00B5)2 (2.5) (y1 (ti , \u00CE\u00B8) \u00E2\u0088\u0092 \u00C2\u00B5)2 (2.6) which is precisely equal to the least-squares estimator. Thus, in the special case where the observations are Normally distributed and their variance is known, the MLE and LSE become equivalent. 2.3 Bayesian Parameter Estimation Bayesian statistics is a departure from the more generally practiced frequency statistics, where the probability of a random event is defined as the percentage of its occurrence in a large number of trials. Therefore, if a frequentist were to derive the absolute probability of a given event, theoretically that person would require an infinite number of trials. However, in Bayesian statistics, a prior distribution of the event is updated with every new observation and the posterior distribution of the random event, conditional on the observations, is calculated. This is mathematically expressed as follows (also called Bayes Rule), p(\u00CE\u00B8 |D) = R L(\u00CE\u00B8 | D) p(\u00CE\u00B8) p(D | \u00CE\u00B8) p(\u00CE\u00B8)d\u00CE\u00B8 (2.7) where D is the set of observations; \u00CE\u00B8 is the random event (process parameter in this work); p(\u00CE\u00B8) is the prior probability distribution; L(\u00CE\u00B8 | D) is the previously mentioned likelihood function; and p(\u00CE\u00B8 | D) is the posterior probability distribution. To illustrate the difference between frequency statistics and Bayesian statistics, consider the example of a tossing game where a fair coin and a trick coin are used as in section 2.1. Assume that a player randomly chooses one of the two coins, plays the game of hundred coin tosses, and observes 38 heads. A frequentist, given the 27 \u000CChapter 2 following information, \u00E2\u0080\u00A2 the trick coin yields 3 H out of 10 tosses and there was a 50-50 chance of the player choosing fair coin or the trick coin (This information is a priori, since it was known before the observation is made); \u00E2\u0080\u00A2 38 H out of a hundred tosses (observation) would not be able to present a precise numerical value for the probability that the chosen coin is the trick coin. This is due to the limited number of observations. This frequentist needs sufficient number of hundred-toss games in order to determine the type of coin used. A Bayesian statistician can use the same information and perform the following computations, \u00E2\u0080\u00A2 The prior knowledge on the events of selecting a trick coin or a fair coin can be assigned a probability as p(T r) = 0.5, p(F a) = 0.5, where T r and F a correspond to the respective events. \u00E2\u0080\u00A2 The probability of the chosen coin being the trick coin, given 38 H out of hundred toss, denoted by p(T r | k = 38), can be expressed as follows (using Bayes rule): p(T r | k = 38) = \u00E2\u0080\u00A2 p(k = 38 | T r) = 100 38 \u00E2\u0080\u00A2 p(k = 38 | F a) = 100 38 p(k = 38 | T r) p(T r) , p(k = 38 | T r) p(T r) + p(k = 38 | F a) p(F a) (2.8) \u0001 38 62 0.3 0.7 , \u0001 0.538 0.562 . Substituting the prior information and the last two conditional distribution values in (2.8), the Bayesian statistician would conclude that there is a 81% chance that the chosen coin is the trick coin and that there is a 19% chance of it being the fair coin. The main advantage of Bayesian statistics, as illustrated in this example, is its ability to compute the probability of a given event with a limited number of observations, in this case a single game. 28 \u000CChapter 2 Two basic approaches exist for Bayesian parameter estimation. One is to find the parameter value that maximizes a posteriori (MAP) distribution as follows \u00CE\u00B8\u00E2\u0088\u0097 = arg max p(\u00CE\u00B8 | D) \u00CE\u00B8 (2.9) and the other is to obtain the expected value of the a posteriori distribution as follows. E[\u00CE\u00B8] = Z p(\u00CE\u00B8 | D) p(\u00CE\u00B8)d\u00CE\u00B8 (2.10) The MAP value indicates the most probable value of the parameter, however the expected value is a more appropriate representation of a parameter if its distribution is skewed [49]. The difference between the (2.3) and (2.9), though they both seek the probability maximizing value, is that MLE maximizes the likelihood of observing the experimental data, whereas MAP maximizes the probability of the parameter conditional on the observations. Bayesian inference uses both a priori information and experimental data to compute full a posteriori distribution. This presents Bayesian inference with two major advantages over the traditional frequentist methods such as Nonlinear Least-Squares Regression or Maximum Likelihood Estimation. The first advantage is that by incorporating a priori information, we can make full use of all of the available information in the estimation process. This can become extremely helpful, especially when there is limited amount of experimental data available. Physical constraints arising from theory, and heuristic knowledge are examples of a priori information. By not using a priori information, frequentist methods usually yield inaccurate estimates, and this is demonstrated in Section 3.1. The second advantage of Bayesian inference is that by computing full probability distribution of the parameter, a statistically meaningful confidence intervals of the estimated parameters can be obtained. However, in previously developed Bayesian inference based approaches, this advantage had not been exploited to its full potential. While there have been many non-Bayesian studies that deal with multiple experimental data, Bayesian inference 29 \u000CChapter 2 was only used to compute a posteriori parameter distribution from each experimental data individually. For point-estimation methods such as MLE, the probability distribution of the parameter is altogether disregarded or considered to be Gaussian by default. And, this practice does not translate into nonlinear processes, as it has been discussed in previous chapter that nonlinear process parameters probability distribution have more complex shape. Therefore, Bayesian parameter estimation method that calculates the full probability distribution of parameters is an advantageous tool for evaluating nonlinear processes. The main challenges of using Bayesian parameters arise from the fact that there is no analytical solution to the posterior distribution, because of the complex integral present in the denominator of the right hand side term in (2.7). This term serves as a normalizing constant that ensures the posterior distribution to integrate to unity [6]. In the absence of analytical solution, the posterior can be approximated numerically by random sampling method called Markov Chain Monte Carlo (MCMC). The details of this method are discussed in Chapter 4. 30 \u000CChapter 3 Multiple Experimental Data Sets for Parameter Estimation This chapter discusses the problem arising from pooling data sets from multiple experiments. The commonly employed method of straightforward data merging is shown to result in loss of information and has difficulty yielding statistically sound confidence intervals. An alternative approach that sequentially updates the a priori distribution function of the parameters based on multiple experimental data is developed in this chapter. 3.1 Merging Multiple Experimental Data Sets Most parameter estimation methods require a large number of data points in order to obtain unbiased estimates with small confidence intervals. However, it is common in many experiments to have only a limited number of data points (N). Hence to reduce bias in the estimated parameters, it is common to conduct multiple experiments (k) and obtain Nk number of sample points. While such an approach may reduce the bias, the question of how the data sets from k different experiments, D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , Dk , can be systematically integrated is not clear addressed. Theoretically speaking, one can only merge data sets from multiple experimental runs if the experimental conditions and the noise characteristics are the same during different runs. However, it can be difficult to maintain the same experimental conditions through multiple runs. Therefore, creating a large merged data set from multiple experimental data sets can lead to poor parameter estimates. Another, more obvious problem is that there may be more than one value corresponding to some sampling time tj . In Figure 3.1, Y (t) measurements of FFL gene reg31 \u000CChapter 3 ulatory network process from three independent experiments, D1 , D2 and D3 , are shown. The measurements are made at irregular time intervals and at t = 30 min, all three experiments have made measurement of Y (t). If these three data sets were merged straightforwardly, then the time series of the merged data set D, is denoted by the heavy black line shown in the figure, where the sample points of D1 , D2 and D3 are connected in sequential order of the corresponding measurement time. However, at t = 30 min, it is unclear as to which of the data points, Y |D1 (t = 30 min), Y |D2 (t = 30 min), Y |D3 (t = 30 min) (denoted by the three different paths of grey dotted lines), is the best representation of the true system. 1 D1 D2 0.9 D3 0.8 Y(t) 0.7 0.6 t = 30min 0.5 0.4 0.3 0.2 0 10 20 30 t [min] 40 50 60 Figure 3.1: Time series data of Y (t) obtained from three independent experiments D1 , D2 and D3 , of Feed-Forward Loop genetic regulatory network process. The heavy black line denotes the Y (t) trajectory using larger data set created from merging the three data sets. The line is broken at t = 30 min, because there are three different measurements corresponding to this time, and the three possible trajectories are denoted with grey dotted lines. An alternative approach to analyzing multiple experimental data sets is to obtain a parameter estimate from each data set and compute the mean of the estimates, such that if the individual P estimates are \u00CE\u00B8\u00CC\u0082 1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , \u00CE\u00B8\u00CC\u0082 k , and then the mean is \u00CE\u00B8\u00CC\u0082 = ( ki=1 \u00CE\u00B8\u00CC\u0082 i )/k. Consider the JAK-STAT signal 32 \u000CChapter 3 pathway process, where six simulated data sets are available5 . From the data sets, using a type of point-estimation method introduced in [42], estimated values of a1 , a3 and a4 are obtained. These values are shown in Table 3.1. The mean and variance of the estimation results from six data sets is equal to \u00CE\u00B8\u00CC\u0084 = [0.0386, 2.393, 0.168] and \u00CF\u0083\u00CE\u00B8\u00CC\u0082 = [0.0134, 2.412, 0.114]. Due to the small number of data points from each experiment and the presence of noise, the estimates show large variances. The common practice of computing this average and the standard deviation, by default, assumes Gaussian distribution of the parameter estimates, and the normalized Gaussian distributions obtained from the average estimate and the standard deviations are shown in Figure 3.2. The true values used to simulate the data sets, \u00CE\u00B8 = [0.0515, 3.39, 0.35], are shown as vertical dotted lines. If Gaussian distribution of the estimated parameters is assumed, the probability of the parameters may show a significant positive value even in the obviously infeasible regions of the parameter space. For instance, the estimated distributions of a3 and a4 have the left-tail well into the negative region, which contradicts the constraints on the parameter that they must have positive values (discussed in Section 1.4.3). This example also demonstrates the case where even though average estimates satisfy the constraints, the corresponding confidence intervals does not. Table 3.1: Point-estimation method is applied to the six simulated data of JAK-STAT signal pathway process, D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 . The individual estimation result for the parameters a1 , a3 and a4 are shown. D1 D2 D3 D4 D5 D6 a\u00CB\u00861 0.0557 0.0385 0.0249 0.0488 0.0423 0.0212 a\u00CB\u00863 5.993 1.652 0.392 4.803 1.215 0.303 a\u00CB\u00864 0.253 0.247 0.025 0.273 0.183 0.026 The challenge, of obtaining an estimate that accurately represents all of the data sets, is easily 5 Simulated data is obtained by the method shown in Appendix A 33 \u000C\u00E2\u0088\u00920.05 0 0.05 a1 0.1 0.15 \u00E2\u0088\u009210 p(a4) p(a3) p(a1) Chapter 3 \u00E2\u0088\u00925 0 5 a3 10 15 \u00E2\u0088\u00920.4 \u00E2\u0088\u00920.2 0 0.2 0.4 0.6 a4 Figure 3.2: Applying point-estimation method, six individual parameter estimate are obtained from each simulated data, D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 . The average and standard deviation of the results shown in Table 3.1 is as follows \u00CE\u00B8\u00CC\u0084 = [0.0386, 2.393, 0.168] and \u00CF\u0083\u00CE\u00B8\u00CC\u0082 = [0.0134, 2.412, 0.114]. This result is used to compute the Gaussian probability distributions that the general \u00E2\u0080\u0099average \u00C2\u00B1 1.96\u00C3\u0097standard deviation\u00E2\u0080\u0099 confidence interval computation assumes. The vertical dotted lines denote the true values of the parameters used to simulate the data sets \u00CE\u00B8 = [0.0515, 3.39, 0.35]. handled by Bayesian parameter estimation methods as they can account for a priori information and estimate the full probability distribution. In the work by Coleman and Block [15], parameters of fermentation process model are estimated using informative prior probability distribution. The authors use several experimental data sets and obtain the full probability distributions of the parameters and proceed to report the data in the \u00E2\u0080\u0098average \u00C2\u00B1 1.96 \u00C3\u0097 standard deviation\u00E2\u0080\u0099 (95% Confidence Interval) format. Such an approach fails to take advantage of estimating the full probability distribution as it does not carry information gained from one experiment to the next. To illustrate this point, the JAK-STAT process is considered again. Using the same sets of simulated data, the probability distribution functions, p\u00CC\u0082(a3 | a1 = 0.0515, a4 = 0.39, Di) are estimated where i = 1, \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , 6.6,7 The approximated probability distribution functions are shown in Figure 3.3 (a)-(f). The asymmetric distributions demonstrated in the figure is a common characteristic of probability distributions of nonlinear parameters. From these probability distriR bution functions, the expected values are computed as a\u00C2\u00AF3 = E(a3 ) = a3 p\u00CC\u0082(a3 ) da3, which are [0.0349, 0.0700, 0.0448, 0.0728, 0.0316, 0.0594]. Then finally the average parameter estimation 6 The approximated probability distribution shown in Figure 3.3 is obtained using the method introduced in Chapter 4 7 The estimation of a3 is conditional to the true value of a1 and a4 which are assumed to be known. 34 \u000CChapter 3 is reported with 95 % confidence interval as \u00E2\u0080\u0098a\u00C2\u00AF3 \u00C2\u00B1 1.96\u00CF\u0083a3 \u00E2\u0080\u00998 and the corresponding Gaussian probability distribution is shown in the center panel of Figure 3.3. When studying probability distribution, it should be noted that the shape and the variance of the distribution can be considered as \u00E2\u0080\u0098information\u00E2\u0080\u0099, in the sense that they are clues to the relative likelihood of a parameter taking up some value. From studying the panels (a)-(f), it is clear that some of the information contained in each probability distribution is eliminated from the average result because of the Gaussian assumption. For example, Panels (b) and (d) show probability distributions that are heavily negative-skewed, and this fact is not properly conveyed in the center panel. It is mentioned in the previous section that nonlinear process parameters often exhibit asymmetric probability distribution, sometimes even multi-modal distributions. Therefore, when dealing with nonlinear processes, it is important to avoid Gaussian approximation of complex probability distributions. For instance, consider the two different types of distributions shown in Figure 3.4. The distribution shown in left is a bimodal distribution where arg max\u00CE\u00B1 p(\u00CE\u00B1) are 3 and 6. The distribution shown in the right is a Gaussian distribution with arg max\u00CE\u00B2 p(\u00CE\u00B2) is 4.50. These two distributions, though different in shape, have the same expected mean and standard deviation. The formulas used to calculate the expected mean and standard deviation are \u0010P \u0011 h\u0010P \u0011 i1/2 N N 2 E(x) = x / (N) and standard deviation is \u00CF\u0083 = / (N \u00E2\u0088\u0092 1) (x \u00E2\u0088\u0092 x\u00CC\u0084) , x i=1 i i=1 i where x = \u00CE\u00B1, \u00CE\u00B2. It is easy to notice from these figures that if p(\u00CE\u00B1) is approximated with a Gaussian distribution, the mid-point of the bimodal distribution, which has a very low probability, will be reported as the \u00E2\u0080\u0098most likely\u00E2\u0080\u0099 value. 8 The average is a\u00C2\u00AF3 = P6 i=1 6 a\u00CB\u00863 i and standard deviation is \u00CF\u0083a3 = \u0012 1 Pk (a\u00CB\u00863i \u00E2\u0088\u0092 a\u00C2\u00AF3 )2 k \u00E2\u0088\u0092 1 i=1 \u00131/2 35 \u000CChapter 3 (a) (c) 0.05 a1 0.1 0 0.05 a1 0.1 0 0.05 a1 0.1 (e) 0.05 a1 0.1 0.05 a1 0.1 0.05 a1 0.1 (f) p(a1|D5) p(a1|D4) (d) 0 0 p(a1|D6) 0 p(a1|D3) p(a1|D2) p(a1|D1) (b) 0 0.05 a1 0.1 0 Figure 3.3: Six independently simulated data sets of JAK-STAT signal pathway process are used to estimate a1 assuming that the two other parameter values are known. The individually estimated probability distributions are shown in Panels (a)-(f). The expected mean from each of the distribution is calculated and using these expected means, the overall average of the a\u00CB\u00861 is computed along with its standard deviation. Using these values, a Gaussian distribution is plotted in the center panel. 36 \u000CChapter 3 E(\u00CE\u00B2) = 4.5028 \u00CF\u0083\u00CE\u00B2 = 1.6210 p(\u00CE\u00B2) p(\u00CE\u00B1) E(\u00CE\u00B1) = 4.5028 \u00CF\u0083\u00CE\u00B1 = 1.6210 0 2 4 \u00CE\u00B1 6 8 10 0 2 4 \u00CE\u00B2 6 8 10 Figure 3.4: Two probability distributions with identical expected mean, E(\u00CE\u00B1) = E(\u00CE\u00B2) = 4.5028, and standard deviation \u00CF\u0083\u00CE\u00B1 = \u00CF\u0083\u00CE\u00B2 = 1.6210. However, for the probability distribution on the left, the max a posteriori is arg max\u00CE\u00B1 p(\u00CE\u00B1) = 3 = 6, where as the probability distribution on the right, the max a posteriori is arg max\u00CE\u00B2 = p(\u00CE\u00B2) = 4.5028. 3.2 A priori and Timeline Shift In this thesis, a parameter estimation approach that makes use of the two major advantages of Bayesian inference, discussed in the previous chapter, is developed. The approach aims to derive a single posterior probability distribution, conditional on all of the available experimental data by iteratively updating the prior probability distribution in the Bayes Rule. By doing so, the information available from all of the databases is propagated through the estimated probability distribution functions. Suppose that the FFL model parameter vector, \u00CE\u00B8, needs to be estimated and that k independent experimental data sets are available, D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , Dk . First, the a priori probability distribution function is defined from heuristic information and other constraining conditions obtained from theoretical considerations (3.5 (A)). This function is denoted with p0 (\u00CE\u00B8). In order to obtain a posteriori probability distribution function using Bayes Rule, the likelihood function, L(D | \u00CE\u00B8), is also required. The procedure for deriving L(D | \u00CE\u00B8) is discussed in Appendix B. Using these two components and the first experimental data set D1 , the expression for the first posterior 37 \u000CChapter 3 distribution function is computed as follows. p1 (\u00CE\u00B8 | D1 ) = R L(\u00CE\u00B8 | D1 ) p0 (\u00CE\u00B8) p(D1 | \u00CE\u00B8) p(\u00CE\u00B8) d\u00CE\u00B8 (3.1) This newly calculated posterior probability distribution is conditional on D1 . This step of obtaining the first posterior is denoted with \u00E2\u0080\u0098E1\u00E2\u0080\u0099. Following E1, present time is shifted forward and the information regarding the parameters obtained using D1 is now considered past knowledge. The posterior information from E1 becomes a priori information for all the future experiments (Figure 3.5 (B)). Thus, the prior distribution function needs to be updated to account for this fact. Therefore, the next prior probability distribution function is set equal to the posterior distribution obtained in E1 as follows. p1 (\u00CE\u00B8) := p1 (\u00CE\u00B8 | D1) (3.2) Using this new prior distribution and the likelihood function, the second posterior probability distribution is calculated as follows. p2 (\u00CE\u00B8 | D1 , D2 ) = R = L(\u00CE\u00B8 | D2 ) p1 (\u00CE\u00B8) p(D2 | \u00CE\u00B8) p(\u00CE\u00B8) d\u00CE\u00B8 L(\u00CE\u00B8 | D2 ) p1 (\u00CE\u00B8 | D1 ) R p(D2 | \u00CE\u00B8) p(\u00CE\u00B8) d\u00CE\u00B8 (3.3) (3.4) This new posterior probability distribution, p2 (\u00CE\u00B8 | D1 , D2 ) is conditional on both D1 and D2 . The process of obtaining the second posterior is denoted with \u00E2\u0080\u0098E2\u00E2\u0080\u0099. Following E2, the prior distribution needs to be updated again as the present time has shifted forward and as it now needs to include the information about the parameter obtained from analyzing D2 . The new prior is then set equal to p2 (\u00CE\u00B8) := p2 (\u00CE\u00B8 | D1, D2 ) (3.5) This sequential update of the prior distribution with the newly calculated posterior distribution 38 \u000CChapter 3 is repeated until all of the experimental data sets have been evaluated. Then, the final posterior distribution that is conditional on all of the information is equal to, pk (\u00CE\u00B8 | D1 , D2 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , Dk ) = L(\u00CE\u00B8 | Dk ) pk\u00E2\u0088\u00921 (\u00CE\u00B8 | D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , Dk\u00E2\u0088\u00921) R p(Dk | \u00CE\u00B8) p(\u00CE\u00B8) d\u00CE\u00B8 (3.6) The process of evaluating the kth and last posterior is denoted with \u00E2\u0080\u0098Ek \u00E2\u0080\u0099 (Figure 3.5 (C)). This iterative approach offers a systematic procedure to integrating information from multiple experimental runs by computing a series of probability distribution functions. Figure 3.6 shows the typical behavior expected from a series of evolving posterior distributions obtained using the sequential Bayesian estimation method. The top left panel is shown with a flat uniform prior distribution of the parameter vector restricted to some lower and upper bounds. In some cases, the prior distribution is more informative and in such cases the a priori distribution will take on shape than the uniform distribution shown. The top right panel shows the posterior probability distribution obtained after applying the first experimental data (after E1). The shape of the distribution starts to form a plateau near the region of higher probability - in this case, near the center - conveyed by D1 . The posterior distribution function shown in the bottom left panel now shows more distinct peak near the value 0, from which it can be inferred that at \u00CE\u00B8 \u00E2\u0089\u0088 0, the probability distribution function is maximized (after E2). Finally, after all of D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , Dk are applied to the sequential method, the resulting final posterior distribution of process parameter is a result of systematic integration of multiple experimental data sets. 39 \u000CChapter 3 Figure 3.5: Three different snapshots of a linear timeline with multiple experiments and the information database; the present time is indicated by the vertical arrow in each panel. The top panel (A) shows the present time before any of the experiments have been conducted/analyzed. At this time, a priori consists of theoretical and heuristic information. The middle panel (B) shows the present time, after Experiment 1 has been conducted/analyzed and the experimental data has been evaluated for parameter estimation. At this time, a priori consists of theoretical and heuristic information as well as the information gathered from the first experiment. The bottom panel (C) portrays the present time, after k experiments have been conducted and the multiple experimental data sets have been evaluated for parameter estimation. At this time a priori consists of theoretical and heuristic information along with the information gathered from all of the experiments. 40 \u000CChapter 3 Figure 3.6: The four panels portray the evolving series of posterior distribution functions obtained from multiple experimental data sets applied to sequential Bayesian estimation method. The top left panel shows a uniform prior distribution before any experimental data has been analyzed. In some cases, the prior distribution may be more informative where it highlights the more probable region in the parameter space. The top right panel shows the posterior distribution computed from the first set of experimental data. The bottom left panel shows the posterior distribution of parameter after the second set of experimental data has been analyzed. The bottom right panel shows the posterior distribution of parameter obtained after all k experimental data sets have been applied to the algorithm. 41 \u000CChapter 4 Markov Chain Monte Carlo (MCMC) for Approximating Probability Distribution Functions Most posterior distributions computed using Bayes\u00E2\u0080\u0099 Rule cannot be solved analytically, therefore a numerical approximation method called Markov Chain Monte Carlo is used to generate random samples from the distribution. These random samples are used to plot a histogram that is an approximation of the desired probability distribution. Two instances of MCMC, MetropolisHastings algorithm and Gibbs Sampler, are used in this work in a set of inner and outer level of iterations to approximate the probability distribution of the parameters. The large computational cost of these approximations is optimized using a novel multi-phase approach of Gibbs sampler. 4.1 Markov Chain Monte Carlo (MCMC) Markov Chain Monte Carlo method was developed in order to solve optimization and integration problems arising in high dimensional spaces where analytical solutions are difficult to obtain. The approach relies on drawing a number of independent and identically distributed samples, {\u00CE\u00B8(i) }M i=1 , from a target distribution (the distribution that needs to be approximated), p(\u00CE\u00B8 | D). Using these M samples, the distribution is approximated by the following empirical point-mass function [2]. M 1 X (i) \u00CE\u00B4 (\u00CE\u00B8), p\u00CC\u0082M (\u00CE\u00B8 | D) = M i=1 \u00CE\u00B8 (4.1) 42 \u000CChapter 4 where \u00CE\u00B4\u00CE\u00B8 (\u00CE\u00B8(i) ) is the delta-Dirac function at \u00CE\u00B8(i) . From this approximation, the maximum a posteriori, expected mean and High Probability Distribution (HPD) interval can be calculated. For example, the expected mean is equal to M 1 X (i) E(\u00CE\u00B8 | D) \u00E2\u0089\u0088 \u00CE\u00B8 . M i=1 (4.2) The samples {\u00CE\u00B8(1) , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , \u00CE\u00B8(M ) } are drawn in such a way that the following relationship is satisfied, p(\u00CE\u00B8(M ) | \u00CE\u00B8(M \u00E2\u0088\u00921) , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , \u00CE\u00B8(1) ) = p(\u00CE\u00B8(M ) | \u00CE\u00B8(M \u00E2\u0088\u00921) ). (4.3) A random variable that satisfies the above relation is said to have the Markov property. Therefore, the sequence of draws of the parameter vector forms a Markov chain and this procedure of approximating density functions is called Markov Chain Monte Carlo approach. There are many variations of MCMC algorithm, and the general idea behind them is to construct the Markov chain in such a way that it draws more samples in regions of high probability of the target distribution, and as M approaches \u00E2\u0088\u009E, the approximation of the distribution will asymptotically be equal to the target distribution. In the following sections, two instances of MCMC, Metropolis-Hastings Algorithm and Gibbs Sampler, used in this work to approximate the posterior probability distribution of nonlinear process parameters, are introduced. 4.2 Metropolis-Hastings Algorithm: Inner Level Estimation The idea behind MCMC is to approximate the target distribution by generating random samples from a proposal distribution, which is chosen such that it has the same support as the target distribution. It is usually difficult to sample directly from the target distribution and hence a simple proposal distribution from which samples can be easily drawn is chosen. The samples from the proposal distribution are either accepted or rejected based on a criterion that allows acceptance 43 \u000CChapter 4 of samples from the target distribution with a high probability. Metropolis-Hastings algorithm (M-H) is a type of MCMC that was first developed by Metropolis in 1953 [38], then generalized by Hastings in 1970 [26]. It employs the acceptance-rejection approach to generate random samples from the desired target distribution and determine whether to accept each sample by computing an acceptance criterion [17]. This criterion, also known as the acceptance probability (\u00CE\u00B1), is computed through the use of a proposal probability distribution function, q(\u00CE\u00B8(i) | \u00CE\u00B8(i\u00E2\u0088\u00921) ). This expression is interpreted as \u00E2\u0080\u0098if the current value of the chain is \u00CE\u00B8(i\u00E2\u0088\u00921) , then the newly generated random sample is \u00CE\u00B8(i) \u00E2\u0080\u0099. There exist several different candidates for the proposal distribution. In this work, an approach called \u00E2\u0080\u0098independence sampling\u00E2\u0080\u0099, where the newly generated sample value does not depend on the current value of the chain, is used. This proposal distribution can be expressed as q(\u00CE\u00B8(i) ) (notice that the conditional term is eliminated) [14]. The quality of the target approximation using M-H is strongly influenced by the choice of the proposal distribution [2]. The following shows the step-by-step guide for implementing M-H algorithm, to approximate the expression for posterior distribution derived in the previous section, p(D | \u00CE\u00B8). 1. Choose an initial sample, \u00CE\u00B8(0) , such that p(\u00CE\u00B8(0) | D) > 0. 2. Repeat the following steps for \u00CE\u00B8(i) , where i = 1, \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , M. 3. From the proposal distribution of choice, q(\u00CE\u00B8), generate a random sample \u00CE\u00B8(i) . 4. Calculate the acceptance probability, \u00CE\u00B1 such that \u0014 \u0015 p(\u00CE\u00B8(i) | D1 ) q(\u00CE\u00B8(i\u00E2\u0088\u00921) ) \u00CE\u00B1 = min 1, q(\u00CE\u00B8(i) ) p(\u00CE\u00B8(i\u00E2\u0088\u00921) | D1 ) \u0015 \u0014 q(\u00CE\u00B8(i\u00E2\u0088\u00921) ) L(\u00CE\u00B8(i) | D) p0(\u00CE\u00B8(i) ) / Z = min 1, q(\u00CE\u00B8(i) ) L(\u00CE\u00B8(i\u00E2\u0088\u00921) | D) p0(\u00CE\u00B8(i\u00E2\u0088\u00921) ) / Z 44 \u000CChapter 4 where Z = R p(D | \u00CE\u00B8)p(\u00CE\u00B8)d\u00CE\u00B8. 5. If \u00CE\u00B1 = 1, then accept the \u00CE\u00B8(i) value, update the count to i = i + 1 and repeat from step 2. If \u00CE\u00B1 6= 1, then sample \u00CE\u00B2 \u00E2\u0088\u00BC U(0, 1) where U(0, 1) is a uniform distribution between 0 and 1. 6. If \u00CE\u00B2 < \u00CE\u00B1, accept the \u00CE\u00B8(i) value, update the count to i = i + 1 and repeat from step 2. If \u00CE\u00B2 \u00E2\u0089\u00A5 \u00CE\u00B1, discard \u00CE\u00B8(i) and repeat from step 2. Notice that when computing the acceptance probability, the normalizing constant involving complex integral term gets canceled, which is the major advantage of using M-H algorithm. As mentioned earlier, the choice of proposal distribution is very important for the success of the algorithm. Two different choices of independence sampling are examined in this thesis. The first one is a Gaussian distribution multiplied with some constant Q and the second one is the prior distribution corresponding to the Bayes Rule at each of the steps E1, \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , Ek. This discussion is presented in sections 4.2.1 and 4.2.2. The mechanism behind M-H\u00E2\u0080\u0099s acceptance probability is explained with a brief example shown in Figure 4.1. The target distribution that needs to be approximated is denoted with red curve and it is shown to be bimodal, asymmetric distribution. The proposal distribution is denoted with green curve in the figure. Let\u00E2\u0080\u0099s assume that the initial value of the chain is equal to 3 (\u00CE\u00B8(0) = 3), and using the proposal distribution, a new random sample \u00CE\u00B8 = 4.5 is generated. Then the acceptance probability for this new sample is calculated to be 0.39, using the equation introduced previously. Since \u00CE\u00B1 is smaller than 1, another random variable \u00CE\u00B2 is sampled from a uniform distribution between 0 and 1. The reason behind sampling \u00CE\u00B2 in steps 5 and 6 can be explained as follows. Generally, a sample moving from a higher probability region to a lower probability region is undesired, but is not always avoided. Therefore, the larger the \u00E2\u0080\u0098jump down\u00E2\u0080\u0099 from higher to lower probability region, the smaller is the chance of accepting that sample. The current example, for instance, has 39% chance of being accepted and 61% chance of being discarded. Let\u00E2\u0080\u0099s assume that \u00CE\u00B2 is equal to 0.78, then the sample 4.5 is discarded, and the current 45 \u000CChapter 4 value of \u00CE\u00B8 is accepted as the next sample (\u00CE\u00B8(1) = 3), making up the following Gibbs sequence of length 2, {3, 3}. Another value is sampled from the proposal distribution, and this time around assume that it is 6. In this case, the acceptance probability is 1. This is because the random sample \u00E2\u0080\u0098jumped up\u00E2\u0080\u0099 in the distribution to a higher region, and the new sample is accepted. Now the Gibbs sequence has length 3, {3, 3, 6}. The current sample now is \u00CE\u00B8(2) = 6 and the same procedure can be repeated until a desired length is reached. p(\u00CE\u00B8|D), q(\u00CE\u00B8) q(\u00CE\u00B8) : Proposal Distribution p(\u00CE\u00B8|D) : Target Distribution (Posterior Distribution) 0 2 4 \u00CE\u00B8 6 8 10 Figure 4.1: Metropolis-Hastings algorithm. The asymmetric red curve represents the target distribution that needs to be approximated (posterior distribution in this work). The green curve represents the proposal distribution chosen by the practitioner. The three points are the random samples of \u00CE\u00B8 = 3, 4.5, 6 with p(\u00CE\u00B8)/q(\u00CE\u00B8) is equal to 0.5427, 0.2157, 0.6785, respectively. Another instance of MCMC that is recently popularized is the Simulated Annealing (SA) algorithm. The SA algorithm was developed by borrowing the concept used in metallurgy where the quality of the material is controlled by implementing a cooling schedule that adapts as time evolves. The users of SA agree that if the ultimate goal of approximating the probability distribution is to obtain the MAP, it is wasteful in terms of computational resources to sample from the lower probability regions. This is because high probability regions of a distribution are concentrated around its mode, and hence the computational resources can be concentrated on the high probability regions. The algorithm is explained in more detail in [23], [30], [41], [52]. Though this method is computationally more efficient, the approximated probability distribution is not 46 \u000CChapter 4 the true representation of the target distribution, but an altered form of the distribution of which the sole purpose is to obtain the MAP value, and this is illustrated in Figure 4.2. Both of the histograms shown in the figure are plotted from Markov Chain having length M = 5000, but SA generated histogram is clearly shown to favor the higher probability region and thus is very efficient for obtaining MAP. Due to this reason, SA is not suitable for application in the work developed in this thesis. In this work, the prior distribution is updated sequentially in order to systematically merge experimental data sets and hence a good approximation of the complete distribution, rather an approximation for MAP, is needed. The parameter estimation method in this work places high priority on as closely estimating the probability distributions under consideration as possible without the assumption of Gaussian distribution. This will allow proper representation of the information extracted from the experimental data. Therefore M-H algorithm was chosen for implementation even though there exists computationally more efficient choices of MCMC. Figure 4.2: Metropolis-Hastings Algorithm vs. Simulated Annealing. The true target distribution form is denoted with a solid black curve and the histograms generated from the Markov Chain using the two MCMC methods are shown as well. The panel on the left show the Metropolis-Hastings Algorithm generated Markov Chain\u00E2\u0080\u0099s histogram and the panel on the right show the Simulated-Annealing generated Markov Chain\u00E2\u0080\u0099s histogram [2]. 47 \u000CChapter 4 4.2.1 Proposal distribution I : Gaussian distribution The proposal distribution in MH needs to cover the entire target distribution\u00E2\u0080\u0099s probability space, such that q(\u00CE\u00B8) \u00E2\u0089\u00A5 p(\u00CE\u00B8 | D) for all \u00CE\u00B8. When using Gaussian distribution, this specification can be easily met by choosing the standard deviation to be wide enough and by multiplying the distribution with a constant Q. Using the Gaussian proposal distribution, consider approximating the first posterior distribution of \u00CE\u00B1y of FFL model, p(\u00CE\u00B1y | D1 ), where the prior distribution is U(0, 1) such that, p0 (\u00CE\u00B8) = \u00EF\u00A3\u00B1 \u00EF\u00A3\u00B4 \u00EF\u00A3\u00B4 \u00EF\u00A3\u00B21 if 0 < \u00CE\u00B1y \u00E2\u0089\u00A4 1, (4.4) \u00EF\u00A3\u00B4 \u00EF\u00A3\u00B4 \u00EF\u00A3\u00B30 otherwise In the first step, computing \u00CE\u00B1 is straight forward because the prior distribution term of the current sample and the future sample are equal to each other and are easily computed. However, for step E2, where the prior distribution is set equal to the approximation of the first posterior, p\u00CC\u00821 (D | \u00CE\u00B1y ), calculation of the acceptance probability is a bit more complicated. Calculation of acceptance probability requires the information regarding the histogram of the Markov chain, in particular the bin-index and the number of elements within the bin. A MATLAB R program that approximates the value of prior distribution function is shown below. A couple of approximations take Program 4.1 MATLAB program that approximates the value of prior distribution p\u00CE\u00BA (\u00CE\u00B8). % approximating the posterior-prior distribution [n,x] = hist(theta_v(:,1),20); % generating new sample from proposal distribution theta_new = Q*(0.5 + randn*sigma); while x(i) >=theta_new % determining the index number where the new % sample belongs i = i+1; end prior(theta_new) = n(i); place during the implementation of the M-H algorithm. Theoretically, the approximate distribution from M-H algorithm will converge to the target distribution only if the number of samples is infinite. However, in practice, only a finite number of samples are used. The second approxi48 \u000CChapter 4 mation is the one shown in the program above where the value of the probability distribution is numerically approximated using the hist function in MATLAB R . 4.2.2 Proposal distribution II : a priori distribution The proposal distribution for M-H can be chosen to be the prior distribution. In other words, if the following posterior distribution needs to be approximated, L(\u00CE\u00B8 | D\u00CE\u00BA ) p\u00CE\u00BA\u00E2\u0088\u00921 (\u00CE\u00B8) p\u00CE\u00BA (\u00CE\u00B8 | D\u00CE\u00BA ) = R , p(D\u00CE\u00BA | \u00CE\u00B8) p(\u00CE\u00B8) d\u00CE\u00B8 \u00CE\u00BA = 1, 2, \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , k (4.5) the proposal distribution is, q(\u00CE\u00B8) := p\u00CE\u00BA\u00E2\u0088\u00921 (\u00CE\u00B8) (4.6) By the above definition, the acceptance probability of random samples for approximation step E\u00CE\u00BA is calculated as follows. \u0015 \u0014 q(\u00CE\u00B8(i\u00E2\u0088\u00921) ) p\u00CE\u00BA (\u00CE\u00B8(i) | D\u00CE\u00BA ) \u00CE\u00B1 = min 1, q(\u00CE\u00B8(i) ) p\u00CE\u00BA (\u00CE\u00B8(i\u00E2\u0088\u00921) | D\u00CE\u00BA ) \u0014 \u0015 L(\u00CE\u00B8(i) | D\u00CE\u00BA ) p\u00CE\u00BA\u00E2\u0088\u00921(\u00CE\u00B8(i) ) / Z p\u00CE\u00BA\u00E2\u0088\u00921 (\u00CE\u00B8(i\u00E2\u0088\u00921) ) = min 1, p\u00CE\u00BA\u00E2\u0088\u00921 (\u00CE\u00B8(i) ) L(\u00CE\u00B8(i\u00E2\u0088\u00921) | D\u00CE\u00BA ) p\u00CE\u00BA\u00E2\u0088\u00921 (\u00CE\u00B8(i\u00E2\u0088\u00921) ) / Z \u0014 \u0015 L(\u00CE\u00B8(i) | D\u00CE\u00BA ) = min 1, L(\u00CE\u00B8(i\u00E2\u0088\u00921) | D\u00CE\u00BA ) where Z = R (4.7) p(D\u00CE\u00BA | \u00CE\u00B8) p(\u00CE\u00B8) d\u00CE\u00B8. Notice that by using (4.6), the acceptance probability is only dependent on the likelihood values as a function of the current value of the proposed parameter value. The proposal distribution is updated along with the prior distribution after each step of evaluating the posterior, E1, \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , Ek. 49 \u000CChapter 4 4.3 Gibbs Sampler : Outer Level Estimation In this part of the work, to approximate the multi-dimensional joint probability distribution of parameters of a nonlinear process, a variant of MCMC called Gibbs sampler is used. This particular MCMC approximation method is a special case of Metropolis-Hastings algorithm where the proposal distribution, q(\u00CE\u00B8), is defined specifically as the set of distributions of individual parameters conditional on the values of the rest of the parameters. Using the Gibbs sampler, the marginal distributions of individual parameters are calculated from which the maximum a posteriori, expected value and standard deviation of the distributions are calculated [40]. To illustrate this algorithm, consider the FFL genetic regulatory network model with the parameter vector, \u00CE\u00B8 = [\u00CE\u00B1y , \u00CE\u00B1z , Kxy , Kxz , Kyz ] \u00E2\u0088\u0088 \u00E2\u0084\u009C5 . For example, the marginal probability distribution of \u00CE\u00B1y is computed by a series of integrations of the joint probability distribution as follows. p(\u00CE\u00B1y ) = Z Kyz Z Kxz Z Kxy Z p(\u00CE\u00B1y , \u00CE\u00B1z , Kxy , Kxz , Kyz ) d\u00CE\u00B1z dKxy dKxz dKyz (4.8) \u00CE\u00B1z The equation contains integrals that are often difficult to solve analytically. However, a Gibbs (0) (1) (M ) sequence with Markov property, {\u00CE\u00B1y , \u00CE\u00B1y , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , \u00CE\u00B1y } (where M is the length of the Gibbs sequence) can be generated so that the marginal distribution and its statistical properties can be approximated as in (4.2). In order to implement the Gibbs sampler, the following set of conditional probability distribution functions are needed, p(\u00CE\u00B1y | \u00CE\u00B1z , Kxy , Kxz , Kyz ), p(\u00CE\u00B1z | \u00CE\u00B1y , Kxy , Kxz , Kyz ), p(Kxy | \u00CE\u00B1y , \u00CE\u00B1z , Kxz , Kyz ), p(Kxz | \u00CE\u00B1y , \u00CE\u00B1z , Kxy , Kyz ), p(Kyz | \u00CE\u00B1y , \u00CE\u00B1z , Kxy , Kxz ). (4.9) 50 \u000CChapter 4 With many dynamic process models, there is no general solution for calculating the conditional distributions of process parameters. Previous work on using Gibbs sampler assumed Gaussian distribution, with some heuristic values for its mean and standard deviation, as the conditional distribution of individual parameters [8, 21]. This assumption may apply to linear processes, but becomes questionable when dealing with nonlinear processes. However, these conditional distributions can be numerically approximated using Metropolis-Hastings algorithm, which forms the inner level of iterations of the algorithm proposed in the next section, and the Gibbs sampler forms the outer level of iterations. The following illustrate the steps of Gibbs sampler using FFL example. (0) (0) (0) (0) 1. Assign initial values \u00CE\u00B1z , Kxy , Kxz , Kyz for \u00CE\u00B1z , Kxy , Kxz , Kyz . 2. Repeat the following steps for i = 0, \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , M \u00E2\u0088\u0092 1 3. Approximate the conditional distribution of \u00CE\u00B1y by applying the experimental data sets (i+1) to sequential M-H algorithm. Generate a value \u00CE\u00B1y by randomly sampling from the conditional distribution (i) (i) (i) \u00CE\u00B1y(i+1) \u00E2\u0088\u00BC p\u00CC\u0082(\u00CE\u00B1y | \u00CE\u00B1z(i) , Kxy , Kxz , Kyz , D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , Dk ). (4.10) 4. Approximate the conditional distribution of \u00CE\u00B1z by applying the experimental data sets (i+1) to sequential M-H algorithm. Generate a value \u00CE\u00B1z by randomly sampling from the conditional distribution (i) (i) (i) \u00CE\u00B1z(i+1) \u00E2\u0088\u00BC p(\u00CE\u00B1z | \u00CE\u00B1y(i+1) , Kxy , Kxz , Kyz , D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , Dk ). (4.11) 5. Approximate the conditional distribution of Kxy by applying the experimental data sets (i+1) to sequential M-H algorithm. Generate a value Kxy by randomly sampling from the 51 \u000CChapter 4 conditional distribution (i+1) (i) (i) Kxy \u00E2\u0088\u00BC p(Kxy | \u00CE\u00B1y(i+1) , \u00CE\u00B1z(i+1) , Kxz , Kyz , D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , Dk ). (4.12) 6. Approximate the conditional distribution of Kxz by applying the experimental data sets (i+1) to sequential M-H algorithm. Generate a value Kxz by randomly sampling from the conditional distribution (i+1) (i+1) (i) Kxz \u00E2\u0088\u00BC p(Kxz | \u00CE\u00B1y(i+1) , \u00CE\u00B1z(i+1) , Kxy , Kyz , D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , Dk ). (4.13) 7. Approximate the conditional distribution of Kyz by applying the experimental data sets (i+1) to sequential M-H algorithm. Generate a value Kyz by randomly sampling from the conditional distribution (i+1) (i+1) (i+1) Kyz \u00E2\u0088\u00BC p(Kyz | \u00CE\u00B1y(i+1) , \u00CE\u00B1z(i+1) , Kxy , Kxz , D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , Dk ). (4.14) 8. Update the count i = i + 1. A single Gibbs step consists of updating the values of the random variables once (e.g. {x(0) , y (0) , z (0) } \u00E2\u0086\u0092 {x(1) , y (1) , z (1) } is one step). Within a single Gibbs step, there are m number of Metropolis-Hastings approximations of posterior distribution, where m is the length of the process parameter vector, \u00CE\u00B8. Within a single M-H approximation of posterior distribution, k evolving posterior distributions are computed. Therefore, there is a large number of different instances of conditional distribution functions being calculated while using the Metropolis-Hastings & Gibbs sequence approach. The experimental data sets are used more than once in these iterations. In each MetropolisHastings approximation step, the conditional distribution of the parameter values changes, and therefore the subsequent conditional distributions must account for this. For example, we can 52 \u000CChapter 4 compare three conditional distributions that are approximated as follows, 1. f1 = f (\u00CE\u00B1y ) = p(\u00CE\u00B1y |\u00CE\u00B1z = \u00CF\u00862 , Kxy = \u00CF\u00863 , Kxz = \u00CF\u00864 , Kyz = \u00CF\u00865 , D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , Dk ) 2. f2 = f (\u00CE\u00B1z ) = p(\u00CE\u00B1z |\u00CE\u00B1y = \u00CF\u00952 , Kxy = \u00CF\u00953 , Kxz = \u00CF\u00954 , Kyz = \u00CF\u00955 , D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , Dk ) 3. f3 = f (Kxy ) = p(Kxy |\u00CE\u00B1y = \u00CF\u00951 , \u00CE\u00B1z = \u00CF\u00952 , Kxz = \u00CF\u00954 , Kyz = \u00CF\u00955 , D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , Dk ) where \u00CF\u0086 6= \u00CF\u0095. f1 and f2 are both functions of \u00CE\u00B1z , but computed using different sets of conditions. f2 and f3 have somewhat similar conditions, however they are functions of different parameters. Since the computational conditions are different in these functions, the experimental data set, D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , Dk , can be used repeatedly without over-exerting its \u00E2\u0080\u0098information database\u00E2\u0080\u0099. As mentioned previously, as M, the number of random samples generated, approaches \u00E2\u0088\u009E, the sequence can accurately approximate the desired target distribution. There are several ways to determine finite M where a sufficient accuracy of the approximation is reached. Similarly, there are several ways of detecting convergence of the approximation agreement to a steadystate distribution. Works by Gelfand et al.[21] and Gelfand and Smith [22] suggest monitoring distribution approximations from multiple independent Gibbs sequences, and choosing M to be the point where the distributions formed by the multiple chains with different initial conditions appear the same. An alternative method of choosing M is to implement the Raftery-Lewis criterion, also known as binary-control, which determines the value of M corresponding to the desired accuracy and avoids excessive sampling. The approach uses a two-state Markov chain model by analyzing a single run of Markov chain of output values. From the two-state Markov chain model, the length of the burn-in period is computed and the number of iterations required to meet the specified accuracy can be computed [44]. 53 \u000CChapter 4 4.3.1 Multi-phase Gibbs sampler When using Gibbs sampler, the rate of convergence of different parameters can vary significantly. Some parameters will approach their steady-state distribution very fast, and hence increasing the number of Gibbs iterations would result in negligible change in the distribution of the corresponding parameters. Since each Gibbs iteration is divided into multiple MetropolisHastings steps that require a considerable amount of computational cost, the parameters that reached their steady-state distribution can be removed from the individual Metropolis-Hastings approximations. This is achieved by fixing the distributions of converged parameters and only updating the distributions of the remaining parameters. For instance, if the distributions of parameters \u00CE\u00B1y and \u00CE\u00B1z reach their respective steady-states before the other three parameters after M Gibbs iterations were executed, then the approximated marginal probability distribution of p(I) (\u00CE\u00B1y ) and p(I) \u00CE\u00B1z (using the M samples, (I) denotes Phase I) will have negligible difference between the marginal probability distribution obtained from executing G more Gibbs iteration, p(II) (\u00CE\u00B1y ) and p(II) (\u00CE\u00B1z ) (using M + G samples, (II) denotes Phase II). If the other three parameters Kxy , Kxz and Kyz did not reach steady-state by the Mth Gibbs iteration, following additional steps to the original algorithm discussed in the previous section are required as follows. 1. Repeat the following steps for i = M + 1, \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , M + G (i+1) 2. Generate a value \u00CE\u00B1y by randomly sampling from the conditional distribution \u00CE\u00B1y(i+1) \u00E2\u0088\u00BC p(I) (\u00CE\u00B1y ) (i+1) 3. Generate a value \u00CE\u00B1z (4.15) by randomly sampling from the conditional distribution \u00CE\u00B1z(i+1) \u00E2\u0088\u00BC p(I) (\u00CE\u00B1z ) (4.16) 4. Follow the Steps (4.12) to (4.14) 5. Update the count i = i + 1. 54 \u000CChapter 4 Using this semi-fixed distribution generated from previous phase is essentially the same as generating a new MH conditional distribution because those distributions, having reached their respective steady states, will not alter much with progressive random sampling. Each parameter eliminated from M-H step for computing their conditional distributions will result in 1/m\u00C3\u0097100% reduction in computational cost after the Phase I. This approach can be adopted in several phases to further optimize the computational resources. 4.4 Sequential Metropolis-Hastings and Gibbs Algorithm The previous two sections discussed the MCMC methods, Metropolis-Hastings algorithm and Gibbs sampler. These two random sampling techniques are integrated in order to approximate multi-dimensional, asymmetric, multi-modal probability distributions of parameters of nonlinear dynamic processes. The proposed method uses a sequential approach to approximate the full probability distributions of parameters without making any assumptions about the shape or variance of the probability distributions. By discarding the misleading assumptions that are only applicable to linear processes, the method preserves the information available from different experimental runs in the form of probability distributions of the process parameters. The following two figures summarize the sequential approach taken in this thesis. Figure 4.3 illustrates the outer level of iterative estimation where the multi-dimensionality of the probability distribution is handled. \u00CE\u00B8 denotes the parameter vector of dimension \u00E2\u0084\u009Cp\u00C3\u00971 ; superscript (i) denotes the Gibbs index in the chain of random samples generated by the algorithm; subscript j denotes the index of the parameter vector. Figure 4.4 illustrates the inner level or iterative estimation that approximates the univariate posterior distribution of the process parameters using multiple data sets. This process is embedded in the Gibbs Sampler as a means to compute the conditional distribution required in the algorithm. The input of this flowchart from the outer level of iterations is j (e.g. the jth element in the vector of \u00CE\u00B8 that is currently being considered in the Gibbs sampling iteration). The prior distribution, p0 (\u00CE\u00B8) (before applying any experimental data), is user-defined. \u00CE\u00BA indicates the index of experimental data set and k is the total number of available sets. (h) 55 \u000CChapter 4 is the Metropolis-Hastings index in the current M-H Markov chain (not to be confused with the Gibbs index (i)). Figure 4.3: Flowchart of Gibbs Sampler for outer level of iterative estimation, where multidimensional probability distribution of nonlinear process parameters is approximated. \u00CE\u00B8 denotes the parameter vector of dimension \u00E2\u0084\u009Cp\u00C3\u00971 ; superscript (i) denotes the Gibbs index in the chain of random samples generated by the algorithm; subscript j denotes the index of the parameter vector. 56 \u000CChapter 4 Figure 4.4: Metropolis-Hastings Algorithm for inner level of iterative estimation, where the univariate conditional distribution of posterior distribution is approximated. The conditional distribution is required for implementation of Gibbs Sampler. The input of this flowchart from the outer level of iteration is j (e.g. the element in the vector of \u00CE\u00B8 is currently considered in the Gibbs Sampling). The prior distribution, p0 (\u00CE\u00B8 (before applying any experimental data), is user-defined. \u00CE\u00BA indicates the index of experimental data among the multiple data sets, where k is the total number of available sets. [h] is the Metropolis-Hastings index in the current MH Markov chain. 57 \u000CChapter 5 Case Studies The sequential Bayesian parameter estimation method discussed in the previous chapters is illustrated using three nonlinear biological systems - batch fermentation, Feed-Forward Loop genetic regulatory network and JAK-STAT signal pathway. Both published experimental data and simulated data are used. The estimated probability distributions of the process parameter vectors are analyzed for identifiability, correlation among the parameters and sensitivity of observations. It is argued that estimating the full probability distributions of nonlinear parameters allows improved confidence in parameters compared to point estimates. 5.1 Batch Fermentation Reaction 5.1.1 Single Parameter Estimation In order to illustrate the inner-loop estimation method using Metropolis-Hastings algorithm, a single parameter, YXS is estimated using the following assumptions: i) All three state variables are measurable, and ii) the values of \u00C2\u00B5m , ks , kp and YP X are known, reducing the parametric space from five dimensions to one-dimension. Thus, the parameter vector is \u00CE\u00B8\u00E2\u0080\u00B2 = \u00CE\u00B8 / {\u00C2\u00B5m = 0.15, ks = 0.50, kp\u00E2\u0080\u00B2 = 0.25, YP\u00E2\u0080\u00B2 X = 0.20} = {YXS }. The prior distribution, p0 (YXS ), is assumed to be uniform. Previous literature and expert knowl- 58 \u000CChapter 5 edge indicates a lower and an upper bound on YXS of 0 and 1 respectively. p0 (YXS ) = \u00EF\u00A3\u00B1 \u00EF\u00A3\u00B4 \u00EF\u00A3\u00B4 \u00EF\u00A3\u00B21 \u00EF\u00A3\u00B4 \u00EF\u00A3\u00B4 \u00EF\u00A3\u00B30 if 0 < YXS \u00E2\u0089\u00A4 1, (5.1) otherwise With this prior probability distribution and likelihood function (the derivation is explained in Appendix B), the M-H algorithm was applied to approximate the final probability distribution of YXS from six simulated data sets, D1 , D2 , D3 , D4 , D5 and D6 . p(YXS | \u00C2\u00B5m = 0.15, ks = 0.5, kP\u00E2\u0080\u00B2 = 0.25, YP\u00E2\u0080\u00B2 X = 0.2, D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) (5.2) The algorithm was run for 10000 iterations for each step of applying successive experimental data. The first 5000 samples in each sequence were discarded to avoid the \u00E2\u0080\u0098burn-in\u00E2\u0080\u0099 effect. The evolving behavior of posterior distributions is clearly illustrated in Figure 5.1. Starting from Panel (A), the first posterior probability distribution already indicates the Markov Chain\u00E2\u0080\u0099s higher affinity towards the region near the true value. In Panel (F), the approximated posterior distribution is shown to form a sharp peak close to the true value, indicated by the solid vertical lines. The range of x-axes of the sub-figures in Figure 5.1 was kept constant in the [0, 1] interval in order to illustrate the dramatic evolution of probability distributions. The variance of the probability distributions cannot be calculated straightforwardly as in the case of Gaussian distributed random variables, because of the asymmetrical distribution of the parameters. Therefore, the approximated probability distributions are analyzed individually to obtain the 95% HPD interval. Table 5.1 summarizes the 95% HPD intervals of the estimated posterior probability distributions as well as their expected mean values. After each successive M-H step, the approximate posterior probability distribution shows higher confidence due to the decreasing trend in the 95% Highest Probability Density (HPD) interval. 59 \u000CChapter 5 0.8 1 (C) 0.2 0.4 0.6 YXS 0.8 p(YXS|D1,...,D5) 0 1 (E) 0 0.2 0.4 0.6 YXS 0.8 0 1 0.2 0.4 0.6 YXS 0.8 p(YXS|D1,...,D4) 0.4 0.6 YXS 1 (D) 0 0.2 0.4 0.6 YXS 0.8 p(YXS|D1,...,D6) 0.2 p(YXS|D1,...D3) 0 (B) p(YXS|D1,D2) p(YXS|D1) (A) 1 (F) 0 0.2 0.4 0.6 YXS 0.8 1 R Figure 5.1: Each probability distribution is normalized so that p(YXS | Di) is equal to unity. The vertical line at YXS = 0.25 corresponds to the true value of the parameter. Panel (A) corresponds to the posterior probability distribution of YXS estimated using the first experimental data set, D1 Panel (A) : p(YXS | \u00C2\u00B5m = 0.15, ks = 0.5, kP\u00E2\u0080\u00B2 = 0.25, YP\u00E2\u0080\u00B2 X = 0.2, D1 ), Panel (B) : p(YXS | \u00C2\u00B5m = 0.15, ks = 0.5, kP\u00E2\u0080\u00B2 = 0.25, YP\u00E2\u0080\u00B2 X = 0.2, D1, D2 ), Panel (C) : p(YXS | \u00C2\u00B5m = 0.15, ks = 0.5, kP\u00E2\u0080\u00B2 = 0.25, YP\u00E2\u0080\u00B2 X = 0.2, D1, D2 , D3 ), Panel (D) : p(YXS | \u00C2\u00B5m = 0.15, ks = 0.5, kP\u00E2\u0080\u00B2 = 0.25, YP\u00E2\u0080\u00B2 X = 0.2, D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D4 ), Panel (E) : p(YXS | \u00C2\u00B5m = 0.15, ks = 0.5, kP\u00E2\u0080\u00B2 = 0.25, YP\u00E2\u0080\u00B2 X = 0.2, D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D5 ), Panel (F) : p(YXS | \u00C2\u00B5m = 0.15, ks = 0.5, kP\u00E2\u0080\u00B2 = 0.25, YP\u00E2\u0080\u00B2 X = 0.2, D1, \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) 60 \u000CChapter 5 The rest of the parameters were estimated using an analogous approach. This was done to demonstrate that in the case of a single parameter process, the M-H algorithm is good enough to approximate the corresponding posterior probability distribution from multiple experimental data sets. Figure 5.2 shows the normalized distribution of each parameter. The expected mean values and 95% HPD intervals are shown in Table 5.2. It is shown that ks and kP have 95% HPD intervals of relatively larger magnitude compared to the three other parameters, \u00C2\u00B5m , YXS and YP X . This discrepancy can be attributed to the innate property of the model. It has been shown in previous studies that the saturation constant parameters of the Michaelis-Menten kinetic model are theoretically identifiable in deterministic cases, but are difficult to estimate when the experimental data are corrupt with stochastic noise [3, 27]. Even so, M-H algorithm is successful in estimating the full probability distribution of these parameters from nonlinear stochastic time series data with a small bias. An interesting aspect of the single parameter estimation using M-H algorithm is that it does not require an initial guess. A major disadvantage of traditional parameter estimation methods such as maximum likelihood estimator (MLE) or nonlinear least-squares (NLS) is that they require an initial guess in order to start the algorithm. If there are several local minima for the objective functions of MLE and NLS, then the choice of initial guess becomes critical to the estimation result. However, in M-H algorithm, it only requires that the initial prior probability distribution, p0 , is defined so that it contains the true value. In order to demonstrate this, following two different probability distributions of YXS were assigned to the initial prior probability distribution and M-H algorithm was executed. p0 (YXS ) = U(0, 10) p0 (YXS ) = U(\u00E2\u0088\u00921, 1) where U(a, b) indicates a uniform distribution between a and b. For the approximation of each successive posterior probability distribution, 10000 iterations were executed and the first 5000 61 \u000CChapter 5 Table 5.1: The expected means and 95% Highest Probability Density (HPD) intervals of the estimated posterior probability distributions YXS using MH algorithm approximation. Expected Mean p(YXS |\u00C2\u00B5m , ks , kP\u00E2\u0080\u00B2 , YP\u00E2\u0080\u00B2 X , D1 ) p(YXS |\u00C2\u00B5m , ks , kP\u00E2\u0080\u00B2 , YP\u00E2\u0080\u00B2 X , D1 , D2 ) p(YXS |\u00C2\u00B5m , ks , kP\u00E2\u0080\u00B2 , YP\u00E2\u0080\u00B2 X , D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D3 ) p(YXS |\u00C2\u00B5m , ks , kP\u00E2\u0080\u00B2 , YP\u00E2\u0080\u00B2 X , D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D4 ) p(YXS |\u00C2\u00B5m , ks , kP\u00E2\u0080\u00B2 , YP\u00E2\u0080\u00B2 X , D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D5 ) p(YXS |\u00C2\u00B5m , ks , kP\u00E2\u0080\u00B2 , YP\u00E2\u0080\u00B2 X , D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) 0.338 0.278 0.256 0.251 0.251 0.250 95% HPD Intervals Lower Bound Upper Bound 0.035 0.757 0.086 0.466 0.161 0.350 0.223 0.290 0.234 0.273 0.237 0.269 Table 5.2: The expected means and 95% Highest Probability Density (HPD) intervals of the estimated posterior probability distributions of \u00CE\u00B8 using MH algorithm approximation. Expected Mean p(\u00C2\u00B5m |ks , kP\u00E2\u0080\u00B2 , YXS , YP\u00E2\u0080\u00B2 X , D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) p(ks |\u00C2\u00B5m , kP\u00E2\u0080\u00B2 , YXS , YP\u00E2\u0080\u00B2 X , D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) p(kp\u00E2\u0080\u00B2 |\u00C2\u00B5m , ks , YXS , YP\u00E2\u0080\u00B2 X , D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) p(YXS |\u00C2\u00B5m , ks , kP\u00E2\u0080\u00B2 , YP\u00E2\u0080\u00B2 X , D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) p(YP\u00E2\u0080\u00B2 X |\u00C2\u00B5m , ks , kP\u00E2\u0080\u00B2 , YXS , D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) 0.152 0.488 0.220 0.250 0.201 95% HPD Intervals Lower Bound Upper Bound 0.134 0.170 0.360 0.607 0.056 0.399 0.237 0.269 0.190 0.213 62 \u000CChapter 5 (B) m 1 6 p(ks|D1,...D6) p(\u00C2\u00B5 |D ,...D ) (A) 0.12 0.14 0.16 \u00C2\u00B5m 0.18 0.2 0.3 0.5 ks 0.7 (D) p 1 6 p(k \u00E2\u0080\u0099|D ,...,D ) p(YXS|D1,...D6) (C) 0 0.1 0.2 0.3 0.4 0.5 kp\u00E2\u0080\u0099 0.22 0.24 0.26 0.28 YXS p(Y PX 1 6 \u00E2\u0080\u0099|D ,...D ) (E) 0.18 0.19 0.2 YPX\u00E2\u0080\u0099 0.21 0.22 Figure 5.2: Normalized posterior distributions of the parameter vector \u00CE\u00B8, approximated using Metropolis-Hastings algorithm with 6 independently simulated batch reactor data sets while assuming that the true values of all other parameters are known. Panel (A) : p(\u00C2\u00B5m | ks = 0.5, kP\u00E2\u0080\u00B2 = 0.25, YXS = 0.25, YP\u00E2\u0080\u00B2 X = 0.2, D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) Panel (B) : p(ks | \u00C2\u00B5m = 0.15, kP\u00E2\u0080\u00B2 = 0.25, YXS = 0.25, YP\u00E2\u0080\u00B2 X = 0.2, D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) Panel (C) : p(kP | \u00C2\u00B5m = 0.15, ks = 0.5, YXS = 0.25, YP\u00E2\u0080\u00B2 X = 0.2, D1, \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) Panel (D) : p(YXS | \u00C2\u00B5m = 0.15, ks = 0.5, kP\u00E2\u0080\u00B2 = 0.25, YP\u00E2\u0080\u00B2 X = 0.2, D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) Panel (E) : p(YP X | \u00C2\u00B5m = 0.15, ks = 0.5, kP\u00E2\u0080\u00B2 = 0.25, YXS = 0.25, D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) 63 \u000CChapter 5 samples were discarded before using the remaining sequence to update the next prior probability distribution. The comparative results are shown in Figure 5.3. It is easy that as long as the uniform distribution contains the true value, the algorithm is successful. For the second row (in Figure 5.3), the uncertainty of the order of magnitude before the estimation was increased by one (i.e. interval (0,1) to interval (0,10)), and the approximated posterior probability distribution still pointed to an expected mean of 0.259, resulting in normalized error of 3.4%. Further simulations with an even higher level of a priori uncertainty were tried and the estimation was found to be equally good. For the third row, where the prior contains negative region, which is physically infeasible because the yield coefficient cannot be negative, the proposed method was still effective. 5.1.2 Multiple Parameter Estimation After confirming that conditional probability distributions can be successfully approximated using M-H algorithm, Gibbs sampler is implemented in order to estimate the multi-dimensional probability distribution of \u00CE\u00B8. The order of parameters estimated in Gibbs sampler was arranged as follows \u00C2\u00B5m \u00E2\u0086\u0092 ks \u00E2\u0086\u0092 kp \u00E2\u0086\u0092 YXS \u00E2\u0086\u0092 YP X . (5.3) The Gibbs sampler was run for 1000 iterations, with 3000 M-H algorithm iterations per parameter per Gibbs sampling step. The first 20% of the Markov sequences generated using M-H algorithm were discarded in order to eliminate the \u00E2\u0080\u0098burn-in\u00E2\u0080\u0099 effect. Figure 5.4 shows the plot of 1000 Gibbs samples drawn for \u00C2\u00B5m and the approximated marginal distribution, p(\u00C2\u00B5m | D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ). The expected mean is 0.177 with the 95% HPD interval of (0.124,0.291). There are two distinct deviations from the true value in the Gibbs sequence, shown near the 500th iteration and the 650th iteration. These deviations give rise to a skewed probability distribution for this parameter. This type of asymmetrical probability distribution is 64 \u000CChapter 5 (A) p(Y 0 XS p (Y 1 XS ) 6 |D ,..D ) (B) 0 0.2 0.4 0.6 0.8 1 0.1 0.2 Y XS 0.3 Y 0.4 0.5 XS (D) p(Y 0 XS p (Y 1 XS ) 6 |D ,...D ) (C) 0 2 4 6 8 10 0.1 0.2 YXS 0.3 YXS 0.4 0.5 (F) 0 p (Y 0 XS p (Y 1 XS ) 6 |D ,...,D ) (E) \u00E2\u0088\u00921 \u00E2\u0088\u00920.5 0 YXS 0.5 1 0.1 0.2 0.3 YXS 0.4 0.5 Figure 5.3: Normalized uniform prior distributions of YXS and the corresponding posterior probability distribution obtained using MH algorithm. The true value of YXS is indicated by solid vertical lines. Panel (A) : p0 (YXS ) = U(0, 1) Panel (B) : p(YXS |\u00C2\u00B5m , ks , kP\u00E2\u0080\u00B2 , YP\u00E2\u0080\u00B2 X , D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) Panel (C) : p0 (YXS ) = U(0, 10) Panel (D) : p(YXS |\u00C2\u00B5m , ks , kP\u00E2\u0080\u00B2 , YP\u00E2\u0080\u00B2 X , D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) Panel (E) : p0 (YXS ) = U(\u00E2\u0088\u00921, 1) Panel (F) : p(YXS |\u00C2\u00B5m , ks , kP\u00E2\u0080\u00B2 , YP\u00E2\u0080\u00B2 X , D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) 65 \u000CChapter 5 characteristic of parameters in nonlinear processes. This example illustrates that even though the added measurement noise is Gaussian, due to the nonlinearity of model, the resulting estimated parameters show non-Gaussian distribution. When using MCMC sampling approach, it is important to determine how long the Markov chain has to be in order to obtain desired accuracy in approximation. There are several ways of doing this and monitoring the moving average of Markov chain is one of them. It helps to determine whether the sequence has reached steady-state distribution. Once the chain has reached its steady-state, it is generally accepted that the chain has converged to the target distribution with sufficient accuracy. The top panel in Figure 5.5 shows the moving average of \u00C2\u00B5m Gibbs sequence and it is noted that there are slight initial fluctuations as the sequence explores the parameter space and gradually settles to a steady-state value. Another method to determine whether a sufficient length of the Markov chain has been generated is to monitor the behavior of the approximated distribution at different iterations. As the convergence is reached, the distributions approximated at increasing iterations will show negligible difference in their form. In Figure 5.5, panels (C), (D) and (E) look almost identical with positive skew, where panel (C) is the approximated marginal distribution of \u00C2\u00B5m using the Gibbs sequence from 200th iteration to 600th iteration; panel (D) corresponds to the approximated distribution using the Gibbs sequence from 200th iteration to 800th iteration; and panel (E) corresponds to the approximated distribution using the Gibbs sequence from 200th iteration to the 1000th iteration (The first 200 samples of the Gibbs sequence were discarded to remove the \u00E2\u0080\u0098burn-in\u00E2\u0080\u0099 effect). The constantshape trend demonstrates that the convergence of the chain is reached around 600th iteration. The parameters, YXS and YP\u00E2\u0080\u00B2 X , demonstrated behavior similar to that of \u00C2\u00B5m . However, for ks and kP\u00E2\u0080\u00B2 , as mentioned in the single parameter estimation case, it was difficult to obtain comparable accuracy of estimated values from the approximated marginal probability distributions. Thus, it was necessary to execute the Gibbs sampler for larger number of iterations in order to ensure that these two parameters reached their steady-state distribution. This, however, requires a larger 66 \u000CChapter 5 0.35 0.3 \u00C2\u00B5 m 0.25 0.2 0.15 0.1 0 100 200 300 400 500 Gibbs Iteration 600 700 800 900 1000 p(\u00C2\u00B5 |D ,...D ) m 1 6 Figure 5.4: Plot of Gibbs sequence corresponding to \u00C2\u00B5m for 1000 iterations and the approximated marginal distribution using the sequence. The dotted horizontal line corresponds to the true value. 0.18 0.16 0 100 200 400 0.2 \u00C2\u00B5m 0.4 600 0 0.2 \u00C2\u00B5m 700 (C) 0.4 800 0 0.2 \u00C2\u00B5m 900 (D) p201:600(\u00C2\u00B5m|D1,...,D6) p1:200(\u00C2\u00B5m|D1,...,D6) 0 500 Iteration (B) p201:400(\u00C2\u00B5m|D1,...,D6) (A) 300 0.4 1000 (E) p201:1000(\u00C2\u00B5m|D1,...,D6) 0.14 p201:800(\u00C2\u00B5m|D1,...,D6) Moving Average of \u00C2\u00B5m Gibbs sequence 0.2 0 0.2 \u00C2\u00B5m 0.4 0 0.2 \u00C2\u00B5m 0.4 Figure 5.5: Moving average of Gibbs sequence corresponding to \u00C2\u00B5m and the approximated marginal distributions computed using various portions of the sequence. Panel (A) corresponds to the marginal distribution approximated using the first 200 samples in the Gibbs sequence. This portion of the sequence is discarded from considering the convergence, in order to remove the residual effect of the initial point of the chain. Panel (B) corresponds to the marginal distribution of approximated using 201st to 400th samples in the Gibbs sequence. Panel (C) corresponds to the marginal distribution of approximated using 201st to 600th samples in the Gibbs sequence. Panel (D) corresponds to the marginal distribution approximated using 201st to 800th samples in the Gibbs sequence. Panel (E) corresponds to the marginal distribution approximated using 201st to 1000th samples in the Gibbs sequence. 67 \u000CChapter 5 amount of computational time. Therefore, in order to reduce the high computational cost, the Gibbs sequences corresponding to the parameters \u00C2\u00B5m , YXS and YP\u00E2\u0080\u00B2 X were eliminated from the M-H algorithm steps that determine corresponding conditional distributions. In other words, the Gibbs sampler was paused once the steady-state convergence is confirmed for the three parameters and the resulting probability distributions were fixed as the full conditional probability distributions as follows, \u00E2\u0080\u00B2 \u00E2\u0080\u00B2 (1:1000) pII (\u00C2\u00B5m | ks , kP\u00E2\u0080\u00B2 , YXS , YP\u00E2\u0080\u00B2 X , D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) C (\u00C2\u00B5m | ks , kP , YXS , YP X , D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) = p (5.4) \u00E2\u0080\u00B2 \u00E2\u0080\u00B2 (1:1000) pII (YXS | \u00C2\u00B5m , ks , kP\u00E2\u0080\u00B2 , YP\u00E2\u0080\u00B2 X , D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) C (YXS | \u00C2\u00B5m , ks , kP , YP X , D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) = p (5.5) \u00E2\u0080\u00B2 \u00E2\u0080\u00B2 (1:1000) pII (YP\u00E2\u0080\u00B2 X | \u00C2\u00B5m , ks , kP\u00E2\u0080\u00B2 , YXS , D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) C (YP X | \u00C2\u00B5m , ks , kP , YXS , D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) = p (5.6) where pII is the conditional distribution to be used in the Gibbs sampler Phase II and p1:1000 denotes marginal probability distribution obtained from the first 1000 iterations of the Gibbs sampler, which are shown in Figure 5.6. In Phase II (i.e. Gibbs sequence iteration 1001st and onward), the M-H algorithm is no longer applied to \u00C2\u00B5m , YXS and YP\u00E2\u0080\u00B2 X for individual approximation of the full conditional distribution, instead (5.4), (5.5) and (5.6) are used to randomly sample the next Gibbs sequence value. Thus, Phase I refers to the estimation process where all five of the parameters were actively analyzed for full conditional distributions using M-H algorithm and Phase II refers to the estimation process where only ks and kP\u00E2\u0080\u00B2 are actively analyzed for conditional distribution. An additional 1000 iterations of Gibbs sampler were executed in Phase II for the convergence of ks . Figure 5.7 shows the joint distribution contour plots of \u00CE\u00B8 using the Gibbs sequence from both Phase I and Phase II. In order to visualize the five-dimensional probability space, the parameters 68 \u000CChapter 5 (B) p1:1000(ks|D1,...,D6) p1:1000(\u00C2\u00B5m|D1,...,D6) (A) 0.1 0.15 0.2 \u00C2\u00B5m 0.25 0.3 0.35 0 0.2 0.4 0.6 0.8 1 0.4 0.5 0.6 ks (D) p1:1000(kP\u00E2\u0080\u0099|D1,...,D6) p1:1000(YXS|D1,...,D6) (C) 0 0.2 0.4 0.6 0.8 1 kP\u00E2\u0080\u0099 0.1 0.2 0.3 YXS p1:1000(YPX\u00E2\u0080\u0099|D1,...,D6) (E) 0.1 0.15 0.2 0.25 0.3 0.35 YPX\u00E2\u0080\u0099 Figure 5.6: The approximated marginal distributions of \u00CE\u00B8 using the first 1000 samples of the Gibbs sequence (i.e. Phase I). The distributions for ks and kP\u00E2\u0080\u00B2 have not reached convergence and have wider intervals compared to the other three parameters. Panel (A) : p1:1000 (\u00C2\u00B5m | D1, \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) Panel (B) : p1:1000 (ks | D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) Panel (C) : p1:1000 (kP\u00E2\u0080\u00B2 | D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) Panel (D) : p1:1000 (YXS | D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) Panel (E) : p1:1000 (YP\u00E2\u0080\u00B2 X | D1, \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) 69 \u000CChapter 5 are paired up to portray two-dimensional joint distributions instead. The solid lines represent the true values of the process parameters. For panels (i) and (ii), the highest probability region is tightly clustered near the cross point of the solid lines. This indicates that the parameters \u00C2\u00B5m , YXS and YP\u00E2\u0080\u00B2 X , were estimated with higher accuracy compared to the other parameters where larger distributions along the parameter space are demonstrated. For instance, in panel (x), the joint distribution of ks and kP\u00E2\u0080\u00B2 shows multiple high probability regions, agreeing with previous studies on the difficulties of estimating the Monod constants using stochastic experimental data. From studying panel (iii), it can be inferred that the yield coefficient parameters YXS and YP\u00E2\u0080\u00B2 X have an inversely proportional relationship, such that when the value of YP\u00E2\u0080\u00B2 X increases, YXS decreases. It may be possible to use parameters that have strong correlation with one another, such as this pair, in optimizing the structure of the model. Modeling a dynamic process is a compromise between accurate portrayal of the true process and simplicity of the model for computational purpose. Therefore, it is beneficial to conduct an iterative analysis between the true process and the proposed models in order to arrive at a parsimonious model. For instance, if a numerical function of YXS in terms of YP\u00E2\u0080\u00B2 X can be developed, the parameter space of the unstructured Michaelis-Menten model (1.9) can be reduced from five to four. The maximum a posteriori estimate, the expected value and the 95% HPD interval of each marginal distribution is shown in Table 5.3. With asymmetric probability distributions shown in Figure 5.5, it is difficult to determine what is the best estimate of the parameter. In any case, as mentioned previously, it is difficult to summarize the shape into a couple of representative statistical values for asymmetric distributions. 5.2 Genetic Regulatory Network : Feed Forward Loop In [10], four different candidates of FFLs were studied. The candidate genes were obtained from [20] where gene expression responses to twelve different environment changes in Saccha70 \u000CChapter 5 0.35 Higher (i) YPX\u00E2\u0080\u0099 0.3 Probability 0.25 0.2 0.15 0.1 0.6 (ii) (iii) YXS 0.5 0.4 0.3 Lower 0.2 0.1 1 Probability (iv) (v) (vi) (viii) (ix) kP\u00E2\u0080\u0099 0.8 0.6 0.4 0.2 0 1 (vii) (x) 0.8 ks 0.6 0.4 0.2 0 0 0 0.1 0.2 \u00C2\u00B5m 0.3 0.4 0 0.1 0.2 YPX\u00E2\u0080\u0099 0.3 0.4 0 0.5 YXS 1 0 0.5 kP\u00E2\u0080\u0099 1 Figure 5.7: Joint distributions of batch fermentation process parameters approximated using Metropolis-Hastings algorithm and Gibbs sampler [Results from both Phase I and II were used]. Each panel corresponds to the pair of parameters indicated by the x-axis and the y-axis. The region corresponding to higher probability is indicated with black (the higher end of the color bar on the right) and the lowest probability region is indicated with white (the lower end of the color bar on the right). The intersection of dotted lines represent the coordinates of the true values of the parameter pairs. 71 \u000CChapter 5 romyces cerevisiae were studied. Among the four candidate FFLs, FFL1 with X: Gene GCN4, Y: Gene LEU3 and Z: Gene ILV5 performed the best in the test of the goodness of fit for dynamic models. In this case study, the same FFL is used to illustrate the algorithm. The gene expression level of X is not a state variable in FFL model and therefore it is regarded as an input variable with a known sequence. To simulate X(t), random noise variable, w(t) with zero mean and variance, \u00CF\u0083w2 , was added to the experimental data from [20]. The initial conditions of Y and Z as well as the parameter values were obtained from [10], where three of the parameter values were heuristically determined such that \u00CE\u00B2y = \u00CE\u00B2z = 1 and H = 2. The rest of the parameter values are listed in Table 5.4. For the model (1.13) and (1.14), process noise terms, v1 (t) and v2 (t) were added to each equation as follows to simulate the stochastic nature of the dynamic process. dY (t) = \u00E2\u0088\u0092\u00CE\u00B1y Y (t) + \u00CE\u00B2y f (X(t), KXY ) + v1 (t), dt dZ(t) = \u00E2\u0088\u0092\u00CE\u00B1z Z(t) + \u00CE\u00B2z g(X(t), Y (t), KXZ , KY Z ) + v2 (t), dt (5.7) (5.8) The sampling times were set at t = 5, 10, 15, 20, 30, 40, 60 and 80 minutes (N = 8). The equations were solved using ode45 function in MATLAB R and to obtain the output variables, measurement noise variables were added as follows. y1 (t) = Y (t) + \u00CE\u00B7Y (t), y2 (t) = Z(t) + \u00CE\u00B7Z (t), where \u00CE\u00B7Y (t) and \u00CE\u00B7Z (t) are independent and Gaussian distributed variables with zero mean and variance \u00CF\u0083Y2 and \u00CF\u0083Z2 , respectively. Using the parameter values in Table 5.4 and the simulated input sequences, a total of seven experimental data sets were collected. Each experimental data 72 \u000CChapter 5 set is defined as, Di = [Y (t1 ), \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , Y (tN ), Z(t1 ), \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , Z(tN ), X(t1 ), \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , X(tN )], i = 1, 2, 3, 4, 5, 6, 7 (5.9) Six of them, D1 , D2 , D3 , D4 , D5 and D6 , were applied to the algorithm to estimate the probability distribution of process parameters and the last experimental data set, D7 , was used to validate the estimation result. Figure 5.8 shows a simulated FFL time series of the input variable X(t) and the two state variables Y (t) and Z(t). The initial priors for estimating full conditional probability distributions using M-H algorithm, p0 (\u00CE\u00B8), were set to a uniform probability distribution between 0 and 1, U(0, 1), for all five parameters. The likelihood function was derived in an analogous approach as the previous case study and is expressed as follows. L(\u00CE\u00B8 | D1) = 1 exp N/2 (2\u00CF\u0080) \u00CF\u0083YN \u00C2\u00B7 \u00CF\u0083ZN (5.10) i=N X\u00E2\u0088\u00921 i=0 \u00E2\u0088\u0092 (y1 (ti ) \u00E2\u0088\u0092 Y\u00CC\u0082 (ti , \u00CE\u00B8))2 (y2 (ti ) \u00E2\u0088\u0092 Z\u00CC\u0082(ti , \u00CE\u00B8))2 \u00E2\u0088\u0092 2\u00CF\u0083Y2 2\u00CF\u0083Z2 ! , where Y\u00CC\u0082 (ti ) and Z\u00CC\u0082(ti ) are predicted output variables as a function of \u00CE\u00B8. A total of 2000 iterations of Gibbs sampler with 3000 iterations of M-H algorithm per parameter per Gibbs iteration were executed. The resulting Gibbs sequences are shown in Figure 5.9. The left column shows the plots of the Gibbs sequences versus the iteration index and the right column shows the marginal probability distributions of process parameters approximated using the sequences shown on the left. The dotted lines denote the true parameter values. Table 5.5 shows the summary of maximum a posteriori estimate, expected mean and the 95% HPD interval obtained from the approximate marginal distributions. From Figure 5.9, it can be noticed that KXZ and KY Z have negative and positive skew. Both 73 \u000CChapter 5 Table 5.3: The maximum a posteriori, the expected mean, the normalized error and the 95% confidence interval calculated from marginal distribution corresponding to each process parameter of batch fermentation reaction model. \u00C2\u00B5m 0.153 0.020 0.177 0.180 0.126 0.260 Process Parameter Maximum a posteriori \u00D6\u0092\u00E2\u0086\u0092Normalized Error Expected Mean \u00D6\u0092\u00E2\u0086\u0092Normalized Error 95% HPD Interval - Lower Bound 95% HPD Interval - Upper Bound ks 0.591 0.182 0.593 0.187 0.240 0.952 kP\u00E2\u0080\u00B2 0.005 0.979 0.460 0.841 0.005 0.950 YXS 0.195 0.221 0.264 0.057 0.177 0.416 YP\u00E2\u0080\u00B2 X 0.189 0.056 0.204 0.020 0.123 0.284 Table 5.4: The parameter vector value used in order to simulate the time series data of FFL genetic regulatory network. \u00CE\u00B1y \u00CE\u00B1z KXY 0.44 0.69 0.90 Process Parameter Value KXZ 0.60 KY Z 0.56 0.8 X(t) 0.7 0.6 0.5 0.4 0 10 20 30 40 50 60 70 80 0 10 20 30 40 50 60 70 80 0 10 20 30 40 50 60 70 80 1 Y(t) 0.8 0.6 0.4 0.2 0.8 Z(t) 0.6 0.4 0.2 0 t [min] Figure 5.8: The simulated data of FFL genetic regulatory network model. There are eight measurements (denoted with x) of each state variable, Y (t) and Z(t). The initial values of the state variables (denoted with \u00E2\u0080\u00A2) are assumed to be known from the estimation reported in [10]. X(t) is regarded as an input variable and its initial value is not reported. 74 \u000CChapter 5 distributions are characterized by asymmetric bimodal distributions indicated by the presence of shorter peaks adjacent to the dominant ones. Maximum a posteriori values and the expected values are in good agreement with each other, as the marginal distributions have less asymmetry relative to the marginal distributions of batch fermentation process parameters. Also, it is observed that the normalized error of estimation result is relatively smaller, indicating that the algorithm was more successful for estimating the parameters of FFL model compared to the batch fermentation model. Figure 5.10 shows the contour plots of process parameter joint distributions. Similar to Figure 5.7, the parameters were paired up for easier visualization of the probability distribution that exists in five-dimensional space. It is shown that the highest probability region of each panel shaded in black closely follows the cross-point of the \u00E2\u0080\u0098true value\u00E2\u0080\u0099 solid lines, demonstrating the accuracy of the estimation. In this model, some correlation among parameters can be inferred from the joint probability distribution contour plots. For instance, the high probability region of \u00CE\u00B1z and KXZ form an inversely proportional relationship. And similar behavior is noted between the high probability regions of KXZ and KY Z . In order to further investigate the accuracy of the estimated parameters, a separate simulated data set (D7 ) was used for verification. The verification data was simulated without process or measurement noise in order to plot the \u00E2\u0080\u0098true\u00E2\u0080\u0099 measurement trajectories. Using the expected values in Table 5.5 and the known sequence of X(t) from D7 , the expression profiles for Y\u00CC\u0082 (t) and Z\u00CC\u0082(t) were predicted without process or measurement noise term. These trajectories were then compared with the simulated data. The plot is shown in Figure 5.11. It can be seen that by using the estimated parameter values, the expression profiles of Y (t) and Z(t) are predicted with very small error. 75 \u000C\u00CE\u00B1y Chapter 5 0.7 0.7 0.5 0.5 \u00CE\u00B1z 0.3 KXY 1000 1500 2000 0.3 0.8 0.6 0.6 0 500 1000 1500 2000 0.4 1 1 0.8 0.8 0.6 KXZ 500 0.8 0.4 0 500 1000 1500 2000 0.6 1 1 0.5 0.5 0 KYZ 0 0 500 1000 1500 2000 0 1 1 0.6 0.6 0.2 0 500 1000 Gibbs Iteration 1500 2000 0.2 p(.|D1,...D6) Figure 5.9: Plot of Gibbs sequences for 2000 iterations and the marginal distribution using of each process parameter approximated using the corresponding sequence. The dotted horizontal lines correspond to the true value of each process parameter used to simulate the experimental data of FFL model. 76 \u000CChapter 5 \u00CE\u00B1Z 0.8 0.6 KXY 0.4 1 (ii) KXZ (iii) 0.8 Lower Probability 0.6 1 (iv) (v) (vi) (vii) (viii) (ix) 0.5 0 1 KYZ Higher Probability (i) (x) 0.6 0.2 \u00E2\u0088\u0092400 00 \u00E2\u0088\u0092400 0.3 0.5 \u00CE\u00B1Y 0.70.4 0.6 \u00CE\u00B1z 0.80.6 0.8 KXY 1 0 0.5 1 KXZ Figure 5.10: Joint distributions of FFL model parameters approximated using MetropolisHastings algorithm and Gibbs sampler. Each panel corresponds to the corresponding pair of parameters indicated on the x-axis and the y-axis. The region corresponding to higher probability is indicated with black (the higher end of the color bar on the right) and the lowest probability region is indicated with white (the lower end of the color bar on the right). The intersections of dotted lines represent the coordinates of true values of the parameter pairs. 77 \u000CChapter 5 Table 5.5: The maximum a posteriori, the expected mean and the 95% confidence interval calculated from each marginal distribution corresponding to the process parameter of FFL genetic regulatory network model. Process Parameter Maximum a posteriori \u00D6\u0092\u00E2\u0086\u0092Normalized Error Expected Mean \u00D6\u0092\u00E2\u0086\u0092Normalized Error 95% Confidence Interval - Lower Bound 95% Confidence Interval - Upper Bound \u00CE\u00B1y 0.469 0.065 0.461 0.049 0.340 0.537 \u00CE\u00B1z 0.659 0.045 0.644 0.066 0.543 0.746 KXY 0.861 0.043 0.871 0.032 0.765 0.973 KXZ 0.701 0.169 0.641 0.068 0.307 0.839 KY Z 0.513 0.083 0.565 0.009 0.424 0.849 1 Y(t) 0.8 0.6 0.4 0.2 0 10 20 30 40 50 60 70 80 10 20 30 40 T [min] 50 60 70 80 0.8 Z(t) 0.6 0.4 0.2 0 0 Figure 5.11: Using a known sequence of input variable X(t) and the estimated parameters from Table 5.5, the gene expression profiles of Y (t) and Z(t) were predicted. They are compared with the simulated expression profile using the true parameter values. Solid line : true parameters. Dotted line: estimated parameters. 78 \u000CChapter 5 5.3 JAK-STAT Signal Transduction Pathway Model : Partially Observable States There is a single experimental data set available from the literature which consists of the input time series, u(t), representing the EpoR concentration profile and the two output variables, y1 (t) and y2 (t) measured at t = 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 25, 30, 40, 50, 60 minutes (N = 16). The output variables are plotted in Figure 5.12, where \u00E2\u0080\u0098x\u00E2\u0080\u0099 denote y1 and \u00E2\u0080\u0098+\u00E2\u0080\u0099 denote y2 . The values of a1 , a3 and a4 , were estimated in [42], using experimental data obtained from [51] and assuming \u00CF\u0084 = 4.001 min, with Unscented Kalman Filter (UKF) estimation approach. They are reported to be a\u00CC\u00821 = 0.0515 \u00C2\u00B1 0.011, a\u00CC\u00823 = 3.39 \u00C2\u00B1 0.882 and a\u00CC\u00824 = 0.35 \u00C2\u00B1 0.092. The estimation 95% confidence interval (1.96\u00CF\u0083) was calculated assuming normal distribution of the process parameters. The trajectory of predicted output variables using this estimated value is shown in Figure 5.12 with solid and dashed curves. Using these literature values, the prior distribution of each parameter was assigned as follows under the assumption that only the order of magnitude of estimated parameters are reliable. p0 (a1 ) = U(0, 0.1), (5.11) p0 (a3 ) = U(0, 10), (5.12) p0 (a4 ) = U(0, 1). (5.13) The likelihood function was derived in an identical manner as previous case studies, assuming that the measurement noise is distributed normally with zero mean and standard deviation \u00CF\u0083 = 0.1. This value was assigned by examining the disagreement between the experimental data and the predicted output calculated by using the parameters reported in literature. The Gibbs sampler was executed for 1000 iterations with 1000 M-H algorithm steps per parameter for evaluation of conditional distribution (The first 501 samples of the Markov chain was 79 \u000CChapter 5 0.2 0.18 0.16 0.14 experimental y1 0.12 y1, y2 experimental y2 Predicted y1 0.1 Predicted y2 0.08 0.06 0.04 0.02 0 0 10 20 30 40 50 60 t [min] Figure 5.12: The experimental data, y1 and y2 , obtained from [51] are denoted with \u00E2\u0080\u0098x\u00E2\u0080\u00B2 and \u00E2\u0080\u0098+\u00E2\u0080\u00B2 , respectively. The output trajectory of y\u00CC\u00821 (solid curve) and y\u00CC\u00822 (dashed curve) are predicted values calculated using the estimated values reported in [42]. 80 \u000CChapter 5 discarded to remove the \u00E2\u0080\u0098burn-in\u00E2\u0080\u0099 effect). Figure 5.13 shows the joint probability distributions of pairs of the parameter visualized by the three contour plots. The maximum a posteriori values are indicated with dotted lines. The higher probability region is indicated by red and black (corresponds to the color bar), and the lowest probability region is indicated by white. The histograms on the outer margin of the figures are the marginal distribution. The magnified view of the marginal distribution of individual parameter are shown in Figure 5.14. The maximum a posteriori, expected mean and 95% HPD intervals are calculated and shown in Table 5.6. The approximated distributions of a1 and a4 converged to peaks which indicate that the uniform prior distribution was successfully assigned to contain the high probability region of the parameter space. Furthermore, the estimated results agree with the previous literature values, as the normalized \u00E2\u0080\u0098differences\u00E2\u0080\u00999 are 0.109 and 0.014, respectively. However, for a3 , the marginal probability distribution did not converge to a peak where the highest probable region is easily identifiable. An interesting aspect about this model is that the state, even though the JAK-STAT model has been generally known for its unobservable states, the first state x1 is actually observable. From the measurements of y1 and y2 , it becomes possible to compute the concentration profile of x1 (t) = y2 (t) \u00E2\u0088\u0092 y1 (t), which is shown in Figure 5.15. The experimental profile is compared with the predicted profile of x1 using \u00CE\u00B8\u00CC\u0082 = [0.0459, 9.351, 0.355]. It is easy observe that the two values are in good agreement. 5.3.1 Comparison With Literature Parameter Values For further investigation, the estimated parameter vectors from literature and those from the proposed Gibbs algorithm are examined in order to determine their ability to reliably represent the given experimental data. The three vectors are \u00CE\u00B8\u00CC\u00821 = [0.0515, 3.39, 0.35] (literature value), 9 The author does not wish to use the term \u00E2\u0080\u0098error\u00E2\u0080\u0099 in this particular case, because the previous literature value is also an estimation, after all. 81 \u000CChapter 5 Higher 1 Probability 0.8 a4 0.6 0.4 0.2 Lower 0 Probability 10 8 a3 6 4 2 0 0 0.02 0.04 0.06 0.08 0.1 0 0.2 0.4 a1 0.6 0.8 1 a4 0 0.05 a1 0.1 p(a4|D) p(a3|D) p(a1|D) Figure 5.13: Joint distributions of JAK-STAT model parameters approximated using MetropolisHastings algorithm and Gibbs sampler. The data used for this analysis is the experimental data reported in previous literature. Each contour plot panel corresponds to the corresponding pair of parameters indicated on the x-axis and the y-axis. The region corresponding to higher probability is indicated with black (the higher end of the color bar) and the lowest probability region is indicated with white (the lower end of the color bar). The dotted lines represent the maximum a posteriori of the estimated probability distribution of true values of the parameter pairs. The histograms on the outer part of the figure represent the approximated marginal probability distributions identical to Figure 5.14. 0 5 a3 10 0 0.5 a4 1 Figure 5.14: Approximated marginal distribution of JAK-STAT process parameters obtained from 1000 Gibbs sampler iterations. Each Gibbs iteration consisted of inner iteration of MH algorithm of 1000 samples per experiment per parameter. The expected mean is denoted with solid vertical line on each panel and the dashed vertical line denote the maximum a posteriori value. 82 \u000CChapter 5 Table 5.6: The maximum a posteriori, the expected mean and the 95% confidence interval calculated from each marginal distribution corresponding to the process parameter of JAK-STAT signal transduction pathway model. Process Parameter Maximum a posteriori Expected Mean 95% Confidence Interval - Lower Bound 95% Confidence Interval - Upper Bound a1 0.0459 0.0509 0.0144 0.0928 a3 9.351 6.004 0.682 9.942 a4 0.355 0.460 0.137 0.962 0.2 Experimental Predicted 0.18 0.16 0.14 x1(t) 0.12 0.1 0.08 0.06 0.04 0.02 0 0 10 20 30 t [min] 40 50 60 Figure 5.15: The concentration of x1 (t) is computed from the experimental data of y1 (t) and y2 (t) is denoted with \u00E2\u0080\u0099o\u00E2\u0080\u0099 and the predicted x1 (t) is shown with dotted line. 83 \u000CChapter 5 \u00CE\u00B8\u00CC\u00822 = [0.0459, 9.351, 0.355] (maximum a posteriori) and \u00CE\u00B8\u00CC\u00823 = [0.0509, 6.004, 0.460] (expected mean). Using these estimations, the output profiles are predicted by solving the state equations and output equations. The predicted trajectories are shown in Figure 5.16. Using the predictions, the sum of squared errors are calculated and presented in Table 5.7. In Figure 5.16, the output profiles predicted using the different \u00CE\u00B8\u00CC\u0082 vectors show similar trajectories even though a\u00CC\u00823 estimates are quite different. The scattering of the predicted trajectories is lesser in magnitude compared to the scattering of the experimental data points. Therefore, the likelihood values and the sum of squared errors, the quantitative representation of the disagreement between experimental data and the predicted data, are examined. It can be concluded that by using \u00CE\u00B8\u00CC\u00822 , in conjunction with the model equations, the experimental data are best represented. However, it is difficult to reliably estimate the confidence interval of nonlinear process parameters from a single data set. The rather large disagreements between the three estimated values of a\u00CC\u00823 can be further analyzed by conducting sensitivity analysis of the model. If by varying this parameter value, no significant variation in predicted output can be detected, then one can conclude that the observations are insensitive to this parameter. Therefore, it can not be estimated. A given vector of parameters may be identifiable with some sets of experimental data but may become unidentifiable if the measurement noise is increased. It can also be inferred that the identifiability of process parameters is not an absolutely definable quality but depends on the quality of the data (e.g. noise variance, amount of sample points). 84 \u000CChapter 5 0.16 0.2 Experimental y1|\u00CE\u00B8 1 y1|\u00CE\u00B8 0.18 2 0.12 y1|\u00CE\u00B8 3 y2 y1 0.16 0.08 0.14 Experimental y2|\u00CE\u00B8 0.04 1 0.12 y2|\u00CE\u00B8 2 y2|\u00CE\u00B8 3 0 0 20 40 60 0.1 0 t [min] 20 40 60 t [min] Figure 5.16: The output variables y1 and y2 are predicted using three different estimation of JAK-STAT process parameters; \u00CE\u00B8\u00CC\u00821 = [0.0515, 3.39, 0.35] (literature value, shown in blue dashed lines), \u00CE\u00B8\u00CC\u00822 = [0.0459, 9.351, 0.355] (maximum a posteriori, shown in green dotted lines) and \u00CE\u00B8\u00CC\u00823 = [0.0509, 6.004, 0.460] (expected mean, shown in red solid lines). The experimental data is denoted with \u00E2\u0080\u0098x\u00E2\u0080\u0099. Table 5.7: Likelihood values and sum of squared errors calculated for different estimates of JAKSTAT process parameters using the experimental data set. Two sets of likelihood values were computed using different noise variance, \u00CF\u0083, 0.1 and 0.01. \u00CE\u00B8\u00CC\u00821 = [0.0515, 3.39, 0.35] (literature value), \u00CE\u00B8\u00CC\u00822 = [0.0459, 9.351, 0.355] (maximum a posteriori) and \u00CE\u00B8\u00CC\u00823 = [0.0509, 6.004, 0.460] (expected mean) Likelihood (\u00CF\u0083 = 0.1) Likelihood (\u00CF\u0083 = 0.01) Sum of Squared Errors \u00CE\u00B8\u00CC\u00821 1.807 \u00C3\u0097 1025 0 0.0025 \u00CE\u00B8\u00CC\u00822 1.923 \u00C3\u0097 1025 0 0.0023 \u00CE\u00B8\u00CC\u00823 1.227 \u00C3\u0097 1025 0 0.0036 85 \u000CChapter 5 5.3.2 Quantitative Parameter Estimability and Sensitivity Analysis: Comparison with PDF In order to study how sensitive the observed output variables are with respect to the change in parameter value, a preliminary result of sensitivity analysis is done by computing the sensitivity coefficient matrix as follows. \u00EF\u00A3\u00AE \u00E2\u0088\u0082y1 \u00EF\u00A3\u00AF \u00E2\u0088\u0082a \u00EF\u00A3\u00AF 1 \u00EF\u00A3\u00AF \u00EF\u00A3\u00AF \u00EF\u00A3\u00AF \u00EF\u00A3\u00B0 \u00E2\u0088\u0082y2 \u00E2\u0088\u0082a1 \u00E2\u0088\u0082y1 \u00E2\u0088\u0082a3 \u00E2\u0088\u0082y2 \u00E2\u0088\u0082a3 \u00EF\u00A3\u00B9 \u00E2\u0088\u0082y1 \u00E2\u0088\u0082a4 \u00EF\u00A3\u00BA \u00EF\u00A3\u00BA \u00EF\u00A3\u00BA \u00EF\u00A3\u00BA \u00EF\u00A3\u00BA \u00E2\u0088\u0082y2 \u00EF\u00A3\u00BB (5.14) \u00E2\u0088\u0082a4 The partial derivatives are approximated by finite-difference method with respect to the previously reported parameter estimation, \u00CE\u00B8\u00CC\u0084 = [a\u00CC\u00841 , a\u00CC\u00843 , a\u00CC\u00844 ]. \u00E2\u0088\u0082yi \u00E2\u0088\u0082aj = yi |0.90a\u00CC\u0084j \u00E2\u0088\u0092 yi |1.10a\u00CC\u0084j 0.90a\u00CC\u0084j \u00E2\u0088\u0092 1.10a\u00CC\u0084j (5.15) where i = 1, 2 and j = 1, 3, 4. The computed values are used to illustrate their relative magnitude to each other in Figure 5.17. In the top panel, the blue bars correspond to bars correspond to \u00E2\u0088\u0082y1 \u00E2\u0088\u0082a3 and the red bars correspond to \u00E2\u0088\u0082y1 \u00E2\u0088\u0082a4 \u00E2\u0088\u0082y1 , \u00E2\u0088\u0082a1 the green at each sampling time. The bottom panel, analogously correspond to partial derivatives of y2 with respect to the process parameters. It is shown that the partial derivatives of y1 and y2 with respect to a3 are very small compared to the partial derivatives with respect to a1 and a4 . Therefore, it is shown that varying a3 does not affect the output as much as when a1 or a4 are varied. Such observation cannot be made readily when using traditional parameter estimation approaches where the distribution of parameters is assumed to be Gaussian and only the point-estimate is obtained. Using the proposed algorithm, the entire probability distribution function is estimated, from which, the sensitivity of certain parameter can be diagnosed qualitatively through examining 86 \u000CChapter 5 the relative distribution of each parameter. This is demonstrated in Figure 5.18, which show the approximated marginal probability distribution obtained through simulated data sets of six independent experiments. The x-axis of each panel was fixed at their given order of magnitude to demonstrate the relative \u00E2\u0080\u0098scattering\u00E2\u0080\u0099 of each marginal distribution corresponding to their order of magnitude. For instance, a1 is in the 10\u00E2\u0088\u00921 order of magnitude and the corresponding panel (A) has a fixed axis at (0, 0.1). To demonstrate this scattering of asymmetric probability distribution function in quantitative terms, a \u00E2\u0080\u0098coverage-ratio\u00E2\u0080\u0099 of each distribution was calculated where, CR1 = CR3 = CR4 = arg max p\u00CC\u0082(a1 |D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) \u00E2\u0088\u0092 arg min p\u00CC\u0082(a1 |D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) a1 a1 10\u00E2\u0088\u00921 arg max p\u00CC\u0082(a3 |D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) \u00E2\u0088\u0092 arg min p\u00CC\u0082(a3 |D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) a3 a3 101 arg max p\u00CC\u0082(a4 |D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) \u00E2\u0088\u0092 arg min p\u00CC\u0082(a4 |D1 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , D6 ) a4 a4 100 , (5.16) , (5.17) . (5.18) The resulting CR values are 0.263, 0.859 and 0.125, for a1 , a3 , a4 respectively. Thus, it is quantitatively shown that probability distribution of a3 has the widest relative width, compared to other two parameters. This observation can be directly correlated to the smaller degree of sensitivity of a3 shown through the sensitivity analysis. Subsequently, this conveys the fact that a3 is not easily estimated with a reliable confidence interval with comparable degree of accuracy compared to the other two parameters. The parameter estimability analysis is further examined by evaluating the scaled sensitivity co- 87 \u000CChapter 5 1 SAy 1 0.8 a1 0.6 a2 0.4 a3 0.2 0 0 2 4 6 8 10 12 14 16 t [min] 18 20 25 30 40 50 60 0.8 0.6 SAy 2 a1 a2 0.4 a3 0.2 0 0 2 4 6 8 10 12 14 16 t [min] 18 20 25 30 40 50 60 0 0.02 0.04 a1 0.06 0.08 0.1 p(a4|D1,...,D6) p(a3|D1,...,D6) p(a1|D1,...,D6) Figure 5.17: Sensitivity coefficients calculated using the finite difference method shown in (5.15). The top panel corresponds to the partial derivatives of y1 and the bottom panel corresponds to the partial derivatives of y2 . The blue bars denote partial derivatives with respect to a1 ; the green bars denote partial derivatives with respect to a3 ; and the red bars denote partial derivatives with respect to a4 . The horizontal axis represents the sampling time and the vertical axis represents the value of the partial derivatives. 0 2 4 a3 6 8 10 0 0.2 0.4 a4 0.6 0.8 1 Figure 5.18: Approximated marginal distribution of JAK-STAT signal transduction pathway model parameters. The probability distributions are normalized and plotted in a window of [0, O(ai )] \u00C3\u0097 [0, 20/O(ai)] where i = 1, 3, 4. The dotted lines represent the uniform prior distributions of a1 , a3 , a4 , U(0, 1), U(0, 10), U(0, 0.1), respectively. 88 \u000CChapter 5 efficient matrix, which is expressed as follows. \u00EF\u00A3\u00AE \u00EF\u00A3\u00AF \u00EF\u00A3\u00AF \u00EF\u00A3\u00AF \u00EF\u00A3\u00AF Z\u00CC\u0084 \u00E2\u0089\u00A1 \u00EF\u00A3\u00AF \u00EF\u00A3\u00AF \u00EF\u00A3\u00AF \u00EF\u00A3\u00B0 \u00EF\u00A3\u00AE Z\u00CC\u0082(0) \u00EF\u00A3\u00B9 \u00EF\u00A3\u00BA \u00EF\u00A3\u00BA Z\u00CC\u0082(1) \u00EF\u00A3\u00BA \u00EF\u00A3\u00BA \u00EF\u00A3\u00BA, .. \u00EF\u00A3\u00BA . \u00EF\u00A3\u00BA \u00EF\u00A3\u00BB Z\u00CC\u0082(N \u00E2\u0088\u0092 1) \u00CE\u00B8\u00CC\u00821 \u00E2\u0088\u0082\u00CE\u00B71 |t=tc \u00CE\u00B71 \u00E2\u0088\u0082\u00CE\u00B81 .. . (5.19) \u00CE\u00B8\u00CC\u0082k \u00E2\u0088\u0082\u00CE\u00B71 |t=tc \u00CE\u00B71 \u00E2\u0088\u0082\u00CE\u00B8k .. . \u00EF\u00A3\u00B9 \u00C2\u00B7\u00C2\u00B7\u00C2\u00B7 \u00EF\u00A3\u00BA \u00EF\u00A3\u00AF \u00EF\u00A3\u00BA \u00EF\u00A3\u00AF \u00EF\u00A3\u00BA \u00EF\u00A3\u00AF . \u00EF\u00A3\u00BA, \u00EF\u00A3\u00AF . Z\u00CC\u0082(c) = \u00EF\u00A3\u00AF . \u00EF\u00A3\u00BA \u00EF\u00A3\u00BA \u00EF\u00A3\u00AF \u00EF\u00A3\u00BB \u00EF\u00A3\u00B0 \u00CE\u00B8\u00CC\u00821 \u00E2\u0088\u0082\u00CE\u00B7m \u00CE\u00B8\u00CC\u0082k \u00E2\u0088\u0082\u00CE\u00B7m |t=tc \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 |t=tc \u00CE\u00B7m \u00E2\u0088\u0082\u00CE\u00B81 \u00CE\u00B7m \u00E2\u0088\u0082\u00CE\u00B8k (5.20) where {\u00CE\u00B81 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , \u00CE\u00B8k } are the model parameters; {\u00CE\u00B71 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , \u00CE\u00B7m } are the output variables; {t0 , \u00C2\u00B7 \u00C2\u00B7 \u00C2\u00B7 , tN \u00E2\u0088\u00921 } are the sampling times and p\u00CC\u0082i is either guess or literature parameter value. The rank of the orthogonalized scaled sensitivity coefficient matrix, Z\u00CC\u0084, is equal to the number of estimable parameters [55]. Also, the relative ease of estimability can be computed, such that the parameter corresponding to the column of Z\u00CC\u0084 has the largest magnitude (sum of squares of the element) is the most estimable. The rank of orthogonalized Z\u00CC\u0084 is equal to 3 for the JAK-STAT signal transduction pathway model, conveying that all 3 of the parameters are indeed estimable. The magnitude of Z\u00CC\u0084 is M = [26.09, 25.02, 26.29]. Such that the order is M(3) > M(1) > M(2), (5.21) where M(i) is the ith element in the vector. This rank of parameter estimability agrees with the rank of relative \u00E2\u0080\u0098coverage-ratio\u00E2\u0080\u0099 of the approximated marginal probability distribution. Such that the parameter that is the easiest to estimate have the smallest \u00E2\u0080\u0098coverage-ratio\u00E2\u0080\u0099 (have the most narrow relative distribution), which conveys the higher confidence in the parameter value. 89 \u000CChapter 5 5.3.3 Effect of Initial Conditions on the Algorithm\u00E2\u0080\u0099s Performance Within the scope of this thesis and its purpose of using the MCMC sampling methods, the Gibbs sampler has been shown to be affected by the initial value of the chain. This is similar to the gradient-search methods for parameter estimation tending to get stuck in local minima depending on the initial guess. However, MH algorithm and Gibbs sampler do not have the problem of getting \u00E2\u0080\u0098stuck\u00E2\u0080\u0099, instead the rate of convergence may be reduced so that more iterations are required in order to successfully approximate the desired target distribution. In order to study the effects of initial conditions, the JAK-STAT signal transduction pathway model parameters were estimated using four different chains with different initial conditions. (a) 1. \u00CE\u00B80 = [0, 0, 0] (b) 2. \u00CE\u00B80 = [0, 0, 1] (c) 3. \u00CE\u00B80 = [0, 10, 0] (d) 4. \u00CE\u00B80 = [0, 10, 1] Since the order of the Gibbs iteration is \u00E2\u0080\u0098a1 \u00E2\u0086\u0092 a3 \u00E2\u0086\u0092 a4 \u00E2\u0080\u0099 the starting value of the a1 does not affect the behavior of the chain; it gets over-written during the first step of sampling from conditional distribution of a1 given a3 , a4 and the experimental data set. The experimental data set used in this case study is identical to the one used in previous section - published real experimental data. The initial conditions were chosen such that they all start from the far corners of the two dimensional parameter space of [0, 10] \u00C3\u0097 [0, 1] where a3 and a4 belong to. The algorithm was executed for 1000 iterations for all four of the chains and the moving standard deviation is calculated. The idea behind this analysis is quite simple. If the variance ([standard deviation]2) of the samples from each individual chain and the variance of the samples from all of the chains converge to each other, this indicates that the chain has reached its steady state. In order to illustrate this point, Figure 5.19 shows the four individual standard deviation computed using each chain and also the standard deviation computed using all of the samples. 90 \u000CChapter 5 The horizontal axis indicates the iteration index at which the moving standard deviations were computed. For instance, at iteration 44, each individual moving standard deviation is computed using the chain samples from 1st iteration to 44th iteration. And for the overall moving standard deviation is computed using the chain samples from 1st to 44th iteration of all four chains (so the pool of which the standard deviation is calculated is four times larger). Each row in the figure corresponds to a1 , a3 and a4 respectively. The values corresponding to chain 1, 2, 3 and 4 are indicated with blue, green, red and aqua solid lines respectively, and the solid black lines indicate the overall moving standard deviation. The result of moving standard deviations is split up into two sections, where the first section corresponds to the moving standard deviations computed up to the 50th iteration, and the second section corresponds to the moving standard deviations computed from the 51st iteration to the 1000th iteration. This is because after about 30 iterations, there is hardly any differences among the moving standard deviations, and therefore the emphasis was made on the first 50 iterations. The figure indicates that regardless of the initial conditions, the chains promptly converge to their steady state value. It is predicted that similar result will be obtained, if the order of the Gibbs iteration is changed, so that a1 is not the first random variable to be sampled, and the initial value of a1 were to be varied. This insensitivity to the initial condition is a significant advantage to the proposed algorithm compared to the other gradient search based parameter estimation methods. 91 \u000C0.08 0.08 0.06 0.06 0.04 0.04 0.02 0.02 0 Moving Standard Deviation a4 Moving Standard Deviation a3 Moving Standard Deviation a1 Chapter 5 5 10 15 20 25 30 35 40 45 50 0 51 200 8 8 6 6 4 4 2 2 0 5 10 15 20 25 30 35 40 45 50 0 51 200 0.8 0.8 0.6 0.6 0.4 0.4 0.2 0.2 0 5 10 15 20 25 30 iteration 35 40 45 50 0 51 200 400 600 800 1,000 400 600 800 1000 400 600 iteration 800 1000 Figure 5.19: The moving standard deviations of four different Markov chains with starting initial conditions [0, 0, 0], [0, 0, 1], [0, 1, 0] and [0, 1, 1] are indicated with blue, green, red and aqua lines, respectively. The heavier black solid lines indicate the overall moving standard deviation of all four chains. Each row corresponds to parameter a1 , a3 and a4 from top row to bottom row. The first column corresponds to the moving standard deviations calculated up to 50th iterations, and the second column corresponds to the moving standard deviations calculated from 51st iterations up to 1000th iterations. 92 \u000CChapter 6 Conclusions and Future Work 6.1 Conclusions \u00E2\u0080\u00A2 In order to estimate parameters of biological processes that have the tendency to yield data sets with small number of sample points and irregular sample intervals, Bayesian parameter estimation method was used. \u00E2\u0080\u00A2 The Bayes Rule is adept at incorporating a priori information with the experimental data to yield posterior probability distribution of the parameter estimation. This characteristic was used to handle multiple experimental data sets and decrease the uncertainty in the estimation. Posterior distribution from each experiment was used as the prior distribution for the next estimation step. This sequential updating procedure allowed the final probability distribution of the parameters to be conditional on all of the data sets, providing a systematic method to merge information from multiple sources. \u00E2\u0080\u00A2 The complex posterior distribution obtained through Bayes Rule is often analytically intractable. Thus, a random sampling method called Markov Chain Monte Carlo was used in order to numerically approximate various probability distributions. Two different instances of MCMC were implemented, Metropolis-Hastings (MH) algorithm and Gibbs Sampler. \u00E2\u0080\u00A2 MH algorithm was used to approximate the univariate conditional probability distribu93 \u000CChapter 6 tions of process parameters. The approximated distributions were calculated under the assumption that except for a single candidate parameter, the other parameter values are conditionally known. MH algorithm was executed in conjunction with the Gibbs Sampler, and made up the inner level of iterative approximation steps. Gibbs Sampler made up the outer level of iterative approximation steps. These two MCMC sampling methods, implemented together, approximated the multi-dimensional probability distributions of nonlinear process parameters. \u00E2\u0080\u00A2 The confidence interval of the parameter estimates is obtained straightforwardly from the full probability distribution. The overall shape of the distribution conveyed that the common Gaussian distribution assumption of nonlinear process parameters is incorrect. \u00E2\u0080\u00A2 The shape of the full probability distribution agrees well with conventional sensitivity analysis, and estimability analysis, thus providing an alternative framework for analyzing nonlinear processes. \u00E2\u0080\u00A2 The choice of initial guess of the parameters did not affect the performance of the proposed algorithm as heavily as it does on conventional parameter estimation method such as Maximum Likelihood Estimation or Nonlinear Regression. \u00E2\u0080\u00A2 The high computational cost of MCMC was reduced by implementing multi-phase estimation of the Gibbs Sampler. As some Markov chains corresponding to some of the parameters in the parameter vector converge faster to their steady-state, these chains were removed from the inner level of iterations. Each parameter removed from the estimation procedure resulted in a reduction of computational cost by 1/m \u00C3\u0097 100%.10 10 m is the length of the parameter vector 94 \u000CChapter 6 6.2 Future Work 6.2.1 Further Investigation of the Algorithm In this thesis, a heuristic approach of estimating the probability distribution of nonlinear process parameters using Gibbs Sampler in different phases was discussed. This approach is successful in reducing the large computational cost when there is a large discrepancy between the rates of convergence among the parameters. However, there are other directions that a further research endeavor may explore to address this discrepancy. For instance, the order of the parameters sampled using the Gibbs Sampler in the case study of Batch fermentation reaction model was fixed at \u00C2\u00B5m \u00E2\u0086\u0092 ks \u00E2\u0086\u0092 kP \u00E2\u0086\u0092 YXS \u00E2\u0086\u0092 YP X . It is interesting to note that the two of the parameters that are notoriously harder to estimate are placed in the earlier position, and one can investigate whether putting the parameters with higher estimability before the ks and kP will result in smaller uncertainty in the estimated parameters. A preliminary study shows that a kP value that maximizes the likelihood function of the model is sensitive to the variation in the other parameters. This is in contrast to the parameter \u00C2\u00B5m where the likelihood maximizing value of this parameters does not show wide variation when the parameters of other values are changed, including kP . Therefore, if these parameters that are sensitive to the other parameters\u00E2\u0080\u0099 variations are placed in the latter part of the sampling, it will allow the other parameters to establish relatively more accurate positions in the parameter space, thus resulting in more accurate estimation of the sensitive-to-others parameters. 6.2.2 Experiment Design The uncertainty of the parameter estimates are conveyed by the probability distribution estimated through the approach discussed in this thesis. The quality of the data sets used in the case studies was poor due to their irregular sampling and small number of data points. From studying the variance of the estimated distribution and the quality of the data, one can derive a correlation between the two, by coming up with quantitative criteria for irregularity and sparsity of data 95 \u000CChapter 6 sets, and the normalized variance of the distributions of the parameters. If the total number of samples during an experiment is known a priori, then it is conceivable to think of developing an optimal sampling scheme to obtain a \u00E2\u0080\u009Cdesired\u00E2\u0080\u009D parameter distribution. This is part of our future work. 96 \u000CBibliography [1] U. Alon. An Introductionto Systems Biology. Chapman and Hall/CRC, 2007. [2] C. Andrieu, N. De Freitas, A. Doucet, and M. I. Jordan. An Introduction to MCMC for Machine Learning. Machine Learning, 50:5\u00E2\u0080\u009343, 2003. [3] M. Baltes, R. Schneider, C. Sturm, and M. Reuss. Optimal experimental design for parameter estimation in unstructured growth models. Biotechnology Progress, 10(5):480\u00E2\u0080\u0093488, 1994. [4] Y. Bard. Nonlinear Parameter Estimation. Academic Press, 1974. [5] N. Barkai and S. Leibler. Robustness in Simple Biochemical Networks. Nature, 387:913\u00E2\u0080\u0093 917, 1997. [6] J. Beck and K. Arnold. Parameter Estimation in Engineering and Science. John Wiley, 1977. [7] H. Bohr, J. Bohr, S. Brunak, R. M. J. Cotterill, H. Fredholm, B. Lautrup, and S. B. Petersen. A novel approach to prediction of the 3-dimensional structure of protein backbones by neural networks. FEBS Letters, 261(1):43\u00E2\u0080\u009346, 1990. [8] R. B. Burrows, G. R. Warnes, and R. C. Hanumara. Statistical Modelling of Biochemical Pathways. IET Systems Biology, 2007. [9] Y. Cai, X. Liu, X. Xu, and K. Chou. Artificial neural network method for predicting protein secondary structure content. Computers and Chemistry, 26:347\u00E2\u0080\u0093350, 2002. 97 \u000CBibliography [10] J. Cao and H. Zhao. Estimating Dynamic Models for Gene Regulation Networks. Bioinformatics, 24:1619\u00E2\u0080\u00931624, 2008. [11] G. Casella and R. L. Berger. Statistical Inference. Brooks/Cole Publishing Company, Pacific Grove, California, 1990. [12] C. Chen. Linear System Theory and Design. Holt, Rinehart and Winston, 1984. [13] W. Chen, B. R. Bakshi., P. K. Goel, and S. Ungarala. Bayesian Estimation via Sequential Monte Carlo Sampling - Unconstrained Nonlinear Dynamical Systems. Industrial and Engineering Chemistry Research, 43:4012\u00E2\u0080\u00934025, 2004. [14] S. Chib and E. Greenberg. Understanding the Metropolis-Hastings Algorithm. The American Statistician, 49(4):327\u00E2\u0080\u0093335, November 1995. [15] M. C. Coleman and D. E. Block. Bayesian Parameter Estimation with Informative Priors for Nonlinear Systems. AIChE Journal, 52(2):651\u00E2\u0080\u0093667, February 2006. [16] P. Englezos and N. Kalogerakis. Applied Parameter Estimation for Chemical Engineers. Marcel Dekker, Inc., 2001. [17] G. Fishman. Monte Carlo: Concepts, Algorithms, and Applications. Springer-Verlag, 1996. [18] K. Fukushima. Cognitron: A self-organizing multilayered neural network . Biological Cybernetics, 20(3-4), 1975. [19] A. R. Gallant. Nonlinear Statistical Models. John Wiley, 1987. [20] A. P. Gasch, P. T. Spellman, C. M. Kao, O. Carmel-Harel, M. B. Eisen, G. Storz, D. Botstein, and P. O. Brown. Genomic Expression Programs in the Response of Yeast Cells to Environmental Changes. Molecular Biology of the Cell, 11:4241\u00E2\u0080\u00934257, 2000. 98 \u000CBibliography [21] A. E. Gelfand, S. E. Hills, A. Racine-Poon, and A. F. M. Smith. Illustration of Bayesian Inference in Normal Data Models Using Gibbs Sampling. Journal of American Statistical Associtation, 85:972\u00E2\u0080\u0093985, 1990. [22] A. E. Gelfand and A. F. M. Smith. Sampling-Based Approaches to Calculating Marginal Densities. Journal of American Statistical Associtation, 85:398\u00E2\u0080\u0093409, 1990. [23] S. Geman and D. Geman. Stochastic relaxation, gibbs distributions and the bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1984. [24] G. Grimmett and D. Stirzaker. Probability and Random Processes. Oxford University Press, 2001. [25] R. R. Gupta and L. Achenie. A network model for gene regulation. Computers and Chemical Engineering, 31:950\u00E2\u0080\u0093961, 2006. [26] W. K. Hastings. Monte Carlo Sampling Methods using Markov Chains and Their Applications. Biometrika, 57:97\u00E2\u0080\u0093109, 1970. [27] A. Holmberg. On the practical idenetifiability of microbial growth models incorporating michaelis-menten type nonlinearities. Mathematical Biosciences, 62:23\u00E2\u0080\u009343, 1982. [28] B. Juang and L. Rabiner. An Introduction to hidden Markov models. ASSP Magazine, IEEE, 3(1):4\u00E2\u0080\u009316, 1985. [29] G. Kimmel and R. Shamir. A Block-Free Hidden Markov Model for Genotypes and Its Application to Disease Association. Journal of Computational Biology, 12(10):1243\u00E2\u0080\u00931260, 2005. [30] S. Kirkpatrick, C. Gelatt Jr., and M. Vecchi. Optimization by simulated annealing. Science, 220:671\u00E2\u0080\u0093679, May 1983. [31] W. R. Kolk and R. A. Lerman. Nonlinear System Dynamics. Van Nostrand Reinhold, 1992. 99 \u000CBibliography [32] A. Krogh, M. Brown, I. Mian, K. Sjolander, and D. Haussler. Hidden Markov Models in Computational Biology. J. Mol. Biol., 235:1501\u00E2\u0080\u00931531, 1994. [33] J. Lackie. The Dicitonary of Cell and Molecular Biology. Academic Press, 2007. [34] S. O\u00CC\u0088. Laursena, D. Webba, and W. F. Ramirez. Dynamic hybrid neural network model of an industrial fed-batch fermentation process to produce foreign protein. Computers and Chemical Engineering, 2006. [35] L. Ljung. System Identification: Theory for the User. Prentice Hall, Upper Saddle River, NJ, 2nd edition, 1999. [36] S. Mangan and U. Alon. Structure and function of the feed-forward loop network motif. PNAS, 100(21):11980\u00E2\u0080\u009311985, 2003. [37] I. A. Maraziotis, A. Dragomir, and A. Bezerianos. Gene networks reconstruction and timeseries prediction from microarray data using recurrent neural fuzzy networks. IET Systems Biology, 1(1):41\u00E2\u0080\u009350, 2007. [38] N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller. Equation of State Calculations by Fast Computing Machines. Journal of Chemical Physics, 21:1087\u00E2\u0080\u0093 1092, 1953. [39] I. J. Myung. Tutorial on maximum likelihood estimation. Journal of Mathematical Psychology, 47:90\u00E2\u0080\u0093100, 2003. [40] R. M. Neal. Probabilistic Inference Using Markov Chain Monte Carlo Methods. Technical report, Department of Computer Science, University of Toronto, 1993. [41] P. Van Laarhoven and E. Arts. Simulated Annealing: Theory and applications. Amsterdam: Reidel Publishers, 1987. [42] M. Quach, N. Brunel, and F. d\u00E2\u0080\u0099Alche Buc. Estimating parameters and hidden variables in 100 \u000CBibliography non-linear state-space models based on ODEs for biological networks inference. Bioinformatics, 23(23):3209\u00E2\u0080\u00933216, 2007. [43] L. R. Rabiner. A tutorial on Hidden Markov Models and selected applications in speech recognition. In Proceedings of the IEEE, 1989. [44] A. E. Raftery and S. Lewis. How Many iterations in the Gibbs Sampler? April 10, 1991; revised September 13, 1991, 1991. [45] W. J. Rugh. Nonlinear System Theory. The Volterra/Wiener Approach. The Johns Hopkins University Press, 1981. [46] G. Seber and C. Wild. Nonlinear Regression. John Wiley, 1989. [47] S. S. Shen-Orr, R. Milo, S. Mangan, and U. Alon. Network motifs in the transcriptional regulation network of Escherichia coli. Nature Genetics, 31, May 2002. [48] A. Siepel and D. Haussler. Combining Phylogenetic and Hidden Markov Models in Biosequence Analysis. Journal of Computational Biology, 11:413\u00E2\u0080\u0093428, 2004. [49] D. Sivia. Data Analysis : A Bayesian Tutorial. Clarendon Press, Oxford, 1996. [50] T.S. So\u00CC\u0088derstro\u00CC\u0088m and P. Stoica. System Identification. Prentice Hall International, 1989. [51] I. Swameye, T. G. Muller, J. TImmer, O. Sandra, and U. Klingmuller. Identification of Nucleocytoplasmic Cycling as a Remote Sensor in Cellular Signaling by Databased Modeling. Proceedings of the National Academy of Sciences of the United States of America, 100(3):1028\u00E2\u0080\u00931033, 2003. [52] J. Tomshine and Y. N. Kaznessis. Optimization of a Stochastically Simulated Gene Network Model via Simulated Annealing. Biophysical Journal, 91:3196\u00E2\u0080\u00933205, 2006. [53] J. V. Tu. Advantages and disadvantages of using artificial neural networks versus logistic regression for predicting medical outcomes. Journal of Clinical Epidemiology, 49(11):1225\u00E2\u0080\u00931231, November 1996. 101 \u000CBibliography [54] J. Wu and J. Xie. Computation-Based Discovery of Cis-Regulatory Modules by Hidden Markov Model. Journal of Computational Biology, 15(3):279\u00E2\u0080\u0093290, 2008. [55] K. Yao, B. Shaw, B. Kou, K. McAulley, and D. Bacon. Modeling Ethylene/Butene Copolymerization with Multi-site Catalysts: Parameter Estimability and Experiment Design. Polymer Reaction Engineering, 11(3):563\u00E2\u0080\u0093588, 2003. [56] J. Zhang. Batch-to-batch optimal control of a batch polymerisation process based on stacked neural network models. Chemical Engineering Science, 63:1273\u00E2\u0080\u00931281, 2008. [57] Z. Zi and E. Klipp. SBML-PET: a Systems Biology Markup Language-based parameter estimation tool. Bioinformatics, 22(21):2704\u00E2\u0080\u00932705, 2006. 102 \u000CAppendix A Experimental Data Simulation Simulating the experimental data of nonlinear process with irregular sampling time starts with the time vector T, where 0 \u00E2\u0089\u00A4 T \u00E2\u0089\u00A4 Tmax . In order to simulate the irregular sampling time, T \u00E2\u0088\u0088 RN , MATLAB R \u00E2\u0080\u0098RAND\u00E2\u0080\u0099 function is used, where N is the number of samples. Program A.1 MATLAB program that simulates nonlinear process experimental data with irregular sampling time. \u00E2\u0080\u0098k\u00E2\u0080\u0099 = number of experiments, \u00E2\u0080\u0098theta\u00E2\u0080\u0099 = parameter vector, \u00E2\u0080\u0098N\u00E2\u0080\u0099 = number of samples, \u00E2\u0080\u0098T\u00E2\u0080\u0099 = sampling time, \u00E2\u0080\u0098init\u00E2\u0080\u0099 = initial condition of the states, \u00E2\u0080\u0098sigma\u00E2\u0080\u0099 = white noise standard deviation, \u00E2\u0080\u0098Tmax\u00E2\u0080\u0099 = Tmax . global N T theta sigma for i = 1:k T = sort([0;rand(N-1,1)]*Tmax); sol = ode45(@(t,x) MODEL_ode(t,x,theta), [0 Tmax], init); states = deval(sol,T)\u00E2\u0080\u0099; y = states + randn(size(states))*sigma; ExpData(:,:,i) = y; end \u00E2\u0080\u0098MODEL ode\u00E2\u0080\u0099 is a user-defined MATLAB function that handles the right side of the differential equation. Following are the functions for batch fermentation model, FFL model and JAK-STAT signal transduction pathway model, respectively. Program A.2 MATLAB function that handles the ordinary differential equations of batch fermentation model. function dxdt = MODEL_ode(t,x,theta) mu = theta(1)*x(2)/(theta(2)+x(2))*(1-x(3)/theta(3)); dxdt = [mu*x(1); -mu*x(1)/theta(4); theta(5)*mu*x(1)]; end 103 \u000CAppendix A Program A.3 MATLAB function that handles the ordinary differential equations of FeedForward Loop genetic regulation network model. function dxdt = MODEL_ode(t,x,theta) B_y = 1; B_z = 1; H = 2; dxdt = [-theta(1)*y(1) + ... B_y*((FFL_X_real(t)/theta(3)).\u00CB\u0086H)/... (1+(FFL_X_real(t)/theta(3)).\u00CB\u0086H); -theta(2)*y(2) + ... B_z*((FFL_X_real(t)/theta(4)).\u00CB\u0086H)/... (1+(FFL_X_real(t)/theta(4).\u00CB\u0086H); ((y(1)/theta(5)).\u00CB\u0086H)/(1+y(1)/theta(5)).\u00CB\u0086H)]; end Program A.4 MATLAB function that handles the ordinary differential equations of JAK-STAT signal pathway model. function dxdt = JAK_STAT_ode(t,x,theta) global tao; if (t "Thesis/Dissertation"@en .
"2009-05"@en .
"10.14288/1.0058616"@en .
"eng"@en .
"Chemical and Biological Engineering"@en .
"Vancouver : University of British Columbia Library"@en .
"University of British Columbia"@en .
"Attribution-NonCommercial-NoDerivatives 4.0 International"@en .
"http://creativecommons.org/licenses/by-nc-nd/4.0/"@en .
"Graduate"@en .
"Parameter estimation of stochastic nonlinear dynamic processes using multiple experimental data sets : with biological applications"@en .
"Text"@en .
"http://hdl.handle.net/2429/7294"@en .