Recap of L09: Normative Decision Theory

Slides:



Advertisements
Similar presentations
Chances Are… You can do it! Activity #4 A woman has two children. What are the odds that both are boys? Show how you would solve this in your math journal.
Advertisements

Solving problems by searching
Modeling and Simulation By Lecturer: Nada Ahmed. Introduction to simulation and Modeling.
Variational Methods for Graphical Models Micheal I. Jordan Zoubin Ghahramani Tommi S. Jaakkola Lawrence K. Saul Presented by: Afsaneh Shirazi.
MA/CS 375 Fall MA/CS 375 Fall 2002 Lecture 29.
1 Chapter 5 Belief Updating in Bayesian Networks Bayesian Networks and Decision Graphs Finn V. Jensen Qunyuan Zhang Division. of Statistical Genomics,
1 Chap. 4 Decision Graphs Statistical Genetics Forum Bayesian Networks and Decision Graphs Finn V. Jensen Presented by Ken Chen Genome Sequencing Center.
Decision Analysis Chapter 15: Hillier and Lieberman Dr. Hurley’s AGB 328 Course.
THE HONG KONG UNIVERSITY OF SCIENCE & TECHNOLOGY CSIT 5220: Reasoning and Decision under Uncertainty L09: Graphical Models for Decision Problems Nevin.
CPSC 668Set 10: Consensus with Byzantine Failures1 CPSC 668 Distributed Algorithms and Systems Fall 2009 Prof. Jennifer Welch.
Decision Theory: Single Stage Decisions Computer Science cpsc322, Lecture 33 (Textbook Chpt 9.2) March, 30, 2009.
Temporal Action-Graph Games: A New Representation for Dynamic Games Albert Xin Jiang University of British Columbia Kevin Leyton-Brown University of British.
Decision Theory: Sequential Decisions Computer Science cpsc322, Lecture 34 (Textbook Chpt 9.3) April, 1, 2009.
KI Kunstmatige Intelligentie / RuG Markov Decision Processes AIMA, Chapter 17.
Artificial Intelligence Course review AIMA. Four main themes Problem solving by search Uninformed search Informed search Constraint satisfaction Adversarial.
1 Decision Trees and Influence Diagrams. 2 Constructing a decision tree: An initial tree...
Cooperating Intelligent Systems Course review AIMA.
CPSC 668Set 10: Consensus with Byzantine Failures1 CPSC 668 Distributed Algorithms and Systems Fall 2006 Prof. Jennifer Welch.
Decision Theory: Sequential Decisions Computer Science cpsc322, Lecture 34 (Textbook Chpt 9.3) April, 12, 2010.
1 © 1998 HRL Laboratories, LLC. All Rights Reserved Development of Bayesian Diagnostic Models Using Troubleshooting Flow Diagrams K. Wojtek Przytula: HRL.
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.
Decision Trees and Influence Diagrams Dr. Ayham Jaaron.
1 More Sorting radix sort bucket sort in-place sorting how fast can we sort?
Bayesian Learning By Porchelvi Vijayakumar. Cognitive Science Current Problem: How do children learn and how do they get it right?
Dynamic Programming for Partially Observable Stochastic Games Daniel S. Bernstein University of Massachusetts Amherst in collaboration with Christopher.
Model Driven DSS Chapter 9. What is a Model? A mathematical representation that relates variables For solving a decision problem Convert the decision.
1 Factored MDPs Alan Fern * * Based in part on slides by Craig Boutilier.
Introduction to Bayesian Networks
Chapter 6 Decision Trees and Influence Diagrams.
CS 188: Artificial Intelligence Fall 2006 Lecture 18: Decision Diagrams 10/31/2006 Dan Klein – UC Berkeley.
Decision Making How do people make decisions? Are there differences between making simple decisions vs. complex ones?
Solving Bayesian Decision Problems: Variable Elimination and Strong Junction Tree Methods Presented By: Jingsong Wang Scott Langevin May 8, 2009.
Modeling Reasoning in Strategic Situations Avi Pfeffer MURI Review Monday, December 17 th, 2007.
Modeling Agents’ Reasoning in Strategic Situations Avi Pfeffer Sevan Ficici Kobi Gal.
CPSC 422, Lecture 11Slide 1 Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 11 Oct, 2, 2015.
UNIT 2 LESSON 6 CS PRINCIPLES. UNIT 2 LESSON 6 OBJECTIVES Students will be able to: Write an algorithm for solving the minimum spanning tree (MST) problem.
1 CSC 384 Lecture Slides (c) , C. Boutilier and P. Poupart CSC384: Lecture 25  Last time Decision trees and decision networks  Today wrap up.
1 CMSC 671 Fall 2001 Class #20 – Thursday, November 8.
© 2015 McGraw-Hill Education. All rights reserved. Chapter 16 Decision Analysis.
1 Automated Planning and Decision Making 2007 Automated Planning and Decision Making Prof. Ronen Brafman Various Subjects.
Perfect recall: Every decision node observes all earlier decision nodes and their parents (along a “temporal” order) Sum-max-sum rule (dynamical programming):
Artificial Intelligence Bayes’ Nets: Independence Instructors: David Suter and Qince Li Course Harbin Institute of Technology [Many slides.
8.4 Elimination using Multiplication To solve systems by elimination with a Multiplication twist.
Solving problems by searching
Nevin L. Zhang Room 3504, phone: ,
Maximum Expected Utility
Iterative Deepening A*
Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 12
Lecture 11: Tree Search © J. Christopher Beck 2008.
ECE 448 Lecture 4: Search Intro
Value of Information and other Decision Analytic Techniques for Optimization of Seismic and Drilling Mark Cronshaw SPEE Denver January 13, 2010 Gustavson.
Decision Theory: Single Stage Decisions
Structured Models for Multi-Agent Interactions
Exploiting Graphical Structure in Decision-Making
Binary Decision Diagrams
Decision Trees and Influence Diagrams.
Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 12
Document Object Model (DOM): Objects and Collections
Decision Theory: Single Stage Decisions
Introduction to Artificial Intelligence Lecture 9: Two-Player Games I
Class #19 – Tuesday, November 3
Solving Equations Containing Decimals
Class #16 – Tuesday, October 26
CS 416 Artificial Intelligence
Influence Diagrams, Decision
Probability Chances Are… You can do it! Activity #4.
Markov Decision Processes
Markov Decision Processes
Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 12
Presentation transcript:

Recap of L09: Normative Decision Theory Page 1 Recap of L09: Normative Decision Theory

Decision Tree for Oil Wildcatter Page 2 Decision Tree for Oil Wildcatter Classical way to represent decision problems with multiple decisions Explicitly show all possible sequences of decisions and observations. Example: Oil Wildcatter

Solving Decision Trees Page 3 Solving Decision Trees

Solving Decision Trees Page 4 Solving Decision Trees

Page 5

Influence Diagram A DAG with three types of nodes Chance nodes, decision nodes, and utility nodes There is a directed path containing all the decision nodes. The utility nodes have no children. Each chance node is associated with the conditional distribution given its parents. Each utility node is associated with a utility function, a real-valued function of its parents.

Influence Diagram An influence diagram for the oil wildcatter problem Page 7 Influence Diagram An influence diagram for the oil wildcatter problem Decision: T: test = {y, n}; D: drill={y, n} Utility: C: cost of test ; V: Benefit of drilling Chance: O: Oil ={dry, wet, soaking} R: seismic structure {no-structure, open-structure, closed-structure, no-result}

Finding Optimal Policy Page 8 Finding Optimal Policy First idea: Convert to decision tree and solve it Exponential still! Next: Variable Elimination Algorithm for solving influence diagrams Note BN inference: All orderings give correct result, but might have different complexity ID: Must use “strong elimination orderings”.