Some Challenging Machine Learning Problems in Computational Biology: Time-Varying Networks Inference and Sparse Structured Input-Out Learning
Description
Recent advances in high-throughput technologies such as microarrays and genome-wide sequencing have led to an avalanche of new biological data that are dynamic, noisy, heterogeneous, and high-dimensional. They have raised unprecedented challenges in machine learning and high-dimensional statistical analysis; and their close relevance to human health and social welfare has often created unique demands on performance metric different from standard data mining or pattern recognition problems. In this talk, I will discuss two of such problems. First, I will present a new statistical formalism for modeling network evolution over time, and several new algorithms based on temporal extensions of the sparse graphical logistic regression, for parsimonious reverse-engineering the latent time varying networks. I will show some promising results on recovering the latent sequence of temporally rewiring gene networks over more than 4000 genes during the life cycle of Drosophila melanogaster from microarray time course, at a time resolution only limited by sample frequency. Second, I will present a family of sparse structured regression models in the context of uncovering true associations between linked genetic variations (inputs) in the genome and networks of human traits (outputs) in the phenome. If time allows, I will also present another class of new models known as the maximum entropy discrimination Markov networks, which address the same problem in the maximum margin paradigm, but using a entropic regularizer that lead to a distribution of structured prediction functions that are simultaneously primal and dual sparse (i.e., with few support vectors, and of low effective feature dimension). Joint work with Amr Ahmed, Seyoung Kim, Mladen Kolar, Le Song and Jun Zhu.
| Slides | |
| 0:00 | - Announcement |
| 0:24 | Some Challenging Machine Learning Problems in Computational Biology |
| 1:31 | Biological Data Analysis |
| 3:09 | Inferring Time-Varying Networks |
| 3:37 | Regulation of cell response to stimuli is paramount, but we can usually only measure (or compute) steady-state interactions |
| 4:39 | Biological regulations may be transient (in time and space) … |
| 5:21 | Example II: Breast Cancer Progression and Reversal in Organotypic Culture |
| 6:24 | Example III: Inflammatory Response in Endotoxinated Mice |
| 7:02 | The Big-Picture Questions |
| 7:46 | Current Practice … |
| 9:42 | Reverse engineer temporal/spatialspecific "rewiring" gene networks |
| 11:09 | Modeling Time-Varying Graphs |
| 13:19 | "Dynamic" Potentials |
| 13:57 | An idea for specifying a model |
| 14:01 | A tERGM is non-degenerate |
| 15:01 | What’s it good for? |
| 16:06 | Inferring Rewiring Biological Networks part1 |
| 16:14 | Inferring Rewiring Biological Networks part2 |
| 16:41 | Modeling Time-Varying Graphs |
| 17:01 | Inference (1) |
| 17:57 | Results on Simulated Data |
| 20:24 | Graph Regression part1 |
| 22:09 | Graph Regression part2 |
| 22:09 | Graph Regression part3 |
| 22:31 | Inference II |
| 25:10 | Inference III |
| 27:17 | Temporally Smoothed Graph Regression |
| 28:10 | Consistency |
| 29:37 | Drosophila Life Cycle |
| 29:58 | Example - picture1 |
| 30:00 | Example - picture2 |
| 30:00 | Example - picture3 |
| 30:01 | Example - picture4 |
| 30:01 | Example - picture5 |
| 30:02 | Example - picture6 |
| 30:02 | Example - picture7 |
| 30:02 | Example - picture8 |
| 30:03 | Example - picture9 |
| 30:03 | Example - picture10 |
| 30:04 | Example - picture11 |
| 30:04 | Example - picture12 |
| 30:04 | Example - picture13 |
| 30:04 | Example - picture14 |
| 30:05 | Example - picture15 |
| 30:05 | Example - picture16 |
| 30:05 | Example - picture17 |
| 30:06 | Example - picture18 |
| 30:06 | Example - picture19 |
| 30:06 | Example - picture20 |
| 30:06 | Example - picture21 |
| 30:07 | Example - picture22 |
| 30:07 | Example - picture23 |
| 30:08 | Transient Interaction |
| 30:40 | Static Versus Dynamic |
| 31:04 | Evolution of Network Signatures |
| 31:18 | Transient Subgraph |
| 31:39 | Future Work |
| 33:16 | Genome-Phenome Association and Structured Input-Out Learning |
| 33:27 | - Questions |
| 34:28 | Genome-Phenome Association and Structured Input-Out Learning |
| 37:37 | Genome and Phenome Structures |
| 37:40 | The Asthma Phenotype Network |
| 38:24 | Inferring Genome-Phenome Association |
| 39:52 | Association Mapping |
| 40:31 | Association Mapping as Regression |
| 40:56 | Sparse Regression part1 |
| 41:39 | Sparse Regression part2 |
| 43:55 | Sparse Regression part3 |
| 44:42 | Recombination |
| 45:06 | After Many Generations with Recombination ... part1 |
| 45:58 | After Many Generations with Recombination ... part2 |
| 45:59 | Bayesian Variable Selection part1 |
| 46:32 | Bayesian Variable Selection part2 |
| 47:00 | Bayesian Variable Selection part3 |
| 47:35 | Markov Chain Prior part1 |
| 47:47 | Markov Chain Prior part2 |
| 48:15 | Markov Chain Prior part3 |
| 48:17 | Block-regularized Regression with Markov Chain Prior |
| 48:38 | Learning with MCMC |
| 48:44 | Experiments |
| 48:45 | Simulations part1 |
| 49:16 | Simulations part2 |
| 49:17 | Simulations part3 |
| 49:27 | Simulations part4 |
| 49:29 | Simulations part5 |
| 49:36 | Precision and Recall part1 |
| 49:38 | Precision and Recall part2 |
| 50:12 | Precision and Recall part3 |
| 50:19 | Mouse Data (BROAD institute) |
| 50:22 | Multiple-trait Association part1 |
| 51:36 | Multiple-trait Association part2 |
| 52:52 | Multiple-trait Association part3 |
| 53:18 | Convex Optimization |
| 53:20 | Simulated Data |
| 55:19 | ROC on Simulated Data |
| 55:27 | Asthma Multiple-trait Association |
| 56:21 | Summary |
| 58:17 | Margin-Based Discriminative Learning Paradigms |
| 60:47 | Maximum Entropy Discrimination Markov Networks |
| 62:01 | Solution to MaxEnDNet |
| 62:44 | Gaussian MaxEnDNet |
| 63:13 | Three Advantages |
| 65:15 | Key Challenges |
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.
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !





