Upgrade to Pro
— share decks privately, control downloads, hide ads and more …
Speaker Deck
Sign up for free
Menu
Search
Features
All features
Private URLs
Password Protection
Custom URLS
Scheduled publishing
Remove Branding
Restrict embedding
Deck Collections
Notes
Features
All features
Private URLs
Password Protection
Custom URLS
Scheduled publishing
Remove Branding
Restrict embedding
Deck Collections
Notes
Explore
Featured decks
Featured speakers
Programming
Technology
Storyboards
Explore
Featured decks
Featured speakers
Programming
Technology
Storyboards
Pricing
Search
Sign in
Sign up for free
ベイズ統計モデリング 10 // Doing Bayesian Data Analysis C...
Search
todesking
August 24, 2018
Science
140
0
Share
Embed
Copy iframe code
Copy JS code
Copy link
Start on current slide
ベイズ統計モデリング 10 // Doing Bayesian Data Analysis Chapter 10
todesking
August 24, 2018
More Decks by todesking
See All by todesking
自作言語進捗 2020 Mar / ojaml-2020-mar
todesking
0
480
バンディット問題の理論とアルゴリズム 第8章 / bandit-8
todesking
0
140
オンライン広告におけるCTR/CVR推定関係の論文を30本くらい雑に紹介する / rtb-papers-ctr
todesking
3
1.8k
オンライン広告関連の論文を50本くらい雑に紹介する AdKDD編 / adkdd-all
todesking
4
2.5k
バンディット問題の理論とアルゴリズム 第二章 / bandit2
todesking
0
200
自作言語進捗 2019 May / ojaml-2019-may
todesking
0
980
自作言語進捗 2019 Mar
todesking
0
550
実行時におけるJVMバイトコード最適化手法
todesking
16
13k
Other Decks in Science
See All in Science
暗号解読における量子計算の展望
neutron63zf
0
300
データベース10: 拡張実体関連モデル
trycycle
PRO
0
1.6k
Visual Linear Algebra - Lecture at Shosen Grande
hiranabe
0
590
データベース09: 実体関連モデル上の一貫性制約
trycycle
PRO
0
1.9k
AI for Phage-Host prediction
michielstock
0
130
「表象」を再定義するー潜在表現解析の落とし穴
ykamit
0
820
プレイがつなぐ研究と社会:市⺠‧クリエイター‧SF作家による実践を通じて
hayataka88
1
110
Webinaire : Valorisez les résultats de vos projets européens avec EU-FarmBook
institudelelevage
PRO
0
110
大黒市で発生した大規模インシデント の ポストモーテムから読み解く、 記憶媒体消去の大切さ
shucho0103
0
280
生成AIが科学とRAにもたらしていること:メタサイエンスの視点から
rmaruy
0
140
(CVPR2026) Back to Basics: Let Denoising Generative Models Denoise
shumpei777
0
380
データベース14: B+木 & ハッシュ索引
trycycle
PRO
0
960
Featured
See All Featured
Taking LLMs out of the black box: A practical guide to human-in-the-loop distillation
inesmontani
PRO
3
2.4k
Why Our Code Smells
bkeepers
PRO
340
58k
Reflections from 52 weeks, 52 projects
jeffersonlam
356
21k
Chasing Engaging Ingredients in Design
codingconduct
0
340
Optimizing for Happiness
mojombo
378
71k
Building AI with AI
inesmontani
PRO
1
1.3k
VelocityConf: Rendering Performance Case Studies
addyosmani
331
25k
Typedesign – Prime Four
hannesfritz
42
3.2k
Kristin Tynski - Automating Marketing Tasks With AI
techseoconnect
PRO
0
530
Building Better People: How to give real-time feedback that sticks.
wjessup
370
20k
Six Lessons from altMBA
skipperchong
29
4.5k
Code Review Best Practice
trishagee
74
20k
Transcript
ϕΠζ౷ܭϞσϦϯά Chapter 10 @todesking
ϕΠδΞϯϞσϧൺֱ • ؍ଌ͞ΕͨσʔλΛઆ໌͢ΔͨΊͷɺෳͷϞσϧ͕ߟ͑ ΒΕΔ • ͲͷϞσϧ͕ΑΓͬͱΒ͍͔͠? • ࠓ·ͰֶΜͰ͖ͨϕΠζϞσϦϯάʹΑͬͯɺʮϞσϧΛ ൺֱ͢ΔϞσϧʯΛߏ͢Δ͜ͱ͕Ͱ͖Δ
10.1 ҰൠࣜͱϕΠζϑΝΫλʔ • ؍ଌ͞Εͨσʔλ(D)Λઆ໌͢Δ2ͭͷϞσϧΛߟ͑Δ • ֤ϞσϧɺࣄલP(θ)ɺP(D|θ)͓Αͼύϥϝʔλθ͔ΒͳΔ D θ1 θ1 ∼
P1 (θ1 ) D ∼ P1 (D|θ1 ) D θ2 θ2 ∼ P2 (θ2 ) D ∼ P2 (D|θ2 )
Ϟσϧͷநදݱ • Ϟσϧ͕ෳͷม͔Βߏ͞Ε͍ͯͯɺநԽ͢Ε θ, P(θ), P(D|θ) ͰදݱͰ͖Δ(ಠࣗݚڀ) D θ1 θ
= (φ1 , φ2 , φ3 ) D = (X, Y) P(θ) = P(φ1 , φ2 , φ3 ) P(D|θ) = P(X, Y|φ1 , φ2 , φ3 ) X φ1 φ3 Y φ2
ϞσϧൺֱͷͨΊͷϞσϧ • ϞσϧબมmΛಋೖͯ͠ɺ2ͭͷϞσϧΛ·ͱΊΔ • ϞσϧൺֱͷͨΊͷϞσϧͱͳΔ • fig 10.1Ͱɺ͕ؔผʑͷέʔε(தԝ)ɺڞ௨͍ͯ͠Δέʔε(ӈ)ɺͦ ͷҰൠԽ͍Δͷ͔?ͷέʔε(ࠨ)͕දݱ͞Ε͍ͯΔ •
Լਤதԝͷέʔεʹ૬ D θ1 θ1 ∼ P1 (θ1 ) θ2 θ2 ∼ P2 (θ2 ) m m ∼ P(m) P(D|θ1 , m = 1) = P1 (D|θ1 ) P(D|θ2 , m = 2) = P2 (D|θ2 )
ϞσϧൺֱͷͨΊͷϞσϧ • ͜ͷϞσϧͷύϥϝʔλಉ࣌ҎԼʹͳΔ • ϞσϧΛM, ύϥϝʔλ{θ_1, ..., θ_M} Λ Θ
ͱͨ͠ P(Θ, m|D) = P(D|Θ, m)P(Θ, m) ∑ m ∫ dθm P(D|Θ, m) = ∏ m ∫ dθm Pm (D|θm , m)Pm (θm )P(m) ∑ m ∏ m ∫ dθm Pm (D|θm , m)Pm (θm )P(m) P(D|Θ) ͕ ∏ m Pm (D|θm )Pm (θm |m)P(m)ʹͳΔͷ͕ॏཁΒ͍͠
P(m|D) • ͜ͷϞσϧΛ͏͜ͱͰɺσʔλD͕༩͑ΒΕͨͱ͖Ϟσ ϧm͕ΘΕΔ֬P(m|D)ΛٻΊΔ͜ͱ͕Ͱ͖Δ P(m|D) = P(D|m)P(m) ∑ m P(D|m)P(m)
P(D|m) = ∫ dθm Pm (D|θm )Pm (θm )
ࣄޙΦοζͱϕΠζϑΝΫλ • ϞσϧؒͰP(m|D)ͷൺΛऔΕɺͲͪΒͷϞσϧ͕ͬͱ Β͍͔͠Θ͔Δ=ࣄޙΦοζ P(m = 1|D) P(m = 2|D)
= P(D|m = 1) P(D|m = 2) P(m = 1) P(m = 2) • P(m|D)ͷൺΛϕΠζϑΝΫλ(BF)ͱ͍͏ • ࣄޙΦοζ=BF * ࣄલ֬ͷൺ
10.2 2ͭͷίΠϯͷྫ • ίΠϯΛNճ͛ͨΒද͕zճग़ͨɻ2ͭͷͷͲͪΒ͔Βདྷ ͨίΠϯ͔? • ͦΕͧΕͷΛϞσϧͱΈͳͯ͠ɺϞσϧൺֱ͢Δ • fig 10.1ʹ͓͚Δӈͷਤ=͕ؔಉ͡Ͱ͋Δέʔεʹ૬
z θ1 θ1 ∼ Beta(ω = 0.25,κ = 12) θ2 m m ∼ Categorical(0.5,0.5) z ∼ Binomial(θm , N) θ2 ∼ Beta(ω = 0.75,κ = 12) N
P(m|D)ͷൺΛٻΊΔ: ղੳղ • ࣄલ͕Beta(a, b)Ͱ༩͑ΒΕΔͱ͖ɺP(z,N)ҎԼͷࣜ ʹͳΔ(6ষͰઆ໌ࡁΈ) • আࢉ࣌ΞϯμʔϑϩʔࢭͷͨΊʹlogΛऔΔͱ͍͍ • RʹϕʔλͷlogΛٻΊΔlbeta͕ؔ͋Δ
P(z, N) = B(z, a, N − z + b) B(a, b) = exp(log B(z + a, N − z + b) − logB(a, b))
P(m|D)ͷൺΛٻΊΔ: ղੳղ • ·ͱΊΔͱɺP(D|m)ҎԼͱͳΔ P(D|m) = P(z, N|m) = B(z,
am , N − z + bm ) B(am , bm ) am = ωm (κ − 2) + 1 bm = (1 − ωm )(κ − 2) + 1 ω1 = 0.25 ω2 = 0.75
P(m|D)ͷൺΛٻΊΔ: ղੳղ • P(D|m=1) ≒ 0.000499 • P(D|m=2) ≒ 0.002339
• BF = P(D|m=1)/P(D|m=2) ≒ 0.213 ͱͳΔ • P(m = 1) = P(m = 2) = 0.5 ͷͱ͖ɺ P(m = 1|D) P(m = 2|D) = P(D|m = 1) P(D|m = 2) = 0.213 P(m = 2|D) = 1 − P(m = 1|D)ΑΓ P(m = 1|D) 1 − P(m = 1|D) = 0.213 P(m = 1|D) = 0.176 P(m = 2|D) = 0.824
P(m|D)ͷൺΛٻΊΔ: άϦουۙࣅ • m{0, 1}ͷΛऔΔࢄύϥϝʔλ • ਤ͕ॻ͖ʹ͍͘ͷͰɺmͷ͔ΘΓʹωΛಋೖ • ω0.25ͱ0.75ʹϐʔΫΛ࣋ͭɻ֤Ϟσϧͷ࠷ස ω_{1,2}ʹରԠɻ
• ӈ্: ωͷɻ2ͭͷࢁ͕ಉ͡ߴ͞Ͱ͋Δ=2ͭͷ֬ • ࠨԼ: θͷपลɻϞσϧʹରԠͨ͠2ͭͷࢁ͕͋Δ • ӈԼ: ω={0.75,0.25}ʹ͓͚Δθͷ άϦουۙࣅ:
ࣄલ
• ӈ্ͷP(ω|D)ʹ͓͍ͯɺߴ͞ͷൺ5:1Ͱ͋Δ: P(m|D)ͷൺʹରԠ • ղੳղͰmͷΈʹ͕ͨ͠ɺࠓճͷۙࣅͰθͷ͕ՄࢹԽ͞Εͨ άϦουۙࣅ: ࣄޙ
10.3 MCMCΛ༻͍ͨղ๏ • ͦΕͧΕͷmʹ͍ͭͯP(D|m)Λܭࢉ͢Δํ๏ • Ϟσϧൺֱ༻ͷϞσϧΛϞσϦϯά͠ɺmͷࣄޙ ΛٻΊΔํ๏
10.3.1 MCMC: Ϟσϧ͝ͱ • ͦΕͧΕͷmʹ͍ͭͯɺP(D|m)Λܭࢉ͢Δ • JAGSͰθ_mΛαϯϓϦϯάͯ͠ɺ݁Ռʹରͯ͠Ή͔ͣ͠ ͍͚͍͞ΜΛ͢ΔͱP(D|m)ʹͳΔ
Ϟσϧ͝ͱͷपลܭࢉ • P(D)P(θ)͔ΒαϯϓϦϯάͨ͠θ_nΛͬͯɺΣP(D|θ) / N ͰۙࣅՄೳ͕ͩɺ࣮༻తͰͳ͍ • P(θ)֦ࢄ͍ͯ͠Δ • ΄ͱΜͲͷαϯϓϧʹஔ͍ͯɺP(D|θ)ඇৗʹখ͍͞
• ࣄޙP(θ|D)͔ΒαϯϓϦϯάͨ͠θΛͬͯP(D)Λಋ ग़͍ͨ͠
Ϟσϧ͝ͱͷपลܭࢉ P(θ|D) = P(D|θ)P(θ) P(D) 1 P(D) = P(θ|D) P(D|θ)P(θ)
ҙͷ֬h(θ)Λಋೖͯ͠ = P(θ|D) P(D|θ)P(θ) ∫ dθ′h(θ′) = ∫ dθ′ P(θ|D) P(D|θ)P(θ) h(θ′) ҙͷθʹ͍ͭͯɺ P(θ|D) P(D|θ)P(θ) ͷಉ͡ͳͷͰ = ∫ dθ′ P(θ′|D) P(D|θ′)P(θ′) h(θ′) ≈ N ∑ θi ∼P(θ|D) h(θi ) P(D|θi )P(θi )
Ϟσϧ͝ͱͷपลܭࢉ • h(θ)ͱͯ͠ҙͷ͕֬͑Δ͕ɺܭࢉͷ߹ ্ɺͱࣅͨܗঢ়Ͱ͋Δ͜ͱ͕·͍͠ • ෳࡶͳϞσϧʹ͓͍ͯɺͦͷΑ͏ͳhΛٻΊΔͷ͍͠ • 10.3.1.1ʹ͓͍ͯɺαϯϓϦϯάͨ͠θΛݩʹhͷܗঢ়Λ ܾΊ͍ͯΔ N
∑ θi ∼P(θ|D) h(θi ) P(D|θi )P(θi )
N 10.3.2 MCMC: ֊Ϟσϧ • ࠓճͷέʔεͰɺ֤Ϟσϧͷࣄલ͓Αͼ͕ಉؔ͡ ͰදͤΔ • θΛαϯϓϦϯά͢ΔࡍʹɺmΛߟྀͯ͠ωͷΛม͑ΕΑ͍ y
θ m ω1 = 0.25 ω2 = 0.75 m ∼ Categorial(0.5,0.5) θ ∼ Beta(ω = ωm , κ = 12) yi ∼ Bern(θ) 2 ω
MCMCͷ݁Ռ • ্͕ࣄલɺԼ͕ࣄޙ • mͷࣄޙɺଞͷख๏Ͱͷ݁ ՌͱҰக͍ͯ͠Δ • m=1ʹ͓͚Δθͷࣄޙɺα ϯϓϧશମͷ18%͔͠ΘΕͯ ͍ͳ͍͜ͱʹҙ
• m=2ʹ͓͚Δθͷࣄޙɺ Γ82%͕ΘΕ͍ͯΔ • ࢧ࣋͞Εͳ͔ͬͨϞσϧʹؔ͢Δ αϯϓϧগͳ͘ͳΔ
2 10.3.2.1 ͬͱҰൠతͳํ๏ • ͜ͷࣄྫͰɺͨ·ͨ·ࣄલ͕ؔશϞσϧͰಉ͡ • ҰൠతʹɺҟͳΔؔΛ͍͍ͨ • ͷͰɺ͚ͯهड़͢Δͱ͜͏ͳΔ •
આ໌ͷ߹্ɺࣄલͷύϥϝʔλલͷྫͱҧ͍ͬͯΔ N y θ m ω1 = 0.10 ω2 = 0.90 m ∼ Categorial(0.5,0.5) θ1 ∼ Beta(ω = ω1 , κ = 20) θ2 ∼ Beta(ω = ω2 , κ = 20) yi ∼ Bern(θm ) ω
݁Ռ • ਤ10.5ࢀর • ҰԠαϯϓϦϯάͰ͖͍ͯΔ͕…… • ESS(༗ޮαϯϓϧαΠζ)<500 • mͷࣗݾ૬͕ؔҟৗʹߴ͍
ࣗݾ૬ؔͷߴ͞ • θ1(m=2)͓Αͼθ2(m=1)ࣄલͷΈʹै͏ͷʹରͯ͠ɺθ1(m=1) ͓Αͼθ2(m=2)ࣄલٴͼyʹӨڹΛड͚Δ • ͜ͷҧ͍͕mͷαϯϓϦϯάʹѱӨڹΛٴ΅͢ θ1(m=1) θ1(m=2) θ2(m=1) θ2(m=2)
mʹΑΔθͷมԽ • JAGSgibbs sampling͍ͯ͠ΔͷͰɺύϥϝʔλΛҰݸ ͣͭαϯϓϦϯά͍ͯ͘͠ θ(1) 1 ∼ P(θ1 |θ(0)
2 , m(0), D) θ(1) 2 ∼ P(θ2 |θ(1) 1 , m(0), D) m(1) ∼ P(m|θ(1) 1 , θ(1) 2 , D) θ(2) 1 ∼ P(θ1 |θ(1) 2 , m(1), D) θ(2) 2 ∼ P(θ2 |θ(2) 1 , m(1), D) m(2) ∼ P(m|θ(2) 1 , θ(2) 2 , D) ⋯
αϯϓϦϯάաఔ P(θ1 , θ2 , m|D) = { P1 (D|θ1
)P1 (θ1 )P2 (θ2 )P(m = 1) if m = 1 P2 (D|θ2 )P1 (θ1 )P2 (θ2 )P(m = 2) if m = 2 m(1) = 1 θ(1) 1 ∼ P(θ1 |θ(0) 2 , m = 1,D) = P(θ1 , θ(0) 2 , m = 1|D) P(θ(0) 2 , m = 1|D) P(θ(0) 2 , m = 1|D) = P2 (θ(0) 2 )P(m = 1) ∫ dθ1 P1 (D|θ1 )P1 (θ1 )ΑΓ = P1 (D|θ1 )P1 (θ1 ) ∫ dθ1 P1 (D|θ1 )P1 (θ1 )
αϯϓϦϯάաఔ θ(1) 2 ∼ P(θ2 |θ(1) 1 , m =
1,D) = P(θ(1) 1 , θ2 , m = 1|D) P(θ(1) 1 , m = 1|D) P(θ(0) 1 , m = 1|D) = P1 (D|θ(1) 1 )P1 (θ(1) 1 )P(m = 1) ∫ dθ2 P2 (θ2 )ΑΓ = P2 (θ2 ) P(θ1 , θ2 , m|D) = { P1 (D|θ1 )P1 (θ1 )P2 (θ2 )P(m = 1) if m = 1 P2 (D|θ2 )P1 (θ1 )P2 (θ2 )P(m = 2) if m = 2
αϯϓϦϯάաఔ m(2) ∼ P(m|θ(1) 1 , θ(1) 2 , D)
= P(θ(1) 1 , θ(1) 2 , m|D) P(θ(1) 1 , θ(1) 2 |D) P(θ1 , θ2 , m|D) = P(D|θ1 , θ2 , m) P(θ1 , θ2 , m) P(D|θ1 , θ2 , m) = { P1 (D|θ1 )P1 (θ1 )P2 (θ2 )P(m = 1) if m = 1 P2 (D|θ2 )P1 (θ1 )P2 (θ2 )P(m = 2) if m = 2 P(θ1 , θ2 , m) = P1 (θ1 )P2 (θ2 )P(m) = { P(D|θ1 ) if m = 1 P(D|θ2 ) if m = 2
αϯϓϦϯάաఔ • ࣍ͷm͕{1,2}ͷͲͪΒʹͳΔ͔ɺP(D|θ1)/P(D|θ2)ͷൺͰܾ·Δ • θ1ͷ΄͏P(D|θ1)P(θ1)͔Βੜ͞Ε͍ͯΔˠP(D|θ1)͕େʹͳΔ ͕֬ߴ͍ • θ2P(θ2)͔Βੜ͞Ε͍ͯΔˠP(D|θ2)খʹͳΔͩΖ͏ • ݁Ռͱͯ͠ɺm1ʹཹ·Δ͕֬ߴ͍
m(1) = 1 θ(1) 1 ∼ P(θ1 |m = 1,D) ∝ P1 (D|θ1 )P1 (θ1 ) θ(1) 2 ∼ P1 (θ2 ) m(2) ∼ P(m|θ(1) 1 , θ(1) 2 , D) = { P(D|θ1 ) if m = 1 P(D|θ2 ) if m = 2
ٙࣅࣄલʹΑΔ αϯϓϦϯάվળ • : θͷmͷʹΑΒͣҰఆͰ͋ͬͯ΄͍͠ • ղܾ: P(θ_i|m=i)ʹ͍ۙΛ༻ҙͯ͠ɺθ_i(i≠m)ʹ͍ͭͯ ͦͷ͔ΒαϯϓϦϯά͢Δ
ٙࣅࣄલͷར༻ • ٙࣅࣄલΛΘͳ͍ϞσϧΛࣄલʹ࣮ߦ͓͖ͯ͠ɺٙࣅࣄલ ͷύϥϝʔλΛಘΔ • બΕͨϞσϧͷθී௨ʹαϯϓϦϯά͢Δ͕ɺબΕͳ͔ͬͨํ ٙࣅࣄલ͔ΒαϯϓϦϯά͢Δ ωi,j , κi,j
= { true prior if i = j pseudo prior if i ≠ j m ∼ Categorial(0.5,0.5) θ1 ∼ Beta(ω = ω1,m , κ = κ1,m ) θ2 ∼ Beta(ω = ω2,m , κ = κ2,m ) yi ∼ Bern(θm ) 2 2 N y θ m ω
݁Ռ • θͷm͕มΘͬ ͍͍ͯͩͨಉ͡ܗঢ় • mͷࣗݾ૬͕ؔେ෯ʹ Լ͕ΓɺESS=10000
ࢧ࣋͞Εͳ͍Ϟσϧͷαϯϓ ϧ͕গͳ͍ • mͷࣄޙʹ͓͍ͯɺϞσϧ1͕બΕΔͷ8% • ͭ·ΓϞσϧ1ͷύϥϝʔλͰ͋Δθ1ͷαϯϓϧ͕શମ ͷ8% • αϯϓϧΛ૿ͨ͢ΊʹɺνΣʔϯͷ͞Λ૿͢ (ܭࢉ࣌ؒʹѱӨڹ)΄͔ʹɺϞσϧ͕ΑΓฏʹબΕΔ
Α͏P(m)Λௐ͢Δ(m=1ʹόΠΞεΛֻ͚Δ)ํ๏͕͋Δ • P(m)Λ͍ͬͯ͡γϛϡϨʔγϣϯͨ͠߹Ͱɺฏͳ ࣄલʹ͓͚ΔࣄޙΦοζΛٻΊΒΕΔ BF = P(m = 1|D) P(m = 2|D) P(m = 2) P(m = 1)
10.3.3 Ϟσϧ͝ͱʹҟͳΔ ؔͷར༻ • P(D|θ)Λnoise distributionͱ͍͏ͦ͏Ͱ͢ • Ϟσϧ͝ͱʹҟͳΔP(D|θ)Λ͍͍ͨͱ͖ɺ8.6.1Ͱհ͠ ͨςΫχοΫ͕͑Δ •
spy = if m = 1 then PDF(D|θ1) else PDF(D|θ2) / C • 1 ~ Bern(spy) • Ϟσϧͷಉ࣌֬ʹspyΛ͡Δ͜ͱʹͳΔ • C(େ͖Ίͷఆ)Ͱׂ͍ͬͯΔͷspy͕1Λ͑ͳ͍Α͏ʹ • ૬ରతͳ͕ॏཁͳͷͰɺspyͷ۩ମతͳؔͳ͍ • STANͩͱͬͱײతʹॻ͚ͨؾ͕͢Δ(increment_log_prob ؔͰϞσϧͷ֬ΛՃࢉͰ͖Δ)
10.4: Ϟσϧฏۉ • P(y)Λ༧ଌ͍ͨ͠ • Ϟσϧൺֱͷ݁ՌϞσϧb͕উ͍ͬͯͨͳΒɺͦͷϞσϧͰ༧ ଌ͢Δ͜ͱ͕Ͱ͖Δ P( ̂ y|D,
m = b) = ∫ dθb Pb ( ̂ y|θb , m = b)Pb (θb |D, m = b) • Ϟσϧ͝ͱʹ֬৴ׂ͕ΓͯΒΕ͍ͯΔͷͰɺͦͷॏΈ ΛͬͯશϞσϧͷฏۉΛऔΔ͜ͱ͕Ͱ͖Δ P( ̂ y|D) = ∑ m ∫ dθm Pm ( ̂ y|θm , m)Pm (θm |D, m)P(m|D)
10.5: Ϟσϧͷෳࡶ • ࣄલʹ͓͍ͯɺύϥϝʔλͷऔΓ͏Δൣғ͕͍Ϟσ ϧΛʮෳࡶʯͳϞσϧͱݴ͍ͬͯΔͬΆ͍ • ୯ʹύϥϝʔλ͕ଟ͍Ϟσϧͱ͍͏ҙຯͰͳ͍(ҎԼ ͷྫͰɺύϥϝʔλಉ͡) • ҰൠతʹɺෳࡶͳϞσϧͷ΄͏͕σʔλͷద߹༗ར
• ͍ύϥϝʔλൣғͷϞσϧͷ΄͏͕ɺσʔλʹద߹ ͢ΔύϥϝʔλͷΈ߹ΘͤΛؚΉՄೳੑ͕ߴ͍ͷͰ • ͔͠͠աద߹ආ͚͍ͨ
Ϟσϧൺֱͱෳࡶ͞ • ෳࡶͳϞσϧɺࣄલ͕શମʹബ͘ࢄΒ͍ͬͯΔ • ՄೳͳύϥϝʔλͷΈ߹Θ͕ͤଟ͍=Ұݸ͋ͨΓͷ֬ ͕͍ • ୯७ͳϞσϧɺࣄલ͕ް͍ • ϕΠζϞσϧൺֱʹ͓͍ͯɺࣄલͷް͕͞ࣄޙ֬
ʹӨڹΛ༩͑Δ
Ϟσϧൺֱͱෳࡶ͞ • ίΠϯ͛ͷϞσϧ: θ ~ Beta(a, b) Λߟ͑Δ • 1.
ϑΣΞͩΖ͏Ϟσϧ: (a,b) = (500, 500) • 2. ͯ͢ى͜Γ͏ΔϞσϧ: (a, b) = (1, 1) • 20ճத15ճද͕ग़ͨέʔεͰɺϞσϧ2͕উͭ • 20ճத11ճද͕ग़ͨΒϞσϧ1͕উͭ • ࣄલͷް͍෦Ͱσʔλʹద߹Ͱ͖͔͕ܾͨΊख
10.5.1 Ϟσϧൺֱͷҙ • ͋ΔϞσϧ(full modelͱݺͿ)ʹରͯ͠ɺύϥϝʔλͷൣғ ʹ੍ΛՃ͑ͨϞσϧΛߟ͑Δ͜ͱ͕Ͱ͖Δ • ύϥϝʔλaͷbͱಉ͡ɺͳͲ • full
modelͷ΄͏͕ෳࡶͳͷͰɺ੍ݶϞσϧ͕ಉ͘͡Β͍ Α͘σʔλΛදݱͰ͖ΔͳΒɺϕΠδΞϯϞσϧൺֱͰ ੍ݶϞσϧ͕બΕΔͩΖ͏ • 9ষͷٿબखϞσϧʹ͓͍ͯɺखͷೳྗͯ͢ಉ ͡Ͱ͋Δͱ͍͏੍ݶΛ͔͚ͨϞσϧ͕ߟ͑ΒΕΔ
Ϟσϧൺֱͷҙ • ߟ͑ΒΕΔ੍Λશ෦ࢼͦ͏ͱ͢ΔͷΊͨ΄͏͕͍ ͍ • 9ύϥϝʔλʹಉ੍Λֻ͚Δ߹ɺΈ߹Θͤ 21147௨Γ • ੍Λ͔͚Δͱ͍͏͜ͱɺಛఆͷύϥϝʔλͷΈ ߹Θͤʹ͍ͭͯࣄલΛ0ʹ͢Δͱ͍͏͜ͱ
• ͨͱ͑ϞσϧൺֱͰউͭͱͯ͠ɺ·͘͠ͳ͍͔ ͠Εͳ͍
10.6 ࣄલʹහײ • ϕΠζϑΝΫλʔ∫dθ P(D|θ)P(θ) Λ͍ͬͯΔͷͰɺࣄ લʹහײ • ྫ: ࢠଆͷϞσϧͷࣄલΛBeta(1,1)͔Β
Beta(0.01,0.01)ʹͨ͠ΒɺBF͕0.12͔Β5.72ʹ • Ϟσϧͷ95% HDIࣄલͷӨڹΛ΄΅ड͚ͳ͍ • ॆͳྔͷσʔλ͕͋ΔͳΒɺϕΠζਪఆϞσϧൺֱͱ ҧͬͯࣄલͷӨڹΛड͚ʹ͍͘
10.6.1 ֤Ϟσϧͷࣄલʹ ฏʹใΛ༩͑Δ͖ • ࣄલͷҧ͍͕BFʹӨڹΛ༩͑ΔɻͲ͏͖͔͢ • σʔλʹج͍ͮͯࣄલΛܾఆ͢Δ • ֤ϞσϧͰɺಉ͡σʔλʹج͍ܾͮͯΊΔ •
ྫ: 100ճத65ճද͕ग़ͨίΠϯ͛ • σʔλͷ10%(10ճத6ճද)ΛͬͯࣄલΛิਖ਼ • Beta(1, 1) → Beta(1+6, 1+4) • BF͕҆ఆ͢Δ