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
Sponsored
·
Your Podcast. Everywhere. Effortlessly.
Share. Educate. Inspire. Entertain. You do you. We'll handle the rest.
→
Masanari Kimura
March 05, 2021
Research
400
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
360
機械学習における重要度重み付けとその応用
mkimura
3
3.4k
Paper Intro: Human Rademacher Complexity
mkimura
0
230
On the principle of Invariant Risk Minimization
mkimura
0
390
論文紹介:Clustering with Bregman Divergences: an Asymptotic Analysis
mkimura
0
610
Generalization Bounds for Set-to-Set Matching with Negative Sampling
mkimura
0
190
論文紹介:On the Importance of Gradients for Detecting Distributional Shifts in the Wild
mkimura
2
890
論文紹介:Dangers of Bayesian Model Averaging under Covariate Shift
mkimura
0
380
Information Geometry of Dropout Training
mkimura
0
350
Other Decks in Research
See All in Research
重要だけど測れていないもの:高齢者ケアの見えない課題
theoriatec2024
0
320
衛星×エッジAI勉強会 衛星上におけるAI処理制約とそ取組について
satai
4
530
敵対生成プロンプト同時探索による内省型プロンプト最適化
kinoue_smarthr
0
130
「行ける・行けない表」による地域公共交通の性能評価
bansousha
0
160
英語教育 “研究” のあり方:学術知とアウトリーチの緊張関係
terasawat
1
990
ScoreMatchingRiesz for Automatic Debiased Machine Learning and Policy Path Estimation with an Application to Japanese Monetary Policy Evaluation
masakat0
0
290
都市交通マスタープランとその後への期待@熊本商工会議所・熊本経済同友会
trafficbrain
0
220
Model Discovery and Graph Simulation: A Lightweight Gateway to Chaos Engineering
anatolykr
0
190
Any-Optical-Model: A Universal Foundation Model for Optical Remote Sensing
satai
3
810
NII S. Koyama's Lab Research Overview AY2026
skoyamalab
0
280
第12回人と環境にやさしい交通をめざす全国大会/熊本都市圏「車1割削減、渋滞半減、公共交通2倍」をめざして
trafficbrain
0
110
2026-01-30-MandSL-textbook-jp-cos-lod
yegusa
1
1.3k
Featured
See All Featured
The #1 spot is gone: here's how to win anyway
tamaranovitovic
2
1.1k
Crafting Experiences
bethany
1
170
Chasing Engaging Ingredients in Design
codingconduct
0
210
Writing Fast Ruby
sferik
630
63k
brightonSEO & MeasureFest 2025 - Christian Goodrich - Winning strategies for Black Friday CRO & PPC
cargoodrich
3
720
10 Git Anti Patterns You Should be Aware of
lemiorhan
PRO
659
62k
Visualization
eitanlees
152
17k
So, you think you're a good person
axbom
PRO
2
2.1k
HU Berlin: Industrial-Strength Natural Language Processing with spaCy and Prodigy
inesmontani
PRO
0
400
Future Trends and Review - Lecture 12 - Web Technologies (1019888BNR)
signer
PRO
0
3.6k
YesSQL, Process and Tooling at Scale
rocio
174
15k
Claude Code どこまでも/ Claude Code Everywhere
nwiizo
65
56k
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.