How data assimilation helps to illuminate complex biology

Size: px
Start display at page:

Download "How data assimilation helps to illuminate complex biology"

Transcription

1 How data assimilation helps to illuminate complex biology The dynamic elastic-net Maik Kschischo Department of Mathematics and Technology University of Applied Sciences Koblenz RheinAhrCampus Remagen Joseph-Rovan-Allee Remagen kschischo@rheinahrcampus.de RISDA 2017 Maik Kschischo (RheinAhrCampus) Dynamic elastic-net RISDA / 23

2 Overview 1 Some challenges for modelling in molecular systems biology 2 The dynamic elastic net: An algorithm for state and model error estimation in imperfect models 3 Test examples 4 Outlook Maik Kschischo (RheinAhrCampus) Dynamic elastic-net RISDA / 23

3 How to model a complex dynamical reaction system? Pathways in Cancer (KEGG hsa05200, 10/23/25, Kaneshisa Lab) Maik Kschischo (RheinAhrCampus) Dynamic elastic-net RISDA / 23

4 Modelling subnetworks Pathways in Cancer (KEGG hsa05200, 10/23/25, Kaneshisa Lab) Maik Kschischo (RheinAhrCampus) Dynamic elastic-net RISDA / 23

5 Crosstalk and external feedback loops Pathways in Cancer (KEGG hsa05200, 10/23/25, Kaneshisa Lab) Maik Kschischo (RheinAhrCampus) Dynamic elastic-net RISDA / 23

6 Challenges for Modelling Kahm et al., PLoS Comput Biol 8, 2012; Tsigkinopoulou et al., Trends in Biotechnology, 2016 We have only incomplete or uncertain information about the Reaction network Reaction rate functions (dynamic laws of the reactions) Parameter values Data: Molecular concentration measurements over time (e.g. protein) Not all the molecular substances can directly be measured Measurements are often very noisy Some proteins can not be identified Maik Kschischo (RheinAhrCampus) Dynamic elastic-net RISDA / 23

7 Challenges for Modelling Kahm et al., PLoS Comput Biol 8, 2012; Tsigkinopoulou et al., Trends in Biotechnology, 2016 We have only incomplete or uncertain information about the Reaction network Reaction rate functions (dynamic laws of the reactions) Parameter values Data: Molecular concentration measurements over time (e.g. protein) Not all the molecular substances can directly be measured Measurements are often very noisy Some proteins can not be identified Methods for modelling under uncertain and incomplete information are needed! Maik Kschischo (RheinAhrCampus) Dynamic elastic-net RISDA / 23

8 Outline 1 Some challenges for modelling in molecular systems biology 2 The dynamic elastic net: An algorithm for state and model error estimation in imperfect models 3 Test examples 4 Outlook Maik Kschischo (RheinAhrCampus) Dynamic elastic-net RISDA / 23

9 Systems models and influence graphs State vector: x = (x 1,..., x n ) T Output (measured): y = (y 1,..., y m ) T u Ordinary differential equation (ODE) model Influence graph ẋ = f (x, u) y = h(x) Each state variable x i is a vertex Draw a directed edge x i x j iff f j x i 0 Legend: known input u state variable: x i model system systems border interaction Maik Kschischo (RheinAhrCampus) Dynamic elastic-net RISDA / 23

10 The nominal model and the true system a u b u c u Legend: nominal model system true system nominal model with unknown inputs known input u nominal systems border hidden state variable unknown input nominal systems state variable: interaction in nominal system hidden interaction Maik Kschischo (RheinAhrCampus) Dynamic elastic-net RISDA / 23

11 Defining the model error Ordinary differential equation (ODE) models Maik Kschischo (RheinAhrCampus) Dynamic elastic-net RISDA / 23

12 Defining the model error Ordinary differential equation (ODE) models The nominal model (the draft) x = f ( x, u) ỹ = h( x) Maik Kschischo (RheinAhrCampus) Dynamic elastic-net RISDA / 23

13 Defining the model error Ordinary differential equation (ODE) models The nominal model (the draft) x = f ( x, u) ỹ = h( x) True model (with unkown error) ẋ = f (x, u) + w y = h (x) Maik Kschischo (RheinAhrCampus) Dynamic elastic-net RISDA / 23

14 Defining the model error Ordinary differential equation (ODE) models The nominal model (the draft) x = f ( x, u) ỹ = h( x) True model (with unkown error) ẋ = f (x, u) + w y = h (x) Model error = hidden input to nominal model w(t) = ẋ(t) f (x(t), u(t)) Note: x(t) is the trajectory of the true system. Maik Kschischo (RheinAhrCampus) Dynamic elastic-net RISDA / 23

15 Data assimilation problem with structural model error What we have: The nominal model (a model draft) Data: y(t k ) for some time points t k, k = 1,..., N Maik Kschischo (RheinAhrCampus) Dynamic elastic-net RISDA / 23

16 Data assimilation problem with structural model error What we have: The nominal model (a model draft) Data: y(t k ) for some time points t k, k = 1,..., N What we want to know: 1 Where is the nominal model wrong? Set of target nodes W = {i {1,..., n} w i 0} 2 The dynamics of the model error w(t) 3 The unknown state trajectory x(t) of the true system Maik Kschischo (RheinAhrCampus) Dynamic elastic-net RISDA / 23

17 Data assimilation problem with structural model error What we have: The nominal model (a model draft) Data: y(t k ) for some time points t k, k = 1,..., N This is an ill posed problem! What we want to know: 1 Where is the nominal model wrong? Set of target nodes W = {i {1,..., n} w i 0} 2 The dynamics of the model error w(t) 3 The unknown state trajectory x(t) of the true system Different models/model errors could explain the data equally well = (Non-)observability of the model error Maik Kschischo (RheinAhrCampus) Dynamic elastic-net RISDA / 23

18 Data assimilation with structural model error Additional assumptions The model error signal w(t) 1 is a smooth function 2 a sparse vector The set of target nodes W = {i {1,..., n} wi 0} is small Most parsimonious explanation for observed discrepancy between the nominal model output and the data Maik Kschischo (RheinAhrCampus) Dynamic elastic-net RISDA / 23

19 Estimating the model error using the Dynamic Elastic-Net Which simple error signal could fit the data? Data: Measure y(t k ) for some time points t k, k = 1,..., N Idea: Build an observer system (copy of the true system): ˆx = f (ˆx(t), u(t)) + ŵ(t) ŷ(t) = h(ˆx(t)) Infer the simplest ŵ(t) that explains the data: { N } min y(t k ) ŷ(t k ) 2 Q(t ŵ k ) + R[ŵ] (t) k=1 L1 and L 2 regularisation (dynamic elastic-net) induces sparsity and smoothness R[ŵ] = α 1 ŵ(t) 1 + α 2 2 ŵ(t) 2 2 Maik Kschischo (RheinAhrCampus) Dynamic elastic-net RISDA / 23

20 Outline 1 Some challenges for modelling in molecular systems biology 2 The dynamic elastic net: An algorithm for state and model error estimation in imperfect models 3 Test examples 4 Outlook Maik Kschischo (RheinAhrCampus) Dynamic elastic-net RISDA / 23

21 Testing the algorithm Example 1: The Jak-Stat-model from Swameye et al., PNAS, Nominal Model of Swameye et al.: Epo binds the EpoR (receptor) Cytoplasmatic STAT5 ist activated Phosphorylated STAT5 dimerises Export to the nucleous Swameye et al., PNAS, 100, 2001, Figure 1 on page Maik Kschischo (RheinAhrCampus) Dynamic elastic-net RISDA / 23

22 Testing the algorithm Example 1: The Jak-Stat-model from Swameye et al., PNAS, Nominal Model of Swameye et al.: Epo binds the EpoR (receptor) Cytoplasmatic STAT5 ist activated Phosphorylated STAT5 dimerises Export to the nucleous Missing reaction: Recycling of nuclear STAT (Raue et al., Bioinformatics, 2009.) Swameye et al., PNAS, 100, 2001, Figure 1 on page Maik Kschischo (RheinAhrCampus) Dynamic elastic-net RISDA / 23

23 Testing the algorithm Example 1: The Jak-Stat-model from Swameye et al., PNAS, Swameye et al., PNAS, 100, 2001, Figure 1 on page Nominal Model of Swameye et al.: Epo binds the EpoR (receptor) Cytoplasmatic STAT5 ist activated Phosphorylated STAT5 dimerises Export to the nucleous Missing reaction: Recycling of nuclear STAT (Raue et al., Bioinformatics, 2009.) Could this have been learned from the data? Apply the dynamic elastic-net Maik Kschischo (RheinAhrCampus) Dynamic elastic-net RISDA / 23

24 The Jak-Stat-System Detecting nucleocytoplasmatic cycling (data points from Swameye et al., 2001.) Legend: known input, data, nominal model, dynamic elastic-net a 1 pepor (a.u.) c b 1 total STAT5p (a.u.) c 1 total STAT5 (a.u.) ^y u(t) 0.5 ^y d x 1 x 2 x 3 x t (min) u(t) x^1 x^2 x^3 x^4 ^w 1 ^w 2 ^w 3 ^w 4 e AUC (a.u.) t (min) 0 ^w 1 ~ y 1 model error (a.u.) ^w 2 ^w 4 ^w t (min) f ~ y t (min) STAT5, cyt. (a.u.) x^ t (min) t (min) x~ ~ 1 x t (min) STAT5p, cyt. (a.u.) x^2 STAT5p-dimer, cyt. (a.u.) STAT5p-dimer, nucl.(a.u.) x~ 3 x^3 x~ 4 x^ t (min) Maik Kschischo (RheinAhrCampus) Dynamic elastic-net RISDA / 23

25 Testing the algorithm Example 2: The UVB-system A model for photomorphogenic UV-B signalling in plants (Ouyang, X. et al. Proc. Natl. Acad. Sci. USA, 2014) 11 protein concentrations x(t) participating in 10 reactions The system was perturbed by a known model error Can we recover this error w(t) and the true state x(t)? Maik Kschischo (RheinAhrCampus) Dynamic elastic-net RISDA / 23

26 The UVB-system Detecting the error and the true state Legend: data, nominal model, dynamic elastic-net a x 5 x 7 b 40 c x x 9 10 x 3 x 6 (a.u.) x 2 x 1 10 x 11 x 4 x 10 x t (min) 2x 5 +2x 4 +x 8 (a.u.) t (min) d 20 e 25 f x 7 (a.u.) (w-ŵ)/a (a.u.) t (min) g AUC (a.u.) h 0.1 ^w 9 ^w 6 i ^w w 1 w 2 w 3 w 4 w 5 w 6 w 7 w 8 w 9 w 10 w^ 11 t (min) 2x5+2x3+x1 (a.u.) x 8 (a.u.) state error (a.u.) t (min) t (min) t (min) Maik Kschischo (RheinAhrCampus) Dynamic elastic-net RISDA / 23

27 Testing the limitations All single and pairwise combinations in the UVB-system a x1 3 x3 3, Na 3 x4 5, Na 5, 3 6 x5 5, 3 5, 3 5, 6 5 x6 6, 5 6, 3 6, Na 6, 5 6 x7 7, 3 7, 3 7, 8 7, 5 8, 6 7 x8 8, 7 5, 3 8, 6 8, 5 8, 6 8, 7 8 x9 9, 3 9, 3 9, 6 9, 5 9, 6 9, 7 9, 8 9 x1 x3 x4 x5 x6 x7 x8 x9 b c AUC (a.u.) AUC (a.u.) true target nodes: (9,1) no constraints w^ 3 =0 w ^ 1 w ^ 2 w ^ 3 w ^ 4 w ^ 5 w ^ 6 w ^ 7 w ^ 8 w ^ 9 w ^ 10 w^ 11 Some model errors are non-observable Simple algorithm to explore suboptimal solutions (next slide) The true target nodes are found amongst the highest ranking suboptimal solutions Maik Kschischo (RheinAhrCampus) Dynamic elastic-net RISDA / 23

28 Exploring suboptimal solutions A heuristic algorithm 1 Init B = I n (identity matrix) 2 Solve the DEN using the observer system ˆx = f (ˆx(t), u(t)) + Bŵ(t) and estimate ŵ(t) and Ŵ = {k ŵ k (t) 0} 3 If the squared error N k=1 y(t k) ŷ(t k ) 2 Q(t k ) is too big, then STOP. 4 Find the index k Ŵ of the smallest nonzero signal ŵ k (t) (as measured by L 1 norm) 5 Delete the k-th column in B and the corresponding row of ŵ and GOTO 2. Result: A set of suboptimal solutions of the DEN providing candidate model errors and state estimates. Maik Kschischo (RheinAhrCampus) Dynamic elastic-net RISDA / 23

29 Summary and Outlook Dynamic elastic-net Estimates the nodes in a network, where the model could be wrong and Estimates the true system state trajectory, even for incomplete or incorrect models Non-observable model error No unique solution possible Greedy approach to explore suboptimal solutions Further research Network properties and model error observability Optimal experimental design to improve observability of model error Assign uncertainty/confidence (Engelhardt et al., submitted) Maik Kschischo (RheinAhrCampus) Dynamic elastic-net RISDA / 23

30 Bayesian Dynamic Elastic-Net (BDEN) JAK-STAT signalling pathway (Swameye et al., 2003) Uncertainty quantification for state and model error estimates (Engelhardt et al., submitted) Maik Kschischo (RheinAhrCampus) Dynamic elastic-net RISDA / 23

31 Acknowledgement Thanks for the great collaboration Holger Fröhlich (1,2) Benjamin Engelhardt (1) (1) Rheinische Friedrich-Wilhelms-Universität Bonn, Institute for Computer Science, Algorithmic Bioinformatics, c/o Bonn-Aachen International Center for IT (2) UCB Biosciences GmbH For some details: Engelhardt, B., Fröhlich, H. and Kschischo, M Learning (from) the errors of a systems biology model. Scientific Reports 6: Maik Kschischo (RheinAhrCampus) Dynamic elastic-net RISDA / 23

Bayesian Calibration of Simulators with Structured Discretization Uncertainty

Bayesian Calibration of Simulators with Structured Discretization Uncertainty Bayesian Calibration of Simulators with Structured Discretization Uncertainty Oksana A. Chkrebtii Department of Statistics, The Ohio State University Joint work with Matthew T. Pratola (Statistics, The

More information

Nested Effects Models at Work

Nested Effects Models at Work 21/06/2010 Nested ffects Models at Work Tutorial Session: Network Modelling in Systems Biology with R Prof. Dr. Holger Fröhlich Algorithmic Bioinformatics Bonn-Aachen International Center for Information

More information

Introduction to Model Order Reduction

Introduction to Model Order Reduction Introduction to Model Order Reduction Lecture 1: Introduction and overview Henrik Sandberg Kin Cheong Sou Automatic Control Lab, KTH ACCESS Specialized Course Graduate level Ht 2010, period 1 1 Overview

More information

Comparative Network Analysis

Comparative Network Analysis Comparative Network Analysis BMI/CS 776 www.biostat.wisc.edu/bmi776/ Spring 2016 Anthony Gitter gitter@biostat.wisc.edu These slides, excluding third-party material, are licensed under CC BY-NC 4.0 by

More information

Data-driven signal processing

Data-driven signal processing 1 / 35 Data-driven signal processing Ivan Markovsky 2 / 35 Modern signal processing is model-based 1. system identification prior information model structure 2. model-based design identification data parameter

More information

Sparsity in system identification and data-driven control

Sparsity in system identification and data-driven control 1 / 40 Sparsity in system identification and data-driven control Ivan Markovsky This signal is not sparse in the "time domain" 2 / 40 But it is sparse in the "frequency domain" (it is weighted sum of six

More information

Oslo Class 6 Sparsity based regularization

Oslo Class 6 Sparsity based regularization RegML2017@SIMULA Oslo Class 6 Sparsity based regularization Lorenzo Rosasco UNIGE-MIT-IIT May 4, 2017 Learning from data Possible only under assumptions regularization min Ê(w) + λr(w) w Smoothness Sparsity

More information

Learning in Bayesian Networks

Learning in Bayesian Networks Learning in Bayesian Networks Florian Markowetz Max-Planck-Institute for Molecular Genetics Computational Molecular Biology Berlin Berlin: 20.06.2002 1 Overview 1. Bayesian Networks Stochastic Networks

More information

ME 132, Fall 2015, Quiz # 2

ME 132, Fall 2015, Quiz # 2 ME 132, Fall 2015, Quiz # 2 # 1 # 2 # 3 # 4 # 5 # 6 Total NAME 14 10 8 6 14 8 60 Rules: 1. 2 sheets of notes allowed, 8.5 11 inches. Both sides can be used. 2. Calculator is allowed. Keep it in plain view

More information

Introduction. Dagmar Iber Jörg Stelling. CSB Deterministic, SS 2015, 1.

Introduction. Dagmar Iber Jörg Stelling. CSB Deterministic, SS 2015, 1. Introduction Dagmar Iber Jörg Stelling joerg.stelling@bsse.ethz.ch CSB Deterministic, SS 2015, 1 Origins of Systems Biology On this assumption of the passage of blood, made as a basis for argument, and

More information

Sequential State Estimation (Crassidas and Junkins, Chapter 5)

Sequential State Estimation (Crassidas and Junkins, Chapter 5) Sequential State Estimation (Crassidas and Junkins, Chapter 5) Please read: 5.1, 5.3-5.6 5.3 The Discrete-Time Kalman Filter The discrete-time Kalman filter is used when the dynamics and measurements are

More information

Data assimilation in high dimensions

Data assimilation in high dimensions Data assimilation in high dimensions David Kelly Courant Institute New York University New York NY www.dtbkelly.com February 12, 2015 Graduate seminar, CIMS David Kelly (CIMS) Data assimilation February

More information

Probabilistic Graphical Models

Probabilistic Graphical Models School of Computer Science Probabilistic Graphical Models Gaussian graphical models and Ising models: modeling networks Eric Xing Lecture 0, February 5, 06 Reading: See class website Eric Xing @ CMU, 005-06

More information

Sparse, stable gene regulatory network recovery via convex optimization

Sparse, stable gene regulatory network recovery via convex optimization Sparse, stable gene regulatory network recovery via convex optimization Arwen Meister June, 11 Gene regulatory networks Gene expression regulation allows cells to control protein levels in order to live

More information

Learning parameters in ODEs

Learning parameters in ODEs Learning parameters in ODEs Application to biological networks Florence d Alché-Buc Joint work with Minh Quach and Nicolas Brunel IBISC FRE 3190 CNRS, Université d Évry-Val d Essonne, France /14 Florence

More information

Final Exam December 12, 2017

Final Exam December 12, 2017 Introduction to Artificial Intelligence CSE 473, Autumn 2017 Dieter Fox Final Exam December 12, 2017 Directions This exam has 7 problems with 111 points shown in the table below, and you have 110 minutes

More information

MIT 9.520/6.860, Fall 2018 Statistical Learning Theory and Applications. Class 08: Sparsity Based Regularization. Lorenzo Rosasco

MIT 9.520/6.860, Fall 2018 Statistical Learning Theory and Applications. Class 08: Sparsity Based Regularization. Lorenzo Rosasco MIT 9.520/6.860, Fall 2018 Statistical Learning Theory and Applications Class 08: Sparsity Based Regularization Lorenzo Rosasco Learning algorithms so far ERM + explicit l 2 penalty 1 min w R d n n l(y

More information

Linear Quadratic Zero-Sum Two-Person Differential Games Pierre Bernhard June 15, 2013

Linear Quadratic Zero-Sum Two-Person Differential Games Pierre Bernhard June 15, 2013 Linear Quadratic Zero-Sum Two-Person Differential Games Pierre Bernhard June 15, 2013 Abstract As in optimal control theory, linear quadratic (LQ) differential games (DG) can be solved, even in high dimension,

More information

Inferring Protein-Signaling Networks II

Inferring Protein-Signaling Networks II Inferring Protein-Signaling Networks II Lectures 15 Nov 16, 2011 CSE 527 Computational Biology, Fall 2011 Instructor: Su-In Lee TA: Christopher Miles Monday & Wednesday 12:00-1:20 Johnson Hall (JHN) 022

More information

SGN Advanced Signal Processing Project bonus: Sparse model estimation

SGN Advanced Signal Processing Project bonus: Sparse model estimation SGN 21006 Advanced Signal Processing Project bonus: Sparse model estimation Ioan Tabus Department of Signal Processing Tampere University of Technology Finland 1 / 12 Sparse models Initial problem: solve

More information

Linear Quadratic Zero-Sum Two-Person Differential Games

Linear Quadratic Zero-Sum Two-Person Differential Games Linear Quadratic Zero-Sum Two-Person Differential Games Pierre Bernhard To cite this version: Pierre Bernhard. Linear Quadratic Zero-Sum Two-Person Differential Games. Encyclopaedia of Systems and Control,

More information

Final Exam December 12, 2017

Final Exam December 12, 2017 Introduction to Artificial Intelligence CSE 473, Autumn 2017 Dieter Fox Final Exam December 12, 2017 Directions This exam has 7 problems with 111 points shown in the table below, and you have 110 minutes

More information

Proximity-Based Anomaly Detection using Sparse Structure Learning

Proximity-Based Anomaly Detection using Sparse Structure Learning Proximity-Based Anomaly Detection using Sparse Structure Learning Tsuyoshi Idé (IBM Tokyo Research Lab) Aurelie C. Lozano, Naoki Abe, and Yan Liu (IBM T. J. Watson Research Center) 2009/04/ SDM 2009 /

More information

Introduction How it works Theory behind Compressed Sensing. Compressed Sensing. Huichao Xue. CS3750 Fall 2011

Introduction How it works Theory behind Compressed Sensing. Compressed Sensing. Huichao Xue. CS3750 Fall 2011 Compressed Sensing Huichao Xue CS3750 Fall 2011 Table of Contents Introduction From News Reports Abstract Definition How it works A review of L 1 norm The Algorithm Backgrounds for underdetermined linear

More information

Observability and state estimation

Observability and state estimation EE263 Autumn 2015 S Boyd and S Lall Observability and state estimation state estimation discrete-time observability observability controllability duality observers for noiseless case continuous-time observability

More information

Ergodicity in data assimilation methods

Ergodicity in data assimilation methods Ergodicity in data assimilation methods David Kelly Andy Majda Xin Tong Courant Institute New York University New York NY www.dtbkelly.com April 15, 2016 ETH Zurich David Kelly (CIMS) Data assimilation

More information

Stochastic Optimal Control!

Stochastic Optimal Control! Stochastic Control! Robert Stengel! Robotics and Intelligent Systems, MAE 345, Princeton University, 2015 Learning Objectives Overview of the Linear-Quadratic-Gaussian (LQG) Regulator Introduction to Stochastic

More information

FEL3210 Multivariable Feedback Control

FEL3210 Multivariable Feedback Control FEL3210 Multivariable Feedback Control Lecture 8: Youla parametrization, LMIs, Model Reduction and Summary [Ch. 11-12] Elling W. Jacobsen, Automatic Control Lab, KTH Lecture 8: Youla, LMIs, Model Reduction

More information

Protein Complex Identification by Supervised Graph Clustering

Protein Complex Identification by Supervised Graph Clustering Protein Complex Identification by Supervised Graph Clustering Yanjun Qi 1, Fernanda Balem 2, Christos Faloutsos 1, Judith Klein- Seetharaman 1,2, Ziv Bar-Joseph 1 1 School of Computer Science, Carnegie

More information

Lecture 19 Observability and state estimation

Lecture 19 Observability and state estimation EE263 Autumn 2007-08 Stephen Boyd Lecture 19 Observability and state estimation state estimation discrete-time observability observability controllability duality observers for noiseless case continuous-time

More information

Jeremy Chang Identifying protein protein interactions with statistical coupling analysis

Jeremy Chang Identifying protein protein interactions with statistical coupling analysis Jeremy Chang Identifying protein protein interactions with statistical coupling analysis Abstract: We used an algorithm known as statistical coupling analysis (SCA) 1 to create a set of features for building

More information

Introduction to Mathematical Modeling

Introduction to Mathematical Modeling Introduction to Mathematical Modeling - Systems Theory in the Toolbox for Systems Biology The 5 th International Course in Yeast Systems Biology 2011 June 6, 2011, PhD, Assoc Prof Head of Department Systems

More information

Low-Complexity Encoding Algorithm for LDPC Codes

Low-Complexity Encoding Algorithm for LDPC Codes EECE 580B Modern Coding Theory Low-Complexity Encoding Algorithm for LDPC Codes Problem: Given the following matrix (imagine a larger matrix with a small number of ones) and the vector of information bits,

More information

Probabilistic Graphical Models

Probabilistic Graphical Models School of Computer Science Probabilistic Graphical Models Gaussian graphical models and Ising models: modeling networks Eric Xing Lecture 0, February 7, 04 Reading: See class website Eric Xing @ CMU, 005-04

More information

Inferring Protein-Signaling Networks

Inferring Protein-Signaling Networks Inferring Protein-Signaling Networks Lectures 14 Nov 14, 2011 CSE 527 Computational Biology, Fall 2011 Instructor: Su-In Lee TA: Christopher Miles Monday & Wednesday 12:00-1:20 Johnson Hall (JHN) 022 1

More information

Direct Learning: Linear Regression. Donglin Zeng, Department of Biostatistics, University of North Carolina

Direct Learning: Linear Regression. Donglin Zeng, Department of Biostatistics, University of North Carolina Direct Learning: Linear Regression Parametric learning We consider the core function in the prediction rule to be a parametric function. The most commonly used function is a linear function: squared loss:

More information

Overview of the Seminar Topic

Overview of the Seminar Topic Overview of the Seminar Topic Simo Särkkä Laboratory of Computational Engineering Helsinki University of Technology September 17, 2007 Contents 1 What is Control Theory? 2 History

More information

Introduction to Bioinformatics

Introduction to Bioinformatics Systems biology Introduction to Bioinformatics Systems biology: modeling biological p Study of whole biological systems p Wholeness : Organization of dynamic interactions Different behaviour of the individual

More information

Structured matrix factorizations. Example: Eigenfaces

Structured matrix factorizations. Example: Eigenfaces Structured matrix factorizations Example: Eigenfaces An extremely large variety of interesting and important problems in machine learning can be formulated as: Given a matrix, find a matrix and a matrix

More information

Introduction to Model Order Reduction

Introduction to Model Order Reduction KTH ROYAL INSTITUTE OF TECHNOLOGY Introduction to Model Order Reduction Lecture 1: Introduction and overview Henrik Sandberg, Bart Besselink, Madhu N. Belur Overview of Today s Lecture What is model (order)

More information

A Database of human biological pathways

A Database of human biological pathways A Database of human biological pathways Steve Jupe - sjupe@ebi.ac.uk 1 Rationale Journal information Nature 407(6805):770-6.The Biochemistry of Apoptosis. Caspase-8 is the key initiator caspase in the

More information

Hierarchy. Will Penny. 24th March Hierarchy. Will Penny. Linear Models. Convergence. Nonlinear Models. References

Hierarchy. Will Penny. 24th March Hierarchy. Will Penny. Linear Models. Convergence. Nonlinear Models. References 24th March 2011 Update Hierarchical Model Rao and Ballard (1999) presented a hierarchical model of visual cortex to show how classical and extra-classical Receptive Field (RF) effects could be explained

More information

Output Adaptive Model Reference Control of Linear Continuous State-Delay Plant

Output Adaptive Model Reference Control of Linear Continuous State-Delay Plant Output Adaptive Model Reference Control of Linear Continuous State-Delay Plant Boris M. Mirkin and Per-Olof Gutman Faculty of Agricultural Engineering Technion Israel Institute of Technology Haifa 3, Israel

More information

Supplementary Material for Load Capacity. Improvements in Nucleic Acid Based Systems. Using Partially Open Feedback Control

Supplementary Material for Load Capacity. Improvements in Nucleic Acid Based Systems. Using Partially Open Feedback Control Supplementary Material for Load Capacity Improvements in Nucleic Acid Based Systems Using Partially Open Feedback Control Vishwesh Kulkarni,, Evgeny Kharisov, Naira Hovakimyan, and Jongmin Kim Institute

More information

On Convergence of Nonlinear Active Disturbance Rejection for SISO Systems

On Convergence of Nonlinear Active Disturbance Rejection for SISO Systems On Convergence of Nonlinear Active Disturbance Rejection for SISO Systems Bao-Zhu Guo 1, Zhi-Liang Zhao 2, 1 Academy of Mathematics and Systems Science, Academia Sinica, Beijing, 100190, China E-mail:

More information

ẋ n = f n (x 1,...,x n,u 1,...,u m ) (5) y 1 = g 1 (x 1,...,x n,u 1,...,u m ) (6) y p = g p (x 1,...,x n,u 1,...,u m ) (7)

ẋ n = f n (x 1,...,x n,u 1,...,u m ) (5) y 1 = g 1 (x 1,...,x n,u 1,...,u m ) (6) y p = g p (x 1,...,x n,u 1,...,u m ) (7) EEE582 Topical Outline A.A. Rodriguez Fall 2007 GWC 352, 965-3712 The following represents a detailed topical outline of the course. It attempts to highlight most of the key concepts to be covered and

More information

Lecture 5 Least-squares

Lecture 5 Least-squares EE263 Autumn 2008-09 Stephen Boyd Lecture 5 Least-squares least-squares (approximate) solution of overdetermined equations projection and orthogonality principle least-squares estimation BLUE property

More information

The integrating factor method (Sect. 1.1)

The integrating factor method (Sect. 1.1) The integrating factor method (Sect. 1.1) Overview of differential equations. Linear Ordinary Differential Equations. The integrating factor method. Constant coefficients. The Initial Value Problem. Overview

More information

Data assimilation in high dimensions

Data assimilation in high dimensions Data assimilation in high dimensions David Kelly Kody Law Andy Majda Andrew Stuart Xin Tong Courant Institute New York University New York NY www.dtbkelly.com February 3, 2016 DPMMS, University of Cambridge

More information

MLCC 2018 Variable Selection and Sparsity. Lorenzo Rosasco UNIGE-MIT-IIT

MLCC 2018 Variable Selection and Sparsity. Lorenzo Rosasco UNIGE-MIT-IIT MLCC 2018 Variable Selection and Sparsity Lorenzo Rosasco UNIGE-MIT-IIT Outline Variable Selection Subset Selection Greedy Methods: (Orthogonal) Matching Pursuit Convex Relaxation: LASSO & Elastic Net

More information

Module 03 Linear Systems Theory: Necessary Background

Module 03 Linear Systems Theory: Necessary Background Module 03 Linear Systems Theory: Necessary Background Ahmad F. Taha EE 5243: Introduction to Cyber-Physical Systems Email: ahmad.taha@utsa.edu Webpage: http://engineering.utsa.edu/ taha/index.html September

More information

Sparsity Models. Tong Zhang. Rutgers University. T. Zhang (Rutgers) Sparsity Models 1 / 28

Sparsity Models. Tong Zhang. Rutgers University. T. Zhang (Rutgers) Sparsity Models 1 / 28 Sparsity Models Tong Zhang Rutgers University T. Zhang (Rutgers) Sparsity Models 1 / 28 Topics Standard sparse regression model algorithms: convex relaxation and greedy algorithm sparse recovery analysis:

More information

EE 474 Lab Part 2: Open-Loop and Closed-Loop Control (Velocity Servo)

EE 474 Lab Part 2: Open-Loop and Closed-Loop Control (Velocity Servo) Contents EE 474 Lab Part 2: Open-Loop and Closed-Loop Control (Velocity Servo) 1 Introduction 1 1.1 Discovery learning in the Controls Teaching Laboratory.............. 1 1.2 A Laboratory Notebook...............................

More information

Networks. Can (John) Bruce Keck Founda7on Biotechnology Lab Bioinforma7cs Resource

Networks. Can (John) Bruce Keck Founda7on Biotechnology Lab Bioinforma7cs Resource Networks Can (John) Bruce Keck Founda7on Biotechnology Lab Bioinforma7cs Resource Networks in biology Protein-Protein Interaction Network of Yeast Transcriptional regulatory network of E.coli Experimental

More information

SCMA292 Mathematical Modeling : Machine Learning. Krikamol Muandet. Department of Mathematics Faculty of Science, Mahidol University.

SCMA292 Mathematical Modeling : Machine Learning. Krikamol Muandet. Department of Mathematics Faculty of Science, Mahidol University. SCMA292 Mathematical Modeling : Machine Learning Krikamol Muandet Department of Mathematics Faculty of Science, Mahidol University February 9, 2016 Outline Quick Recap of Least Square Ridge Regression

More information

Spectral k-support Norm Regularization

Spectral k-support Norm Regularization Spectral k-support Norm Regularization Andrew McDonald Department of Computer Science, UCL (Joint work with Massimiliano Pontil and Dimitris Stamos) 25 March, 2015 1 / 19 Problem: Matrix Completion Goal:

More information

NON-LINEAR APPROXIMATION OF BAYESIAN UPDATE

NON-LINEAR APPROXIMATION OF BAYESIAN UPDATE tifica NON-LINEAR APPROXIMATION OF BAYESIAN UPDATE Alexander Litvinenko 1, Hermann G. Matthies 2, Elmar Zander 2 http://sri-uq.kaust.edu.sa/ 1 Extreme Computing Research Center, KAUST, 2 Institute of Scientific

More information

Bayesian Hierarchical Classification. Seminar on Predicting Structured Data Jukka Kohonen

Bayesian Hierarchical Classification. Seminar on Predicting Structured Data Jukka Kohonen Bayesian Hierarchical Classification Seminar on Predicting Structured Data Jukka Kohonen 17.4.2008 Overview Intro: The task of hierarchical gene annotation Approach I: SVM/Bayes hybrid Barutcuoglu et al:

More information

Color Scheme. swright/pcmi/ M. Figueiredo and S. Wright () Inference and Optimization PCMI, July / 14

Color Scheme.   swright/pcmi/ M. Figueiredo and S. Wright () Inference and Optimization PCMI, July / 14 Color Scheme www.cs.wisc.edu/ swright/pcmi/ M. Figueiredo and S. Wright () Inference and Optimization PCMI, July 2016 1 / 14 Statistical Inference via Optimization Many problems in statistical inference

More information

Nonlinear and robust MPC with applications in robotics

Nonlinear and robust MPC with applications in robotics Nonlinear and robust MPC with applications in robotics Boris Houska, Mario Villanueva, Benoît Chachuat ShanghaiTech, Texas A&M, Imperial College London 1 Overview Introduction to Robust MPC Min-Max Differential

More information

Probabilistic Graphical Models

Probabilistic Graphical Models Probabilistic Graphical Models Brown University CSCI 295-P, Spring 213 Prof. Erik Sudderth Lecture 11: Inference & Learning Overview, Gaussian Graphical Models Some figures courtesy Michael Jordan s draft

More information

Big Data Analytics: Optimization and Randomization

Big Data Analytics: Optimization and Randomization Big Data Analytics: Optimization and Randomization Tianbao Yang Tutorial@ACML 2015 Hong Kong Department of Computer Science, The University of Iowa, IA, USA Nov. 20, 2015 Yang Tutorial for ACML 15 Nov.

More information

Latent Tree Approximation in Linear Model

Latent Tree Approximation in Linear Model Latent Tree Approximation in Linear Model Navid Tafaghodi Khajavi Dept. of Electrical Engineering, University of Hawaii, Honolulu, HI 96822 Email: navidt@hawaii.edu ariv:1710.01838v1 [cs.it] 5 Oct 2017

More information

Recent Developments in Compressed Sensing

Recent Developments in Compressed Sensing Recent Developments in Compressed Sensing M. Vidyasagar Distinguished Professor, IIT Hyderabad m.vidyasagar@iith.ac.in, www.iith.ac.in/ m vidyasagar/ ISL Seminar, Stanford University, 19 April 2018 Outline

More information

Linear Regression. Volker Tresp 2018

Linear Regression. Volker Tresp 2018 Linear Regression Volker Tresp 2018 1 Learning Machine: The Linear Model / ADALINE As with the Perceptron we start with an activation functions that is a linearly weighted sum of the inputs h = M j=0 w

More information

Subject: Optimal Control Assignment-1 (Related to Lecture notes 1-10)

Subject: Optimal Control Assignment-1 (Related to Lecture notes 1-10) Subject: Optimal Control Assignment- (Related to Lecture notes -). Design a oil mug, shown in fig., to hold as much oil possible. The height and radius of the mug should not be more than 6cm. The mug must

More information

Bayesian Networks: Construction, Inference, Learning and Causal Interpretation. Volker Tresp Summer 2014

Bayesian Networks: Construction, Inference, Learning and Causal Interpretation. Volker Tresp Summer 2014 Bayesian Networks: Construction, Inference, Learning and Causal Interpretation Volker Tresp Summer 2014 1 Introduction So far we were mostly concerned with supervised learning: we predicted one or several

More information

Input to state Stability

Input to state Stability Input to state Stability Mini course, Universität Stuttgart, November 2004 Lars Grüne, Mathematisches Institut, Universität Bayreuth Part IV: Applications ISS Consider with solutions ϕ(t, x, w) ẋ(t) =

More information

ACTA PHYSICA DEBRECINA XLVI, 47 (2012) MODELLING GENE REGULATION WITH BOOLEAN NETWORKS. Abstract

ACTA PHYSICA DEBRECINA XLVI, 47 (2012) MODELLING GENE REGULATION WITH BOOLEAN NETWORKS. Abstract ACTA PHYSICA DEBRECINA XLVI, 47 (2012) MODELLING GENE REGULATION WITH BOOLEAN NETWORKS E. Fenyvesi 1, G. Palla 2 1 University of Debrecen, Department of Experimental Physics, 4032 Debrecen, Egyetem 1,

More information

Network alignment and querying

Network alignment and querying Network biology minicourse (part 4) Algorithmic challenges in genomics Network alignment and querying Roded Sharan School of Computer Science, Tel Aviv University Multiple Species PPI Data Rapid growth

More information

Biological Pathways Representation by Petri Nets and extension

Biological Pathways Representation by Petri Nets and extension Biological Pathways Representation by and extensions December 6, 2006 Biological Pathways Representation by and extension 1 The cell Pathways 2 Definitions 3 4 Biological Pathways Representation by and

More information

The thermodynamics of cellular computation

The thermodynamics of cellular computation The thermodynamics of cellular computation Sourjik and Wingreen (2012) Cur. Opinions in Cell Bio. Pankaj Mehta Collaborators: David Schwab, Charles Fisher, Mo Khalil Cells perform complex computations

More information

Autonomous Helicopter Landing A Nonlinear Output Regulation Perspective

Autonomous Helicopter Landing A Nonlinear Output Regulation Perspective Autonomous Helicopter Landing A Nonlinear Output Regulation Perspective Andrea Serrani Department of Electrical and Computer Engineering Collaborative Center for Control Sciences The Ohio State University

More information

What is Systems Biology?

What is Systems Biology? What is Systems Biology? 1 ICBS 2008 - More than 1000 participants!! 2 Outline 1. What is Systems Biology? 2. Why a need for Systems Biology (motivation)? 3. Biological data suitable for conducting Systems

More information

The Role of Network Science in Biology and Medicine. Tiffany J. Callahan Computational Bioscience Program Hunter/Kahn Labs

The Role of Network Science in Biology and Medicine. Tiffany J. Callahan Computational Bioscience Program Hunter/Kahn Labs The Role of Network Science in Biology and Medicine Tiffany J. Callahan Computational Bioscience Program Hunter/Kahn Labs Network Analysis Working Group 09.28.2017 Network-Enabled Wisdom (NEW) empirically

More information

Moving Horizon Estimation (MHE)

Moving Horizon Estimation (MHE) Moving Horizon Estimation (MHE) James B. Rawlings Department of Chemical and Biological Engineering University of Wisconsin Madison Insitut für Systemtheorie und Regelungstechnik Universität Stuttgart

More information

Machine Learning (CS 567) Lecture 2

Machine Learning (CS 567) Lecture 2 Machine Learning (CS 567) Lecture 2 Time: T-Th 5:00pm - 6:20pm Location: GFS118 Instructor: Sofus A. Macskassy (macskass@usc.edu) Office: SAL 216 Office hours: by appointment Teaching assistant: Cheol

More information

Outline. 1 Full information estimation. 2 Moving horizon estimation - zero prior weighting. 3 Moving horizon estimation - nonzero prior weighting

Outline. 1 Full information estimation. 2 Moving horizon estimation - zero prior weighting. 3 Moving horizon estimation - nonzero prior weighting Outline Moving Horizon Estimation MHE James B. Rawlings Department of Chemical and Biological Engineering University of Wisconsin Madison SADCO Summer School and Workshop on Optimal and Model Predictive

More information

A numerical algorithm for solving 3D inverse scattering problem with non-over-determined data

A numerical algorithm for solving 3D inverse scattering problem with non-over-determined data A numerical algorithm for solving 3D inverse scattering problem with non-over-determined data Alexander Ramm, Cong Van Department of Mathematics, Kansas State University, Manhattan, KS 66506, USA ramm@math.ksu.edu;

More information

Graph Alignment and Biological Networks

Graph Alignment and Biological Networks Graph Alignment and Biological Networks Johannes Berg http://www.uni-koeln.de/ berg Institute for Theoretical Physics University of Cologne Germany p.1/12 Networks in molecular biology New large-scale

More information

Efficient robust optimization for robust control with constraints Paul Goulart, Eric Kerrigan and Danny Ralph

Efficient robust optimization for robust control with constraints Paul Goulart, Eric Kerrigan and Danny Ralph Efficient robust optimization for robust control with constraints p. 1 Efficient robust optimization for robust control with constraints Paul Goulart, Eric Kerrigan and Danny Ralph Efficient robust optimization

More information

Near Ideal Behavior of a Modified Elastic Net Algorithm in Compressed Sensing

Near Ideal Behavior of a Modified Elastic Net Algorithm in Compressed Sensing Near Ideal Behavior of a Modified Elastic Net Algorithm in Compressed Sensing M. Vidyasagar Cecil & Ida Green Chair The University of Texas at Dallas M.Vidyasagar@utdallas.edu www.utdallas.edu/ m.vidyasagar

More information

11 : Gaussian Graphic Models and Ising Models

11 : Gaussian Graphic Models and Ising Models 10-708: Probabilistic Graphical Models 10-708, Spring 2017 11 : Gaussian Graphic Models and Ising Models Lecturer: Bryon Aragam Scribes: Chao-Ming Yen 1 Introduction Different from previous maximum likelihood

More information

Solution of a Distributed Linear System Stabilisation Problem

Solution of a Distributed Linear System Stabilisation Problem Solution of a Distributed Linear System Stabilisation Problem NICTA Linear Systems Workshop ANU Brian Anderson (ANU/NICTA) with contributions from: Brad Yu, Baris Fidan, Soura Dasgupta, Steve Morse Overview

More information

Towards Detecting Protein Complexes from Protein Interaction Data

Towards Detecting Protein Complexes from Protein Interaction Data Towards Detecting Protein Complexes from Protein Interaction Data Pengjun Pei 1 and Aidong Zhang 1 Department of Computer Science and Engineering State University of New York at Buffalo Buffalo NY 14260,

More information

Lecture 15: H Control Synthesis

Lecture 15: H Control Synthesis c A. Shiriaev/L. Freidovich. March 12, 2010. Optimal Control for Linear Systems: Lecture 15 p. 1/14 Lecture 15: H Control Synthesis Example c A. Shiriaev/L. Freidovich. March 12, 2010. Optimal Control

More information

= m(0) + 4e 2 ( 3e 2 ) 2e 2, 1 (2k + k 2 ) dt. m(0) = u + R 1 B T P x 2 R dt. u + R 1 B T P y 2 R dt +

= m(0) + 4e 2 ( 3e 2 ) 2e 2, 1 (2k + k 2 ) dt. m(0) = u + R 1 B T P x 2 R dt. u + R 1 B T P y 2 R dt + ECE 553, Spring 8 Posted: May nd, 8 Problem Set #7 Solution Solutions: 1. The optimal controller is still the one given in the solution to the Problem 6 in Homework #5: u (x, t) = p(t)x k(t), t. The minimum

More information

Linear Inverse Problems

Linear Inverse Problems Linear Inverse Problems Ajinkya Kadu Utrecht University, The Netherlands February 26, 2018 Outline Introduction Least-squares Reconstruction Methods Examples Summary Introduction 2 What are inverse problems?

More information

Topic # Feedback Control. State-Space Systems Closed-loop control using estimators and regulators. Dynamics output feedback

Topic # Feedback Control. State-Space Systems Closed-loop control using estimators and regulators. Dynamics output feedback Topic #17 16.31 Feedback Control State-Space Systems Closed-loop control using estimators and regulators. Dynamics output feedback Back to reality Copyright 21 by Jonathan How. All Rights reserved 1 Fall

More information

Approximate Bayesian Computation and Particle Filters

Approximate Bayesian Computation and Particle Filters Approximate Bayesian Computation and Particle Filters Dennis Prangle Reading University 5th February 2014 Introduction Talk is mostly a literature review A few comments on my own ongoing research See Jasra

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science : Dynamic Systems Spring 2011

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science : Dynamic Systems Spring 2011 MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.4: Dynamic Systems Spring Homework Solutions Exercise 3. a) We are given the single input LTI system: [

More information

PARAMETER UNCERTAINTY QUANTIFICATION USING SURROGATE MODELS APPLIED TO A SPATIAL MODEL OF YEAST MATING POLARIZATION

PARAMETER UNCERTAINTY QUANTIFICATION USING SURROGATE MODELS APPLIED TO A SPATIAL MODEL OF YEAST MATING POLARIZATION Ching-Shan Chou Department of Mathematics Ohio State University PARAMETER UNCERTAINTY QUANTIFICATION USING SURROGATE MODELS APPLIED TO A SPATIAL MODEL OF YEAST MATING POLARIZATION In systems biology, we

More information

CONTROL DESIGN FOR SET POINT TRACKING

CONTROL DESIGN FOR SET POINT TRACKING Chapter 5 CONTROL DESIGN FOR SET POINT TRACKING In this chapter, we extend the pole placement, observer-based output feedback design to solve tracking problems. By tracking we mean that the output is commanded

More information

A new Hierarchical Bayes approach to ensemble-variational data assimilation

A new Hierarchical Bayes approach to ensemble-variational data assimilation A new Hierarchical Bayes approach to ensemble-variational data assimilation Michael Tsyrulnikov and Alexander Rakitko HydroMetCenter of Russia College Park, 20 Oct 2014 Michael Tsyrulnikov and Alexander

More information

to have roots with negative real parts, the necessary and sufficient conditions are that:

to have roots with negative real parts, the necessary and sufficient conditions are that: THE UNIVERSITY OF TEXAS AT SAN ANTONIO EE 543 LINEAR SYSTEMS AND CONTROL H O M E W O R K # 7 Sebastian A. Nugroho November 6, 7 Due date of the homework is: Sunday, November 6th @ :59pm.. The following

More information

High-Gain Observers in Nonlinear Feedback Control. Lecture # 2 Separation Principle

High-Gain Observers in Nonlinear Feedback Control. Lecture # 2 Separation Principle High-Gain Observers in Nonlinear Feedback Control Lecture # 2 Separation Principle High-Gain ObserversinNonlinear Feedback ControlLecture # 2Separation Principle p. 1/4 The Class of Systems ẋ = Ax + Bφ(x,

More information

Optimal Control Theory SF 2852

Optimal Control Theory SF 2852 Optimal Control Theory SF 2852 Johan Karlsson Optimization and Systems Theory, Department of Mathematics Royal Institute of Technology (KTH) Spring 2017 Optimal Control Theory SF 2852 1 Course information

More information

Every real system has uncertainties, which include system parametric uncertainties, unmodeled dynamics

Every real system has uncertainties, which include system parametric uncertainties, unmodeled dynamics Sensitivity Analysis of Disturbance Accommodating Control with Kalman Filter Estimation Jemin George and John L. Crassidis University at Buffalo, State University of New York, Amherst, NY, 14-44 The design

More information

Metabolic networks: Activity detection and Inference

Metabolic networks: Activity detection and Inference 1 Metabolic networks: Activity detection and Inference Jean-Philippe.Vert@mines.org Ecole des Mines de Paris Computational Biology group Advanced microarray analysis course, Elsinore, Denmark, May 21th,

More information