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
第12回人と環境にやさしい交通をめざす全国大会/熊本都市圏「車1割削減、渋滞半減、公共交通2倍」をめざして
trafficbrain
0
110
老舗ものづくり企業でリサーチが変革を起こすまで - 三菱重工DXの実践
skydats
0
180
Unified Audio Source Separation (Defense Slides)
kohei_1979
1
610
typst の使い方:言語学を研究する学生のために
gitomochang
0
450
SOTAのさらに先へ:厳しい推論制約下での高性能モデルのPost-Training
analokmaus
0
1.2k
通時的な類似度行列に基づく単語の意味変化の分析
rudorudo11
0
310
LOSの検討(λ Kansai 2026 in Winter)
motopu
0
140
Dual Quadric表現を用いた動的物体追跡とRGB-D・IMU制約の密結合によるオドメトリ推定
nanoshimarobot
0
400
LLM Compute Infrastructure Overview
karakurist
2
1.4k
Using our influence and power for patient safety
helenbevan
0
360
ブレグマン距離最小化に基づくリース表現量推定:バイアス除去学習の統一理論
masakat0
0
280
COFFEE-Japan PROJECT Impact Report(海ノ向こうコーヒー)
ontheslope
0
1.8k
Featured
See All Featured
What’s in a name? Adding method to the madness
productmarketing
PRO
24
4.1k
Leading Effective Engineering Teams in the AI Era
addyosmani
9
2k
Thoughts on Productivity
jonyablonski
76
5.2k
Digital Ethics as a Driver of Design Innovation
axbom
PRO
1
300
How to Grow Your eCommerce with AI & Automation
katarinadahlin
PRO
1
200
Performance Is Good for Brains [We Love Speed 2024]
tammyeverts
12
1.7k
Navigating the moral maze — ethical principles for Al-driven product design
skipperchong
2
380
Lightning talk: Run Django tests with GitHub Actions
sabderemane
0
200
Reality Check: Gamification 10 Years Later
codingconduct
0
2.2k
[SF Ruby Conf 2025] Rails X
palkan
2
1.1k
Practical Orchestrator
shlominoach
191
11k
Raft: Consensus for Rubyists
vanstee
141
7.5k
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.