Tutorial #3 by Ma’ayan Fishelson

Slides:



Advertisements
Similar presentations
Bayes rule, priors and maximum a posteriori
Advertisements

Basics of Statistical Estimation
Probabilistic models Haixu Tang School of Informatics.
ECE 8443 – Pattern Recognition LECTURE 05: MAXIMUM LIKELIHOOD ESTIMATION Objectives: Discrete Features Maximum Likelihood Resources: D.H.S: Chapter 3 (Part.
Learning: Parameter Estimation
INTRODUCTION TO ARTIFICIAL INTELLIGENCE Massimo Poesio LECTURE 11 (Lab): Probability reminder.
Flipping A Biased Coin Suppose you have a coin with an unknown bias, θ ≡ P(head). You flip the coin multiple times and observe the outcome. From observations,
1 Methods of Experimental Particle Physics Alexei Safonov Lecture #21.
.. . Parameter Estimation using likelihood functions Tutorial #1 This class has been cut and slightly edited from Nir Friedman’s full course of 12 lectures.
CSC321: 2011 Introduction to Neural Networks and Machine Learning Lecture 10: The Bayesian way to fit models Geoffrey Hinton.
Bayesian Wrap-Up (probably). 5 minutes of math... Marginal probabilities If you have a joint PDF:... and want to know about the probability of just one.
Intro to Bayesian Learning Exercise Solutions Ata Kaban The University of Birmingham 2005.
1 BASIC NOTIONS OF PROBABILITY THEORY. NLE 2 What probability theory is for Suppose that we have a fair dice, with six faces, and that we keep throwing.
Maximum Likelihood-Maximum Entropy Duality : Session 1 Pushpak Bhattacharyya Scribed by Aditya Joshi Presented in NLP-AI talk on 14 th January, 2014.
Parameter Estimation using likelihood functions Tutorial #1
. Learning – EM in ABO locus Tutorial #08 © Ydo Wexler & Dan Geiger.
HMM for CpG Islands Parameter Estimation For HMM Maximum Likelihood and the Information Inequality Lecture #7 Background Readings: Chapter 3.3 in the.
. Algorithms in Computational Biology – אלגוריתמים בביולוגיה חישובית – (
. Algorithms in Computational Biology – אלגוריתמים בביולוגיה חישובית – (
This presentation has been cut and slightly edited from Nir Friedman’s full course of 12 lectures which is available at Changes.
Bayesian learning finalized (with high probability)
Probabilistic Graphical Models Tool for representing complex systems and performing sophisticated reasoning tasks Fundamental notion: Modularity Complex.
Basics of Statistical Estimation. Learning Probabilities: Classical Approach Simplest case: Flipping a thumbtack tails heads True probability  is unknown.
Hidden Markov Models K 1 … 2. Outline Hidden Markov Models – Formalism The Three Basic Problems of HMMs Solutions Applications of HMMs for Automatic Speech.
. PGM: Tirgul 10 Parameter Learning and Priors. 2 Why learning? Knowledge acquisition bottleneck u Knowledge acquisition is an expensive process u Often.
. Maximum Likelihood (ML) Parameter Estimation with applications to reconstructing phylogenetic trees Comput. Genomics, lecture 6b Presentation taken from.
Class 3: Estimating Scoring Rules for Sequence Alignment.
Thanks to Nir Friedman, HU
Recitation 1 Probability Review
Additional Slides on Bayesian Statistics for STA 101 Prof. Jerry Reiter Fall 2008.
All of Statistics Chapter 5: Convergence of Random Variables Nick Schafer.
.. . Maximum Likelihood (ML) Parameter Estimation with applications to inferring phylogenetic trees Comput. Genomics, lecture 6a Presentation taken from.
BINF6201/8201 Hidden Markov Models for Sequence Analysis
Introduction to Bayesian statistics Yves Moreau. Overview The Cox-Jaynes axioms Bayes’ rule Probabilistic models Maximum likelihood Maximum a posteriori.
IID Samples In supervised learning, we usually assume that data points are sampled independently and from the same distribution IID assumption: data are.
Course Introduction What these courses are about What I expect What you can expect.
Consistency An estimator is a consistent estimator of θ, if , i.e., if
CS498-EA Reasoning in AI Lecture #10 Instructor: Eyal Amir Fall Semester 2009 Some slides in this set were adopted from Eran Segal.
Conditional Probability Mass Function. Introduction P[A|B] is the probability of an event A, giving that we know that some other event B has occurred.
Maximum Likelihood Estimation
Statistical Estimation Vasileios Hatzivassiloglou University of Texas at Dallas.
1 Learning P-maps Param. Learning Graphical Models – Carlos Guestrin Carnegie Mellon University September 24 th, 2008 Readings: K&F: 3.3, 3.4, 16.1,
The Uniform Prior and the Laplace Correction Supplemental Material not on exam.
Week 31 The Likelihood Function - Introduction Recall: a statistical model for some data is a set of distributions, one of which corresponds to the true.
CS 2750: Machine Learning Linear Models for Classification Prof. Adriana Kovashka University of Pittsburgh February 15, 2016.
Parameter Estimation. Statistics Probability specified inferred Steam engine pump “prediction” “estimation”
Conditional Expectation
CSC321: Lecture 8: The Bayesian way to fit models Geoffrey Hinton.
Bayesian Estimation and Confidence Intervals Lecture XXII.
Applied statistics Usman Roshan.
Statistical Estimation
Bayesian Estimation and Confidence Intervals
CS 2750: Machine Learning Density Estimation
Parameter Estimation 主講人:虞台文.
Bayes Net Learning: Bayesian Approaches
Maximum Likelihood Estimation
Oliver Schulte Machine Learning 726
Important Distinctions in Learning BNs
CS498-EA Reasoning in AI Lecture #20
Covered only ML estimator
Computing and Statistical Data Analysis / Stat 8
Statistical NLP: Lecture 4
Important Distinctions in Learning BNs
CS 594: Empirical Methods in HCC Introduction to Bayesian Analysis
Parametric Methods Berlin Chen, 2005 References:
Learning From Observed Data
BN Semantics 3 – Now it’s personal! Parameter Learning 1
Mathematical Foundations of BME Reza Shadmehr
Maximum Likelihood Estimation (MLE)
Learning Bayesian networks
Presentation transcript:

Tutorial #3 by Ma’ayan Fishelson Parameter Estimation Using Likelihood Functions. Tutorial #3 by Ma’ayan Fishelson This presentation has been cut and slightly edited from Nir Friedman’s full course of 12 lectures which is available at www.cs.huji.ac.il/~pmai. Changes made by Dan Geiger, Ydo Wexler and Ma’ayan Fishelson.

Example: Binomial Experiment Head Tail When tossed, it can land in one of two positions: Head or Tail. 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 - .

Statistical Parameter Fitting Consider instances x[1], x[2], …, x[M] such that: The set of values x can take is known. Each one is sampled from the same distribution. Each one is sampled independently of the rest. The task is to find the vector of parameters  that have generated the given data. This parameter vector  can be used to predict future data. i.i.d. samples i.I.d - idependent, identically distributed

The Likelihood Function How good is a particular  ? It depends on how likely it is to generate the observed data: The likelihood for the sequence H,T, T, H, H is: 0.2 0.4 0.6 0.8 1  L()

Sufficient Statistics To compute the likelihood in the thumbtack example we only require NH and NT (the number of heads and the number of tails). NH and NT are sufficient statistics for the binomial distribution. For example: H,T,T,H,H is just like T,H,H,H,T

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

Maximum Likelihood Estimation MLE Principle: Choose parameters that maximize the likelihood function One of the most commonly used estimators in statistics. Intuitively appealing. One usually maximizes the log-likelihood function defined as lD() = logeLD().

Example: MLE in Binomial Data Applying the MLE principle we get (Which coincides with what one would expect) 0.2 0.4 0.6 0.8 1 L() Example: (NH,NT ) = (3,2) MLE estimate is 3/5 = 0.6

From Binomial to Multinomial For example, suppose that X can have the values 1,2,…,K (for example, a die has 6 faces). We want to learn the parameters 1, 2. …, K. Sufficient statistics: N1, N2, …, NK - the number of times each outcome is observed. Likelihood function: MLE: A case of a die where 1….6 are the possible values

Example: Multinomial Let x1,x2,…,xn be a protein sequence. We want to learn the parameters q1, q2,…,q20 corresponding to the frequencies of the 20 amino-acids. Let N1, N2,…,N20 be the number of times each amino-acid is observed in the sequence. Likelihood function: MLE: A case of a die where 1….6 are the possible values

Is MLE all we need? Suppose that after 10 observations, ML estimate is P(H) = 0.7 for the thumbtack. Would you bet on heads for the next toss? Suppose now that after 10 observations, ML estimate is P(H) = 0.7 for a coin. Would you place the same bet? Solution: The Bayesian approach that incorporates your subjective prior knowledge. E.g., you may know a priori that some amino acids have high frequencies and some have low frequencies. How would one use this information ?

Bayes’ rule where, Bayes’ rule: It holds because:

Example: Dishonest Casino A casino uses 2 kind of dice: 99% are fair. 1% is loaded: 6 comes up 50% of the times We pick a die at random and roll it 3 times. We get 3 consecutive sixes. What is the probability the die is loaded?

Dishonest Casino (2) The solution is based on using Bayes rule and the fact that while P(loaded | 3 sixes) is not known, the other three terms in Bayes rule are known, namely: P(3 sixes | loaded)=(0.5)3 P(loaded)=0.01 P(3 sixes) = P(3 sixes|loaded) P(loaded)+P(3 sixes|fair) P(fair)

Dishonest Casino (3)

Biological Example: Proteins Extra-cellular proteins have a slightly different amino acid composition than intra-cellular proteins. From a large enough protein database (SWISS-PROT), we can get the following: p(ext) - the probability that any new sequence is extra-cellular p(ai|int) - the frequency of amino acid ai for intra-cellular proteins p(ai|ext) - the frequency of amino acid ai for extra-cellular proteins p(int) - the probability that any new sequence is intra-cellular

Biological Example: Proteins (2) Q: What is the probability that a given new protein sequence x=x1x2….xn is extra-cellular? A: Assuming that every sequence is either extra-cellular or intra-cellular (but not both), we can write: . Thus,

Biological Example: Proteins (3) Using conditional probability we get , By Bayes’ theorem The probabilities p(int), p(ext) are called the prior probabilities. The probability P(ext|x) is called the posterior probability.