learning amp value change
play

Learning & Value Change J. Dmitri Gallow Modality & Method - PowerPoint PPT Presentation

Learning & Value Change J. Dmitri Gallow Modality & Method Workshop Center for Formal Epistemology Carneigie Mellon University June 910, 2017 Please interrupt when I stop making sense. 0 Daniel & Melissa If theres a


  1. Credal States • At any time t , your opinions are representable with a credal possible worlds; opinionated; 8 state < W , A , c t > • W = { w 1 , w 2 , . . . , w N } is a fjnite set of doxastically • A ⊆ W is a proposition ; • A ⊆ ℘ ( W ) is the set of propositions about which you are • c t : A → [ 0 , 1 ] is your time t credence function.

  2. Credal States • At any time t , your opinions are representable with a credal possible worlds; opinionated; 8 state < W , A , c t > • W = { w 1 , w 2 , . . . , w N } is a fjnite set of doxastically • A ⊆ W is a proposition ; • A ⊆ ℘ ( W ) is the set of propositions about which you are • c t : A → [ 0 , 1 ] is your time t credence function.

  3. Credal States • At any time t , your opinions are representable with a credal possible worlds; opinionated; 8 state < W , A , c t > • W = { w 1 , w 2 , . . . , w N } is a fjnite set of doxastically • A ⊆ W is a proposition ; • A ⊆ ℘ ( W ) is the set of propositions about which you are • c t : A → [ 0 , 1 ] is your time t credence function.

  4. Bayesianism Probabilism

  5. Probabilism Probabilism 9 At all times t , c t should be a probability function.

  6. Bayesianism Conditionalization

  7. Conditionalization adopt, at t , upon receiving the total evidence E . Conditionalization Tiere should be some credence function c such that, for all evidence, 10 • Use ‘ c t , E ’ for the credence function you are disposed to times t and all A , E ∈ A such that E could be your total time t c t , E ( A ) = c ( A | E )

  8. Conditionalization • Use ‘ c E ’ for the credence function you are disposed to adopt, at t , upon receiving the total evidence E . Conditionalization Tiere should be some credence function c such that, for all evidence, 10 times t and all A , E ∈ A such that E could be your total time t c t , E ( A ) = c ( A | E )

  9. Conditionalization adopt, at t , upon receiving the total evidence E . Conditionalization Tiere should be some credence function c such that, for all evidence, 10 • Use ‘ c t , E ’ for the credence function you are disposed to times t and all A , E ∈ A such that E could be your total time t c t , E ( A ) = c ( A | E )

  10. Bayesianism • Tie Bayesian account of rational learning: you should be a probabilistic conditionalizer. 11

  11. Daniel is not a probabilistic conditionalizer If Daniel were a conditionalizer, then So Daniel isn’t probabilistic 12 1. c a Dem. φ -ed ( φ -ing is wrong ) is low. 2. c a Rep. φ -ed ( φ -ing is wrong ) is high. c ( φ -ing is wrong | a Dem. φ -ed ) is low and c ( φ -ing is wrong | a Rep. φ -ed ) is high But Daniel thinks whether φ -ing is wrong is independent of whether a Dem. or a Rep. φ -ed. So c ( φ -ing is wrong ) is low and c ( φ -ing is wrong ) is high

  12. Daniel is not a probabilistic conditionalizer If Daniel were a conditionalizer, then So Daniel isn’t probabilistic 12 1. c a Dem. φ -ed ( φ -ing is wrong ) is low. 2. c a Rep. φ -ed ( φ -ing is wrong ) is high. c ( φ -ing is wrong | a Dem. φ -ed ) is low and c ( φ -ing is wrong | a Rep. φ -ed ) is high But Daniel thinks whether φ -ing is wrong is independent of whether a Dem. or a Rep. φ -ed. So c ( φ -ing is wrong ) is low and c ( φ -ing is wrong ) is high

  13. Daniel is not a probabilistic conditionalizer If Daniel were a conditionalizer, then So Daniel isn’t probabilistic 12 1. c a Dem. φ -ed ( φ -ing is wrong ) is low. 2. c a Rep. φ -ed ( φ -ing is wrong ) is high. c ( φ -ing is wrong | a Dem. φ -ed ) is low and c ( φ -ing is wrong | a Rep. φ -ed ) is high But Daniel thinks whether φ -ing is wrong is independent of whether a Dem. or a Rep. φ -ed. So c ( φ -ing is wrong ) is low and c ( φ -ing is wrong ) is high

  14. Daniel is not a probabilistic conditionalizer If Daniel were a conditionalizer, then So Daniel isn’t probabilistic 12 1. c a Dem. φ -ed ( φ -ing is wrong ) is low. 2. c a Rep. φ -ed ( φ -ing is wrong ) is high. c ( φ -ing is wrong | a Dem. φ -ed ) is low and c ( φ -ing is wrong | a Rep. φ -ed ) is high But Daniel thinks whether φ -ing is wrong is independent of whether a Dem. or a Rep. φ -ed. So c ( φ -ing is wrong ) is low and c ( φ -ing is wrong ) is high

  15. Daniel is not a probabilistic conditionalizer If Daniel were a conditionalizer, then So Daniel isn’t probabilistic 12 1. c a Dem. φ -ed ( φ -ing is wrong ) is low. 2. c a Rep. φ -ed ( φ -ing is wrong ) is high. c ( φ -ing is wrong | a Dem. φ -ed ) is low and c ( φ -ing is wrong | a Rep. φ -ed ) is high But Daniel thinks whether φ -ing is wrong is independent of whether a Dem. or a Rep. φ -ed. So c ( φ -ing is wrong ) is low and c ( φ -ing is wrong ) is high

  16. Daniel is not a probabilistic conditionalizer • Tie accuracy-fjrster likes this diagnosis of Daniel’s irrationality. • Tiey wish to show that Probabilism and Conditionalization follow from: • the axiological claim that accuracy is the sole epistemic good; • a claim about how to properly value accuracy; and • the consequentialist deontic norm that it is rational to maximize expected epistemic value. 13

  17. Daniel is not a probabilistic conditionalizer • Tie accuracy-fjrster likes this diagnosis of Daniel’s irrationality. Conditionalization follow from: • the axiological claim that accuracy is the sole epistemic good; • a claim about how to properly value accuracy; and • the consequentialist deontic norm that it is rational to maximize expected epistemic value. 13 • Tiey wish to show that Probabilism and

  18. Daniel is not a probabilistic conditionalizer • Tie accuracy-fjrster likes this diagnosis of Daniel’s irrationality. Conditionalization follow from: • the axiological claim that accuracy is the sole epistemic good; • a claim about how to properly value accuracy; and • the consequentialist deontic norm that it is rational to maximize expected epistemic value. 13 • Tiey wish to show that Probabilism and

  19. Daniel is not a probabilistic conditionalizer • Tie accuracy-fjrster likes this diagnosis of Daniel’s irrationality. Conditionalization follow from: • the axiological claim that accuracy is the sole epistemic good; • a claim about how to properly value accuracy; and • the consequentialist deontic norm that it is rational to maximize expected epistemic value. 13 • Tiey wish to show that Probabilism and

  20. Daniel is not a probabilistic conditionalizer • Tie accuracy-fjrster likes this diagnosis of Daniel’s irrationality. Conditionalization follow from: • the axiological claim that accuracy is the sole epistemic good; • a claim about how to properly value accuracy; and • the consequentialist deontic norm that it is rational to maximize expected epistemic value. 13 • Tiey wish to show that Probabilism and

  21. Epistemic Value

  22. Epistemic Value • Write the epistemic value of a credence function c , under the supposition that w is actual, as: accuracy of c in w . • E.g., one accuracy measure is the quadratic or ‘Brier’ def 14 V ( c , w ) • For the accuracy-fjrster, V ( c , w ) is entirely a function of the measure, Q = − ∑ Q ( c , w ) ( ν A ( w ) − c ( A )) 2 A ∈ A

  23. Epistemic Value • Write the epistemic value of a credence function c , under the supposition that w is actual, as: accuracy of c in w . • E.g., one accuracy measure is the quadratic or ‘Brier’ def 14 V ( c , w ) • For the accuracy-fjrster, V ( c , w ) is entirely a function of the measure, Q = − ∑ Q ( c , w ) ( ν A ( w ) − c ( A )) 2 A ∈ A

  24. Epistemic Value • Write the epistemic value of a credence function c , under the supposition that w is actual, as: accuracy of c in w . • E.g., one accuracy measure is the quadratic or ‘Brier’ def 14 V ( c , w ) • For the accuracy-fjrster, V ( c , w ) is entirely a function of the measure, Q = − ∑ Q ( c , w ) ( ν A ( w ) − c ( A )) 2 A ∈ A

  25. Epistemic Value • Write the epistemic value of a credence function c , under the supposition that w is actual, as: accuracy of c in w . • E.g., one accuracy measure is the quadratic or ‘Brier’ def 14 V ( c , w ) • For the accuracy-fjrster, V ( c , w ) is entirely a function of the measure, Q = − ∑ Q ( c , w ) ( ν A ( w ) − c ( A )) 2 A ∈ A

  26. Epistemic Value • Write the epistemic value of a credence function c , under the supposition that w is actual, as: accuracy of c in w . • E.g., one accuracy measure is the quadratic or ‘Brier’ def 14 V ( c , w ) • For the accuracy-fjrster, V ( c , w ) is entirely a function of the measure, Q = − ∑ Q ( c , w ) ( ν A ( w ) − c ( A )) 2 A ∈ A

  27. Epistemic Value • Write the epistemic value of a credence function c , under the supposition that w is actual, as: accuracy of c in w . • E.g., one accuracy measure is the quadratic or ‘Brier’ def 14 V ( c , w ) • For the accuracy-fjrster, V ( c , w ) is entirely a function of the measure, Q = − ∑ Q ( c , w ) ( ν A ( w ) − c ( A )) 2 A ∈ A

  28. Epistemic Value • Write the epistemic value of a credence function c , under the supposition that w is actual, as: accuracy of c in w . • E.g., one accuracy measure is the quadratic or ‘Brier’ def 14 V ( c , w ) • For the accuracy-fjrster, V ( c , w ) is entirely a function of the measure, Q = − ∑ Q ( c , w ) ( ν A ( w ) − c ( A )) 2 A ∈ A

  29. Other Accuracy Measures • Tie Absolute Value measure def • Tie Logarithmic measure • Tie Euclidean distance measure def def 15 √ ∑ E ( c , w ) = − ( ν A ( w ) − c ( A )) 2 A ∈ A = ∑ A ( c , w ) | ν A ( w ) − c ( A ) | A ∈ A = ∑ L ( c , w ) ln [ | ( 1 − ν A ( w )) − c ( A ) | ] A ∈ A

  30. Other Accuracy Measures • Tie Absolute Value measure def • Tie Logarithmic measure • Tie Euclidean distance measure def def 15 √ ∑ E ( c , w ) = − ( ν A ( w ) − c ( A )) 2 A ∈ A = ∑ A ( c , w ) | ν A ( w ) − c ( A ) | A ∈ A = ∑ L ( c , w ) ln [ | ( 1 − ν A ( w )) − c ( A ) | ] A ∈ A

  31. Other Accuracy Measures • Tie Absolute Value measure def • Tie Logarithmic measure • Tie Euclidean distance measure def def 15 √ ∑ E ( c , w ) = − ( ν A ( w ) − c ( A )) 2 A ∈ A = ∑ A ( c , w ) | ν A ( w ) − c ( A ) | A ∈ A = ∑ L ( c , w ) ln [ | ( 1 − ν A ( w )) − c ( A ) | ] A ∈ A

  32. Evaluating credence functions • Leitgeb & Pettigrew: if your credence function is a of c ’s epistemic value. • Tiis is a general decision-theoretic norm: epistemic acts are choiceworthy to the degree that they maximize expected value. 16 • Use ‘ V c ( c ∗ ) ’ to represent how valuable the credence function c ∗ is, according to the credence function c . probability, p , then, for all c , V p ( c ) should be p ’s expectation = ∑ ! V p ( c ) V ( c , w ) · p ( w ) w ∈ W

  33. Evaluating credence functions • Leitgeb & Pettigrew: if your credence function is a of c ’s epistemic value. • Tiis is a general decision-theoretic norm: epistemic acts are choiceworthy to the degree that they maximize expected value. 16 • Use ‘ V c ( c ∗ ) ’ to represent how valuable the credence function c ∗ is, according to the credence function c . probability, p , then, for all c , V p ( c ) should be p ’s expectation = ∑ ! V p ( c ) V ( c , w ) · p ( w ) w ∈ W

  34. Evaluating credence functions • Leitgeb & Pettigrew: if your credence function is a of c ’s epistemic value. • Tiis is a general decision-theoretic norm: epistemic acts are choiceworthy to the degree that they maximize expected value. 16 • Use ‘ V c ( c ∗ ) ’ to represent how valuable the credence function c ∗ is, according to the credence function c . probability, p , then, for all c , V p ( c ) should be p ’s expectation = ∑ ! V p ( c ) V ( c , w ) · p ( w ) w ∈ W

  35. Evaluating credence functions • Leitgeb & Pettigrew: if your credence function is a of c ’s epistemic value. • Tiis is a general decision-theoretic norm: epistemic acts are choiceworthy to the degree that they maximize expected value. 16 • Use ‘ V c ( c ∗ ) ’ to represent how valuable the credence function c ∗ is, according to the credence function c . probability, p , then, for all c , V p ( c ) should be p ’s expectation = ∑ ! V p ( c ) V ( c , w ) · p ( w ) w ∈ W

  36. Evaluating credence functions • Leitgeb & Pettigrew: if your credence function is a of c ’s epistemic value. • Tiis is a general decision-theoretic norm: epistemic acts expected value. 16 • Use ‘ V c ( c ∗ ) ’ to represent how valuable the credence function c ∗ is, according to the credence function c . probability, p , then, for all c , V p ( c ) should be p ’s expectation = ∑ ! V p ( c ) V ( c , w ) · p ( w ) w ∈ W are choiceworthy to the degree that they maximize causal?

  37. Evaluating credence functions • Leitgeb & Pettigrew: if your credence function is a of c ’s epistemic value. • Tiis is a general decision-theoretic norm: epistemic acts are choiceworthy to the degree that they maximize expected value. 16 • Use ‘ V c ( c ∗ ) ’ to represent how valuable the credence function c ∗ is, according to the credence function c . probability, p , then, for all c , V p ( c ) should be p ’s expectation = ∑ ! V p ( c ) V ( c , w ) · p ( w ) w ∈ W

  38. Valuing Accuracy Properly Propriety 17 Tie epistemic value function V is proper ifg, for every probability p and every credence function c � p , V p ( c ) < V p ( p ) • Q is proper , • L is proper , • A is not proper / • E is not proper /

  39. Valuing Accuracy Properly Propriety 17 Tie epistemic value function V is proper ifg, for every probability p and every credence function c � p , V p ( c ) < V p ( p ) • Q is proper , • L is proper , • A is not proper / • E is not proper /

  40. Valuing Accuracy Properly Propriety 17 Tie epistemic value function V is proper ifg, for every probability p and every credence function c � p , V p ( c ) < V p ( p ) • Q is proper , • L is proper , • A is not proper / • E is not proper /

  41. Valuing Accuracy Properly Propriety 17 Tie epistemic value function V is proper ifg, for every probability p and every credence function c � p , V p ( c ) < V p ( p ) • Q is proper , • L is proper , • A is not proper / • E is not proper /

  42. Valuing Accuracy Properly Propriety 17 Tie epistemic value function V is proper ifg, for every probability p and every credence function c � p , V p ( c ) < V p ( p ) • Q is proper , • L is proper , • A is not proper / • E is not proper /

  43. Why Propriety? Epistemic Conservativism P1. For any probability p , there is some evidence you could have that would make it permissible to have p as your credence function. your own, then it is permissible to adopt c as your credence function, even without receiving any evidence. P3. It is impermissible to change your credences without receiving evidence. C1. So, epistemic value must be proper. 18 P2. If another credence function c is at least as valuable as

  44. Why Propriety? Epistemic Conservativism P1. For any probability p , there is some evidence you could have that would make it permissible to have p as your credence function. your own, then it is permissible to adopt c as your credence function, even without receiving any evidence. P3. It is impermissible to change your credences without receiving evidence. C1. So, epistemic value must be proper. 18 P2. If another credence function c is at least as valuable as

  45. Why Propriety? Epistemic Conservativism P1. For any probability p , there is some evidence you could have that would make it permissible to have p as your credence function. your own, then it is permissible to adopt c as your credence function, even without receiving any evidence. P3. It is impermissible to change your credences without receiving evidence. C1. So, epistemic value must be proper. 18 P2. If another credence function c is at least as valuable as

  46. Why Propriety? Epistemic Conservativism P1. For any probability p , there is some evidence you could have that would make it permissible to have p as your credence function. your own, then it is permissible to adopt c as your credence function, even without receiving any evidence. P3. It is impermissible to change your credences without receiving evidence. C1. So, epistemic value must be proper. 18 P2. If another credence function c is at least as valuable as

  47. Why Propriety? Epistemic Conservativism P1. For any probability p , there is some evidence you could have that would make it permissible to have p as your credence function. your own, then it is permissible to adopt c as your credence function, even without receiving any evidence. P3. It is impermissible to change your credences without receiving evidence. C1. So, epistemic value must be proper. 18 P2. If another credence function c is at least as valuable as

  48. Why Propriety? Immodesty P1. For any probability p , there is some evidence you could have that would make it permissible to have p as your credence function. P4. Rationality requires you to think that your own credences are epistemically better than any other credences you could have held instead. C1. So, epistemic value must be proper. 19

  49. Why Propriety? Immodesty P1. For any probability p , there is some evidence you could have that would make it permissible to have p as your credence function. P4. Rationality requires you to think that your own credences are epistemically better than any other credences you could have held instead. C1. So, epistemic value must be proper. 19

  50. Why Propriety? Immodesty P1. For any probability p , there is some evidence you could have that would make it permissible to have p as your credence function. P4. Rationality requires you to think that your own credences are epistemically better than any other credences you could have held instead. C1. So, epistemic value must be proper. 19

  51. Why Propriety? Immodesty P1. For any probability p , there is some evidence you could have that would make it permissible to have p as your credence function. P4. Rationality requires you to think that your own credences are epistemically better than any other credences you could have held instead. C1. So, epistemic value must be proper. 19

  52. Propriety & Probabilism non-probabilistic credence function is accuracy dominated by a probabilistic credence function, and no probabilistic credence function is so dominated. (Predd et al, 2009) • Assuming that accuracy domination is irrational and that 20 • If V is a proper measure of accuracy, then every V is a proper measure of accuracy, Probabilism follows.

  53. Propriety & Probabilism non-probabilistic credence function is accuracy dominated by a probabilistic credence function, and no probabilistic credence function is so dominated. (Predd et al, 2009) • Assuming that accuracy domination is irrational and that 20 • If V is a proper measure of accuracy, then every V is a proper measure of accuracy, Probabilism follows.

  54. Conditionalization & Accuracy

  55. Conditionalization & Accuracy Take 1

  56. Propriety & Conditionalization • Leitgeb & Pettigrew (2010): Upon learning that E , you should be disposed to adopt a new credence function which maximizes your expected epistemic value in all possibilities consistent with E . p E c 21 { } ! ∑ = arg max p ( w ) · V ( c , w ) w ∈ E

  57. Propriety & Conditionalization • Leitgeb & Pettigrew (2010): Upon learning that E , you should be disposed to adopt a new credence function which maximizes your expected epistemic value in all possibilities consistent with E . p E c 21 { } ! ∑ = arg max p ( w ) · V ( c , w ) w ∈ E

  58. Propriety & Conditionalization Tieorem 1 (Generalized from Leitgeb & Pettigrew, 2010) c arg max p E and any proposition E , 22 c { } ! ∑ = arg max p ( w ) · V ( c , w ) w ∈ E If V is a proper accuracy measure, then, for any probability p { } ∑ p ( w ) · V ( c , w ) = p ( − | E ) w ∈ E ! If V is a proper accuracy measure, then p E = p ( − | E ) .

  59. Propriety & Conditionalization Tieorem 1 (Generalized from Leitgeb & Pettigrew, 2010) c arg max p E and any proposition E , 22 c { } ! ∑ = arg max p ( w ) · V ( c , w ) w ∈ E If V is a proper accuracy measure, then, for any probability p { } ∑ p ( w ) · V ( c , w ) = p ( − | E ) w ∈ E ! If V is a proper accuracy measure, then p E = p ( − | E ) .

  60. Propriety & Conditionalization Tieorem 1 (Generalized from Leitgeb & Pettigrew, 2010) c arg max p E and any proposition E , 22 c { } ! ∑ = arg max p ( w ) · V ( c , w ) w ∈ E If V is a proper accuracy measure, then, for any probability p { } ∑ p ( w ) · V ( c , w ) = p ( − | E ) w ∈ E ! If V is a proper accuracy measure, then p E = p ( − | E ) .

  61. Why only E -possibilities? p E c • We should attempt to maximize expected epistemic value, but this is not an expectation; why should it be maximized? 23 { } ! ∑ = arg max p ( w ) · V ( c , w ) w ∈ E

  62. Why only E -possibilities? p E c • We should attempt to maximize expected epistemic value, but this is not an expectation; why should it be maximized? 23 { } ! ∑ = arg max p ( w ) · V ( c , w ) w ∈ E

  63. Why only E -possibilities? p E value in the remaining worlds. to pick a posterior which maximizes expected epistemic • Stage 2: use your prior (no longer probabilistic) credences • Stage 1: upon learning E , you eliminate worlds • A 2-stage theory of rational learning: 24 c { } ! ∑ = arg max p ( w ) · V ( c , w ) w ∈ E incompatible with E from W ;

  64. Why only E -possibilities? p E value in the remaining worlds. to pick a posterior which maximizes expected epistemic • Stage 2: use your prior (no longer probabilistic) credences • Stage 1: upon learning E , you eliminate worlds • A 2-stage theory of rational learning: 24 c { } ! ∑ = arg max p ( w ) · V ( c , w ) w ∈ E incompatible with E from W ;

  65. Why only E -possibilities? p E value in the remaining worlds. to pick a posterior which maximizes expected epistemic • Stage 2: use your prior (no longer probabilistic) credences • Stage 1: upon learning E , you eliminate worlds • A 2-stage theory of rational learning: 24 c { } ! ∑ = arg max p ( w ) · V ( c , w ) w ∈ E incompatible with E from W ;

  66. Why only E -possibilities? p E value in the remaining worlds. to pick a posterior which maximizes expected epistemic • Stage 2: use your prior (no longer probabilistic) credences • Stage 1: upon learning E , you eliminate worlds • A 2-stage theory of rational learning: 24 c { } ! ∑ = arg max p ( w ) · V ( c , w ) w ∈ E incompatible with E from W ;

  67. Why only E -possibilities? p E value in the remaining worlds. to pick a posterior which maximizes expected epistemic • Stage 2: use your prior (no longer probabilistic) credences • A 2-stage theory of rational learning: 24 c { } ! ∑ = arg max p ( w ) · V ( c , w ) w ∈ E • Stage 1: upon learning E , you eliminate worlds incompatible with E from W ;

  68. Accuracy-fjrst? • Why eliminate worlds at stage 1? • Because they are incompatible with your evidence. • Tiis answer relies upon a norm like “do not treat a world as epistemically possible if it is incompatible with your evidence” • Tiis is a distinctively evidential norm • It has not been justifjed in terms of the rational pursuit of accuracy alone. • Moreover, no such justifjcation is possible, if we assume that accuracy is properly measured. 25

  69. Accuracy-fjrst? • Why eliminate worlds at stage 1? • Because they are incompatible with your evidence. • Tiis answer relies upon a norm like “do not treat a world as epistemically possible if it is incompatible with your evidence” • Tiis is a distinctively evidential norm • It has not been justifjed in terms of the rational pursuit of accuracy alone. • Moreover, no such justifjcation is possible, if we assume that accuracy is properly measured. 25

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend