Upgrade to Pro
— share decks privately, control downloads, hide ads and more …
Speaker Deck
Features
Speaker Deck
PRO
Sign in
Sign up for free
Search
Search
セミパラメトリック推論の基礎の復習
Search
Sponsored
·
Your Podcast. Everywhere. Effortlessly.
Share. Educate. Inspire. Entertain. You do you. We'll handle the rest.
→
Daisuke Yoneoka
November 14, 2023
Research
0
120
セミパラメトリック推論の基礎の復習
Daisuke Yoneoka
November 14, 2023
Tweet
Share
More Decks by Daisuke Yoneoka
See All by Daisuke Yoneoka
感染症の数理モデル15
kingqwert
0
36
感染症の数理モデル14
kingqwert
0
120
感染症の数理モデル13
kingqwert
0
46
感染症の数理モデル12
kingqwert
0
120
感染症の数理モデル11
kingqwert
0
120
感染症の数理セミナー_10_.pdf
kingqwert
0
140
感染症の数理モデル9
kingqwert
0
110
感染症の数理モデル8
kingqwert
0
120
感染症の数理モデル7
kingqwert
0
120
Other Decks in Research
See All in Research
Ankylosing Spondylitis
ankh2054
0
120
An Open and Reproducible Deep Research Agent for Long-Form Question Answering
ikuyamada
0
280
生成的情報検索時代におけるAI利用と認知バイアス
trycycle
PRO
0
300
その推薦システムの評価指標、ユーザーの感覚とズレてるかも
kuri8ive
1
320
地域丸ごとデイサービス「Go トレ」の紹介
smartfukushilab1
0
930
Community Driveプロジェクト(CDPJ)の中間報告
smartfukushilab1
0
170
自動運転におけるデータ駆動型AIに対する安全性の考え方 / Safety Engineering for Data-Driven AI in Autonomous Driving Systems
ishikawafyu
0
130
離散凸解析に基づく予測付き離散最適化手法 (IBIS '25)
taihei_oki
PRO
1
690
データサイエンティストをめぐる環境の違い2025年版〈一般ビジネスパーソン調査の国際比較〉
datascientistsociety
PRO
0
720
svc-hook: hooking system calls on ARM64 by binary rewriting
retrage
1
110
When Learned Data Structures Meet Computer Vision
matsui_528
1
2.9k
Collective Predictive Coding and World Models in LLMs: A System 0/1/2/3 Perspective on Hierarchical Physical AI (IEEE SII 2026 Plenary Talk)
tanichu
1
250
Featured
See All Featured
Improving Core Web Vitals using Speculation Rules API
sergeychernyshev
21
1.4k
<Decoding/> the Language of Devs - We Love SEO 2024
nikkihalliwell
1
130
Data-driven link building: lessons from a $708K investment (BrightonSEO talk)
szymonslowik
1
920
Ruling the World: When Life Gets Gamed
codingconduct
0
150
Stewardship and Sustainability of Urban and Community Forests
pwiseman
0
110
Put a Button on it: Removing Barriers to Going Fast.
kastner
60
4.2k
GraphQLとの向き合い方2022年版
quramy
50
14k
Mozcon NYC 2025: Stop Losing SEO Traffic
samtorres
0
150
Google's AI Overviews - The New Search
badams
0
910
Marketing Yourself as an Engineer | Alaka | Gurzu
gurzu
0
130
Become a Pro
speakerdeck
PRO
31
5.8k
Chasing Engaging Ingredients in Design
codingconduct
0
120
Transcript
ηϛύϥϝτϦοΫਪͷجૅͷ෮श Daisuke Yoneoka September 29, 2014
Notations جຊతʹ Tsiatis,2006 ʹै͏. Θ͔Μͳ͔ͬͨΒࣗͰௐͯͶ! ϕΫτϧߦྻଠࣈʹͯ͠ͳ͍͚Ͳ, ͦࣗ͜Ͱิ͍ͬͯͩ͘͞. σʔλ i.i.d Ͱ
Zi = (Zi1, . . . , Zim) ∈ Rm αϯϓϧαΠζ n ਓ. i.e., Z1, . . . , Zn φ(Z) Өڹؔ u(Zi, θ) ਪఆؔ Լ͖ࣈͷ eff (ۙ) ༗ޮ (efficient) ͱ͍͏ҙຯ
ηϛύϥϝτϦοΫਪͱʁ Zi ͷີ͕ؔηϛύϥϝτϦοΫϞσϧʹै͏ͱ S = {p(z : θ, η)|θ ∈
Θ ⊂ Rr, η ∈ H} θ ༗ݶ࣍ݩͷڵຯ͋ΔύϥϝλͰ, η ແݶ࣍ݩͷͲ͏Ͱ͍͍ύ ϥϝλ (ہ֎ (nuisance) ύϥϝʔλʔ). ηϛύϥϝτϦοΫਪ: ͜ͷͱͰ θ ͷ࠷ྑͷਪఆྔ (RAL ਪఆ ྔ) ΛͱΊΔ͜ͱ
Өڹؔ θ ͳΜͰ͍͍͔Β࠷ྑΛݟ͚ͭΔͱ͍͏ͷແཧήʔ → Ϋϥε Λݶఆͯͦ͜͠Ͱݟ͚ͭΔ! (౷ܭͰΑ͘ΔΑͶ) Өڹؔ: ਪఆྔ ˆ
θ ͷӨڹؔͱ, (Ϟʔϝϯτʹ੍͕͋Δ) √ n(ˆ θ − θ) = 1 √ n n i=1 φ(Zi, θ, η) + op(1) Λຬͨ͢ϕΫτϧؔ. ˆ θ ۙઢܗਪఆྔͱݺͼ n → ∞ ͰҰகੑ ͱۙਖ਼نੑ͕͋Δ √ n(ˆ θ − θ) → N 0, E[φ(Zi, θ, η)φ(Zi, θ, η)T ] Πϝʔδతʹ͋Δσʔλ͕ͲΕ͚ͩਪఆʹӨڹΛ༩͍͑ͯΔ͔Λ දݱͨ͠ͷ
ਪఆؔͱ M ਪఆ ਪఆํఔࣜ n i=1 u(Zi, θ) ਪఆؔ =
0 ͷղͱͯ͠ಘΒΕΔͷΛ M ਪఆྔ ͱݺͿ. Α͘ݟΔ score ؔͳΜ͔ίϨ. ͨͩ͠, E[φ(Zi, θ)] = 0 ظ 0 , E[∥φ(Zi, θ)∥2] < ∞ ࢄతͳͷൃࢄ͠ͳ͍ . ͋ͱ͏গ͚ͩ݅͋͠Δ. Ұகੑͱۙਖ਼نੑΛ࣋ͭ √ n(ˆ θ − θ) = 1 √ n n i=1 E[ ∂u(Zi, θ) ∂θ ] −1 u(Zi, θ) ͕͜͜Өڹؔʹͳ͍ͬͯΔ +op(1) → N 0, E[ ∂u(Zi, θ) ∂θ ] −1 E[u(Zi, θ)u(Zi, θ)T ] E[ ∂u(Zi, θ) ∂θ ] −T ] ͜ͷۙࢄͷਪఆྔΛαϯυΠονਪఆྔͱݺΜͩΓ͢Δ
RAL ਪఆྔ ۙઢܥਪఆྔͳΜ͔ྑͦ͞͏ʂͰ super efficiency ͷ (Hodges) ͕Δʂ Super efficiency:
ۙతʹ Cramer-Rao ͷԼݶΑΓྑ͍ͷ͕Ͱ͖ Δͷ͜ͱ ͜ͷΛղܾͨ͠ͷ͕ RAL (Regular asymptotic linear) ਪఆྔ. ͦͷਖ਼ଇ݅ۃݶ͕ LDGP (local data generating process) ʹґ ଘ͠ͳ͍͜ͱ (ৄ͘͠ Tsiatis, 2006) ηϛύϥਪ͜ͷ RAL ਪఆྔͷӨڹؔΛٻΊΔ͜ͱΛߟ͑Δ
Parametric submodel ηϛύϥϝτϦοΫϞσϧ S ͷ֤ʹର͠ p(z; θ, η) ∈ Ssub
⊂ S Λຬͨ͢ύϥϝτϦοΫϞσϧ Ssub = {p(z; θ, γ)|θ ∈ Θ ⊂ Rr, γ ∈ Γ ⊂ Rs, s ∈ N} ΛύϥϝτϦοΫαϒϞσϧͱݺͿ.
Nuisance tangent space (ہ֎ۭؒ) ηϛύϥϝτϦοΫϞσϧ S ͷ֤ʹର͠, ύϥϝτϦοΫαϒϞσϧ Ssub ͷہ֎ۭؒΛ
TN θ,γ (Ssub) = {BT sγ(z, θ, γ)|B ∈ Rs} ͱ͢Δ. γ p(z; θ, η) ʹରԠ͢ΔͷͰ sγ(z, θ, γ) = ∂ ∂γ log p(z; θ, γ) Ͱ ද͞ΕΔ nuisance score ؔ. ͜ͷઢܗۭؒ͜ͷ nuisance score vector ʹ ΑͬͯுΒΕ͍ͯΔ. ͜ͷͱ͖ TN θ,η (S) = Ssub TN θ,γ (Ssub) Λ S ্ͷ p(z; θ, η) ʹ͓͚Δہ֎ۭؒͱΑͿ. ͪͳΈʹ, ଆͷू ߹ʹؔͯ͠ closure ΛͱΔԋࢉࢠ. Note:͜ͷۭؒେͰޙʹ, RAL ਪఆྔͷӨڹؔ͜ͷۭؒʹަۭͨؒ͠ʹ ଐ͢Δ͜ͱ͕ॏཁʹͳͬͯ͘Δʂ
ઢܗ෦ۭؒͷࣹӨͷزԿͱϐλΰϥεͷఆཧ
RAL ਪఆྔͷӨڹؔͷॏཁͳఆཧ ηϛύϥϝτϦοΫ RAL ਪఆྔ β ͷӨڹؔ φ(Z) ҎԼͷ݅Λຬ ͢Δ.
Corollary1 E[φ(Z)sβ] = E[φ(Z)sT efficient (Z, β0, η0)] = I. ͨͩ͠, s είΞؔͰ, sT efficient ༗ޮείΞؔ Corollary2 φ(Z) ہ֎ۭؒʹަ͍ͯ͠Δ. ༗ޮӨڹ্ؔͷ 2 ͭͷ݅Λຬͨ͠, ͦͷࢄߦྻ, ޮݶքΛୡ ͦ͠Ε φeffi(Z, β0, η0) = E[seff (Z, β0, η0)sT eff (Z, β0, η0)] −1 seff (Z, β0, η0)
ηϛύϥۭؒͷఆཧ ύϥϝτϦοΫαϒϞσϧͷ߹ͷ RAL ਪఆྔͷӨڹؔͱۭؒͱͷؔ Tsiatis, 2006 ͷ Ch4.3 ͋ͨΓΛݟͯͶʂ ఆཧ
1 RAL ਪఆྔͷӨڹؔ {φ(Z) + TN θ,η (S)⊥} ͱ͍͏ۭؒʹؚ·ΕΔ. ͨͩ͠, φ(Z) ҙͷ RAL ਪఆྔͷӨڹؔͰ, TN θ,η (S)⊥ ηϛύϥϝτϦο Ϋۭؒͷަิۭؒ ఆཧ 2 ηϛύϥϝτϦοΫ༗ޮͳਪఆྔ, ͦͷӨڹ͕ؔҰҙʹ well-defined Ͱܾఆ͞ Ε,φefficient = φ(Z) − {φ(Z)|TN θ,η (S)⊥} ͷཁૉ. ͪͳΈʹ, (h|U) projection of h ∈ H(ੵΛಋೖͨ͠ώϧϕϧτۭؒ) onto the space U (ઢܗۭؒ)
GEE ʹ͍ͭͯͷ Remarks Liang-Zeger ͷ GEE ͷηϛύϥϝτϦοΫϞσϧ (੍ϞʔϝϯτϞσϧ: 1 ࣍ͱ
2 ࣍ͷϞʔϝϯτʹ੍͚ͩΛஔ͍ͨϞσϧ) ҎԼͷಛΛͭ. ہॴ (ۙ༗) ޮਪఆྔ: ࢄؔͷԾఆ͕ਖ਼͚͠Ε, ༗ޮਪఆྔ Robustness: ແݶ࣍ݩͷύϥϝʔλਪఆ͕ඞཁ͕ͩ, ࢄؔΛ misspecify ͨ͠ͱͯ͠Ұகੑͱۙਖ਼نੑอ࣋ GEE ͷຊΛಡΊΘ͔Δ͚Ͳ, Working covariance matrix Λؒҧ͑ͯ ༗ޮੑࣦΘΕΔ͕, ͦͷଞͷ·͍͠ੑ࣭ (ۙਖ਼نੑͱҰகੑ) อ࣋Ͱ͖Δͬͯ͜ͱ