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
Takayuki Uchiba
November 15, 2020
Science
740
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.8k
高次元データに対するL1正則化の有効性
utaka233
1
3.3k
Other Decks in Science
See All in Science
Understanding CVP Waveforms: Interpretation and Clinical Implications in Anesthesiology
taka88
0
910
AI(人工知能)の過去・現在・未来 ~AIは人類を越えるのか~
tagtag
PRO
0
170
JSAI2026企画セッションKS-14 インタビュー集『⼈⼯知能と哲学と四つの問い』が提起する⼈⼯知能のこれからの課題 趣旨説明 / JSAI2026 Special Session: A Collection of Interviews, “Artificial Intelligence, Philosophy, and Four Questions”
ykiyota
0
460
TypeScript で WebAssembly を用いた 型安全なプラグイン設計
nagano
2
620
2026 Introduction to University Math 01
kanaya
0
180
機械学習 - pandas入門
trycycle
PRO
0
750
大黒市で発生した大規模インシデント の ポストモーテムから読み解く、 記憶媒体消去の大切さ
shucho0103
0
280
Tensor Factorization Meets Deformed Information Geometry: Convex Relaxation under Deformed Algebra
gkazunii
0
160
データベース10: 拡張実体関連モデル
trycycle
PRO
0
1.6k
Build your own LLM, Live, with MicroGPT
ianozsvald
0
150
Cross-Media Technologies, Information Science and Human-Information Interaction
signer
PRO
3
33k
機械学習 - DBSCAN
trycycle
PRO
0
2.1k
Featured
See All Featured
Exploring the Power of Turbo Streams & Action Cable | RailsConf2023
kevinliebholz
37
6.6k
How to Build an AI Search Optimization Roadmap - Criteria and Steps to Take #SEOIRL
aleyda
1
2.2k
Tell your own story through comics
letsgokoyo
1
1.1k
Lightning talk: Run Django tests with GitHub Actions
sabderemane
0
270
Conquering PDFs: document understanding beyond plain text
inesmontani
PRO
4
3.1k
Build The Right Thing And Hit Your Dates
maggiecrowley
39
3.5k
The World Runs on Bad Software
bkeepers
PRO
72
12k
The Director’s Chair: Orchestrating AI for Truly Effective Learning
tmiket
1
310
Measuring Dark Social's Impact On Conversion and Attribution
stephenakadiri
2
290
Claude Code どこまでも/ Claude Code Everywhere
nwiizo
68
58k
Technical Leadership for Architectural Decision Making
baasie
3
580
The Success of Rails: Ensuring Growth for the Next 100 Years
eileencodes
47
8.3k
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 ɹڞஶࠓຊɺ͍ͣΕػցֶशͷจɻ