Share
Embed
Confounding (Causal inference: What if, Chapter 7)
Keywords: 因果推論, Confounding(交絡), Confounder(交絡因子)Exchangeability(交換可能性), Backdoor criterion(バックドア基準), Single-world intervention graphs(SWIG)
Shuntaro Sato
November 18, 2020
Transcript
53 slides
-
࣍ 7.1 The structure of confounding 7.2 Confounding and exchangeability
7.3 Confounding and the backdoor criterion 7.4 Confounding and confounders 7.5 Single-world intervention graphs 7.6 Confounding adjustment Technical Points & Fine Points 2 -
͡Ίʹ • ؍ݚڀͰ treatment ͱ outcome ͷํʹӨڹΛ༩͑ ΔҼࢠ͕͠͠ଘࡏ͢Δ • ͜ͷ࣌ަབྷ
(confounding) ͕͋Δͱݴ͍ɺexchangeability ͕Γཱͨͳ͘ͳΔ • ຊষͰަབྷͷఆٛͱͦΕΛௐ͢Δํ๏Λѻ͏ 3 -
ަབྷͷఆٛ ަབྷͷఆٛ Treatment A ͱ outcome Y ͕ڞ௨ͷݪҼΛ࣋ͭ͜ͱʹΑͬͯ ੜ͡ΔόΠΞεΛɺA ͷ
Y ͷޮՌʹ͓͚Δަབྷ (confounding) ͱݺͿ A Y L Figure 7.1 ڞ௨ͷݪҼ L ͕ଘࡏ͢Δͱɺ association causation 4 -
ަབྷͷྫ: healthy worker bias A Y L Figure 7.1 A:
ফ࢜ͱͯ͠ಇ͘ Y: ࢮ L: ݈߁Ͱ͋Δ 5 -
ަབྷͷྫ: confounding by indication/channeling A Y L Figure 7.1 A
Y L U Figure 7.2 A: ༀͷ༻ Y: ڵຯͷ͋Δ࣬ױ L: A ͕༻͞Ε͍͢පଶ U:Y ͱ L ΛͱʹҾ͖ى͜͢Ҽࢠ ಉछͷༀͷதͰɺױऀݻ༗ͷϦεΫҼࢠ L ʹΑͬͯҩࢣ͕ༀ A Λ͏͕͋Δ߹ɺಛʹ channeling ͱݺͿ͜ͱ͕ଟ͍ɻ 6 -
ަབྷͷྫ: reverse causation A Y L U Figure 7.3 A:
ӡಈ Y: ڵຯͷ͋Δ࣬ױ U: ແީੑͷ࣬ױ L: U ʹΑͬͯੜ͡ΔҼࢠ L ͕ະͩͱɺY ΛҾ͖ى͜͢Α͏ͳ U ʹΑͬͯӡಈෆ͕ ੜ͍ͯ͡ΔͷʹؔΘΒͣɺӡಈෆʹΑͬͯ Y ͕Ҿ͖ى͜ ͞Ε͍ͯΔ͔ͷΑ͏ʹஅ͞Ε͍͢ɻ 7 -
ަབྷͷྫ: linkage disequilibrium A Y L U Figure 7.3 A:
DNA ྻ Y: ԿΒ͔ͷੑ࣭ L: A ͱϦϯΫ͍ͯ͠Δ DNA ྻ U: ຽͳͲɺA ͱ L ΛϦϯΫͤ͞ ΔཁҼ ෳͷຽΛؚΉूஂͰݚڀΛߦ͏߹ʹɺಛʹ population stratification ͱݺͿ͜ͱ͕ଟ͍ɻ 8 -
ຊষʹ͓͚ΔԾఆ ຊষʹ͓͍ͯҎԼΛԾఆ͢Δɻ • σʔλରूஂ͔Βແ࡞ҝʹநग़͞Ε͍ͯΔ (selection node ͕ͳ͍) • ҼՌ DAG
ͷͯ͢ͷ node શʹଌఆ͞Ε͍ͯΔ • Random variability ͕ଘࡏ͠ͳ͍ ্ه 3 ͦΕͧΕɺ8 ষɺ9 ষɺ10 ষͰѻ͏ɻ 9 -
ҼՌޮՌͷࣝผ ؍ݚڀ͔ΒҼՌޮՌΛࣝผ͢ΔͨΊͷ 3 ͕݅ • Consistency • Postivity • Exchangeablity
Ͱ͋ͬͨɻ͜͜Ͱ consistency ͱ positivity Γཱͭͷ ͱͯ͠Ծఆ͢Δɻަབྷ͕͋ͬͯ Conditional exchangeability: Ya A | L ͕ΓཱͯɺҼՌޮՌΛࣝผͰ͖Δɻ 10 -
Conditional exchangeability Γཱͭͷ͔ʁ Conditional exchangeablitiy ͕ΓཱͭΑ͏ͳڞมྔ L ͷू߹ ͕͋Δ͔Ͳ͏͔ఆͰ͖Δͷ͔ʁ ↓
• σʔλΛੜΈग़ͨ͠ਅͷҼՌ DAG ͕Θ͔Εɺ ͜ͷ ͍ʹ͑ΒΕΔ • ͑Δํ๏ backdoor ج४ͱ SWIG ͷ 2 ͕ͭ͋Δ 11 -
Backdoor path Path ಉ͡ node Λ௨Βͳ͍Α͏ʹ edge Λͭͳ͍ͰͰ͖Δϧʔτ Causal path
Causal path: arrow ͷ͖͕ͯ͢ಉ͡Ͱ͋Δ path Noncausal path: arrow ͷ͖͕Ұக͍ͯ͠ͳ͍ path Backdoor path Treatment ͱ outcome Λ݁Ϳ non causal path ͷ͏ͪɺ treatment ʹྲྀΕࠐΉ͖ͷͷ A Y 12 -
Open backdoor path Selection node ͕ͳ͍ͱ͍͏ԾఆͷԼɺopen backdoor path •
Treatment ͱ outcome Λ݁Ϳ • Treatment ʹྲྀΕࠐΉ (← Ͱελʔτ) • Arrow ͷ͖͕Ұக͍ͯ͠ͳ͍ (͖͕ 1 ճҎ্มΘΔ) • Collider ͕ͳ͍ (→ ͔Β͖͕มΘΒͳ͍) ͱͳΔ path Ͱ͋Γɺڞ௨ͷݪҼͷଘࡏΛҙຯ͢Δɻ A Y A ͱ Y Λ݁Ϳ open path causal path ͔ open backdoor path ͷ͍ͣΕ͔Ͱ͋Δɻ 13 -
Backdoor ج४ Backdoor ج४ ڞมྔͷू߹ L ҎԼͷ݅Λຬͨ͢ͱ͖ɺbackdoor ج ४Λຬͨ͢ɺͱݴ͏ɻ •
L Ͱ͚݅Δ͜ͱͰͯ͢ͷ backdoor path ͕ด͡Δ • L ͷதʹɺA ͷ descendant ؚ͕·Εͳ͍ Conditional exchangeablity ⇐⇒ backdoor ج४ Failthfulness ͱ Technical Pont 7.1 Ͱٞ͢Δ݅ͷԼͰ Ya A | L ⇐⇒ L ͕ backdoor ج४Λຬͨ͢ 14 -
Backdoor ج४Λຬͨ͢ 2 ͭͷঢ়گ ަབྷ͕ͳ͍ (no confounding) ަབྷ͕ͳ͍߹ɺͱͱ open backdoor
path ͕ଘࡏ͠ͳ ͍ɻMarginal exchangeability Ya A ͕Γཱͭɻ ະଌఆͷަབྷ͕ͳ͍ (no unmeasured confounding) ަབྷ͕͋Δ͕ɺL(ଌఆ͞Ε͍ͯͯɺA ͷ descendant Λؚ· ͳ͍) Ͱ͚݅Δ͜ͱͰͯ͢ͷ backdoor path Λด͡Δ ͜ͱ͕Ͱ͖Δ߹ɺconditional exchangeability Ya A | L ͕ ΓཱͭɻL ͷ͜ͱΛ sufficient set for confounding adjustment ͱݺͿɻ 15 -
ަབྷͷ͖ͱڧ͞ • Backdoor ج४ަབྷͷ͖ڧ͞ʹؔͯ͠ԿޠΒ ͳ͍ • ະଌఆͷަབྷͷ”all or nothing” Ͱͳ͍ͷͰɺ༧
͞ΕΔ͖ڧ͞Λߟ͑Δ͜ͱ͕ॏཁͰ͋Δ (Fine Point 7.1) 16 -
ަབྷ͕͋Δ͕ɺYa A | L ͕Γཱͭ߹ A Y L Figure 7.1
A Y L U Figure 7.2 A Y L U Figure 7.3 ͍ͣΕͷ߹ • ަབྷ͕ଘࡏ͢Δ • L Ͱ͚݅Δ͜ͱͰͯ͢ ͷ backdoor path ͕ด͡Δ ͨΊ Ya A | L ͕Γཱͪɺະଌ ఆͷަབྷͳ͍ɻ 17 -
ަབྷͳ͍͕ɺYa A | L ͕Γཱͨͳ͍߹ A Y L U2 U1
Figure 7.4 A Y L U2 U1 Figure 7.4’ ͜ͷ߹ • ަབྷͳ͍ • Backdoor path ͋Δ͕ collider L ʹΑΓด͍ͯ͡Δ Ͱ͋ΓɺYa A ٯʹ L Ͱ͚݅ͮΔͱ • Backdoor path ͕։͘ ͷͰ Ya A | L Γཱͨͳ͍ (selection bias)ɻ 18 -
ަབྷ͕͋ΓɺYa A | L Γཱͨͳ͍߹ A Y L U2 U1
Figure 7.5 A Y L U2 U1 L1 L2 Figure 7.6 Figure 7.5 • ަབྷ͋Γ (U1 ͕ڞ௨ͷݪҼ) • L Ͱ͚݅ͮΔͱ৽ͨͳ backdoor path ͕։͘ ͱͳΔͷͰɺYa A Ya A | L ཱ͠ͳ͍ɻ Figure 7.6 ͷΑ͏ʹ L1 L2 ͕ଌ ఆͰ͖ΕɺL1 ͘͠ L2 ɾL Ͱ ͚݅ͮΔ͜ͱͰͯ͢ͷ backdoor path ͕ด͡Δɻ 19 -
ަབྷͷ 2 ͭͷఆٛ ަབྷͷఆٛ 1 (structural definition) A ͱ Y
͕ڞ௨ͷݪҼΛ࣋ͭ͜ͱʹΑͬͯੜ͡ΔόΠΞε ަབྷͷఆٛ 2 A ͱ Y ͷؒͷ open backdoor path ʹΑͬͯੜ͡ΔόΠΞε =A Λແ࡞ҝʹׂΓ͚Δͱফࣦ͢Δܥ౷తόΠΞε { Selection node ͕ͳ͍߹ɿ2 ͭͷఆ͕ٛҰக͢Δ Selection node ͕͋Δ߹ɿඞͣ͠Ұக͠ͳ͍ (Figure 7.4’) ఆٛ 1 ղੳͷํ๏ʹґΒͳ͍͕ɺఆٛ 2 Ͱղੳͷํ๏ʹ Αͬͯަབྷͷ༗ແ͕มΘΔɻ 20 -
ަབྷҼࢠ (confounder) ަབྷҼࢠ (confounder) Treatment A ͱ outcome Y ʹؔ͢Δσʔλ͚ͩͰҼՌޮՌ
ΛࣝผͰ͖ͣɺL Λ༻͍Δ͜ͱͰࣝผͰ͖ΔΑ͏ʹͳΔ࣌ɺ L ΛަབྷҼࢠ (confounder) ͱݺͿ = Ya A ཱ͕͠ͳ͍͕ Ya A | L ཱ͕͢Δ࣌ 21 -
ަབྷҼࢠͷྫ A Y L U Figure 7.2 A Y L
U Figure 7.3 • 7.1 Ͱ L ڞ௨ͷݪҼͰ͋Γ ަབྷҼࢠ • 7.2-7.3 Ͱ L ڞ௨ͷݪҼͰ ͳ͍͕ަབྷҼࢠ • 7.4 Ͱ L ަབྷҼࢠͰͳ͍ U ͕ଌఆ͞ΕΕɺU Ͱ open backdoor path Λด͡Δ͜ͱ͕ Ͱ͖ΔͷͰɺU ͷԼͰ L ަབྷҼࢠʹͳΒͳ͍ɻ͜ͷΑ͏ ʹަབྷઈରతͳ֓೦͕ͩɺަབྷҼࢠ૬ରతͳ֓೦Ͱ͋Δɻ 22 -
ަབྷͷߟ͑ํͷൺֱ ຊষͰͷަབྷͷߟ͑ํ (structural approach) 1. ҼՌؔʹ͍ͭͯͷΞϓϦΦϦͳࣝʹج͍ͮͯɺA ͱ Y ͷͯ͢ͷڞ௨ͷݪҼΛؚΉΑ͏ʹɺҼՌ DAG
Λॻ͘ 2. ڞ௨ͷݪҼ͕͋Εަབྷ͕ଘࡏ͢Δ 3. Backdoor ج४ʹΑΓௐ͢Δม (ަབྷҼࢠ) ΛܾΊΔ ౷తͳަབྷͷߟ͑ํ 1. ౷ܭతͳؔ࿈ʹج͍ͮͯɺ” ަབྷҼࢠ” Λݟ͚ͭΔ 2. "ަབྷҼࢠ"Λௐ͢Δ 3. ௐͨ͠ਪఆͱௐ͍ͯ͠ͳ͍ਪఆ͕ҟͳΕ” ަ བྷ” ͕ଘࡏ͢Δ 23 -
౷తͳߟ͑ํʹ͓͚Δ” ަབྷҼࢠ” ͷఆٛ ౷తͳߟ͑ํʹ͓͚Δ” ަབྷҼࢠ” ͷఆٛ ҎԼͷ 3 ݅Λຬͨ͢มΛ” ަབྷҼࢠ”
ͱݺͿɻ • Treatment ͱؔ࿈͍ͯ͠Δ • Treatment Ͱ͚݅ͮͨԼͰ outcome ͱؔ࿈͍ͯ͠Δ • Treatment ͱ outcome ͷؒͷҼՌܦ࿏্ʹଘࡏ͠ͳ͍ Figure 7.1-7.3 Ͱ͜ͷఆٛͷԼɺL ͕ަབྷҼࢠͱͳΓɺզʑ ͷఆٛͱҰக͢Δɻ 24 -
౷తͳߟ͑ํͰෆ߹͕ੜ͡Δ߹ A Y L U2 U1 Figure 7.4 A L
Y U Figure 7.7 Figure 7.4 7.7 • ަབྷͳ͘ Ya A • ͔͠͠ L ౷తͳ” ަབྷҼ ࢠ” ͷ 3 ݅Λຬͨ͢ • L Ͱௐ͢Δͱٯʹ selection bias ͕ൃੜ • Selection bias ͷ͍ͤͰௐͷ ༗ແʹΑͬͯਪఆ͕ҟͳΔ ͷͰ” ަབྷ” ͱஅ͞ΕΔ 25 -
मਖ਼൛” ަབྷҼࢠ” ͷఆٛ Figure 7.4 7.7 ʹରԠ͢ΔͨΊɺ3 ݅ͷ͏ͪ 2
൪Λ • Treatment Ͱ͚݅ͮͨԼͰ outcome ͱؔ࿈͍ͯ͠Δ ↓ • Outcome ͷݪҼͰ͋Δ ͱमਖ਼͠Α͏ͱ͢Δͱࠓ Figure 7.2 Ͱ L ΛަབྷҼࢠͱΈ ͳ͞ͳ͘ͳͬͯ͠·͏ɻ 26 -
Structural approach ͷར ަབྷʹର͢Δ structural approach ͰɺҼՌؔʹؔ͢Δݚڀ ऀͷߟ͑ԾఆΛҼՌ DAG Ͱද͠ɺͦΕʹج͍ͮͯௐ͢
͖มΛܾΊΔ͜ͱͰɺ • ԾఆʹԊͬͨదͳղੳ͕ߦ͑Δ • Ծఆ͕໌֬ʹͳΔ͜ͱͰɺͦͷԾఆʹ͍ͭͯଞͷݚڀऀ ͱٞͰ͖Δ 27 -
Counterafactural ΛάϥϑʹΈࠐΉ ͜͜·ͰͷҼՌ DAG ʹ͓͍ͯɺάϥϑ্ʹ Ya ͕ग़ݱ͠ͳ ͍ͷʹؔΘΒͣɺҎԼͷ 2 ͭ
• άϥϑ͔Βಋ͔ΕΔ backdoor ج४ͱ • Ya A | L ͕݁ͼ͍͍ͭͯͨɻ ຊηΫγϣϯͰ Single-world intervention graphs (SWIGs) ʹ ͓͍ͯɺYa ΛάϥϑʹΈࠐΉ͜ͱͰ exchangeability ΛධՁ ͢Δɻ 28 -
Figure7.2 ʹ͓͚Δ SWIG A Y L U Figure 7.2 A
| a Ya L U Figure 7.9 A: ΞεϐϦϯɺY: ଔத L: ৺࣬ױɺU:ಈ຺ߗԽ ΞεϐϦϯ͕ॲํ͞ΕΔॠؒʹɺॲ ํᝦΛճऩ͢Δͱ͍͏Ծతͳੈք Λߟ͑Δɻ • શһ a = 0 ͱ͍͏ single intervention Λड͚Δ • Ծతͳੈքʹ͓͚Δ Y Ya=0 • A natural value of treatment ͳ ͷͰྲྀΕࠐΉҹͦͷ·· • a A ͔Βग़ΔҹΛҾ͖ܧ͙ • A ͔Β a ͷҹͳ͍ 29 -
SWIG ʹ͓͚Δ exchangeability ͷධՁ A | a Ya L U
Figure 7.9 A | a Ya L U2 U1 Figure 7.10 L Ͱ͚݅ͮΔͱ A ͱ Ya d-separate ͞Ε͍ͯΔͷͰ Ya A | L Figure 7.4 Λ SWIG ʹมͨ͠ Figure7.10 ͰɺL Ͱ͚݅ͮͣʹ d-separate ͞Ε͍ͯΔͷͰ Ya A SWIG ͰɺBackdoor ج४ͱ Ya A | L ͱͷ͕ؔΘ͔Γ͍͢ 30 -
ަབྷͷௐ Conditional exchangeabilityYa A | L ͷԼͰަབྷҼࢠΛௐ ͢Δํ๏ʹҎԼͷ 2 छྨ͕͋Δɻ
G-method L ΛؚΉ backdoor path ͕ଘࡏ͠ͳ͍߹ͷ A ͱ Y ͷؔ࿈Λ γϛϡϨʔγϣϯ͠ɺpopulation શମ͋Δ͍ͦͷҰ෦ʹ͓ ͚ΔҼՌޮՌΛਪఆ͢ΔɻBackdoor path Λফ͢ʂ ۩ମྫɿstandardizatiosn, IP weighting, g-estimation Stratification-based method L ͷʹΑܾͬͯ·Δ subpopulation ʹ͓͚Δ conditional effect ΛٻΊΔɻL Ͱ͚݅ͮΔʂ ۩ମྫɿstratification, restriction, outcome regression, matching 31 -
Time-varying treatment Time-varying treatment ͕͋Δ߹ • G-method: ަབྷͷௐʹ༻͍Δ͜ͱ͕Ͱ͖Δɹ (Part III)
• Stratification-based method: ͚݅ͮΔ͜ͱʹΑͬͯ selection bias ͕ੜ͡ΔڪΕ͕͋Δ (Chapter 20) • Conditional exchangeability Ҏ֎ΛԾఆ͢Δख๏ɿҰൠʹ ༻͍Δ͜ͱ͕Ͱ͖ͳ͍ ͱͳ͍ͬͯΔͨΊɺg-method Λ༻͍Δඞཁ͕͋Δɻ 32 -
Conditional exchangeablity Λ༻͍ͣʹަབྷΛௐ͢Δ ํ๏ ަབྷ conditional exchangeablity Λ༻͍ͳͯ͘ • Difference-in-Difference
(Technical Point 7.3) • Instrumental variable estimation (Chapter 16) • The front door criterion (Technical Point 7.4) ͳͲʹΑͬͯରॲ͢Δ͜ͱ͕Ͱ͖Δ͕ɺ͜ΕΒͷख๏ conditional exchangeability ͱಉ༷ʹɺݕূෆՄೳͳԾఆΛඞཁ ͱ͢ΔͨΊɺख๏ΛબͿࡍʹɺͲͷԾఆ͕ΑΓ͔֬Β͍͠ ͔Λߟ͑Δඞཁ͕͋Δɻ 33 -
؍σʔλʹΑΔҼՌਪʹ͓͚Δෆ࣮֬ੑ • Expert knowledge Λ༻͍Δ • ม (treatment ͷ non-descendant)
ΛͳΔ͘ଟ͘ଌఆ ͜ͱͰ conditional exchangebility ʹۙͮ͜͏ͱͯ͠ɺΓཱ ͭอূͳ͍ɻ • ෳͷ causal structure ʹ͍ͭͯͦΕͧΕੳΛߦ͏ ߹Ͱͦ͜ʹਅͷ causal structure ؚ͕·ΕΔอূͳ͍ɻ 34 -
؍ݚڀΛͲͷΑ͏ʹ൷͖͔͢ ͲͷΑ͏ͳ؍ݚڀͰ͋Εަབྷ͕ੜ͡ΔՄೳ͕͋ΔͨΊ ʹཱͨͳ͍൷ ʮަབྷ͕ଘࡏ͢ΔՄೳੑ͕͋ΔͨΊɺ͜ͷ؍ݚڀ͔Βಋ͔ ΕΔਪޡ͍ͬͯΔ͔͠Εͳ͍ʯ Ͱͳ͘ɺ దͳ൷ • ͦͷ݁Ռͱ૬͢ΔݚڀΛҾ༻͢Δ •
ަབྷΛੜͤ͡͞Δ۩ମతͳݪҼΛࢦఠ͢Δ ͜ͱͰ൷͖͢Ͱ͋Δɻ 35 -
Technical Point 7.1 Conditional exchangeability ← backdoor ج४ Faithfulness ͕ͳཱͯ͘
Conditional exchangeability → backdoor ج४ FFRCISTG ϞσϧͷԼͰɺfaithfulness ͕͋Δ߹ʹཱ Cross-world independence ΛԾఆ͢Δ NPSEM-IE ϞσϧͰ backdoor ج४͕Γཱͨͳͯ͘ conditional exchangeablity ͕ΓཱͪಘΔɻ 36 -
Fine Point 7.1: ަབྷͷํ Signed causal diagram Λ͏ͱɺަབྷ͕Ͳͷํʹ bias Λ
ͨΒ͔͕͢Θ͔Δɻ A Y L Figure 7.1 L → A : +, L → Y : + ͷͱ͖ɺ+ ʹ bias L → A : −, L → Y : − ͷͱ͖ɺ+ ʹ bias L → A : +, L → Y : − ͷͱ͖ɺ− ʹ bias L → A : −, L → Y : + ͷͱ͖ɺ− ʹ bias 37 -
Fine Point 7.1: ަབྷͷڧ͞ • ڧ͍ަབྷʹڧ͍ confounder-treatment ؔͱڧ͍ confounder-outcome ͕ؔඞཁ
• Confounder ͕ࢄมͷ߹ɺconfounder ͷ prevalence ʹΑͬͯަབྷͷڧ͕͞มΘΔ • Confounder ͕ະͷ߹ɺbias ͷڧ͞Λਪଌ͢Δͷʹ sensitivity analysis Λߦ͏͜ͱ͕༗༻ 38 -
Fine Point 7.2 A Y L U2 U1 L1 L2
Figure 7.6 Figure 7.6 ʹ͓͍ͯ • Ya A | L, L2 • Ya A | L1 ͕Γཱ͕ͭɺ • Ya A | L • Ya A | L2 Γཱͨͳ͍ɻैͬͯɺ ʮL ͷΈʯ ɺ ͋Δ͍ʮL2 ͷΈʯͰҼՌޮՌ ࣝผͰ͖ͣɺ ʮL ͱ L2 ʯ͋Δ͍ ʮL1 ʯ͕ଌఆ͞ΕΔඞཁ͕͋Δɻ 39 -
Fine Point 7.3: Surrogate confounder L A Y U Figure
7.8 • ະଌఆͷ U ʹΑͬͯަབྷ͕ൃੜ • L backdoor path ্ʹͳ͍ • L U ͱؔ࿈͍ͯ͠Δ L ͕ೋͰ U ͷ nondifferential ͳޡྨͰ͋ΕɺL Ͱ݅ͮ ͚Δ͜ͱͰ backdoor path ͕෦తʹϒϩοΫ͞ΕΔɻ Surrogate confounder Backdoor path ্ʹଘࡏ͠ͳ͍͕ɺަབྷʹΑΔ bias ΛݮΒ ͢ͷʹ͑ΔมΛ surrogate confounder ͱݺͿ ަབྷʹରॲ͢Δํ๏ͱͯ͠Ͱ͖Δ͚ͩଟ͘ͷ surrogate confounder Λଌఆ͢Δɺͱ͍͏ઓུ͕ՄೳͰ͋Δɻ 40 -
Technical Point 7.2 มͷू߹ L ͱ U ͕ Ya A
| L, U Λຬͨ͢ͱ͖ɺҎԼͷ ݅ΛຬͨͤɺL ͷΈͰे (Ya A | L) Ͱ͋Δɻ U ͕ޓ͍ʹૉͳू߹ U1 ͱ U2 ʹ͚ΒΕɺ • L ʹΑΓܾ·Δʹ͓͍ͯ U1 ͱ A ͕ؔ࿈͍ͯ͠ͳ͍ • A, L, U1 ʹΑΓܾ·Δʹ͓͍ͯ U2 ͱ Y ͕ؔ࿈͍ͯ͠ ͳ͍ 41 -
Fine Point 7.4 A L Y U Figure 7.11 A
| a La Ya U Figure 7.12 L • Backdoor path Λด͡Δ͕ • A ͷ descendant ͳͷͰɺYa A | L Γཱͨ ͳ͍ɻ SWIG Λඳ͘ͱɺΓཱͭͷ Ya A | La Ͱ͋Δ͜ͱ͕Θ͔Δɻ ॏཁͳͷʮL ͕ A ΑΓ࣌ؒతʹ લ͔ޙ͔ʯͰͳ͘ɺʮL ͕ A ͷ descendant ͔൱͔ʯ Ͱ͋Δɻ 42 -
Technical Point 7.3 C A Y U Figure 7.13 ະଌఆͷ
U ʹΑΔަབྷ͕͋Δͱ͖ɺ • A ͱͷؔʹ͓͍ͯ U ʹΑΔަ བྷ͕ੜ͡Δ͕ • A ʹΑΔӨڹΛड͚ͳ͍ มΛ negative outcome control ͱͯ͠༻͍Δ͜ͱ͕͋Δɻ 43 -
Technical Point 7.3 Treatment ͷલͷ outcome ͷΛ C ͱ͢Δͱɺnegative outcome
control ͱͯ͠༻Ͱ͖ɺ Additive equi-confounding E[Y0 | A = 1] − E[Y0 | A = 0] = E[C | A = 1] − E[C | A = 0] ͷԼͰɺॲஔ܈ʹ͓͚Δ A ͷ Y ͷޮՌΛܭࢉͰ͖Δɻ͜ͷ ํ๏ difference-in-differences ͱͯ͠ΒΕ͍ͯΔɻΑΓऑ ͍Ծఆʹجͮ͘ख๏ఏҊ͞Ε͍ͯΔɻ 44 -
Technical Point 7.4 A M Y U Figure 7.14 7.14
Ͱ backdoor path Λด͡Δͷ ʹ U Ͱ͚݅ͮΔඞཁ͕͋Δ͕ɺU ͕ະଌఆͰ front door formula Λ༻ ͍ͯ Pr[Ya = 1] ΛࣝผͰ͖Δɻ A ʹΑΔӨڹ M ͔ΒͷΈड͚ΔͷͰɺPr[Ya = 1] ∑ m Pr[Ma = m]Pr[Ym = 1 | Ma = m] = ∑ m Pr[Ma = m] A MaΑΓࣝผ Pr[Ym = 1] Ym M|A ΑΓࣝผ (∵ Ma Ym) = ∑ m Pr[M = m|A = a] ∑ a′ Pr[Y = 1|M = m, A = a′]Pr[A = a′] 45 -
·ͱΊ • ަབྷͱڞ௨ͷݪҼʹΑͬͯੜ͡Δ bias Ͱ͋Δ • ҼՌ DAG ʹج͖ͮɺbackdoor ج४ΛదԠͯ͠ௐ͢Δ
มΛܾΊΔ • Ͳͷ؍ݚڀʹަབྷ͕ੜ͡ΔՄೳੑ͕͋Γɺͦͷରॲ ʹݕূෆՄೳͳԾఆ͕ඞཁͰ͋Δ 46