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
slides for MCMski 4 decompression seminar at CREST
Search
Xi'an
January 23, 2014
Research
9.2k
1
Share
Embed
Copy iframe code
Copy JS code
Copy link
Start on current slide
slides for MCMski 4 decompression seminar at CREST
the name says it all!
Xi'an
January 23, 2014
More Decks by Xi'an
See All by Xi'an
AISTATS 2014 / MLSS tutorial
xianblog
0
7.2k
Statistical frontiers, Warwick, Jan. 30, 2014
xianblog
0
3.2k
Mouna Berrada's presentation of Hartigan and Wong’s 1979 K-Means Clustering Algorithm paper in JRSS C.
xianblog
0
5.4k
R final exam (A), Université Paris-Dauphine, Jan. 18, 2014
xianblog
2
110
R final exam (B), Université Paris-Dauphine, Jan. 18, 2014
xianblog
0
83
Bayes 250 versus Bayes-2.5.0
xianblog
1
3k
slides of Anouar Seghir for the Reading Classics Seminar
xianblog
0
4k
BNP'ski: a satellite workshop to MCMSki IV, Jan. 9, 2014, Chamonix
xianblog
0
140
MCMSki IV, Jan. 6-8, 2014, Chamonix
xianblog
0
200
Other Decks in Research
See All in Research
AGI4OPT:自然言語から数理最適化を導くエ ージェントスキル Translating Human Intent into Mathematical Optimization
mickey_kubo
0
170
Unified Audio Source Separation (Defense Slides)
kohei_1979
1
640
某助成金プロジェクト採択に向けて企業研究所のアウトリーチ専任者がやったこと
afroscript
0
130
EIRによる不正端末のブロッキング 5G時代におけるデバイス識別と不正対策の進化
stellarcraft
0
110
SoftMatcha 2: 1兆語規模コーパスの超高速かつ柔らかい検索
e869120_sub
7
3.6k
論文紹介 "ReSim: Reliable World Simulation for Autonomous Driving"
kogo
0
720
Anthropic が提案する LLM の内部状態を自然言語で説明可能にした Natural Language Autoencoders / Natural Language Autoencoders Produce Unsupervised Explanations of LLM Activations
shunk031
0
160
National high-resolution cropland classification of Japan with agricultural census information and multi-temporal multi-modality datasets
satai
3
400
Using our influence and power for patient safety
helenbevan
0
380
全国町字単位空き家率推定データver1.0データ仕様
microbaseinc
0
160
2026年度 生成AI を活用した論文執筆ガイド/ワークショップ / 2026 Academic Year Guide to Writing Papers Using Generative AI - Workshop
ks91
PRO
0
200
Fukui Shibiten 39 - AI Art
butchi
0
160
Featured
See All Featured
Ruling the World: When Life Gets Gamed
codingconduct
0
290
The Pragmatic Product Professional
lauravandoore
37
7.4k
Navigating the Design Leadership Dip - Product Design Week Design Leaders+ Conference 2024
apolaine
1
380
How People are Using Generative and Agentic AI to Supercharge Their Products, Projects, Services and Value Streams Today
helenjbeal
1
260
Test your architecture with Archunit
thirion
1
2.3k
The agentic SEO stack - context over prompts
schlessera
0
860
svc-hook: hooking system calls on ARM64 by binary rewriting
retrage
2
430
Build The Right Thing And Hit Your Dates
maggiecrowley
39
3.4k
Bash Introduction
62gerente
615
220k
The #1 spot is gone: here's how to win anyway
tamaranovitovic
3
1.1k
Unsuck your backbone
ammeep
672
58k
GraphQLとの向き合い方2022年版
quramy
50
15k
Transcript
normal-normal problem z ∼ N(0, 1) θ|z ∼ N(z, 1)
corresponding Gibbs sampler 1. θ|z ∼ N(z, 1) mu.new <- rnorm(1, mean=z, sd=1) 2. z|θ ∼ N(θ/2, 1/2) 3. or z|θ ∼ N(0, 1) z <- rnorm(1, mean=0, sd=1)
normal-normal problem (2) in a cut model, the dependence of
z on θ is “cut” corresponding random-walk sampler 1. z ∼ N(0, 1) 2. θ|z, θt−1 ∼ MH(N(z, 1); θt−1) mu.new <- rnorm(1, mean=mu, sd=STEP) R <- dnorm(z, mean=mu.new, sd=1)/dnorm(z, mean=mu, ifelse(runif(1) < R, mu.new, mu) i.e. 1. zt ∼ N(0, 1) 2. propose η = θt−1 + εt 3. compute ρ = ϕ(η − zt)/ϕ(θt−1 − zt) 4. θt = ifelse(ut < ρ, η, θt−1)
normal-normal problem (2.5) in a cut model, the dependence of
z on θ is “cut” corresponding independence sampler 1. z ∼ N(0, 1) 2. θ|z, θt−1 ∼ MH(N(z, 1); θt−1) mu.new <- rnorm(1, mean=0, sd=SD) R <- (dnorm(mu, mean=0, sd=SD)*dnorm(z, mean=mu.new (dnorm(mu.new, mean=0, sd=SD)*dnorm(z, mean=mu, ifelse(runif(1) < R, mu.new, mu) i.e. 1. zt ∼ N(0, 1) 2. propose η ∼ N(1, 1) 3. compute ρ = ϕ(η − zt)/ϕ(θt−1 − zt) ϕ(η − 1)/ϕ(θt−1 − 1)
normal-normal problem (end) different stationary distributions
Poisson-binomial case use of π(φ|z)π(θ|φ, y) = π(φ)f (z|φ) m(z)
π(θ|φ)f (y|θ, φ) m(y|φ) instead of π(φ|z, y)π(θ|φ, y) ∝ π(φ)f (z|φ)π(θ|φ)f (y|θ, φ)