System Identification of Enzymatic Control Processes Using Population Monte Carlo Methods
Description
We demonstrate the superiority of Population Monte Carlo techniques over standard Metropolis Markov Chain Monte Carlo (MCMC) methods for inferring optimal parameters for a particular mechanistic model of a biological process given noisy experimental data. As our understanding of biological processes increases, the proposed models to describe them become more complex. With such potentially large numbers of equations and parameters, it is no longer feasible to hand-pick parameter values and be sure that the most appropriate values have been chosen. Monte Carlo methods are becoming more widely used for estimating parameter values, however we show that the standard Metropolis MCMC approach fails to converge on optimal values for even relatively simple models and that a more sophisticated method, in the form of non-Markovian Population Monte Carlo, may be successfully employed to produce consistent and accurate results. We illustrate the basic problem using the minimal model for the circadian genetic network in Arabidopsis thaliana, which consists of 3 linked differential equations containing a total of 6 parameters, with an additional noise parameter incorporated to estimate the variance of noise in the data. Joint work with Mark Girolami.
Categories
Top: Computer Science: BioinformaticsTop: Computer Science: Machine Learning: Markov Processes
| Slides | |
| 0:01 | System Identification of Enzymatic Control Processes Using Population Monte Carlo Methods |
| 0:35 | Outline |
| 1:49 | Biological Motivation |
| 2:45 | Circadian Rhythms |
| 3:48 | A Minimal Model to Describe Circadian Control |
| 4:49 | An Extended Goodwin Model |
| 5:56 | Example of Possible Outputs |
| 6:10 | Long Term Goals |
| 7:07 | Bayesian Model Inference |
| 7:17 | Model Inference |
| 8:04 | Defining the Model and the Data |
| 8:41 | Defining a Likelihood Function |
| 9:17 | A Standard MCMC Approach |
| 9:33 | A Random Walk in Parameter Space |
| 10:12 | Engineering a Solution |
| 10:58 | Implementation |
| 12:45 | Results - 15 Parallel Chains |
| 13:25 | Results - 30 Parallel Chains |
| 14:06 | A Population Monte Carlo Approach |
| 14:31 | Comparison of Population Monte Carlo |
| 15:43 | How Non-Markovian Population Monte Carlo Works |
| 16:03 | How Non-Markovian Population Monte Carlo Works |
| 16:50 | Features of Non-Markovian Population Monte Carlo |
| 16:54 | Implementation |
| 17:08 | Results for a Population of 40 Particles |
| 17:28 | Potential Pitfalls |
| 18:05 | Summary of Non-Markovian Population Monte Ca |
| 18:56 | Future Work |
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Related content
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !





