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
20190223_nlpaperchallenge_CV_4.3to5.5
Search
yoppe
February 23, 2019
Science
870
2
Share
Embed
Copy iframe code
Copy JS code
Copy link
Start on current slide
20190223_nlpaperchallenge_CV_4.3to5.5
Presentation at
https://nlpaper-challenge.connpass.com/event/118557/
.
yoppe
February 23, 2019
More Decks by yoppe
See All by yoppe
20211023_recsys2021_paper_reading_YoheiKikuta
diracdiego
1
520
20201121_oldpaperreading_computing_machinery_and_intelligence
diracdiego
0
190
20200906_ACL2020_metric_for_ordinal_classification_YoheiKikuta
diracdiego
1
1.4k
20191102_ACL2019_adversarial_examples_in_NLP_YoheiKIKUTA
diracdiego
2
1.5k
20180701_CVPR2018_reading_YoheiKIKUTA
diracdiego
3
1.3k
20180414_WSDM2018_reading_YoheiKIKUTA
diracdiego
0
750
20180306_NIPS2017_DeepLearning
diracdiego
4
6k
20180215_MLKitchen7_YoheiKIKUTA
diracdiego
0
490
20180210_Cookpad_TechConf2018_YoheiKIKUTA
diracdiego
5
1.3k
Other Decks in Science
See All in Science
知能とはなにか -ヒトとAIのあいだ-
tagtag
PRO
0
140
コーヒー豆様核 (Coffee-bean nuclei) における形態学的サブタイピングと精選・焙煎特性の同定
jagupath
PRO
0
140
テンソル分解を用いたVisiumデータの高精度・高速デコンボリューション手法
tagtag
PRO
0
110
20260220 OpenIDファウンデーション・ジャパン ご紹介 / 20260220 OpenID Foundation Japan Intro
oidfj
0
390
機械学習 - ニューラルネットワーク入門
trycycle
PRO
0
1.2k
ゲームと人工知能
miyayou
0
120
因果探索の発展と展望
sshimizu2006
2
870
LLMs vs Chess
ianozsvald
0
110
Bリーグのショットデータを活用した得点期待値モデルの構築 / Construction of expected points model using shot data of B.LEAGUE
konakalab
0
200
俺たちは本当に分かり合えるのか? ~ PdMとスクラムチームの “ずれ” を科学する
bonotake
3
2.6k
20251212_LT忘年会_データサイエンス枠_新川.pdf
shinpsan
0
320
機械学習 - pandas入門
trycycle
PRO
0
680
Featured
See All Featured
A Soul's Torment
seathinner
6
3.4k
Rails Girls Zürich Keynote
gr2m
96
14k
Into the Great Unknown - MozCon
thekraken
41
2.7k
Agile Leadership in an Agile Organization
kimpetersen
PRO
0
200
My Coaching Mixtape
mlcsv
0
240
Agile that works and the tools we love
rasmusluckow
331
22k
How to Build an AI Search Optimization Roadmap - Criteria and Steps to Take #SEOIRL
aleyda
1
2.1k
Why Mistakes Are the Best Teachers: Turning Failure into a Pathway for Growth
auna
0
200
From Legacy to Launchpad: Building Startup-Ready Communities
dugsong
0
300
Building Flexible Design Systems
yeseniaperezcruz
330
40k
Easily Structure & Communicate Ideas using Wireframe
afnizarnur
194
17k
Exploring the relationship between traditional SERPs and Gen AI search
raygrieselhuber
PRO
2
4.2k
Transcript
ୈ2ճ nlpaper.challenge NLP/CV ަྲྀษڧձ ը૾ೝࣝ ୈ4.3ষ~ୈ5.5ষ 20190223 Yohei KIKUTA
ࣗݾհ • Twitter ID @yohei_kikuta • Resume • ࠷ۙୀ৬ͯ͠ແ৬ʹͳΓ·ͨ͠ ϒϩάΤϯτϦ
ແ৬ͱͯ͠Έ͍ͨਓ͓͕͚͍ͩ͘͞ʂ ΫοΫύουྑ͍ձࣾͳͷͰస৬͍ͨ͠ਓͥͻͲ͏ͧʂ
ଟ༷ମֶश͚ͩৄ͘͠Γ·͢ • ը૾ೝࣝ ຊͷ 4.3~5.5 Λൃද • ہॴಛʹ͔ؔͯ͠ͳΓߴີͰ࣌ؒʹ͖͠Εͳ͍ ଟ༷ମֶश ΧʔωϧؔۙࣅʢಛʹͦͷͨΊͷجૅ͕ࣝॏ͍ʣ
ͦͷ΄͔༷ʑͳ • શମͷ·ͱΊͱུ֓Λہॴಛͷ෦Λܰ͘આ໌ͨ͠ޙɺଟ ༷ମֶशΛৄ͘͠આ໌ Q. ͳͥଟ༷ମֶशͳͷ͔ʁ A. ͕ࣗগ͠ਅ໘ʹษڧͯ͠Έ͔͔ͨͬͨΒ
4.3~4.6 ͷ·ͱΊ ہॴಛͰࣦΘΕۭͨؒใΛ༩ͨ͠Γ͢Δʢ4.6ʣ
5.1~5.5 ͷ·ͱΊ ʢ֬తʣޯ߱Լ๏χϡʔτϯ๏Ͱύϥϝλ w Λֶश
ہॴಛΛ༻͍ͨ࠶ߏங ͜Ε݁ہͲͷล͕ଟ༷ମͳͷ͔ʁ ͱ͍͏͕ฉ͖͑ͯͦ͜͏͕ͩɺͦΕޙͰগ͠ৄ͘͠આ໌
ಛࣸ૾ʹΑΔΧʔωϧͷۙࣅ ػցֶशʹଌ͍Δͷʁͱ͍͏ٙΛ࣋ͭਓ Mercer’s theorem ͱ͔ Bochner’s theorem ͱ͔Λݟ·͠ΐ͏
ۭؒใͷ׆༻ • ϓʔϦϯάʹΑࣦͬͯΘΕΔҐஔใΛखͰՃ͑Δ • ہॴهड़ࢠͷҐஔεέʔϧΛՃ͑Δ • ہॴهड़ࢠͷࣗݾ૬ؔߦྻͷཁૉΛՃ͑Δ • spatial pyramid
ϓʔϦϯάޙͷಛʹۭؒใΛ༩
ଟ༷ମֶश ଟ༷ମֶशʹͯ͠গ͠ৄ͘͠આ໌͢Δʢݸਓతڵຯʣ આ໌͢ΔͷҎԼͷτϐοΫɿ • ͦͦଟ༷ମͱʁʢֶతʹݫີͳ͠ͳ͍ʣ • ଟ༷ମֶशʹࢸΔϞνϕʔγϣϯ • Ұͭͷྫͱͯ͠ہॴ࠲ඪ coding
ͷվળͷจΛհ [140] K. Yu, T. Zhang. Improved local coordinate coding using local tangents. In ICML, 2010.
ଟ༷ମͱʁ ہॴతʹ Euclid ۭؒͰهड़Ͱ͖ΔਤΛషΓ߹ΘͤͯදͤΔ ྫʣද໘Λߟ͑Δ ※ Φ ͱ Θ ͚ͩͰ࠲ඪܥషΓ͖Εͳ͍ʢશͳٿͰͳ͍ʣ
ہॴతʢզʑͷৗεέʔϧʣʹ Euclid ࠲ඪͰهड़Ͱ͖Δ ͦͷ࠲ඪΛషΓ߹ΘͤΕද໘શମΛΧόʔͰ͖Δ ͦͷΑ͏ͳషΓ߹ΘͤͷใͰ 3 ࣍ݩͷٿͷใٞՄ
ଟ༷ମͱʁ σʔλͷॅΉۭؒಉ͡Α͏ͳͷͩͱ૾͞ΕΔ ͜ͷΑ͏ͳঢ়گͰɺྫ͑ೋؒͷڑΛଌΔͱ͖ʹߴ࣍ݩۭ ؒͰͷ Euclid ڑෆద͔͠Εͳ͍ → ଟ༷ମʹԊͬͯڑΛଌΔํ͕ੑ࣭Λଊ͑ΒΕͦ͏ʢଌઢʣ → ใزԿʹ͓͚Δࣗવޯ๏ͳͲ͜ΕΛ͍ͬͯΔ
ଟ༷ମֶशʹࢸΔಈػ • ࣍ݩͷढ͍ͷճආ ྫʣσʔλେྔʹ͋Ε kNN Ͱ͍͍͡ΌΜ → μϝͰ͢ • σʔλͷ༗͢ΔಛΛΑΓྑ͘Ѳ
ઌ΄ͲͷྫͷΑ͏ʹ୯ͳΔ Euclid ڑ͕ෆద͔͠Εͳ͍ ྫʣࣗવޯ๏ɺt-SNE • ༷ʑͳΞϓϩʔν͔Β৽ͨͳݟ͕ಘΒΕΔ͔ ඍزԿతͳΞϓϩʔνʢہॴతʣˠ େମͷͬͪ͜ Ґ૬زԿతͳΞϓϩʔνʢେҬతʣˠ ࠓ৮Εͳ͍
ʢิʣ࣍ݩͷढ͍ • ಛྔͷ࣍ݩ͕େ͖͗͢Δ߹ Ϟσϧ͕ෳࡶ͗ͯ͢దʹֶशͰ͖ͳ͍ • σʔλۭؒͷ࣍ݩ͕େ͖͗͢Δ߹ ྫͱͯ͠ΫϥελϦϯάΛߟ͑Δ ٿ໘ूதݱʹΑΓɺҟͳΔؒͷڑ͕͘͠ͳ͍ͬͯ͘ ݁Ռͱͯ͠ A
͔Βݟͯ B C ΄΅ಉ͡Ͱ۠ผෆՄ ʢ࣍ݩͷढ͍ͷ ͡Ίͯͷύλʔϯೝࣝ ͕ৄ͍͠ʣ
ଟ༷ମֶशͷྫ ہॴ࠲ඪ coding Λվળ͢Δ͜ͱΛߟ͑Δ K. Yu, T. Zhang. Improved local
coordinate coding using local tangents. In ICML, 2010. ࠷ऴతͳඪσʔλ͕͢ଟ༷ମͷࡏతͳ࣍ݩʢPCA Ͱٻ ΊΔʣΛߟྀ͠ɺͦͷใΛͬͯ coding Λิਖ਼
४උ
ہॴ࠲ඪ coding ʹΑΔۙࣅ
(4.79) ࣜͷূ໌
ہॴ࠲ඪ coding ͷֶश๏
֦ுہॴ࠲ඪ coding
σʔλଟ༷ମͷఆٛ
ہॴಛ coding with u ূ໌ུʢઌ΄Ͳͷূ໌͕͔ͬͯΕ͘͠ͳ͍ʣ u (local) PCA ͳͲͰٻΊɺm
खͰܾΊΔύϥϝλ c(M) ؔʹ͓͚ΔϦϓγοπఆʹ૬ ॏཁͳͷ c(M) ͕খ͍͞߹ʹ bound ͕Ωπ͘ͳΔͱ͍͏͜ͱ → ͜Εখ͞ͳྖҬͰσʔλଟ༷ମ͕ flat ͳߏͰ͋Δ߹ → “ఆੑత” ͳԾఆͰ flat Ͱͳͯ͘༗ޮͳ߹͋ΓಘΔ
ֶशΞϧΰϦζϜ จͷΞϧΰϦζϜࡌͤΔʢs, m hyperparameterʣ
࣮ݧ݁ՌɿMNIST Cross validation ʹΑΓ s = 0, m = 64
୯७ͳہॴಛ coding ͱൺΔͱ anchor ͕গͳͯ͘ྑ͍
࣮ݧ݁ՌɿCIFAR10 Cross validation ʹΑΓ s = 10, m = 256
ͪ͜Β anchor ͕গͳͯ͘ྑ͍݁ՌΛ͍ࣔͯ͠Δ
ଟ༷ମֶशʹཱͭ • σʔλͷߏΛ͏·͘ଊ͑ͯ༗༻ͳಛྔΛ࡞Εͨ • ہॴੑʹΛ͠ͳ͕Βߴ࣍ݩใΛ࣍ݩͰۙࣅ • ࣮ࡍʹࣝผੑೳ্͕ • σΟʔϓϥʔχϯάͰଟ༷ମֶशڵຯਂ͍τϐοΫ ใزԿ
ϦʔϚϯଟ༷ମ্ͰֶशΛఆࣜԽ …
4.3~4.6 ͷ·ͱΊʢ࠶ܝʣ ہॴಛͰࣦΘΕۭͨؒใΛ༩ͨ͠Γ͢Δʢ4.6ʣ