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
ICLR2017読み会@DeNA/iclr2017atDeNA_VLAE
Search
Masaki Kozuki
June 17, 2017
Research
29k
2
Share
Embed
Copy iframe code
Copy JS code
Copy link
Start on current slide
ICLR2017読み会@DeNA/iclr2017atDeNA_VLAE
Masaki Kozuki
June 17, 2017
More Decks by Masaki Kozuki
See All by Masaki Kozuki
Sanity Checks for Saliency Maps explained in Japanese language
crcrpar
0
2.7k
Deep Learning for clothes and changing pose
crcrpar
0
930
夏のトップカンファレンス論文読み会 / InnovationMeetup20170918csn_cvpr2k17
crcrpar
3
1.5k
iclr読み会 / iclrjp2017vlae
crcrpar
3
1.1k
Other Decks in Research
See All in Research
重要だけど測れていないもの:高齢者ケアの見えない課題
theoriatec2024
0
460
シングルチャネルマルチトーカー音声認識の進展
ryomasumura
0
210
NII S. Koyama's Lab Research Overview AY2026
skoyamalab
0
490
Anthropic が提案する LLM の内部状態を自然言語で説明可能にした Natural Language Autoencoders / Natural Language Autoencoders Produce Unsupervised Explanations of LLM Activations
shunk031
0
160
長時間動画QAにおけるマルチエージェント推論 ・SVAgent: Storyline-Guided Long Video Understanding via Cross-Modal Multi-Agent Collaboration
murakawatakuya
1
180
研究室単位での自律的 IPv6接続性確立に向けたAS共同運用モデルの提案と実証
reokashiwa
PRO
0
190
Sequences of Logits Reveal the Low Rank Structure of Language Models
sansantech
PRO
1
300
AGI4OPT:自然言語から数理最適化を導くエ ージェントスキル Translating Human Intent into Mathematical Optimization
mickey_kubo
0
170
ScoreMatchingRiesz for Automatic Debiased Machine Learning and Policy Path Estimation with an Application to Japanese Monetary Policy Evaluation
masakat0
0
320
【ローカルAI LT大会】SSE: Stable Static Embedding ー速度低下を伴わず 静的埋め込みモデルの潜在能力を引き出す Dynamic Tanh手法の提案
rikkabotan7
0
110
AIで最適化を解けるか?
mickey_kubo
0
150
AY 2026 Guide to Academic Writing Using Generative AI - Workshop
ks91
PRO
0
150
Featured
See All Featured
Embracing the Ebb and Flow
colly
88
5.1k
Color Theory Basics | Prateek | Gurzu
gurzu
0
410
Why Your Marketing Sucks and What You Can Do About It - Sophie Logan
marketingsoph
0
370
More Than Pixels: Becoming A User Experience Designer
marktimemedia
3
480
Tell your own story through comics
letsgokoyo
1
1k
個人開発の失敗を避けるイケてる考え方 / tips for indie hackers
panda_program
123
22k
Optimizing for Happiness
mojombo
378
71k
Chrome DevTools: State of the Union 2024 - Debugging React & Beyond
addyosmani
10
1.3k
How Software Deployment tools have changed in the past 20 years
geshan
1
34k
Google's AI Overviews - The New Search
badams
0
1.1k
Visualizing Your Data: Incorporating Mongo into Loggly Infrastructure
mongodb
49
10k
Noah Learner - AI + Me: how we built a GSC Bulk Export data pipeline
techseoconnect
PRO
0
350
Transcript
Variational Lossy Autoencoder ICLR 2017 ಡΈձ @ DeNA @crcrpar 2017/6/17
1 / 25
จ • Variational Lossy Autoencoder • Xi Chen (UC Berkeley,
OpenAI), Diederik P. Kingma (OpenAI), Tim Salimans (OpenAI), et al. • දݱֶशͰજࡏมΛ׆༻͢Δ • Bits Back Coding Ͱ VAE ͷજࡏมʹ͍ͭͯͷߟ • જࡏมΛ lossy ʹ͢Δ • જࡏม z ͷ p(z), q(z|x) Λॊೈʹ • decoder ʹ PixelCNN 2 / 25
දهʹ͍ͭͯ • x ∈ Rd: σʔλ. x = ( x0
. . . xd )⊤ • x<i : x ͷ index ͕ i ະຬͷશཁૉ ( x0 . . . xi−1 )⊤ • z: જࡏม • pdata (x): σʔλΛੜ͢Δਅͷ • DKL (p∥q): p ͷ q ʹର͢Δ Kullback Leibler Divergence • θ: ϞσϧʢNNʣͷύϥϝʔλ • AR: PixelCNN ͳͲͷࣗݾճؼܕ NN • H, H: Τϯτϩϐʔ 3 / 25
VAE తؔ log p(X) = ∑ N i=1 log p(x(i))
࣮ࡍͷతؔ L(x; θ) = Eq(z|x) [log p(x|z) − DKL (q(z|x)∥p(z))] - ਖ਼نԽͨ͠ autoencoder ͱΈΕΔɻ VAE ͷ՝ɾऑ • දݱྗ͕ߴ͗͢Δ decoder જࡏมΛແࢹ • જࡏม͕ͭใΛཧͰ͖ͳ͍ 4 / 25
1 ͳͥʁ ײతʹ ཧʢBits Back Codingʣ 2 VLAE ֓ཁ Autoregressive
Flow decoder: PixelCNN 3 ࣮ݧɾ݁Ռ Lossy Comprssion Density Estimation 5 / 25
1 ͳͥʁ 2 VLAE 3 ࣮ݧɾ݁Ռ 6 / 25
ײతʹ... ͦͦɺRNN / AR ҙͷΛۙࣅͰ͖Δ 1 જࡏมʹใ͕΄ͱΜͲؚ·Εͳ͍ʢֶशॳظʣ 2 decoder σʔλΛ࠶ߏ͠Α͏ͱ͢Δ:
p(x|z) → pdecoder (x) 3 ࣄޙɾۙࣅࣄޙͱʹࣄલʹͳΔ p(z|x), q(z|x) → p(z) 7 / 25
গ͠ཧతʹ... VAE ≈ ූ߸Խ 1 σʔλͷຊ࣭ z Λූ߸Խ: p(z) 2
z ͷζϨΛූ߸Խ: p(x|z) ූ߸ͷ͞ʁ naive ʹ Cnaive (x) = Ex∼data,z∼q(z|x) [− log p(z) − log p(x|z)] Bits Back Coding ޮͷͨΊʹ encoder ͷ q(z|x) Λ༻͍Δ 8 / 25
Bits Back Coding q(z|x) ߴʑ H(q(z|x)) ϏοτͰใΛ͑ΒΕΔ ʢʣ ɿreceiver
q(z|x) ΛΈΕΔ߹ͷΈ Bits Back Coding ͷූ߸ Cnaive q(z|x) ͚ͩແବͰ L(x) = Eq(z|x) [log p(x|z) − log q(z|x)] ͳͷͰ CBitsBack (x) = Ex∼data [−L(x)] ≥ H(data) + Ex∼data [DKL (q(z|x)∥p(z|x))] 9 / 25
Bits Back Coding • ූ߸ͷ࠷খԽ = มԼքͷ࠷େԽ → z ͕ΘΕΔͷූ߸Խ͕ޮՌతͳ࣌
• ΑΓਖ਼֬ͳࣄޙʹΑΓมਪߴਫ਼ʹͳ Δ͕ɺݱ࣌Ͱଘࡏ͠ͳ͍ → DKL (≥ 0) ແࢹͰ͖ͳ͍ 10 / 25
Information Preference z ͕ແࢹ͞ΕΔͷ... p(x|z) ͕ pdata (x) Λz ͷใͳ͠ʹϞσϧԽͰ͖Δ߹
1 ࣄޙ pz|x) ͕ p(z) ʹͳΓɺ 2 ۙࣅࣄޙ q(z|x) p(z) ʹͳΔ ∵ KL ߲Λখ͘͢͞ΔͨΊ Information Preference • z ͳ͠ͰہॴతʹϞσϧԽͰ͖Δใہॴతʹ ූ߸Խ • ͦΕҎ֎ͷใ z Λͬͯ෮߸Խ જࡏมΛ hack ͢Δํ๏ɿ free bits, annealing the relative weight of DKL 11 / 25
1 ͳͥʁ 2 VLAE 3 ࣮ݧɾ݁Ռ 12 / 25
Ϟσϧͷ֓ཁ 1 ॊೈͳࣄલ 2 දݱྗͷ͋Δ decoder 13 / 25
ࣄલͷվળ • ٿ໘ΨεɾҰ༷͕ద͔ٙ • જࡏมͷ׆༻ʹෆՄܽ • → autoregressive flow 14
/ 25
Autoregressive Flow normalizing flows ʹ͍ͭͯ • ୯७ͳ͔ΒॊೈͳͷՄٯͳม • general normalizing
flow • volume preserving flow • Jacobian ͷѻ͍ʹҧ͍ AF ͷಛ IAF ͱಉ͡ܭࢉྔ͕ͩϞσϧ͕ΑΓਂ͍ 15 / 25
Inverse Autoregressive Flow zt = µt + σt ⊙ zt−1
log q(zT |x) = − D ∑ i=1 1 2 ϵ2 i + 1 2 log(2π) + T ∑ t=0 log σt,i ਤ 1: IAF ͷ֓ཁ 16 / 25
IAF posterior ॊೈͳࣄޙΛ֫ಘ͍ͯ͠Δʂ ਤ 2: IAF ͷࣄޙ 17 / 25
AF prior ≡ IAF posterior L(x; θ) = Ez∼q(z|x) [log
p(x|z) + log p(z) − log q(z|x)] = Ez∼q(z|x),ϵ=f−1(z) [ log p(x|f(ϵ)) + log u(ϵ) + log det dϵ dz − log q(z|x) ] = Ez∼q(z|x),ϵ=f−1(z) log p(x|f(ϵ)) + log u(ϵ) − ( log q(z|x) − log det dϵ dz ) IAF posterior 18 / 25
1 ͳͥʁ 2 VLAE 3 ࣮ݧɾ݁Ռ 19 / 25
࣮ݧ֓ཁ • త • જࡏม͕େҬతͳใΛ֫ಘ͍ͯ͠Δ͔ • AF prior ͕ IAF
posterior ΑΓ༏Ε͍ͯΔ͔ • AR decoder ʹΑΓີਪఆͷਫ਼্͕͕Δ͔ • ݕূϞσϧ: AF prior & PixelCNN decoder • σʔληοτ: 2 ͷ 28×28 ը૾ • MNIST, OMNIGLOT, Caltech - 101 Silhouettes • ΞʔΩςΫνϟɾજࡏมͷ࣍ݩ౷Ұ 20 / 25
Lossy Compression - MNIST ࠨɿೖྗɺӈɿग़ྗ • Ͳͷࣈ͔Θ͔Δ • ͨͩͷ࠶ߏͰͳ͍ ਤ
3: original & decompressed MNIST 21 / 25
Lossy Compression - OMNIGLOT ࠨɿೖྗɺӈɿग़ྗ • semantics ͕อଘ͞Ε ͍ͯͳ͍ •
λεΫɾσʔληοτ ͝ͱʹใΛಛఆ͢Δ ඞཁ ਤ 4: original & decompressed OMNIGLOT 22 / 25
જࡏม͔ΒͷαϯϓϦϯά • Սۭͷࣈ • େҬతͳಛ ਤ 5: VLAE ͔Βͷαϯϓϧ 23
/ 25
Density Estimation Unconditional Decoder γϯϓϧͳ PixelCNN 24 / 25
AF priorͷޮՌ • ີਪఆ͕վળ • AR ʹΑͬͯજࡏม ͷ࣋ͭใ͕૿Ճ ਤ 6:
AF prior ͷޮՌ 25 / 25