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
statistician_ja_lt5.pdf
Search
Sponsored
·
Your Podcast. Everywhere. Effortlessly.
Share. Educate. Inspire. Entertain. You do you. We'll handle the rest.
→
Takayuki Uchiba
November 15, 2020
Science
750
0
Share
Embed
Copy iframe code
Copy JS code
Copy link
Start on current slide
statistician_ja_lt5.pdf
一様最小分散不偏推定量が存在しない例を紹介しました。
Takayuki Uchiba
November 15, 2020
More Decks by Takayuki Uchiba
See All by Takayuki Uchiba
縮小推定のはなし.pdf
utaka233
1
2.9k
高次元データに対するL1正則化の有効性
utaka233
1
3.3k
Other Decks in Science
See All in Science
「表象」を再定義するー潜在表現解析の落とし穴
ykamit
0
1.2k
Toward Causal Scientific Discovery with AI
sshimizu2006
0
240
AWS WAFのAIトラフィック収益化機能を考えてみる_20260626
masakiokuda
1
140
Webinaire : Valorisez les résultats de vos projets européens avec EU-FarmBook
institutdelelevage
PRO
0
220
生成AI・プレプリント時代における 研究成果公開の再設計 ― トップカンファレンス文化はどこへ向かうのか / Redesigning the Dissemination of Research Outputs in the Age of Generative AI and Preprints — Where Is the Top-Conference Culture Heading?
ykiyota
0
31k
チュートリアル:世界モデル
hf149
0
2.5k
明治薬科大学講義_ビッグデータ解析を支えるデータベース技術とクラウドコンピューティング
ktatsuya
1
210
データベース04: SQL (1/3) 単純質問 & 集約演算
trycycle
PRO
0
1.8k
JSAI2026企画セッションKS-14 インタビュー集『⼈⼯知能と哲学と四つの問い』が提起する⼈⼯知能のこれからの課題 趣旨説明 / JSAI2026 Special Session: A Collection of Interviews, “Artificial Intelligence, Philosophy, and Four Questions”
ykiyota
0
500
社内で活躍できるデータサイエンティストになるために
aikinohara
1
200
Conwayの法則を"ちゃんと"使うために — 原典でConwayは何を言っていたのか
bonotake
10
7.8k
白金鉱業Meetup Vol.25 【初学者向け発表枠】「で、この施策って効いてるの」に答える効果検証の基礎 ~ATE / ATT / CATE / LATEを現場の問いに翻訳する~
brainpadpr
1
430
Featured
See All Featured
Building Better People: How to give real-time feedback that sticks.
wjessup
371
20k
The Spectacular Lies of Maps
axbom
PRO
1
1.1k
The AI Search Optimization Roadmap by Aleyda Solis
aleyda
2
6.4k
Producing Creativity
orderedlist
PRO
348
41k
The Mindset for Success: Future Career Progression
greggifford
PRO
0
560
Bioeconomy Workshop: Dr. Julius Ecuru, Opportunities for a Bioeconomy in West Africa
akademiya2063
PRO
1
450
コードの90%をAIが書く世界で何が待っているのか / What awaits us in a world where 90% of the code is written by AI
rkaga
63
48k
Making Projects Easy
brettharned
120
6.8k
Leo the Paperboy
mayatellez
10
2.4k
SEOcharity - Dark patterns in SEO and UX: How to avoid them and build a more ethical web
sarafernandez
0
320
Exploring the Power of Turbo Streams & Action Cable | RailsConf2023
kevinliebholz
37
6.7k
[SF Ruby Conf 2025] Rails X
palkan
3
1.5k
Transcript
Ұ༷࠷খࢄෆภਪఆྔඞͣଘࡏ͢Δ͔ʁ !VUBLB
Ұ༷࠷খࢄෆภਪఆྔ ͷҰ༷࠷খࢄෆภਪఆྔʢ6.76&ʣɹ ෆภੑ ͕ͲΜͳͰ͋ͬͯɺ ͕Γཱͭɻ Ұ༷࠷খࢄੑ ͕ͲΜͳͰ͋ͬͯɺଞͷෆภਪఆྔ
ʹൺͯ ͷࢄ͕খ͍͞ɻཁ͢Δʹɺ ͕Γཱͭɻ ྫαΠζ ͷಠཱඪຊΛظ ࢄ ͷਖ਼ن͔Βಘͨ߹ ɾظ ͷ6.76&ඪຊฏۉ ɾࢄ ͷ6.76&ෆภࢄ T θ θ [T] = θ θ S T [T] ≤ [S] n μ σ2 μ σ2
6.76&ͷѻ͍͢͞ʢͦͷʣ $SBNFS3BPͷఆཧ͋Δෆภਪఆྔ͕6.76&͔ఆ͢Δํ๏ͷͻͱͭ ɾෆภਪఆྔͷࢄͷେ͖͞ͷԼݶܭࢉͰ͖Δɻ ɹɾ$SBNFS3BPԼݶ'JTIFSใྔ ɾෆภਪఆྔ ͷࢄ͕͜ͷԼݶʹҰக͢Ε6.76& ʢʣ6.76&ͷࢄ͕ඞͣ͜ͷԼݶʹͳΔΘ͚Ͱͳ͍ɻ T
6.76&ͷѻ͍͢͞ʢͦͷʣ -FINBOO4DIF⒎Fͷఆཧ6.76&ಛఆͷ݅ͷͱͰ࡞ΕΔɻ ɾಛఆͷ݅උे౷ܭྔͷଘࡏ ɾඋे౷ܭྔͰද͞ΕΔ౷ܭྔ͕ෆภͳΒ6.76& ɾ$SBNFS3BPͷఆཧ͕༗ޮͰͳ͍έʔεͰಛʹศར ɹɾ'JTIFSใྔ͕ఆٛͰ͖ͳ͍ͱ͖ʢҰ༷ͷ࠷େύϥϝʔλʣ ɹɾ6.76&ͷࢄ㱠$SBNFS3BPԼݶͷͱ͖
6.76&ඞͣଘࡏ͢Δ͔ʁ ύϥϝʔλ ͷ6.76&ඞͣଘࡏ͢Δ͔ʁ ɾ-FINBOO4DIF⒎Fͷఆཧඋे౷ܭྔ͕ଘࡏ͢Ε6.76&࡞ΕΔɻ ɾඋे౷ܭྔ͕ଘࡏ͠ͳ͚ΕͲ͏͔ʁ ɾ)JOUҰ༷࠷খࢄੑʹݱΕΔʮ ͕ͲΜͳͰ͋ͬͯʯڧ͍݅ ˠɹ ͷ͝ͱʹ࠷খࢄͷෆภਪఆྔ͕ҟͳΕɺ6.76&ଘࡏ͠ͳ͍ɻ θ
θ θ
۩ମྫͷߏ ֬ม ͕࣍ͷ࣭֬ྔؔ ʹै͍ͬͯΔͷͱ͠·͢ɻύϥϝʔλ ͷҰ༷࠷খࢄෆภਪఆྔଘࡏ͢Δ͔ʁ ٕज़తͳ3FNBSL Ͱද͞ΕΔͲΜͳ౷ܭྔɺ ͷܗͰද͢͜ͱ͕Ͱ͖Δɻ X
f(x) = { p JGx = − 1 (1 − p)2px JGx = 0,1,2,⋯ p X T(X) = ∞ ∑ x=−1 tx [X = x]
ෆภਪఆྔʹͳΔͨΊͷ݅ Λ༻͍ͯɺ౷ܭྔ ͷظΛܭࢉ͢Δɻ ౷ܭྔ ͕ෆภਪఆྔͳΒɺظඞͣ ʹ͘͠ͳΔɻ ˠɹԽࣜ GPS
ˠɹ ͷܗͰද͞ΕΔ౷ܭྔ ͕ෆภਪఆྔʹͳΔɻ f(x) = { p JGx = − 1 (1 − p)2px JGx = 0,1,2,⋯ T(X) [T] = t−1 p + ∞ ∑ x=0 tx (1 − p)2px = t0 + ∞ ∑ x=1 (tx−2 − 2tx−1 + tx )px T(X) p tx − 2tx−1 + tx−2 = 0 x ≥ 2 t1 = 1 − t−1 t0 = 0 tx = x(1 − t−1 ) T(X)
ෆภਪఆྔͷࢄΛܭࢉ͢Δʢͦͷʣ Λ༻͍ͯɺෆภਪఆྔ ͷࢄΛܭࢉ͢Δɻ ͜͏͍͏ͱ͖ʹཱͭͷࢄͷެࣜʂ ͳͷͰɺ Λܭࢉ͠Α͏ɻ f(x) = {
p JGx = − 1 (1 − p)2px JGx = 0,1,2,⋯ T(X) [T] = [T2] − [T]2 = [T2] − p2, ෆภੑ [T2]
ෆภਪఆྔͷࢄΛܭࢉ͢Δʢͦͷʣ Ώ͑ʹɺ ͷࢄ ͱΘ͔Γ·͢ɻ [T2] = t2 −1 p
+ ∞ ∑ x=1 x2(1 − t−1 )2(1 − p)2px = t−1 + (1 − t−1 )2(1 − p)2 ∞ ∑ x=1 x2px = t2 −1 p + (1 − t−1 )2(1 − p)2 p(1 + p) (1 − p)3 = t2 −1 p + (1 − t−1 )2 p(1 + p) 1 − p T(X) [T] = t2 −1 p + (1 − t−1 )2 p(1 + p) 1 − p − p2
ࢄ͕࠷খΛͱΔͨΊͷ݅ʢͦͷʣ ࠷খࢄΛ༩͑Δ ʢΛ༩͑Δ ʣΛٻΊɺ ʹґଘͳΒ6.76&ଘࡏ͠ͳ͍ɻ Λ Ͱཧ͢Δͱɺ͕࣍ؔݱΕΔɻ ฏํͯ͠ɺ࠷খΛ༩͑Δ ΛٻΊͯΈΑ͏ʂ
T(X) t−1 p [T] = t2 −1 p + (1 − t−1 )2 p(1 + p) 1 − p − p2 t−1 [T] = (p + p(1 + p) 1 − p ) t2 −1 − 2 p(1 + p) 1 − p t−1 + ( p(1 + p) 1 − p − p2 ) t−1
ࢄ͕࠷খΛͱΔͨΊͷ݅ʢͦͷʣ ฏํ͢Δͱɺ࣍ͷΑ͏ʹͳΓ·͢ɻ ࣍ؔͷͷ࠲ඪΛಡΉ͜ͱͰɺ ͷͱ͖ࢄ࠷খͱΘ͔Γ·͢ɻ [T] = (p + p(1
+ p) 1 − p ) t−1 − 1 1 + 1 − p 1 + p 2 + const . = (p + p(1 + p) 1 − p ) {t−1 − p + 1 2 } 2 + const . t−1 = p + 1 2
݁ ࢄ͕࠷খʹͳΔෆภਪఆྔ͕ύϥϝʔλ ͷʹґଘ͍ͯ͠Δɻ ˠɹ ͷ6.76&ଘࡏ͠ͳ͍ʂʂʂʂʂ ͜ͷྫ͕ڭ͑ͯ͘Ε͍ͯΔͱࢥ͏͜ͱʢࢲײʣ ɾඞͣ͠ʮ͍ͭͰ҆ఆͯ͠ਫ਼͕ྑ͍ਪఆྔʯ͕ଘࡏ͢ΔͱݶΒͳ͍ɻ ɾԾઆ͕͋ΔͳΒਪఆྔʹөͤͯ͞ΈΔͷେࣄɻ ɹɾࠓճͷྫͰɺ ͷʹԠͨ͡ਪఆྔͷબͷ༨͞Ε͍ͯΔɻ
ɹɾDMJDLখ͘͞ͳΓ͕͔ͪͩΒɺͪΐͬͱॖখͨ͠ͷΛ͓͏ͱ͔ɻ p p p
͝ਗ਼ௌ͋Γ͕ͱ͏͍͟͝·ͨ͠ʂ ࣗݾհͰͬͱ͖·͢ɻɻɻ ɾ!VUBLB ɾגࣜձࣾ͢͏͕͘ͿΜ͔ ڭ෦ ෦ ɾڵຯཧ౷ܭֶͷσʔλϚΠχϯάͷԠ༻ زԿֶ ɾจ ɹओஶ(MVJOH4UBCJMJUZ$POEJUJPOTPO3VMFE4VSGBDFXJUI1PTJUJWF(FOVT
ɹɹɹɹ0TBLB+PVSOBMPG.BUIFNBUJDT BDDFQUFE ɹڞஶࠓຊɺ͍ͣΕػցֶशͷจɻ