1 Bayesian Decision Theory Foundations for a unified theory.

Slides:



Advertisements
Similar presentations
Reasons for (prior) belief in Bayesian epistemology
Advertisements

Kees van Deemter Matthew Stone Formal Issues in Natural Language Generation Lecture 4 Shieber 1993; van Deemter 2002.
Dr. Alexandra I. Cristea CS 319: Theory of Databases: C3.
FT228/4 Knowledge Based Decision Support Systems
Naïve Bayes. Bayesian Reasoning Bayesian reasoning provides a probabilistic approach to inference. It is based on the assumption that the quantities of.
The Logic of Intelligence Pei Wang Department of Computer and Information Sciences Temple University.
Hoare’s Correctness Triplets Dijkstra’s Predicate Transformers
Rigorous Software Development CSCI-GA Instructor: Thomas Wies Spring 2012 Lecture 11.
Chapter 1: The Foundations: Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers.
Logic Use mathematical deduction to derive new knowledge.
Logic.
EC941 - Game Theory Prof. Francesco Squintani Lecture 8 1.
1. Introduction Consistency of learning processes To explain when a learning machine that minimizes empirical risk can achieve a small value of actual.
A/Prof Geraint Lewis A/Prof Peter Tuthill
From Chapter 4 Formal Specification using Z David Lightfoot
First Order Logic (chapter 2 of the book) Lecture 3: Sep 14.
Dr. Alexandra I. Cristea CS 319: Theory of Databases: C3.
Introduction to Proofs ch. 1.6, pg. 87,93 Muhammad Arief download dari
Introduction to Logic for Artificial Intelligence Lecture 2 Erik Sandewall 2010.
CAUSES AND COUNTERFACTUALS OR THE SUBTLE WISDOM OF BRAINLESS ROBOTS.
First Order Logic. This Lecture Last time we talked about propositional logic, a logic on simple statements. This time we will talk about first order.
Predicates and Quantifiers
On Bayesian Measures 27 May 2005 V. Crup i Vincenzo Crupi Department of Cognitive and Education Sciences Laboratory of Cognitive Sciences University of.
COMP14112: Artificial Intelligence Fundamentals L ecture 3 - Foundations of Probabilistic Reasoning Lecturer: Xiao-Jun Zeng
Discrete Mathematics and Its Applications
1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 03: PROOFS Section 1.5 Jarek Rossignac CS1050: Understanding.
CSE 311: Foundations of Computing Fall 2013 Lecture 8: More Proofs.
1 Chapter 7 Propositional and Predicate Logic. 2 Chapter 7 Contents (1) l What is Logic? l Logical Operators l Translating between English and Logic l.
Review I Rosen , 3.1 Know your definitions!
CSE 311 Foundations of Computing I Lecture 8 Proofs and Set Theory Spring
Formal Models in AGI Research Pei Wang Temple University Philadelphia, USA.
1 Reasoning Under Uncertainty Artificial Intelligence Chapter 9.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Propositional Calculus CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.
Hazırlayan DISCRETE COMPUTATIONAL STRUCTURES Propositional Logic PROF. DR. YUSUF OYSAL.
LECTURE LECTURE Propositional Logic Syntax 1 Source: MIT OpenCourseWare.
Logical Agents Chapter 7. Outline Knowledge-based agents Logic in general Propositional (Boolean) logic Equivalence, validity, satisfiability.
CS6133 Software Specification and Verification
CSE 311 Foundations of Computing I Lecture 9 Proofs and Set Theory Autumn 2012 CSE
Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.
First Order Logic Lecture 3: Sep 13 (chapter 2 of the book)
CS104:Discrete Structures Chapter 2: Proof Techniques.
CSE 311: Foundations of Computing Fall 2013 Lecture 8: Proofs and Set theory.
First-Order Logic Semantics Reading: Chapter 8, , FOL Syntax and Semantics read: FOL Knowledge Engineering read: FOL.
Boolean Algebra. BOOLEAN ALGEBRA Formal logic: In formal logic, a statement (proposition) is a declarative sentence that is either true(1) or false (0).
CSE 311 Foundations of Computing I Lecture 8 Proofs Autumn 2012 CSE
Process Algebra (2IF45) Basic Process Algebra Dr. Suzana Andova.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
Updating Probabilities Ariel Caticha and Adom Giffin Department of Physics University at Albany - SUNY MaxEnt 2006.
1 Decision Analysis Without Consequences, Bayesianism Without Probabilities Robert Nau Fuqua School of Business Duke University Presentation for RUD 2005.
Artificial Intelligence Logical Agents Chapter 7.
CS.462 Artificial Intelligence SOMCHAI THANGSATHITYANGKUL Lecture 04 : Logic.
Lecture 2: Proofs and Recursion. Lecture 2-1: Proof Techniques Proof methods : –Inductive reasoning Lecture 2-2 –Deductive reasoning Using counterexample.
Conditionals: If __________ [then] __________ statements
2. The Logic of Compound Statements Summary
Conditionals as Random Variables?
Introduction to Logic for Artificial Intelligence Lecture 2
CSE15 Discrete Mathematics 02/08/17
Knowledge and reasoning – second part
ARTIFICIAL INTELLIGENCE
CSE 311 Foundations of Computing I
CSE 311: Foundations of Computing
First Order Logic Rosen Lecture 3: Sept 11, 12.
Knowledge and reasoning – second part
Computational Logic Lecture 13
Conditionals: If __________ [then] __________ statements
Conditionals: If __________ [then] __________ statements
This Lecture Substitution model
Foundations of Discrete Mathematics
ece 720 intelligent web: ontology and beyond
Presentation transcript:

1 Bayesian Decision Theory Foundations for a unified theory

2 What is it? Bayesian decision theories are formal models of rational agency, typically comprising a theory of: –Consistency of belief, desire and preference –Optimal choice Lots of common ground… –Ontology: Agents; states of the world; actions/options; consequences –Form: Two variable quantitative models ; centrality of representation theorem –Content: The principle that rational action maximises expected benefit.

3 It seems natural therefore to speak of plain Decision Theory. But there are differences too... e.g. Savage versus Jeffrey. –Structure of the set of prospects –The representation of actions –SEU versus CEU. Are they offering rival theories or different expressions of the same theory? Thesis: Ramsey, Savage, Jeffrey (and others) are all special cases of a single Bayesian Decision Theory (obtained by restriction of the domain of prospects).

4 Plan Introductory remarks –Prospects –Basic Bayesian hypotheses –Representation theorems A short history –Ramsey’s solution to the measurement problem –Ramsey versus Savage –Jeffrey Conditionals –Lewis-Stalnaker semantics –The Ramsey-Adams Hypothesis –A common logic Conditional algebras A Unified Theory (2 nd lecture)

5 Types of prospects Usual factual possibilities e.g. it will rain tomorrow; UK inflation is 3%; etc. –Denoted by P, Q, etc. –Assumed to be closed under Boolean compounding Conjunction: PQ Negation: ¬P Disjunction: P v Q Logical truth/falsehood: T,  Plus derived conditional possibilities e.g. If it rains tomorrow our trip will be cancelled; if the war in Iraq continues, inflation will rise. –The prospect of X if P and Y if Q will be represented as (P→X)(Q→Y)

6 Main Claims Probability Hypothesis: Rational degrees of belief in factual possibilities are probabilities. SEU Hypothesis: The desirability of (P→X)(¬P→Y) is an average of the desirabilities of PX and ¬PY, respectively weighted by the probability that P or that ¬P. CEU Hypothesis: The desirability of the prospect of X is an average of the desirabilities of XY and X¬Y, respectively weighted by the conditional probability, given X, of XY and of X¬Y. Adams Thesis: The rational degree of belief to have in P→X is the conditional probability of X given that P.

7 Representation Theorems Two problems; one kind of solution! –Problem of measurement –Problem of justification Scientific application: Representation theorems shows that specific conditions on (revealed) preferences suffice to determine a measure of belief and desire. Normative application: Theorems show that commitment to conditions on (rational) preference imply commitment to properties of rational belief and desire.

8 Ramsey-Savage Framework 1.Worlds / consequences: ω 1, ω 2, ω 3, … 2.Propositions / events: P, Q, R, … 3.Conditional Prospects / Actions: (P→ω 1 )(Q→ω 2 ), … Good eggRotten egg Break egg6-egg omeletteNothing to eat Throw egg away5-egg omelette 4. Preferences are over worlds and conditional prospects. “If we had the power of the almighty … we could by offering him options discover how he placed them in order of merit …“

9 Ramsey’s Solution to the Measurement Problem 1.Ethically neutral propositions Problem of definition Enp P has probability one-half iff for all ω 1 and ω 2 (P→ω 1 )(¬P→ω 2 )  (¬P→ω 1 )(P→ω 2 ) 2.Differences in value Values are sets of equi-preferred prospects  - β  γ – δ iff (P→  )(¬P→δ)  (P→ β )(¬P→γ)

10 3.Existence of utility Axiomatic characterisation of a value difference structure implies that existence of a mapping from values to real numbers such that:  - β = γ – δ iff U(  ) – U(β) = U(γ) –U(δ) 4.Derivation of probability Suppose δ  (  if P)(β if ¬P). Then:

11 Evaluation The Justification problem –Why should measurement axioms hold? –Sure-Thing Principle versus P4 and Impartiality Jeffrey’s objection –Fanciful causal hypotheses and artifacts of attribution. –Behaviourism in decision theory Ethical neutrality versus state dependence –Desirabilistic dependence –Constant acts

12 Utility Dependence Good eggRotten egg Break egg6-egg omelette None wasted Nothing to eat 5 eggs wasted Throw egg away5-egg omelette 1 egg wasted 5-egg omelette None wasted Good eggRotten egg Miracle6-egg omelette None wasted 6-egg omelette None wasted Topsy TurvyNothing to eat 5 eggs wasted 6-egg omelette None wasted

13 Probability Dependence RepublicanDemocrat Dodgy land dealLow taxes Unrestricted development High taxes Restricted development No dealNo development Miracle dealHigh taxes Restricted development Low taxes Unrestricted development

14 Jeffrey Advantages –A simple ontology of propositions –State dependent utility –Partition independence (CEU) Measurement –Under-determination of quantitative representations –The inseparability of belief and desire? –Solutions: More axioms, more relations or more prospects? The logical status of conditionals

15 Conditionals Two types of conditional? –Counterfactual: If Oswald hadn’t killed Kennedy then someone else would have. –Indicative: If Oswald didn’t kill Kennedy then someone else did Two types of supposition –Evidential: If its true that … –Interventional: If I make it true that … [Lewis, Joyce, Pearl versus Stalnaker, Adams, Edgington]

16 Lewis-Stalnaker semantics Intuitive idea: A□→B is true iff B is true in those worlds most like the actual one in which A is true. Formally: A□→B is true at a world w iff for every A¬B- world there is a closer AB-world (relative to an ordering on worlds). 1.Limit assumption: There is a closest world 2.Uniqueness Assumption: There is at most one closest world.

17 The Ramsey-Adams Hypothesis General Idea: Rational belief in conditionals goes by conditional belief for their consequents on the assumption that their antecedent is true. Adams Thesis: The probability of an (indicative) conditional is the conditional probability of its consequent given its antecedent: (AT) Logic from belief: A sentence Y can be validly inferred from a set of premises iff the high probability of the premises guarantees the high probability of Y.

18 A Common Logic 1.AB  A  B  A  B 2.   A  A 3. A  A   4. A  ¬ A   5.A  B  A  AB 6.(A  B)(A  C)  A  BC 7.(A  B) v (A  C)  A  (B v C) 8.¬(A  B)  A  ¬B

19 The Bombshell Question: What must the truth-conditions of A  B be, in order that Ramsey-Adams hypothesis be satisfied? Answer: The question cannot be answered. Lewis, Edgington, Hajek, Gärdenfors, Döring, …: There is no non- trivial assignment of truth-conditions to the conditional consistent with the Ramsey-Adams hypothesis. Conclusion: 1.“few philosophical theses that have been more decisively refuted” – Joyce (1999, p.191) 2.Ditch bivalence!

20  A CB ABAB BCBCACAC  Boolean algebra

21 A CB ABABBCBCACAC  ACAACAACCACC ACACACAC A  C  AC Conditional Algebras (1)  (X  Y)(X  Z)  X  YZ (X  Y) v (X  Z)  X  (Y v Z)

22 A CB ABABBCBCACAC  ACAACAACCACC ACACACAC A  C  AC Conditional algebras (2)  XY  X  Y

23 A CB ABABBCBCACAC  ACAACAACCACC ACACACAC A  C  AC Conditional algebras (3)  XY  XYXY  XY

24 A CB ABABBCBCACAC  ACAACAACCACC ACACACAC A  C  AC Normally bounded algebras (1)  X  X   X  Y  X  XY

25 A CB ABABBCBCACAC  ACAACAACCACC ACACACAC A  C  AC Material Conditional  X   ¬X

26 A CB ABABBCBCACAC  ACAACAACCACC ACACACAC A  C  AC Normally bounded algebras (2)  X  ¬X   ¬(X  Y)  X  ¬Y

27 A CB ABABBCBCACAC  ACAACA ACCACC Conditional algebras (3) 