.

. Maximum Likelihood (ML) Parameter Estimation with applications to inferring phylogenetic trees Comput. Genomics, lecture 6a Presentation taken from Nir Friedman’s HU course, available at Changes made by Dan Geiger, Ydo Wexler, and finally by Benny Chor.

3 The Setting u We have a probabilistic model, M, of some phenomena. We know exactly the structure of M, but not the values of its probabilistic parameters, .  Each “execution” of M produces an observation, x[i], according to the (unknown) distribution induced by M.  Goal: After observing x[1],…, x[n], estimate the model parameters, , that generated the observed data.

4 Maximum Likelihood Estimation (MLE)  The likelihood of the observed data, given the model parameters , as the conditional probability that the model, M, with parameters , produces x[1],…, x[n]. L(  )=Pr( x[1],…, x[n] | , M), u In MLE we seek the model parameters, , that maximize the likelihood.

5 Maximum Likelihood Estimation (MLE) u In MLE we seek the model parameters, , that maximize the likelihood. u The MLE principle is applicable in a wide variety of applications, from speech recognition, through natural language processing, to computational biology. u We will start with the simplest example: Estimating the bias of a coin. Then apply MLE to inferring phylogenetic trees. u (will later talk about MAP - Bayesian inference).

6 Example: Binomial Experiment u When tossed, it can land in one of two positions: Head (H) or Tail (T) HeadTail  We denote by  the (unknown) probability P(H). Estimation task:  Given a sequence of toss samples x[1], x[2], …, x[M] we want to estimate the probabilities P(H)=  and P(T) = 1 - 

7 Statistical Parameter Fitting (restement)  Consider instances x[1], x[2], …, x[M] such that l The set of values that x can take is known l Each is sampled from the same distribution l Each sampled independently of the rest i.i.d. Samples (why??) u The task is to find a vector of parameters  that have generated the given data. This vector parameter  can be used to predict future data.

8 The Likelihood Function u How good is a particular  ? It depends on how likely it is to generate the observed data u The likelihood for the sequence H,T, T, H, H is  L()L()

9 Sufficient Statistics  To compute the likelihood in the thumbtack example we only require N H and N T (the number of heads and the number of tails)  N H and N T are sufficient statistics for the binomial distribution

10 Sufficient Statistics u A sufficient statistic is a function of the data that summarizes the relevant information for the likelihood Datasets Statistics  Formally, s(D) is a sufficient statistics if for any two datasets D and D’ s(D) = s(D’ )  L D (  ) = L D’ (  )

11 Maximum Likelihood Estimation MLE Principle: Choose parameters that maximize the likelihood function u This is one of the most commonly used estimators in statistics u Intuitively appealing  One usually maximizes the log-likelihood function, defined as l D (  ) = ln L D (  )

12 Example: MLE in Binomial Data Taking derivative and equating it to 0, we get L()L() Example: (N H,N T ) = (3,2) MLE estimate is 3/5 = 0.6 (which coincides with what one would expect)

13 From Binomial to Multinomial  Now suppose X can have the values 1,2,…,K (For example a die has K=6 sides)  We want to learn the parameters  1,  2. …,  K Sufficient statistics:  N 1, N 2, …, N K - the number of times each outcome is observed Likelihood function: MLE: assignment 3)

14 Example: Multinomial u Let be a protein sequence  We want to learn the parameters q 1, q 2,…, q 20 corresponding to the frequencies of the 20 amino acids  N 1, N 2, …, N 20 - the number of times each amino acid is observed in the sequence Likelihood function: MLE:

15 Inferring Phylogenetic Trees u Let be n sequence (DNA or AA). Assume for simplicity they are all same length, l. u We want to learn the parameters of a phylogenetic tree that maximizes the likelihood. u But wait: Should first specify a model.

16 A Probabilistic Model u Our models will consist of a “regular” tree, where in addition, edges are assigned substituion probabilities. u For simplicity, assume our “DNA” has only two states, say X and Y. u If edge e is assigned probability p e, this means that the probability of substitution (X Y) across e is p e.

17 A Probabilistic Model (2) u Our models will consist of a “regular” tree, where in addition, edges are assigned substituion probabilities. u For simplicity, assume our “DNA” has only two states, say X and Y. u If edge e is assigned probability p e, this means that the probability of substitution (X Y) across e is p e.

18 A Probabilistic Model (3) u If edge e is assigned probability p e, this means that the probability of more involved patterns of substitution across e (e.g. XXYXY YXYXX) is determined, and easily computed: p e 2 (1- p e ) 3 for this pattern. u Q.: What if pattern on both sides is known, but p e is not known? u A.: Makes sense to seek p e that maximizes probability of observation. u So far, this is identical to coin toss example.

19 A Probabilistic Model (4) Now we don’t know the states at internal node(s), nor the edge parameters pe1, pe2, pe3 XXYXY YXYXX YYYYX pe1pe1 pe2pe2 pe3pe3 But a single edge is a fairly boring tree… ?????

20 Two Ways to Go 1. Maximize over states of internal node(s) 2. Average over states of internal node(s) In both cases, we maximize over edge parameters XXYXY YXYXX YYYYX pe1pe1 pe2pe2 pe3pe3 ?????

21 Two Ways to Go In the first version (average, or sum over states of internal nodes) we are looking for the “most likely” setting of tree edges. This is called maximum likelihood (ML) inference of phylogenetic trees. ML is probably the inference method most widely (wildly ) used. XXYXY YXYXX YYYYX pe1pe1 pe2pe2 pe3pe3 ?????

22 Two Ways to Go In the second version (maximize over states of internal nodes) we are looking for the “most likely” ancestral states. This is called ancestral maximum likelihood (AML). In some sense AML is “between” MP (having ancestral states) and ML (because the goal is still to maximize likelihood). XXYXY YXYXX YYYYX pe1pe1 pe2pe2 pe3pe3 ?????

. or a break bust