Rutgers Business School, Introduction to Probability, 26:960:575. Homework 1. Prepared by Daniel Pirutinsky. Feburary 1st, 2016

Size: px
Start display at page:

Download "Rutgers Business School, Introduction to Probability, 26:960:575. Homework 1. Prepared by Daniel Pirutinsky. Feburary 1st, 2016"

Transcription

1 Rutgers usiness School, Introduction to Probability, 6:960:575 Homework Prepared by Daniel Pirutinsky Feburary st, 06 Introduction Suppose we have two boxes, labeled and. Each box contains some amount of white balls and some amount of black balls. Let i denote the proportion of white white balls in box i and i the proportion of black balls in box i. For example if ox has 0 white balls and 40 black balls then =. and =.8 A dealer will choose a box (uniformly at random) and our job is to guess which box the dealer chose. If we guess correctly we will win a reward of R dollars. If we are wrong, we will lose and have to pay L dollars. e are also given the option to sample (with replacement) a ball from the box the dealer chose to help inform us which box it really is. e can sample as many time as we want, but we must pay C dollars each time. The question is, what is the strategy that maximizes our expected reward? efore we analyze this question, we will first define some more terms. Let D denote the box that the dealer chose. In our case, either D = if the dealer chose box, or D = if the dealer chose box. Let D i will be the initial probability that the dealer chose box i, which we take to be D = D =.5 Let O denote the ordered samples that we have already observed. For example, in the beginning O =, if we sampled three times and saw a white, black, and then a white, O = Let S denote the next observation. In our case we may sample and either S = if we observe a white ball, or S = if we observe a black ball. Summary of variables Proportion of white balls in box Proportion of black balls in box Proportion of white balls in box Proportion of black balls in box R = 00 Reward if we guess correctly L = 50 Loss if we guess incorrectly C = 0 Cost per sample D =.5 Initial probability (prior) that the dealer chose box D =.5 Initial probability (prior) that the dealer chose box Summary of random variables D {, } ox that the dealer chose O {,,,,,,,,...} Ordered observations S {, } Next observation

2 e can visuallize our game as follows, Problem 0 lack 0 hite 0 lack 0 hite ox ox Find the strategy for the case where box has 0 black balls and 0 white balls, and box has 0 black balls and no white balls.

3 e have: = =.5 and = 0, =. e will find the optimal policy by examining each action in turn. First we will calculate the expected reward if we guess without sampling at all. If we guess box, the with probability D we will gain R = 00 and with probability D we will lose L = 50, so the expected reward can be written as, E[reward guess O = ] = R P (D = ) L P (D = ) = R D L D If guess will be the same. Indeed: = R L = = 5 And so the expected reward can be written as, E[reward guess O = ] = L P (D = ) + RL P (D = ) = L D + R D e update the picture, = L + R = = 5 3

4 +5 (or ) If we choose to sample, we will pay C = 0, and with probability P (S = ) we will observe a white, and with probability P (S = ) we will observe a black. To find these probabilities we can use the law of total probability and we have, P (S = ) = P (S = D = ) P (D = ) + P (S = D = ) P (D = ) = D + D = + 0 = 4..[...and P (S = ) = P (S = ) = ]. -.. P (S = ) = P (S = D = ) P (D = ) + P (S = D = ) P (D = ) = D + D = + = 3 4 If we observed a white ball, we need to determine the probablity that the dealer chose box : P (D = S = ), and the probability that the dealer chose box : P (D = S = ). Using ayes Theorem (and our previous calculations) we have, P (D = S = ) = and P (S = D = ) P (D = ) P (S = ) P (D = S = ) = P (D = S = ) = 0 = 4 = 4

5 So if we observe a white ball and we decide to guess, we will guess box, and with probability P (D = S = ) = we will win R = 00 but have paid C = 0 to sample, so we will net 80. Since we are sure that the dealer chose box, we will not sample again. If we observed a black ball, we need to determine the probablity that the dealer chose box P (D = S = ), and the probability that the dealer chose box, P (D = S = ). Using ayes Theorem (and our previous calculations) we have, P (D = S = ) = and P (S = D = ) P (D = ) P (S = ) P (D = S = ) = P (D = S = ) = 3 = 3 4 = 3 So if we observe a black ball and we decide to guess, we will guess box, and our expected reward is, E[reward guess S = ] = R P (D = S = ) L P (D = S = ) 0 = = = 50 0 = (or ) Following the path down from, if we choose to sample again, we will pay another C = 0, and with probability P (S = O = ) we will observe a white, and with probability P (S = O = ) we will observe a black. P (S = O = ) = P (S = (O = D = )) P (O = D = ) + P (S = O =, D = ) P (O =, D = ) = P (S = D = ) P (D = O = ) + P (S = O =, D = ) P (O =, D = ) = D + D = + 0 = 4 5

6 +5 (or )

MATH 56A SPRING 2008 STOCHASTIC PROCESSES

MATH 56A SPRING 2008 STOCHASTIC PROCESSES MATH 56A SPRING 008 STOCHASTIC PROCESSES KIYOSHI IGUSA Contents 4. Optimal Stopping Time 95 4.1. Definitions 95 4.. The basic problem 95 4.3. Solutions to basic problem 97 4.4. Cost functions 101 4.5.

More information

Introduction to Artificial Intelligence Midterm 2. CS 188 Spring You have approximately 2 hours and 50 minutes.

Introduction to Artificial Intelligence Midterm 2. CS 188 Spring You have approximately 2 hours and 50 minutes. CS 188 Spring 2014 Introduction to Artificial Intelligence Midterm 2 You have approximately 2 hours and 50 minutes. The exam is closed book, closed notes except your two-page crib sheet. Mark your answers

More information

PHYS102 - Superposition of Forces

PHYS102 - Superposition of Forces GoBack PHYS102 - of Forces Dr. Suess January 12, 2007 PHYS102 Introduction and Charge slide 1 PHYS102 Introduction and Charge slide 2 1. If you were in PHYS101 last semester, then please pick up your homework

More information

Calculus I Homework: The Tangent and Velocity Problems Page 1

Calculus I Homework: The Tangent and Velocity Problems Page 1 Calculus I Homework: The Tangent and Velocity Problems Page 1 Questions Example The point P (1, 1/2) lies on the curve y = x/(1 + x). a) If Q is the point (x, x/(1 + x)), use Mathematica to find the slope

More information

Exam III #1 Solutions

Exam III #1 Solutions Department of Mathematics University of Notre Dame Math 10120 Finite Math Fall 2017 Name: Instructors: Basit & Migliore Exam III #1 Solutions November 14, 2017 This exam is in two parts on 11 pages and

More information

/ / MET Day 000 NC1^ INRTL MNVR I E E PRE SLEEP K PRE SLEEP R E

/ / MET Day 000 NC1^ INRTL MNVR I E E PRE SLEEP K PRE SLEEP R E 05//0 5:26:04 09/6/0 (259) 6 7 8 9 20 2 22 2 09/7 0 02 0 000/00 0 02 0 04 05 06 07 08 09 0 2 ay 000 ^ 0 X Y / / / / ( %/ ) 2 /0 2 ( ) ^ 4 / Y/ 2 4 5 6 7 8 9 2 X ^ X % 2 // 09/7/0 (260) ay 000 02 05//0

More information

Reinforcement Learning and Control

Reinforcement Learning and Control CS9 Lecture notes Andrew Ng Part XIII Reinforcement Learning and Control We now begin our study of reinforcement learning and adaptive control. In supervised learning, we saw algorithms that tried to make

More information

Distributive property and its connection to areas

Distributive property and its connection to areas February 27, 2009 Distributive property and its connection to areas page 1 Distributive property and its connection to areas Recap: distributive property The distributive property says that when you multiply

More information

SECONDARY MATH THREE. An Integrated Approach. MODULE 2 Logarithmic Functions

SECONDARY MATH THREE. An Integrated Approach. MODULE 2 Logarithmic Functions SECONDARY MATH THREE An Integrated Approach MODULE 2 Logarithmic Functions The Scott Hendrickson, Joleigh Honey, Barbara Kuehl, Travis Lemon, Janet Sutorius 2018 Original work 2013 in partnership with

More information

Solve using graphing. Solve using graphing. Solve using graphing.

Solve using graphing. Solve using graphing. Solve using graphing. Solve using graphing. Solve using graphing. Solve using graphing. Solve using graphing. Solve using graphing. Solve using graphing. Of the four linear functions represented below, which has the greatest

More information

M340(921) Solutions Practice Problems (c) 2013, Philip D Loewen

M340(921) Solutions Practice Problems (c) 2013, Philip D Loewen M340(921) Solutions Practice Problems (c) 2013, Philip D Loewen 1. Consider a zero-sum game between Claude and Rachel in which the following matrix shows Claude s winnings: C 1 C 2 C 3 R 1 4 2 5 R G =

More information

The exam is closed book, closed calculator, and closed notes except your one-page crib sheet.

The exam is closed book, closed calculator, and closed notes except your one-page crib sheet. CS 188 Fall 2018 Introduction to Artificial Intelligence Practice Final You have approximately 2 hours 50 minutes. The exam is closed book, closed calculator, and closed notes except your one-page crib

More information

Solution of a Toy Problem by Reinforcement Learning

Solution of a Toy Problem by Reinforcement Learning Solution of a Toy Problem by Reinforcement Learning David MacKay, Iain Murray, and Peter Latham March 1, 2006 1 Problem statement You get to toss coins, each of which is either of type H, having probabilities

More information

Neural Map. Structured Memory for Deep RL. Emilio Parisotto

Neural Map. Structured Memory for Deep RL. Emilio Parisotto Neural Map Structured Memory for Deep RL Emilio Parisotto eparisot@andrew.cmu.edu PhD Student Machine Learning Department Carnegie Mellon University Supervised Learning Most deep learning problems are

More information

Expectation is linear. So far we saw that E(X + Y ) = E(X) + E(Y ). Let α R. Then,

Expectation is linear. So far we saw that E(X + Y ) = E(X) + E(Y ). Let α R. Then, Expectation is linear So far we saw that E(X + Y ) = E(X) + E(Y ). Let α R. Then, E(αX) = ω = ω (αx)(ω) Pr(ω) αx(ω) Pr(ω) = α ω X(ω) Pr(ω) = αe(x). Corollary. For α, β R, E(αX + βy ) = αe(x) + βe(y ).

More information

STAT/MA 416 Answers Homework 4 September 27, 2007 Solutions by Mark Daniel Ward PROBLEMS

STAT/MA 416 Answers Homework 4 September 27, 2007 Solutions by Mark Daniel Ward PROBLEMS STAT/MA 416 Answers Homework 4 September 27, 2007 Solutions by Mark Daniel Ward PROBLEMS 2. We ust examine the 36 possible products of two dice. We see that 1/36 for i = 1, 9, 16, 25, 36 2/36 for i = 2,

More information

Solutions of Linear Equations

Solutions of Linear Equations Lesson 14 Part 1: Introduction Solutions of Linear Equations Develop Skills and Strategies CCSS 8.EE.C.7a You ve learned how to solve linear equations and how to check your solution. In this lesson, you

More information

The exam is closed book, closed calculator, and closed notes except your one-page crib sheet.

The exam is closed book, closed calculator, and closed notes except your one-page crib sheet. CS 88 Fall 208 Introduction to Artificial Intelligence Practice Final You have approximately 2 hours 50 minutes. The exam is closed book, closed calculator, and closed notes except your one-page crib sheet.

More information

Pre-Test Unit 4: Exponential Functions KEY

Pre-Test Unit 4: Exponential Functions KEY Pre-Test Unit 4: Exponential Functions KEY You may use a calculator on parts of the test. Evaluate the following rational roots. NO CALCULATOR. (4 pts; 2 pts for correct process, 2 pts for correct answer)

More information

9 Classification. 9.1 Linear Classifiers

9 Classification. 9.1 Linear Classifiers 9 Classification This topic returns to prediction. Unlike linear regression where we were predicting a numeric value, in this case we are predicting a class: winner or loser, yes or no, rich or poor, positive

More information

Msc Micro I exam. Lecturer: Todd Kaplan.

Msc Micro I exam. Lecturer: Todd Kaplan. Msc Micro I 204-205 exam. Lecturer: Todd Kaplan. Please answer exactly 5 questions. Answer one question from each of sections: A, B, C, and D and answer one additional question from any of the sections

More information

Part II) Practice Problems

Part II) Practice Problems Part II) Practice Problems 1. Calculate the value of to the nearest tenth: sin 38 80 2. Calculate the value of y to the nearest tenth: y cos 52 80 3. Calculate the value of to the nearest hundredth: tan

More information

Taste the Rainbow! Using Skittles to explore the chemistry of photosynthesis and cellular respiration. Name: Class:

Taste the Rainbow! Using Skittles to explore the chemistry of photosynthesis and cellular respiration. Name: Class: Taste the Rainbow! Using Skittles to explore the chemistry of photosynthesis and cellular respiration Name: Class: Background Information Plants cells and animal cells use chemical reactions to engage

More information

Dueling Network Architectures for Deep Reinforcement Learning (ICML 2016)

Dueling Network Architectures for Deep Reinforcement Learning (ICML 2016) Dueling Network Architectures for Deep Reinforcement Learning (ICML 2016) Yoonho Lee Department of Computer Science and Engineering Pohang University of Science and Technology October 11, 2016 Outline

More information

4.2 PROPORTIONS 70.00

4.2 PROPORTIONS 70.00 4.2 PROPORTIONS Jake has a part-time job walking dogs for an elderly neighbor. He is paid $20 for every ninety minutes he works. He has walked Boris, Buster, and Bonnie a total of 31 minutes this week.

More information

Name: 180A MIDTERM 2. (x + n)/2

Name: 180A MIDTERM 2. (x + n)/2 1. Recall the (somewhat strange) person from the first midterm who repeatedly flips a fair coin, taking a step forward when it lands head up and taking a step back when it lands tail up. Suppose this person

More information

2.4 Conditional Probability

2.4 Conditional Probability 2.4 Conditional Probability The probabilities assigned to various events depend on what is known about the experimental situation when the assignment is made. Example: Suppose a pair of dice is tossed.

More information

Lecture 23: Reinforcement Learning

Lecture 23: Reinforcement Learning Lecture 23: Reinforcement Learning MDPs revisited Model-based learning Monte Carlo value function estimation Temporal-difference (TD) learning Exploration November 23, 2006 1 COMP-424 Lecture 23 Recall:

More information

T 1. The value function v(x) is the expected net gain when using the optimal stopping time starting at state x:

T 1. The value function v(x) is the expected net gain when using the optimal stopping time starting at state x: 108 OPTIMAL STOPPING TIME 4.4. Cost functions. The cost function g(x) gives the price you must pay to continue from state x. If T is your stopping time then X T is your stopping state and f(x T ) is your

More information

Physics 6A Lab Experiment 6

Physics 6A Lab Experiment 6 Biceps Muscle Model Physics 6A Lab Experiment 6 Introduction This lab will begin with some warm-up exercises to familiarize yourself with the theory, as well as the experimental setup. Then you ll move

More information

Unit 1 - Algebra. Chapter 3 Polynomials Chapter 4 Equations MPM1D

Unit 1 - Algebra. Chapter 3 Polynomials Chapter 4 Equations MPM1D Unit 1 - Algebra Chapter 3 Polynomials Chapter 4 Equations MPM1D Chapter 3 Outline Section Subject Homework Notes Lesson and Homework Complete (initial) 3.2 Work With Exponents 3.3a Exponent Laws 3.3b

More information

INF 5860 Machine learning for image classification. Lecture 14: Reinforcement learning May 9, 2018

INF 5860 Machine learning for image classification. Lecture 14: Reinforcement learning May 9, 2018 Machine learning for image classification Lecture 14: Reinforcement learning May 9, 2018 Page 3 Outline Motivation Introduction to reinforcement learning (RL) Value function based methods (Q-learning)

More information

Lesson 20B: Absolute Value Equations and Inequalities

Lesson 20B: Absolute Value Equations and Inequalities : Absolute Value Equations and Inequalities Warm-Up Exercise 1. Watch the absolute value video on YouTube Math Shorts Episode 10 and then answer the questions below. https://www.youtube.com/watch?v=wrof6dw63es

More information

) (d o f. For the previous layer in a neural network (just the rightmost layer if a single neuron), the required update equation is: 2.

) (d o f. For the previous layer in a neural network (just the rightmost layer if a single neuron), the required update equation is: 2. 1 Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.034 Artificial Intelligence, Fall 2011 Recitation 8, November 3 Corrected Version & (most) solutions

More information

Cover Page: Entropy Summary

Cover Page: Entropy Summary Cover Page: Entropy Summary Heat goes where the ratio of heat to absolute temperature can increase. That ratio (Q/T) is used to define a quantity called entropy. The useful application of this idea shows

More information

Polytechnic Institute of NYU MA 2212 MIDTERM Feb 12, 2009

Polytechnic Institute of NYU MA 2212 MIDTERM Feb 12, 2009 Polytechnic Institute of NYU MA 2212 MIDTERM Feb 12, 2009 Print Name: Signature: Section: ID #: Directions: You have 55 minutes to answer the following questions. You must show all your work as neatly

More information

Purpose: Materials: WARNING! Section: Partner 2: Partner 1:

Purpose: Materials: WARNING! Section: Partner 2: Partner 1: Partner 1: Partner 2: Section: PLEASE NOTE: You will need this particular lab report later in the semester again for the homework of the Rolling Motion Experiment. When you get back this graded report,

More information

(i) Write as a mixed number. (ii) Work out of (iii) Complete each statement with the correct symbol. = < >

(i) Write as a mixed number. (ii) Work out of (iii) Complete each statement with the correct symbol. = < > paper 1 Checkpoint 2012 1 a) Calculate. 483.7 100 = 15.06 0.001 = 9.27 0.1= Show your working. b) Write 276.5246 (i) correct to two decimal places (ii) correct to two significant figures 23 1 2 (i) Write

More information

Where Is Newton Taking Us? And How Fast?

Where Is Newton Taking Us? And How Fast? Name: Where Is Newton Taking Us? And How Fast? In this activity, you ll use a computer applet to investigate patterns in the way the approximations of Newton s Methods settle down to a solution of the

More information

Math 320-1: Midterm 2 Practice Solutions Northwestern University, Fall 2014

Math 320-1: Midterm 2 Practice Solutions Northwestern University, Fall 2014 Math 30-: Midterm Practice Solutions Northwestern University, Fall 04. Give an eample of each of the following. Justify your answer. (a) A function on (, ) which is continuous but not uniformly continuous.

More information

Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 12. Random Variables: Distribution and Expectation

Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 12. Random Variables: Distribution and Expectation CS 70 Discrete Mathematics and Probability Theory Fall 203 Vazirani Note 2 Random Variables: Distribution and Expectation We will now return once again to the question of how many heads in a typical sequence

More information

Course basics. CSE 190: Reinforcement Learning: An Introduction. Last Time. Course goals. The website for the class is linked off my homepage.

Course basics. CSE 190: Reinforcement Learning: An Introduction. Last Time. Course goals. The website for the class is linked off my homepage. Course basics CSE 190: Reinforcement Learning: An Introduction The website for the class is linked off my homepage. Grades will be based on programming assignments, homeworks, and class participation.

More information

1 Boosting. COS 511: Foundations of Machine Learning. Rob Schapire Lecture # 10 Scribe: John H. White, IV 3/6/2003

1 Boosting. COS 511: Foundations of Machine Learning. Rob Schapire Lecture # 10 Scribe: John H. White, IV 3/6/2003 COS 511: Foundations of Machine Learning Rob Schapire Lecture # 10 Scribe: John H. White, IV 3/6/003 1 Boosting Theorem 1 With probablity 1, f co (H), and θ >0 then Pr D yf (x) 0] Pr S yf (x) θ]+o 1 (m)ln(

More information

Pellissippi State. Sponsored by: Oak Ridge Associated Universities

Pellissippi State. Sponsored by: Oak Ridge Associated Universities Pellissippi State Eighth Grade Middle School Mathematics Competition Sponsored by: Oak Ridge Associated Universities Eighth Grade Scoring Formula: 4R W + 0 Directions: For each problem there are 5 possible

More information

Final. Introduction to Artificial Intelligence. CS 188 Spring You have approximately 2 hours and 50 minutes.

Final. Introduction to Artificial Intelligence. CS 188 Spring You have approximately 2 hours and 50 minutes. CS 188 Spring 2014 Introduction to Artificial Intelligence Final You have approximately 2 hours and 50 minutes. The exam is closed book, closed notes except your two-page crib sheet. Mark your answers

More information

Vickrey Auction. Mechanism Design. Algorithmic Game Theory. Alexander Skopalik Algorithmic Game Theory 2013 Mechanism Design

Vickrey Auction. Mechanism Design. Algorithmic Game Theory. Alexander Skopalik Algorithmic Game Theory 2013 Mechanism Design Algorithmic Game Theory Vickrey Auction Vickrey-Clarke-Groves Mechanisms Mechanisms with Money Player preferences are quantifiable. Common currency enables utility transfer between players. Preference

More information

Introduction to Fall 2008 Artificial Intelligence Midterm Exam

Introduction to Fall 2008 Artificial Intelligence Midterm Exam CS 188 Introduction to Fall 2008 Artificial Intelligence Midterm Exam INSTRUCTIONS You have 80 minutes. 70 points total. Don t panic! The exam is closed book, closed notes except a one-page crib sheet,

More information

This means that we can assume each list ) is

This means that we can assume each list ) is This means that we can assume each list ) is of the form ),, ( )with < and Since the sizes of the items are integers, there are at most +1pairs in each list Furthermore, if we let = be the maximum possible

More information

*Karle Laska s Sections: There is no class tomorrow and Friday! Have a good weekend! Scores will be posted in Compass early Friday morning

*Karle Laska s Sections: There is no class tomorrow and Friday! Have a good weekend! Scores will be posted in Compass early Friday morning STATISTICS 100 EXAM 3 Spring 2016 PRINT NAME (Last name) (First name) *NETID CIRCLE SECTION: Laska MWF L1 Laska Tues/Thurs L2 Robin Tu Write answers in appropriate blanks. When no blanks are provided CIRCLE

More information

Rational Numbers. Chapter GOALS

Rational Numbers. Chapter GOALS Chapter Rational Numbers GOALS You will be able to interpret, compare, and order rational numbers add, subtract, multiply, and divide rational numbers using the correct order of operations solve problems

More information

CS 188: Artificial Intelligence Spring Today

CS 188: Artificial Intelligence Spring Today CS 188: Artificial Intelligence Spring 2006 Lecture 9: Naïve Bayes 2/14/2006 Dan Klein UC Berkeley Many slides from either Stuart Russell or Andrew Moore Bayes rule Today Expectations and utilities Naïve

More information

Discrete Mathematics and Probability Theory Fall 2014 Anant Sahai Note 15. Random Variables: Distributions, Independence, and Expectations

Discrete Mathematics and Probability Theory Fall 2014 Anant Sahai Note 15. Random Variables: Distributions, Independence, and Expectations EECS 70 Discrete Mathematics and Probability Theory Fall 204 Anant Sahai Note 5 Random Variables: Distributions, Independence, and Expectations In the last note, we saw how useful it is to have a way of

More information

MATH 446/546 Homework 2: Due October 8th, 2014

MATH 446/546 Homework 2: Due October 8th, 2014 MATH 446/546 Homework 2: Due October 8th, 2014 Answer the following questions. Some of which come from Winston s text book. 1. We are going to invest $1,000 for a period of 6 months. Two potential investments

More information

MAT 111 Final Exam Fall 2013 Name: If solving graphically, sketch a graph and label the solution.

MAT 111 Final Exam Fall 2013 Name: If solving graphically, sketch a graph and label the solution. MAT 111 Final Exam Fall 2013 Name: Show all work on test to receive credit. Draw a box around your answer. If solving algebraically, show all steps. If solving graphically, sketch a graph and label the

More information

CISC 4631 Data Mining

CISC 4631 Data Mining CISC 4631 Data Mining Lecture 06: ayes Theorem Theses slides are based on the slides by Tan, Steinbach and Kumar (textbook authors) Eamonn Koegh (UC Riverside) Andrew Moore (CMU/Google) 1 Naïve ayes Classifier

More information

MOMENTUM! Momentum Impulse Conservation of Momentum in 1 Dimension

MOMENTUM! Momentum Impulse Conservation of Momentum in 1 Dimension MOMENTUM! Momentum Impulse Conservation of Momentum in 1 Dimension Momentum Defined p = m v p = momentum vector m = mass v = velocity vector Momentum Facts p = m v Momentum is a vector quantity! Velocity

More information

of 8 28/11/ :25

of 8 28/11/ :25 Paul's Online Math Notes Home Content Chapter/Section Downloads Misc Links Site Help Contact Me Differential Equations (Notes) / First Order DE`s / Modeling with First Order DE's [Notes] Differential Equations

More information

Lesson 7: Slopes and Functions: Speed and Velocity

Lesson 7: Slopes and Functions: Speed and Velocity Lesson 7: Slopes and Functions: Speed and Velocity 7.1 Observe and Represent Another way of comparing trend lines is by calculating the slope of each line and comparing the numerical values of the slopes.

More information

15-780: Graduate Artificial Intelligence. Reinforcement learning (RL)

15-780: Graduate Artificial Intelligence. Reinforcement learning (RL) 15-780: Graduate Artificial Intelligence Reinforcement learning (RL) From MDPs to RL We still use the same Markov model with rewards and actions But there are a few differences: 1. We do not assume we

More information

Physics 6A Lab Experiment 6

Physics 6A Lab Experiment 6 Rewritten Biceps Lab Introduction This lab will be different from the others you ve done so far. First, we ll have some warmup exercises to familiarize yourself with some of the theory, as well as the

More information

Lab 5 for Math 17: Sampling Distributions and Applications

Lab 5 for Math 17: Sampling Distributions and Applications Lab 5 for Math 17: Sampling Distributions and Applications Recall: The distribution formed by considering the value of a statistic for every possible sample of a given size n from the population is called

More information

January 5, SWBAT explain Newton s first law by describing it in a series of examples.

January 5, SWBAT explain Newton s first law by describing it in a series of examples. January 5, 2017 Aims: SWBAT explain Newton s first law by describing it in a series of examples. Agenda 1. Do Now 2. Class Notes 3. Guided Practice 4. Independent Practice 5. Practicing our AIMS: Homework:

More information

Markov Models and Reinforcement Learning. Stephen G. Ware CSCI 4525 / 5525

Markov Models and Reinforcement Learning. Stephen G. Ware CSCI 4525 / 5525 Markov Models and Reinforcement Learning Stephen G. Ware CSCI 4525 / 5525 Camera Vacuum World (CVW) 2 discrete rooms with cameras that detect dirt. A mobile robot with a vacuum. The goal is to ensure both

More information

MATH HOMEWORK PROBLEMS D. MCCLENDON

MATH HOMEWORK PROBLEMS D. MCCLENDON MATH 46- HOMEWORK PROBLEMS D. MCCLENDON. Consider a Markov chain with state space S = {0, }, where p = P (0, ) and q = P (, 0); compute the following in terms of p and q: (a) P (X 2 = 0 X = ) (b) P (X

More information

Decision making, Markov decision processes

Decision making, Markov decision processes Decision making, Markov decision processes Solved tasks Collected by: Jiří Kléma, klema@fel.cvut.cz Spring 2017 The main goal: The text presents solved tasks to support labs in the A4B33ZUI course. 1 Simple

More information

Tallahassee Community College. 1. Define addition. 2. Draw a picture of 3 apples + 2 apples. 3. Write the directions for adding on the number line.

Tallahassee Community College. 1. Define addition. 2. Draw a picture of 3 apples + 2 apples. 3. Write the directions for adding on the number line. Tallahassee Community College 4 I. Understanding Addition ADDITION OF WHOLE NUMBERS (DEFINITIONS AND PROPERTIES) 1. Define addition. 2. Draw a picture of 3 apples + 2 apples. 3. Write the directions for

More information

RECURSION EQUATION FOR

RECURSION EQUATION FOR Math 46 Lecture 8 Infinite Horizon discounted reward problem From the last lecture: The value function of policy u for the infinite horizon problem with discount factor a and initial state i is W i, u

More information

Algebra 2/Pre-Calculus

Algebra 2/Pre-Calculus Algebra /Pre-Calculus Name Introduction to Eponential Functions (Day 1, Eponential Functions) In this handout, we will introduce eponential functions. Definition We say f () is an eponential function if

More information

x y

x y Name Date Period Slope Review 1. Callie and Jeff each have a job delivering newspapers. Jeff gets paid $140 dollars for delivering 350 papers. Callie gets paid $100 for delivering 200 papers. a. Find the

More information

Grundlagen der Künstlichen Intelligenz

Grundlagen der Künstlichen Intelligenz Grundlagen der Künstlichen Intelligenz Reinforcement learning Daniel Hennes 4.12.2017 (WS 2017/18) University Stuttgart - IPVS - Machine Learning & Robotics 1 Today Reinforcement learning Model based and

More information

CS 361: Probability & Statistics

CS 361: Probability & Statistics February 19, 2018 CS 361: Probability & Statistics Random variables Markov s inequality This theorem says that for any random variable X and any value a, we have A random variable is unlikely to have an

More information

Introduction to Negative Numbers and Computing with Signed Numbers

Introduction to Negative Numbers and Computing with Signed Numbers Section 6. PRE-ACTIVITY PREPARATION Introduction to Negative Numbers and Computing with Signed Numbers In the previous five chapters of this book, your computations only involved zero and the whole numbers,

More information

Statistical methods in recognition. Why is classification a problem?

Statistical methods in recognition. Why is classification a problem? Statistical methods in recognition Basic steps in classifier design collect training images choose a classification model estimate parameters of classification model from training images evaluate model

More information

Basic Statistics for Astrologers

Basic Statistics for Astrologers Page 1 of 5 Basic Statistics for Astrologers Written by Sergey Tarassov The statistics is the most tricky science I have ever dealt with. A decent person from the street who is not a statistician might

More information

Epsilon Delta proofs

Epsilon Delta proofs Epsilon Delta proofs Before reading this guide, please go over inequalities (if needed). Eample Prove lim(4 3) = 5 2 First we have to know what the definition of a limit is: i.e rigorous way of saying

More information

2014 Summer Review for Students Entering Geometry

2014 Summer Review for Students Entering Geometry 1. Solving Linear Equations 2. Evaluating Expressions 3. Order of Operations 3. Operations with Rational Numbers 4. Laws of Exponents 5. Scientific Notation 6. Writing the Equation of a Line 7. Multiplying

More information

Independent Samples ANOVA

Independent Samples ANOVA Independent Samples ANOVA In this example students were randomly assigned to one of three mnemonics (techniques for improving memory) rehearsal (the control group; simply repeat the words), visual imagery

More information

Expected Value 7/7/2006

Expected Value 7/7/2006 Expected Value 7/7/2006 Definition Let X be a numerically-valued discrete random variable with sample space Ω and distribution function m(x). The expected value E(X) is defined by E(X) = x Ω x m(x), provided

More information

Part 1: Integration problems from exams

Part 1: Integration problems from exams . Find each of the following. ( (a) 4t 4 t + t + (a ) (b ) Part : Integration problems from 4-5 eams ) ( sec tan sin + + e e ). (a) Let f() = e. On the graph of f pictured below, draw the approimating

More information

V. RANDOM VARIABLES, PROBABILITY DISTRIBUTIONS, EXPECTED VALUE

V. RANDOM VARIABLES, PROBABILITY DISTRIBUTIONS, EXPECTED VALUE V. RANDOM VARIABLES, PROBABILITY DISTRIBUTIONS, EXPECTED VALUE A game of chance featured at an amusement park is played as follows: You pay $ to play. A penny a nickel are flipped. You win $ if either

More information

1/2 1/2 1/4 1/4 8 1/2 1/2 1/2 1/2 8 1/2 6 P =

1/2 1/2 1/4 1/4 8 1/2 1/2 1/2 1/2 8 1/2 6 P = / 7 8 / / / /4 4 5 / /4 / 8 / 6 P = 0 0 0 0 0 0 0 0 0 0 4 0 0 0 0 0 0 0 0 4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Andrei Andreevich Markov (856 9) In Example. 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 P (n) = 0

More information

1. Frequency Distribution The total number of goals scored in a World Cup soccer match approximately follows the following distribution.

1. Frequency Distribution The total number of goals scored in a World Cup soccer match approximately follows the following distribution. STAT 345 Fall 2018 Homework 3 - Discrete Random Variables Name: Please adhere to the homework rules as given in the Syllabus. 1. Frequency Distribution The total number of goals scored in a World Cup soccer

More information

Introduction to Spring 2009 Artificial Intelligence Midterm Exam

Introduction to Spring 2009 Artificial Intelligence Midterm Exam S 188 Introduction to Spring 009 rtificial Intelligence Midterm Exam INSTRUTINS You have 3 hours. The exam is closed book, closed notes except a one-page crib sheet. Please use non-programmable calculators

More information

Q520: Answers to the Homework on Hopfield Networks. 1. For each of the following, answer true or false with an explanation:

Q520: Answers to the Homework on Hopfield Networks. 1. For each of the following, answer true or false with an explanation: Q50: Answers to the Homework on Hopfield Networks 1. For each of the following, answer true or false with an explanation: a. Fix a Hopfield net. If o and o are neighboring observation patterns then Φ(

More information

CSCI3390-Second Test with Solutions

CSCI3390-Second Test with Solutions CSCI3390-Second Test with Solutions April 26, 2016 Each of the 15 parts of the problems below is worth 10 points, except for the more involved 4(d), which is worth 20. A perfect score is 100: if your score

More information

Discrete Mathematics for CS Spring 2005 Clancy/Wagner Notes 25. Minesweeper. Optimal play in Minesweeper

Discrete Mathematics for CS Spring 2005 Clancy/Wagner Notes 25. Minesweeper. Optimal play in Minesweeper CS 70 Discrete Mathematics for CS Spring 2005 Clancy/Wagner Notes 25 Minesweeper Our final application of probability is to Minesweeper. We begin by discussing how to play the game optimally; this is probably

More information

Algebra 1. Standard Create and Analyze Tables and Graphs. Categories Tables Graphs Context Problems Making Predictions

Algebra 1. Standard Create and Analyze Tables and Graphs. Categories Tables Graphs Context Problems Making Predictions Algebra Standard Create and Analze Tables and Graphs Categories Tables Graphs Contet Problems Making Predictions Summative Assessment Date: Wednesda, August 9 th Page Create and Analze Tables and Graphs

More information

Unit 1- Function Families Quadratic Functions

Unit 1- Function Families Quadratic Functions Unit 1- Function Families Quadratic Functions The graph of a quadratic function is called a. Use a table of values to graph y = x 2. x f(x) = x 2 y (x,y) -2-1 0 1 2 Verify your graph is correct by graphing

More information

CS188: Artificial Intelligence, Fall 2010 Written 3: Bayes Nets, VPI, and HMMs

CS188: Artificial Intelligence, Fall 2010 Written 3: Bayes Nets, VPI, and HMMs CS188: Artificial Intelligence, Fall 2010 Written 3: Bayes Nets, VPI, and HMMs Due: Tuesday 11/23 in 283 Soda Drop Box by 11:59pm (no slip days) Policy: Can be solved in groups (acknowledge collaborators)

More information

A brief introduction to Conditional Random Fields

A brief introduction to Conditional Random Fields A brief introduction to Conditional Random Fields Mark Johnson Macquarie University April, 2005, updated October 2010 1 Talk outline Graphical models Maximum likelihood and maximum conditional likelihood

More information

Homework Exercises. 1. You want to conduct a test of significance for p the population proportion.

Homework Exercises. 1. You want to conduct a test of significance for p the population proportion. Homework Exercises 1. You want to conduct a test of significance for p the population proportion. The test you will run is H 0 : p = 0.4 Ha: p > 0.4, n = 80. you decide that the critical value will be

More information

Algebra Homework 1: Linear Equations

Algebra Homework 1: Linear Equations SAN FRANCISCO STATE UNIVERSITY DEPARTMENT OF MATHEMATICS Algebra Homework 1: Linear Equations Andrew Dynneson Due July 12th at 11:59 PM [Last Update: July 9th] [For all questions, do not include units

More information

UC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Solutions 5 Spring 2006

UC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Solutions 5 Spring 2006 Review problems UC Berkeley Department of Electrical Engineering and Computer Science EE 6: Probablity and Random Processes Solutions 5 Spring 006 Problem 5. On any given day your golf score is any integer

More information

1. A student has learned that test scores in math are determined by this quadratic function:

1. A student has learned that test scores in math are determined by this quadratic function: 01 014 SEMESTER EXAMS 1. A student has learned that test scores in math are determined by this quadratic function: s( t) ( t 6) 99 In the function, s is the score and t is the number of hours that a student

More information

Mathematician # Date DLA #1 Review

Mathematician # Date DLA #1 Review Mathematician # Date DLA #1 Review 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 1 John finished a race at school in 43.9 seconds. Which of the following has the same value as 43.9? A (4 x 10) + (3

More information

CSC321 Lecture 9: Generalization

CSC321 Lecture 9: Generalization CSC321 Lecture 9: Generalization Roger Grosse Roger Grosse CSC321 Lecture 9: Generalization 1 / 26 Overview We ve focused so far on how to optimize neural nets how to get them to make good predictions

More information

Time Indexed Hierarchical Relative Entropy Policy Search

Time Indexed Hierarchical Relative Entropy Policy Search Time Indexed Hierarchical Relative Entropy Policy Search Florentin Mehlbeer June 19, 2013 1 / 15 Structure Introduction Reinforcement Learning Relative Entropy Policy Search Hierarchical Relative Entropy

More information

Learning with multiple models. Boosting.

Learning with multiple models. Boosting. CS 2750 Machine Learning Lecture 21 Learning with multiple models. Boosting. Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Learning with multiple models: Approach 2 Approach 2: use multiple models

More information

Discrete Mathematics for CS Spring 2006 Vazirani Lecture 22

Discrete Mathematics for CS Spring 2006 Vazirani Lecture 22 CS 70 Discrete Mathematics for CS Spring 2006 Vazirani Lecture 22 Random Variables and Expectation Question: The homeworks of 20 students are collected in, randomly shuffled and returned to the students.

More information

MITOCW free_body_diagrams

MITOCW free_body_diagrams MITOCW free_body_diagrams This is a bungee jumper at the bottom of his trajectory. This is a pack of dogs pulling a sled. And this is a golf ball about to be struck. All of these scenarios can be represented

More information