Maximum Expected Utility

Slides:



Advertisements
Similar presentations
Introduction to Graphical Models Brookes Vision Lab Reading Group.
Advertisements

Making Simple Decisions Chapter 16 Some material borrowed from Jean-Claude Latombe and Daphne Koller by way of Marie desJadines,
Making Simple Decisions
Bayesian Networks CSE 473. © Daniel S. Weld 2 Last Time Basic notions Atomic events Probabilities Joint distribution Inference by enumeration Independence.
THE HONG KONG UNIVERSITY OF SCIENCE & TECHNOLOGY CSIT 5220: Reasoning and Decision under Uncertainty L09: Graphical Models for Decision Problems Nevin.
Bayesian Networks. Contents Semantics and factorization Reasoning Patterns Flow of Probabilistic Influence.
CPSC 502, Lecture 11Slide 1 Introduction to Artificial Intelligence (AI) Computer Science cpsc502, Lecture 11 Oct, 18, 2011.
Decision Theory: Single Stage Decisions Computer Science cpsc322, Lecture 33 (Textbook Chpt 9.2) March, 30, 2009.
Decision Making Under Uncertainty Russell and Norvig: ch 16, 17 CMSC421 – Fall 2005.
Decision Making Under Uncertainty Russell and Norvig: ch 16 CMSC421 – Fall 2006.
5/25/2005EE562 EE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS Lecture 16, 6/1/2005 University of Washington, Department of Electrical Engineering Spring 2005.
Bayesian Networks Alan Ritter.
Decision Making Under Uncertainty Russell and Norvig: ch 16, 17 CMSC421 – Fall 2003 material from Jean-Claude Latombe, and Daphne Koller.
1 Bayesian Networks Chapter ; 14.4 CS 63 Adapted from slides by Tim Finin and Marie desJardins. Some material borrowed from Lise Getoor.
CMSC 671 Fall 2003 Class #26 – Wednesday, November 26 Russell & Norvig 16.1 – 16.5 Some material borrowed from Jean-Claude Latombe and Daphne Koller by.
Model Based DSS Creating Information Under Conditions of Uncertainty and Complexity Interface MODEL BASE DATA BASE MBMSDBMS DATA WAREHOUSING ON LINE ANALYTICAL.
Probability and Statistics Required!. 2 Review Outline  Connection to simulation.  Concepts to review.  Assess your understanding.  Addressing knowledge.
1 S ystems Analysis Laboratory Helsinki University of Technology Kai Virtanen, Janne Karelahti, Tuomas Raivio, and Raimo P. Hämäläinen Systems Analysis.
第十讲 概率图模型导论 Chapter 10 Introduction to Probabilistic Graphical Models
Introduction to Bayesian Networks
1 Variable Elimination Graphical Models – Carlos Guestrin Carnegie Mellon University October 11 th, 2006 Readings: K&F: 8.1, 8.2, 8.3,
Lectures 2 – Oct 3, 2011 CSE 527 Computational Biology, Fall 2011 Instructor: Su-In Lee TA: Christopher Miles Monday & Wednesday 12:00-1:20 Johnson Hall.
1 S ystems Analysis Laboratory Helsinki University of Technology Kai Virtanen, Janne Karelahti, Tuomas Raivio, and Raimo P. Hämäläinen Systems Analysis.
Daphne Koller Message Passing Belief Propagation Algorithm Probabilistic Graphical Models Inference.
Slides for “Data Mining” by I. H. Witten and E. Frank.
Marginalization & Conditioning Marginalization (summing out): for any sets of variables Y and Z: Conditioning(variant of marginalization):
Bayesian Networks CSE 473. © D. Weld and D. Fox 2 Bayes Nets In general, joint distribution P over set of variables (X 1 x... x X n ) requires exponential.
Maximum Likelihood Estimation
1 CSC 384 Lecture Slides (c) , C. Boutilier and P. Poupart CSC384: Lecture 25  Last time Decision trees and decision networks  Today wrap up.
Christopher M. Bishop, Pattern Recognition and Machine Learning 1.
1 CMSC 671 Fall 2001 Class #20 – Thursday, November 8.
Web-Mining Agents Agents and Rational Behavior Decision-Making under Uncertainty Simple Decisions Ralf Möller Universität zu Lübeck Institut für Informationssysteme.
Daphne Koller Overview Conditional Probability Queries Probabilistic Graphical Models Inference.
Making Simple Decisions Chapter 16 Some material borrowed from Jean-Claude Latombe and Daphne Koller by way of Marie desJadines,
1 Structure Learning (The Good), The Bad, The Ugly Inference Graphical Models – Carlos Guestrin Carnegie Mellon University October 13 th, 2008 Readings:
Daphne Koller Overview Maximum a posteriori (MAP) Probabilistic Graphical Models Inference.
Daphne Koller Template Models Plate Models Probabilistic Graphical Models Representation.
1 Variable Elimination Graphical Models – Carlos Guestrin Carnegie Mellon University October 15 th, 2008 Readings: K&F: 8.1, 8.2, 8.3,
Perfect recall: Every decision node observes all earlier decision nodes and their parents (along a “temporal” order) Sum-max-sum rule (dynamical programming):
Recap of L09: Normative Decision Theory
Decision Analysis Objective
Some tools and a discussion.
Nevin L. Zhang Room 3504, phone: ,
Ralf Möller Universität zu Lübeck Institut für Informationssysteme
Making Simple Decisions
Read R&N Ch Next lecture: Read R&N
Learning Bayesian Network Models from Data
Decision Theory: Single Stage Decisions
Read R&N Ch Next lecture: Read R&N
The Normal Probability Distribution Summary
General Gibbs Distribution
Readings: K&F: 15.1, 15.2, 15.3, 15.4, 15.5 K&F: 7 (overview of inference) K&F: 8.1, 8.2 (Variable Elimination) Structure Learning in BNs 3: (the good,
Complexity Analysis Variable Elimination Inference Probabilistic
Decision Theory: Single Stage Decisions
Simple Sampling Sampling Methods Inference Probabilistic Graphical
Decision Analysis Objective
I-equivalence Bayesian Networks Representation Probabilistic Graphical
Kai Virtanen, Janne Karelahti, Tuomas Raivio, and Raimo P. Hämäläinen
Shared Features in Log-Linear Models
Readings: K&F: 5.1, 5.2, 5.3, 5.4, 5.5, 5.6, 5.7 Markov networks, Factor graphs, and an unified view Start approximate inference If we are lucky… Graphical.
MCMC for PGMs: The Gibbs Chain
Probabilistic Influence & d-separation
Making Simple Decisions
Plate Models Template Models Representation Probabilistic Graphical
Plate Models Template Models Representation Probabilistic Graphical
Flow of Probabilistic Influence
Read R&N Ch Next lecture: Read R&N
Variable Elimination Graphical Models – Carlos Guestrin
Chapter 14 February 26, 2004.
Decision Making.
Presentation transcript:

Maximum Expected Utility Acting Probabilistic Graphical Models Decision Making Maximum Expected Utility

Simple Decision Making A simple decision making situation D: A set of possible actions Val(A)={a1,…,aK} A set of states Val(X) = {x1,…,xN} A distribution P(X | A) A utility function U(X, A)

Expected Utility Want to choose action a that maximizes the expected utility

Simple Influence Diagram 0.3 0.5 m1 m0 0.2 m2 Market Found U f1 f0 -7 m0 20 m2 5 m1

More Complex Influence Diagram Difficulty Intelligence Study Grade VG Letter VQ Job VS

Information Edges Market Survey Found Decision rule  at 0.3 0.5 m1 m0 0.2 m2 Market 0.1 0.3 0.6 m0 0.4 m2 m1 0.5 s0 s1 s2 Survey Found Decision rule  at action node A is a CPD: P(A | Parents(A)) f1 f0 -7 m0 20 m2 5 m1 U

Expected Utility with Information Want to choose the decision rule A that maximizes the expected utility

Finding MEU Decision Rules Market Survey Found U

Finding MEU Decision Rules Market Survey 0.1 0.3 0.6 m0 0.4 m2 m1 0.5 s0 s1 s2 f1 f0 -7 m0 20 m2 5 m1 0.3 0.5 m1 m0 0.2 m2 Found f1 f0 -1.25 s0 2.1 s2 1.15 s1 U

More Generally

MEU Algorithm Summary To compute MEU & optimize decision at A: Treat A as random variable with arbitrary CPD Introduce utility factor with scope PaU Eliminate all variables except A, Z (A’s parents) to produce factor (A, Z) For each z, set:

Decision Making under Uncertainty MEU principle provides rigorous foundation PGMs provide structured representation for probabilities, actions, and utilities PGM inference methods (VE) can be used for Finding the optimal strategy Determining overall value of the decision situation Efficient methods also exist for: Multiple utility components Multiple decisions

END END END