Presentation is loading. Please wait.

Presentation is loading. Please wait.

Machine Learning CMPT 726 Simon Fraser University CHAPTER 1: INTRODUCTION.

Similar presentations


Presentation on theme: "Machine Learning CMPT 726 Simon Fraser University CHAPTER 1: INTRODUCTION."— Presentation transcript:

1 Machine Learning CMPT 726 Simon Fraser University CHAPTER 1: INTRODUCTION

2 Outline Comments on general approach. Probability Theory. Joint, conditional and marginal probabilities. Random Variables. Functions of R.V.s Bernoulli Distribution (Coin Tosses). Maximum Likelihood Estimation. Bayesian Learning With Conjugate Prior. The Gaussian Distribution. Maximum Likelihood Estimation. Bayesian Learning With Conjugate Prior. More Probability Theory. Entropy. KL Divergence.

3 Our Approach The course generally follows statistics, very interdisciplinary. Emphasis on predictive models: guess the value(s) of target variable(s). “Pattern Recognition” Generally a Bayesian approach as in the text. Compared to standard Bayesian statistics: more complex models (neural nets, Bayes nets) more discrete variables more emphasis on algorithms and efficiency

4 Things Not Covered Within statistics: Hypothesis testing Frequentist theory, learning theory. Other types of data (not random samples) Relational data Scientific data (automated scientific discovery) Action + learning = reinforcement learning. Could be optional – what do you think?

5 Probability Theory Apples and Oranges

6 Probability Theory Marginal Probability Conditional Probability Joint Probability

7 Probability Theory Sum Rule Product Rule

8 The Rules of Probability Sum Rule Product Rule

9 Bayes’ Theorem posterior  likelihood × prior

10 Bayes’ Theorem: Model Version Let M be model, E be evidence. P(M|E) proportional to P(M) x P(E|M) Intuition prior = how plausible is the event (model, theory) a priori before seeing any evidence. likelihood = how well does the model explain the data?

11 Probability Densities

12 Transformed Densities

13 Expectations Conditional Expectation (discrete) Approximate Expectation (discrete and continuous)

14 Expectations are Linear Let aX + bY + c be a linear combination of two random variables (itself a random variable). Then E[aX + bY + c] = aE[X] + bE[Y] + c. This holds whether or not X and Y are independent. Good exercise to prove it.

15 Variances and Covariances Think about this difference: 1.Everybody gets a B. 2.10 students get a C, 10 get an A. The average is the same – how to quantify the difference? Prove this. Hint: use the linearity of expectation.


Download ppt "Machine Learning CMPT 726 Simon Fraser University CHAPTER 1: INTRODUCTION."

Similar presentations


Ads by Google