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
統計的学習理論の基礎 II
Search
Masanari Kimura
March 05, 2021
Research
410
3
Share
Embed
Copy iframe code
Copy JS code
Copy link
Start on current slide
統計的学習理論の基礎 II
Masanari Kimura
March 05, 2021
More Decks by Masanari Kimura
See All by Masanari Kimura
Equivalence of Geodesics and Importance Weighting from the Perspective of Information Geometry
mkimura
0
380
機械学習における重要度重み付けとその応用
mkimura
3
3.5k
Paper Intro: Human Rademacher Complexity
mkimura
0
250
On the principle of Invariant Risk Minimization
mkimura
0
410
論文紹介:Clustering with Bregman Divergences: an Asymptotic Analysis
mkimura
0
640
Generalization Bounds for Set-to-Set Matching with Negative Sampling
mkimura
0
210
論文紹介:On the Importance of Gradients for Detecting Distributional Shifts in the Wild
mkimura
2
930
論文紹介:Dangers of Bayesian Model Averaging under Covariate Shift
mkimura
0
390
Information Geometry of Dropout Training
mkimura
0
370
Other Decks in Research
See All in Research
Karkada さんの論文 × 2 の紹介: (1) Closed-Form Training Dynamics Reveal Learned Features and Linear Structure in Word2Vec-like Models, (2) Symmetry in language statistics shapes the geometry of model representations
eumesy
PRO
1
400
[IR Reading 2026春 論文紹介] LLM-based Listwise Reranking under the Effect of Positional Bias (ECIR 2026) /IR-Reading-2026-Spring
koheishinden
PRO
0
370
J-STAGEの現況と全文XML登載必須化について
xspa2012
0
160
マーケットストリート 社会実験2024 in 秋葉原ジャンク通り 調査報告書
izumiyama_lab
1
120
EIRによる不正端末のブロッキング 5G時代におけるデバイス識別と不正対策の進化
stellarcraft
0
120
Ghost in the 7‑Zip: The Shadow of Residential Proxies Creeping into Your Life
nttcom
0
1.9k
論文読み会 SNLP2026 Tau2-Bench: Evaluating Conversational Agents in a Dual-Control Environment
s_mizuki_nlp
0
150
2026年度 生成AI を活用した論文執筆ガイド/ワークショップ / 2026 Academic Year Guide to Writing Papers Using Generative AI - Workshop
ks91
PRO
0
220
LLM Compute Infrastructure Overview
karakurist
2
1.6k
IA for theory
gpeyre
1
380
MIRU2026 チュートリアル講演2:三次元データ処理の動向
nnchiba
6
4.6k
東京大学工学部計数工学科、計数工学特別講義の説明資料
kikuzo
0
630
Featured
See All Featured
The browser strikes back
jonoalderson
0
1.6k
エンジニアに許された特別な時間の終わり
watany
108
250k
The Power of CSS Pseudo Elements
geoffreycrofte
82
6.5k
Accessibility Awareness
sabderemane
1
180
Exploring the Power of Turbo Streams & Action Cable | RailsConf2023
kevinliebholz
37
6.6k
A Modern Web Designer's Workflow
chriscoyier
698
190k
Tips & Tricks on How to Get Your First Job In Tech
honzajavorek
1
710
Heart Work Chapter 1 - Part 1
lfama
PRO
8
36k
The State of eCommerce SEO: How to Win in Today's Products SERPs - #SEOweek
aleyda
2
11k
Fireside Chat
paigeccino
42
4k
The Art of Programming - Codeland 2020
erikaheidi
57
14k
コードの90%をAIが書く世界で何が待っているのか / What awaits us in a world where 90% of the code is written by AI
rkaga
63
45k
Transcript
CompML ౷ܭతֶशཧͷجૅ II Masanari Kimura (@machinery81)
CompML TL;DR • ౷ܭతֶशཧͷجૅతͳࣄ߲ͷ·ͱΊ • ୈೋճҎԼͷτϐοΫʹ͍ͭͯ • ू߹ͷ֓೦ • VC-Dimension
• Pseudo-Dimension • Fat-Shattering Dimension • VCόϯυ 2
CompML VC-Dimension
CompML VC-Dimension ఆٛ 1.ʢVC-࣍ݩʣՄଌۭؒ ͷ͋Δू߹Λ ͱ͢Δɽશͯͷ෦ू߹ ʹ͍ͭͯɼ ͱͳΔΑ͏ͳ ͕ଘࡏ͢Δͱ͖ɼू߹
Ͱ͞ ΕΔͱ͍͏ɽ ͷVapnik-Chervonenkis࣍ݩ ɼ ʹΑͬͯ͞ΕΔू ߹ͷجͷ࠷େʹ͍͠ɽ (𝑋, 𝑆) 𝒜 ⊂ 𝑆 𝐵 ⊂ 𝑆 𝑆 ∩ 𝐴 = 𝐵 𝐴 ∈ 𝒜 𝑆 𝒜 𝒜 𝑉𝐶𝑑𝑖𝑚(𝒜) 𝒜 Photo by Wikipedia.
CompML The Pseudo-Dimension ఆٛ2.ʢ -࣍ݩʣՄଌۭؒ ͷ্ͷՄଌؔͷू߹Λ ͱ͢Δɽ ू߹ ҎԼ͕Γཱͭͱ͖ -shatteredͰ͋Δͱ͍͏ɿ
ҙͷ2ϕΫτϧ ͱͦΕʹରԠ͢Δؔ ʹ͍ͭͯɼ ্هͷ݅ΛHeavisideؔ Ͱॻ͖͑Δͱ ؔΫϥε ͷ -࣍ݩ ʹΑͬͯ -shatteredͱͳΔΑ͏ͳू߹ͷجͷ࠷େͰఆٛ͞Εɼ ͱॻ͔ΕΔɽ 𝑃 (𝑋, 𝑆 ) ℱ ⊂ [0,𝑅] 𝑋 𝑆 = {𝑥1 , …, 𝑥𝑛} ⊂ 𝑋 𝑃 𝑒 ∈ {0,1}𝑛 𝑓𝑒 ∈ ℱ { 𝑓𝑒(𝑥𝑖) ≥ 𝑐𝑖 𝑖𝑓 𝑒𝑖 = 1, 𝑓𝑒(𝑥𝑖) < 𝑐𝑖 𝑖𝑓 𝑒𝑖 = 0. 𝜂(𝑧) 𝜂[𝑓𝑒(𝑥𝑖) − 𝑐𝑖] = 𝑒𝑖 , ∀𝑖, ∀𝑒 . ℱ 𝑃 ℱ 𝑃 𝑃𝑑𝑖𝑚(ℱ)
CompML Illustration of P-Shattering 𝑥1 𝑥2 𝑥3 𝑓 [01…1] 𝑓
[00…1] 𝑓 [11…0] 𝑐1 𝑐2 𝑐3 { 𝑓𝑒(𝑥𝑖) ≥ 𝑐𝑖 𝑖𝑓 𝑒𝑖 = 1, 𝑓𝑒(𝑥𝑖) < 𝑐𝑖 𝑖𝑓 𝑒𝑖 = 0.
CompML VC࣍ݩͱ -࣍ݩͷಉ݅ 𝑃 ิ1ɽ ʹ͍ͭͯɼҎԼͷΑ͏ʹ Λఆٛ͢Δɿ ͜ͷͱ͖ɼ ℱ =
{𝑓:𝑋 → [0,𝑅]} ¯ ℱ ¯ ℱ = { ¯ 𝑓(𝑥, 𝑐) = 𝜂[𝑓(𝑥) − 𝑐] :𝑓 ∈ ℱ} . 𝑃𝑑𝑖𝑚( ¯ ℱ) = 𝑉𝐶𝑑𝑖𝑚( ¯ ℱ) .
CompML The Fat-Shattering Dimension ఆٛɽʢFat-Shattering࣍ݩʣ Մଌۭؒ ͷ্ͷՄଌؔͷू߹Λ ͱ͢Δɽू߹ Ҏ Լ͕Γཱͭͱ͖෯
͓Αͼਫ਼ Ͱfat-shatteredͰ͋Δͱ͍͏ɿ ҙͷ2ϕΫτϧ ͱͦΕʹରԠ͢Δؔ ʹ͍ͭͯɼ ؔΫϥε ͷFat-Shattering࣍ݩ ʹΑͬͯfat-shatteredͱͳΔΑ͏ͳू߹ͷج ͷ࠷େͰఆٛ͞Εɼ ͱॻ͔ΕΔɽ (𝑋, 𝑆) ℱ ⊂ [0,𝑅] 𝑋 S = {x1 , …, xn } γ c 𝑒 ∈ {0,1}𝑛 𝑓𝑒 ∈ ℱ { fe (xi ) ≥ ci + γ if ei = 1, fe (xi ) < ci − γ if ei = 0. ℱ ℱ Fdim(ℱ, γ)
CompML VC Generalization Bound ఆཧɽظޡࠩ ͓Αͼܦݧޡࠩ ʹ͍ͭͯɼVC࣍ݩΛ ͱॻ͘ͱɼ ͕ຬ͞ΕΔɽ ൚Խޡ͕ࠩVC࣍ݩΛ༻͍ͯ͑ΒΕΔɽ
R(h) ̂ R(h) dVC R(h) − ̂ R(h) ≤ 8dVC(ln 2m dVC + 1) + 8 ln 4 δ m
CompML LemmaʢSymmetrizationʣ ิɽ ͱͳΔΑ͏ͳ ʹ͍ͭͯɼ ͕Γཱͭɽ͜͜Ͱ ؔͷظͱܦݧͷࠩɼಠཱʹಘΒΕͨೋछྨͷܦݧͷࠩͰ͑ΒΕΔɽ t ≥ 2/m
t > 0 P( sup f∈ℱ | f − ̂ f | ) ≤ 2P( sup f∈ℱ | ̂ f′ − ̂ f | ≥ t/2) f = 𝔼[ f ] ̂ f = 1 m m ∑ i=1 f(xi , yi ) ̂ f′ = 1 m m ∑ i=1 f(x′ i , y′ i )
CompML ࢀߟจݙ • Shalev-Shwartz, S., Ben-David, S. (2014). Understanding Machine
Learning - From Theory to Algorithms.. Cambridge University Press. ISBN: 978-1-10-705713-5 • Mohri, Mehryar, Afshin Rostamizadeh, and Ameet Talwalkar. Foundations of machine learning. MIT press, 2018.