MCMC and Gibbs Sampling. Kayhan Batmanghelich
|
|
- William Wilkinson
- 6 years ago
- Views:
Transcription
1 MCMC and Gibbs Sampling Kayhan Batmanghelich 1
2 Approaches to inference l Exact inference algorithms l l l The elimination algorithm Message-passing algorithm (sum-product, belief propagation) The junction tree algorithms l Approximate inference techniques l l l Variational algorithms l l Loopy belief propagation Mean field approximation Stochastic simulation / sampling methods Markov chain Monte Carlo methods Eric CMU,
3 <latexit sha1_base64="fc+7qcw5lwx1mpkmfwp1fwazqck=">aaacf3icbva7t8mwghr4lvikmljyvejtuhkebayvklgyw4nqsk1uoy7twnuesh3ukprnspbxwbgasclgv8fpm0dlszzpd98n+86ngrxsml61pewv1bx10kz5c2t7z1ff278tucixsxdeit51kscmhsssvdlsjtlbgctixx1d537nnnbbo/bwpjfxajqiqu8xkkrq6yd2gotqdbpwpjo2zidxdtag7xoem1ts5phcgncm2aidx7cvv4y6mqvcjgzbkqbaq69/2v6ek4ceejmkrm80yulkieukgzmu7usqgoergpceoiekihcyabajpfakb/2iqxnkofv/b2qoecinxdwzxxdzxi7+5/us6v84gq3jrjiqzx7yewzlbpowoec5wzkliidmqforxeokwpgqy7iqwzypveis0/pl3wyfvzpxrrslcaioqbwy4bw0wq1oaqtg8aiewst40560f+1d+5inlmnfzgh4a+3zb6qhnxw=</latexit> <latexit sha1_base64="fc+7qcw5lwx1mpkmfwp1fwazqck=">aaacf3icbva7t8mwghr4lvikmljyvejtuhkebayvklgyw4nqsk1uoy7twnuesh3ukprnspbxwbgasclgv8fpm0dlszzpd98n+86ngrxsml61pewv1bx10kz5c2t7z1ff278tucixsxdeit51kscmhsssvdlsjtlbgctixx1d537nnnbbo/bwpjfxajqiqu8xkkrq6yd2gotqdbpwpjo2zidxdtag7xoem1ts5phcgncm2aidx7cvv4y6mqvcjgzbkqbaq69/2v6ek4ceejmkrm80yulkieukgzmu7usqgoergpceoiekihcyabajpfakb/2iqxnkofv/b2qoecinxdwzxxdzxi7+5/us6v84gq3jrjiqzx7yewzlbpowoec5wzkliidmqforxeokwpgqy7iqwzypveis0/pl3wyfvzpxrrslcaioqbwy4bw0wq1oaqtg8aiewst40560f+1d+5inlmnfzgh4a+3zb6qhnxw=</latexit> <latexit sha1_base64="fc+7qcw5lwx1mpkmfwp1fwazqck=">aaacf3icbva7t8mwghr4lvikmljyvejtuhkebayvklgyw4nqsk1uoy7twnuesh3ukprnspbxwbgasclgv8fpm0dlszzpd98n+86ngrxsml61pewv1bx10kz5c2t7z1ff278tucixsxdeit51kscmhsssvdlsjtlbgctixx1d537nnnbbo/bwpjfxajqiqu8xkkrq6yd2gotqdbpwpjo2zidxdtag7xoem1ts5phcgncm2aidx7cvv4y6mqvcjgzbkqbaq69/2v6ek4ceejmkrm80yulkieukgzmu7usqgoergpceoiekihcyabajpfakb/2iqxnkofv/b2qoecinxdwzxxdzxi7+5/us6v84gq3jrjiqzx7yewzlbpowoec5wzkliidmqforxeokwpgqy7iqwzypveis0/pl3wyfvzpxrrslcaioqbwy4bw0wq1oaqtg8aiewst40560f+1d+5inlmnfzgh4a+3zb6qhnxw=</latexit> <latexit sha1_base64="fc+7qcw5lwx1mpkmfwp1fwazqck=">aaacf3icbva7t8mwghr4lvikmljyvejtuhkebayvklgyw4nqsk1uoy7twnuesh3ukprnspbxwbgasclgv8fpm0dlszzpd98n+86ngrxsml61pewv1bx10kz5c2t7z1ff278tucixsxdeit51kscmhsssvdlsjtlbgctixx1d537nnnbbo/bwpjfxajqiqu8xkkrq6yd2gotqdbpwpjo2zidxdtag7xoem1ts5phcgncm2aidx7cvv4y6mqvcjgzbkqbaq69/2v6ek4ceejmkrm80yulkieukgzmu7usqgoergpceoiekihcyabajpfakb/2iqxnkofv/b2qoecinxdwzxxdzxi7+5/us6v84gq3jrjiqzx7yewzlbpowoec5wzkliidmqforxeokwpgqy7iqwzypveis0/pl3wyfvzpxrrslcaioqbwy4bw0wq1oaqtg8aiewst40560f+1d+5inlmnfzgh4a+3zb6qhnxw=</latexit> <latexit sha1_base64="c3pt6y845+h/bz9d9nfnvlv4uk8=">aaacbnicbvdlssnafj34rpuvdsniybhqpiqiqoci6mzlc8ywmlamk0k7ddijmxoxhozc+ctuxki49rvc+tdo2iy09cdlhs65l5l7/irrqszr21hyxfpewa2svdc3nre2zz3doxmnahmhxywwxr9jwignjqkkkw4icip8rjr+6lrwo/desbrzwzvoibehaachxuhpqw8eukfaohmvzqhjwnn94tjpru2iwuto982a1bamgppelkknlgj1zs83iheaea4wq1l2bctrxoaeopirvoqmkiqij9ca9dtlkclsyyz35pbikwemy6glkzhrf29kkjjyhpl6mkjqkge9qvzp66uqppcyypnuey6nd4upgyqgrsgwoijgxcaaicyo/iveq6sdutq6qg7bnj15njgnjyug3t6tna/kncpghxycordbgwicg9acdsdgetydv/bmpbkvxrvxmr1dmmqdpfahxucp+tmyra==</latexit> <latexit sha1_base64="c3pt6y845+h/bz9d9nfnvlv4uk8=">aaacbnicbvdlssnafj34rpuvdsniybhqpiqiqoci6mzlc8ywmlamk0k7ddijmxoxhozc+ctuxki49rvc+tdo2iy09cdlhs65l5l7/irrqszr21hyxfpewa2svdc3nre2zz3doxmnahmhxywwxr9jwignjqkkkw4icip8rjr+6lrwo/desbrzwzvoibehaachxuhpqw8eukfaohmvzqhjwnn94tjpru2iwuto982a1bamgppelkknlgj1zs83iheaea4wq1l2bctrxoaeopirvoqmkiqij9ca9dtlkclsyyz35pbikwemy6glkzhrf29kkjjyhpl6mkjqkge9qvzp66uqppcyypnuey6nd4upgyqgrsgwoijgxcaaicyo/iveq6sdutq6qg7bnj15njgnjyug3t6tna/kncpghxycordbgwicg9acdsdgetydv/bmpbkvxrvxmr1dmmqdpfahxucp+tmyra==</latexit> <latexit sha1_base64="c3pt6y845+h/bz9d9nfnvlv4uk8=">aaacbnicbvdlssnafj34rpuvdsniybhqpiqiqoci6mzlc8ywmlamk0k7ddijmxoxhozc+ctuxki49rvc+tdo2iy09cdlhs65l5l7/irrqszr21hyxfpewa2svdc3nre2zz3doxmnahmhxywwxr9jwignjqkkkw4icip8rjr+6lrwo/desbrzwzvoibehaachxuhpqw8eukfaohmvzqhjwnn94tjpru2iwuto982a1bamgppelkknlgj1zs83iheaea4wq1l2bctrxoaeopirvoqmkiqij9ca9dtlkclsyyz35pbikwemy6glkzhrf29kkjjyhpl6mkjqkge9qvzp66uqppcyypnuey6nd4upgyqgrsgwoijgxcaaicyo/iveq6sdutq6qg7bnj15njgnjyug3t6tna/kncpghxycordbgwicg9acdsdgetydv/bmpbkvxrvxmr1dmmqdpfahxucp+tmyra==</latexit> <latexit sha1_base64="c3pt6y845+h/bz9d9nfnvlv4uk8=">aaacbnicbvdlssnafj34rpuvdsniybhqpiqiqoci6mzlc8ywmlamk0k7ddijmxoxhozc+ctuxki49rvc+tdo2iy09cdlhs65l5l7/irrqszr21hyxfpewa2svdc3nre2zz3doxmnahmhxywwxr9jwignjqkkkw4icip8rjr+6lrwo/desbrzwzvoibehaachxuhpqw8eukfaohmvzqhjwnn94tjpru2iwuto982a1bamgppelkknlgj1zs83iheaea4wq1l2bctrxoaeopirvoqmkiqij9ca9dtlkclsyyz35pbikwemy6glkzhrf29kkjjyhpl6mkjqkge9qvzp66uqppcyypnuey6nd4upgyqgrsgwoijgxcaaicyo/iveq6sdutq6qg7bnj15njgnjyug3t6tna/kncpghxycordbgwicg9acdsdgetydv/bmpbkvxrvxmr1dmmqdpfahxucp+tmyra==</latexit> Recap: Rejection Sampling Steps: Find Q(x) that is easy to sample from. Find k such that k such that: P (x) kq(x) < 1 Sample auxiliary variable y P(y =1 x) = P (x) kq(x) accept the sample with probability P(y=1 x) 3
4 <latexit sha1_base64="8dao0lgvwvmig3thzz77mqexmxm=">aaace3icbvdlssnafj3uv62vqks3g0woccurqv0irrfcvjc20iqymu7aozmhmzfsevorbvwvny5u3lpx5984abpq1gmdh3pu5c45xiy4atp8ngoli0vlk8xv0tr6xuzwexvnxkwjpmymkyhkyyokcr4ygzgi1ooli4enwnmbxgv+84fjxapwdkyxcwpsc7npkqetdcphtkcg73np9bitdrgjeidjmxye86gn/erwedus9/rg4otouwlwzanwplfyuke5gp3yl9onabkwekggsrutmwy3jri4fwxcchlfykihpmfamoykympnj6hg+earxexhur8q8et9vzgsqklr4onjlika9tlxp6+dgh/mpjyme2ahnr7ye4ehwlldumsloybgmhaquf4rpn0icqxdy0mxym1gnif2ce28zt2evoqxertftif2urvz6btv0q1qibtr9iie0st6m56mf+pd+jiofox8zxf9gfh5a6e/nx0=</latexit> <latexit sha1_base64="8dao0lgvwvmig3thzz77mqexmxm=">aaace3icbvdlssnafj3uv62vqks3g0woccurqv0irrfcvjc20iqymu7aozmhmzfsevorbvwvny5u3lpx5984abpq1gmdh3pu5c45xiy4atp8ngoli0vlk8xv0tr6xuzwexvnxkwjpmymkyhkyyokcr4ygzgi1ooli4enwnmbxgv+84fjxapwdkyxcwpsc7npkqetdcphtkcg73np9bitdrgjeidjmxye86gn/erwedus9/rg4otouwlwzanwplfyuke5gp3yl9onabkwekggsrutmwy3jri4fwxcchlfykihpmfamoykympnj6hg+earxexhur8q8et9vzgsqklr4onjlika9tlxp6+dgh/mpjyme2ahnr7ye4ehwlldumsloybgmhaquf4rpn0icqxdy0mxym1gnif2ce28zt2evoqxertftif2urvz6btv0q1qibtr9iie0st6m56mf+pd+jiofox8zxf9gfh5a6e/nx0=</latexit> <latexit sha1_base64="8dao0lgvwvmig3thzz77mqexmxm=">aaace3icbvdlssnafj3uv62vqks3g0woccurqv0irrfcvjc20iqymu7aozmhmzfsevorbvwvny5u3lpx5984abpq1gmdh3pu5c45xiy4atp8ngoli0vlk8xv0tr6xuzwexvnxkwjpmymkyhkyyokcr4ygzgi1ooli4enwnmbxgv+84fjxapwdkyxcwpsc7npkqetdcphtkcg73np9bitdrgjeidjmxye86gn/erwedus9/rg4otouwlwzanwplfyuke5gp3yl9onabkwekggsrutmwy3jri4fwxcchlfykihpmfamoykympnj6hg+earxexhur8q8et9vzgsqklr4onjlika9tlxp6+dgh/mpjyme2ahnr7ye4ehwlldumsloybgmhaquf4rpn0icqxdy0mxym1gnif2ce28zt2evoqxertftif2urvz6btv0q1qibtr9iie0st6m56mf+pd+jiofox8zxf9gfh5a6e/nx0=</latexit> <latexit sha1_base64="8dao0lgvwvmig3thzz77mqexmxm=">aaace3icbvdlssnafj3uv62vqks3g0woccurqv0irrfcvjc20iqymu7aozmhmzfsevorbvwvny5u3lpx5984abpq1gmdh3pu5c45xiy4atp8ngoli0vlk8xv0tr6xuzwexvnxkwjpmymkyhkyyokcr4ygzgi1ooli4enwnmbxgv+84fjxapwdkyxcwpsc7npkqetdcphtkcg73np9bitdrgjeidjmxye86gn/erwedus9/rg4otouwlwzanwplfyuke5gp3yl9onabkwekggsrutmwy3jri4fwxcchlfykihpmfamoykympnj6hg+earxexhur8q8et9vzgsqklr4onjlika9tlxp6+dgh/mpjyme2ahnr7ye4ehwlldumsloybgmhaquf4rpn0icqxdy0mxym1gnif2ce28zt2evoqxertftif2urvz6btv0q1qibtr9iie0st6m56mf+pd+jiofox8zxf9gfh5a6e/nx0=</latexit> <latexit sha1_base64="9aljmpz0psa/aqahexhvmw1d3ke=">aaac0niclvlpb9mwfhyyykp8kndk8krvqbuuzeladpg0wyudh1yibfptry7rbfydx7odqzwxbulkx8enf4g/aqcnurdx4umrp3/f+/ls95xlzrsjol9buhxv/optnyedr4+fph3wff7is65qrwhckl6p0xxrypmgiwgg01opkc5ztk/y+ftgp7misrnkfdjlsaclphesyaqbt2xd3/20xoyiz+3idzzh8zfflhxbwihmbgoyn9fgwow6ox83c3t6z5men3cwjshfuqpq0abhzn50koq6zhhloes6krmmw0dh3sahg7+htevgrdlubocz1vvl1r4cxp7l187/cyhlur1ogk0c7ok4bt3uxijr/kxnfallkgzhwotjhekztvgzrjj1n6s1lzjm8tmdechwsfxurmbioo+zgrsv8p8wsgi3hraxwi/l3gc2a9c3tyb8lzaptxewtuzi2lbb1owkmoopobkwzjiixpclb5go5s8k5al7phn/ddq+cfhtk98fyd7wcbip3/ao37xd2egv0gs0qdhar8foaxqhbjfgffwf18hxmalt+c38vk4ng9bzet2i8mcfl1zdig==</latexit> <latexit sha1_base64="9aljmpz0psa/aqahexhvmw1d3ke=">aaac0niclvlpb9mwfhyyykp8kndk8krvqbuuzeladpg0wyudh1yibfptry7rbfydx7odqzwxbulkx8enf4g/aqcnurdx4umrp3/f+/ls95xlzrsjol9buhxv/optnyedr4+fph3wff7is65qrwhckl6p0xxrypmgiwgg01opkc5ztk/y+ftgp7misrnkfdjlsaclphesyaqbt2xd3/20xoyiz+3idzzh8zfflhxbwihmbgoyn9fgwow6ox83c3t6z5men3cwjshfuqpq0abhzn50koq6zhhloes6krmmw0dh3sahg7+htevgrdlubocz1vvl1r4cxp7l187/cyhlur1ogk0c7ok4bt3uxijr/kxnfallkgzhwotjhekztvgzrjj1n6s1lzjm8tmdechwsfxurmbioo+zgrsv8p8wsgi3hraxwi/l3gc2a9c3tyb8lzaptxewtuzi2lbb1owkmoopobkwzjiixpclb5go5s8k5al7phn/ddq+cfhtk98fyd7wcbip3/ao37xd2egv0gs0qdhar8foaxqhbjfgffwf18hxmalt+c38vk4ng9bzet2i8mcfl1zdig==</latexit> <latexit sha1_base64="9aljmpz0psa/aqahexhvmw1d3ke=">aaac0niclvlpb9mwfhyyykp8kndk8krvqbuuzeladpg0wyudh1yibfptry7rbfydx7odqzwxbulkx8enf4g/aqcnurdx4umrp3/f+/ls95xlzrsjol9buhxv/optnyedr4+fph3wff7is65qrwhckl6p0xxrypmgiwgg01opkc5ztk/y+ftgp7misrnkfdjlsaclphesyaqbt2xd3/20xoyiz+3idzzh8zfflhxbwihmbgoyn9fgwow6ox83c3t6z5men3cwjshfuqpq0abhzn50koq6zhhloes6krmmw0dh3sahg7+htevgrdlubocz1vvl1r4cxp7l187/cyhlur1ogk0c7ok4bt3uxijr/kxnfallkgzhwotjhekztvgzrjj1n6s1lzjm8tmdechwsfxurmbioo+zgrsv8p8wsgi3hraxwi/l3gc2a9c3tyb8lzaptxewtuzi2lbb1owkmoopobkwzjiixpclb5go5s8k5al7phn/ddq+cfhtk98fyd7wcbip3/ao37xd2egv0gs0qdhar8foaxqhbjfgffwf18hxmalt+c38vk4ng9bzet2i8mcfl1zdig==</latexit> <latexit sha1_base64="9aljmpz0psa/aqahexhvmw1d3ke=">aaac0niclvlpb9mwfhyyykp8kndk8krvqbuuzeladpg0wyudh1yibfptry7rbfydx7odqzwxbulkx8enf4g/aqcnurdx4umrp3/f+/ls95xlzrsjol9buhxv/optnyedr4+fph3wff7is65qrwhckl6p0xxrypmgiwgg01opkc5ztk/y+ftgp7misrnkfdjlsaclphesyaqbt2xd3/20xoyiz+3idzzh8zfflhxbwihmbgoyn9fgwow6ox83c3t6z5men3cwjshfuqpq0abhzn50koq6zhhloes6krmmw0dh3sahg7+htevgrdlubocz1vvl1r4cxp7l187/cyhlur1ogk0c7ok4bt3uxijr/kxnfallkgzhwotjhekztvgzrjj1n6s1lzjm8tmdechwsfxurmbioo+zgrsv8p8wsgi3hraxwi/l3gc2a9c3tyb8lzaptxewtuzi2lbb1owkmoopobkwzjiixpclb5go5s8k5al7phn/ddq+cfhtk98fyd7wcbip3/ao37xd2egv0gs0qdhar8foaxqhbjfgffwf18hxmalt+c38vk4ng9bzet2i8mcfl1zdig==</latexit> <latexit sha1_base64="bb77uxzkemvnag7tr19p+0k1rj0=">aaadghiclvjbb9mwfhytycnc1sejl0eusu0dxykqbkivjnjhyq+trnm0posc19msookxo9aq+hfwv3jjzyccs6v23csswt7+vvodm04oojpkdf+2lpvbw0d7+4+dj0+fpt9oh774ltm8i3rcup5m5ygwlloethrtnj6ljoi45pqsxhwp+bmfnjmstb6placzgf8llgiekwmfh63fxt/g6jomi5huryber2ufhubhgsafrxif05jy9nwxgjcpon2lqmarxarj8leqwbps3d1dngrwzr4hvif0oz2uzxivlceychc9jfiwywylfgvk0maj/t9uf9bws8zr5x1uoj2dsrybwndu+et+r0ulub29rez8cq2191gzo6x1br96+vj0nflnwin2xx241yfdw2umdmrokgj/8ecpywoakmkxlfppfwpw4ewxwqnppzduyllav3rqzathvm6kaom0da0yhyjnze0uvoimoscxlks4nj7ltsjbxanexu1zfx2yfswruaijqrnfoqevqrmomgczjyqvjifjxkytqk6xmaays+uyixi3w941ju8ghwfe+h3n5hmzjx30cr1gpeshy3scvqirmids+me9sd5aa9u2+/ar7dwuvqvrverbx/70h1kefyw=</latexit> <latexit sha1_base64="bb77uxzkemvnag7tr19p+0k1rj0=">aaadghiclvjbb9mwfhytycnc1sejl0eusu0dxykqbkivjnjhyq+trnm0posc19msookxo9aq+hfwv3jjzyccs6v23csswt7+vvodm04oojpkdf+2lpvbw0d7+4+dj0+fpt9oh774ltm8i3rcup5m5ygwlloethrtnj6ljoi45pqsxhwp+bmfnjmstb6placzgf8llgiekwmfh63fxt/g6jomi5huryber2ufhubhgsafrxif05jy9nwxgjcpon2lqmarxarj8leqwbps3d1dngrwzr4hvif0oz2uzxivlceychc9jfiwywylfgvk0maj/t9uf9bws8zr5x1uoj2dsrybwndu+et+r0ulub29rez8cq2191gzo6x1br96+vj0nflnwin2xx241yfdw2umdmrokgj/8ecpywoakmkxlfppfwpw4ewxwqnppzduyllav3rqzathvm6kaom0da0yhyjnze0uvoimoscxlks4nj7ltsjbxanexu1zfx2yfswruaijqrnfoqevqrmomgczjyqvjifjxkytqk6xmaays+uyixi3w941ju8ghwfe+h3n5hmzjx30cr1gpeshy3scvqirmids+me9sd5aa9u2+/ar7dwuvqvrverbx/70h1kefyw=</latexit> <latexit sha1_base64="bb77uxzkemvnag7tr19p+0k1rj0=">aaadghiclvjbb9mwfhytycnc1sejl0eusu0dxykqbkivjnjhyq+trnm0posc19msookxo9aq+hfwv3jjzyccs6v23csswt7+vvodm04oojpkdf+2lpvbw0d7+4+dj0+fpt9oh774ltm8i3rcup5m5ygwlloethrtnj6ljoi45pqsxhwp+bmfnjmstb6placzgf8llgiekwmfh63fxt/g6jomi5huryber2ufhubhgsafrxif05jy9nwxgjcpon2lqmarxarj8leqwbps3d1dngrwzr4hvif0oz2uzxivlceychc9jfiwywylfgvk0maj/t9uf9bws8zr5x1uoj2dsrybwndu+et+r0ulub29rez8cq2191gzo6x1br96+vj0nflnwin2xx241yfdw2umdmrokgj/8ecpywoakmkxlfppfwpw4ewxwqnppzduyllav3rqzathvm6kaom0da0yhyjnze0uvoimoscxlks4nj7ltsjbxanexu1zfx2yfswruaijqrnfoqevqrmomgczjyqvjifjxkytqk6xmaays+uyixi3w941ju8ghwfe+h3n5hmzjx30cr1gpeshy3scvqirmids+me9sd5aa9u2+/ar7dwuvqvrverbx/70h1kefyw=</latexit> <latexit sha1_base64="bb77uxzkemvnag7tr19p+0k1rj0=">aaadghiclvjbb9mwfhytycnc1sejl0eusu0dxykqbkivjnjhyq+trnm0posc19msookxo9aq+hfwv3jjzyccs6v23csswt7+vvodm04oojpkdf+2lpvbw0d7+4+dj0+fpt9oh774ltm8i3rcup5m5ygwlloethrtnj6ljoi45pqsxhwp+bmfnjmstb6placzgf8llgiekwmfh63fxt/g6jomi5huryber2ufhubhgsafrxif05jy9nwxgjcpon2lqmarxarj8leqwbps3d1dngrwzr4hvif0oz2uzxivlceychc9jfiwywylfgvk0maj/t9uf9bws8zr5x1uoj2dsrybwndu+et+r0ulub29rez8cq2191gzo6x1br96+vj0nflnwin2xx241yfdw2umdmrokgj/8ecpywoakmkxlfppfwpw4ewxwqnppzduyllav3rqzathvm6kaom0da0yhyjnze0uvoimoscxlks4nj7ltsjbxanexu1zfx2yfswruaijqrnfoqevqrmomgczjyqvjifjxkytqk6xmaays+uyixi3w941ju8ghwfe+h3n5hmzjx30cr1gpeshy3scvqirmids+me9sd5aa9u2+/ar7dwuvqvrverbx/70h1kefyw=</latexit> Recap: Importance Sampling Previous slide assumed we could evaluate P (x) = P (x)/z P Z E x p [f(x)] = x f(x)p(x) = Rx f(x) p(x) q(x) q(x) R x p(x) q(x) q(x) Let! ",,! % be samples from q(x). Z f(x)p(x) x Pl f(xl ) p(xl ) q(x l ) P l p(x l ) q(x l ) = LX f(x l )w l l=1 4
5 Recap: Particle Filters Apply the importance sampling to a temporal distribution!(# $:& ) General idea, change the proposal in each step: ( # & # $:& ) The recursion rule: Forward message: 5
6 Summary so far General ideas for the sampling approaches Proposal distribution (q(x)): Use another distribution to sample from. Change the proposal distribution with the iterations. Introduce an auxiliary variable to decide keeping a sample or not. Why should we discard samples? Sampling from high-dimension is difficult. Let s incorporate the graphical model into our sampling strategy. Can we use the gradient of the p(x)? 6
7 Summary so far General ideas for the sampling approaches Proposal distribution (q(x)): Use another distribution to sample from. Change the proposal distribution with the iterations. Introduce an auxiliary variable to decide keeping a sample or not. Why should we discard samples? Sampling from high-dimension is difficult. Let s incorporate the graphical model into our sampling strategy. Can we use the gradient of the p(x)? 7
8 <latexit sha1_base64="wbxyijmaiemebe6qqkqhmxzfhpu=">aaacahicbzdnssnafivv6l+tf1e3gpvbirgqiqjqqii6csnumlbqhjkzttqhk0mymrrkqbtfxy0lfbc+hjvfxmkbufspdhycey937gkszpr2nc+rslc4tlxsxc2trw9sbtnbo/cqtiwhhol5lbsbvpqzqt3nnkenrficbzzwg/7vuf4fuklylo70mkf+hluchyxgbay2vxedbu2sxusohyn08cntu+xuninqplg5lcfxrw1/tjoxssmqnofyqabrjnrpsnsmcdoqtvjfe0z6ueubbgwoqpkzyqujdgicdgpjaz7qaol+nshwpnqwckxnhhvpzdbg5n+1zqrdmz9jikk1fws6kew50jeax4e6tfki+daajpkzvylswxitbuirmrdc2zpnwtuunffc25ny9tjpowj7cabh4mipvoeaauabgqd4ghd4tr6tz+vnep+2fqx8zhf+ypr4bhbolt8=</latexit> <latexit sha1_base64="wbxyijmaiemebe6qqkqhmxzfhpu=">aaacahicbzdnssnafivv6l+tf1e3gpvbirgqiqjqqii6csnumlbqhjkzttqhk0mymrrkqbtfxy0lfbc+hjvfxmkbufspdhycey937gkszpr2nc+rslc4tlxsxc2trw9sbtnbo/cqtiwhhol5lbsbvpqzqt3nnkenrficbzzwg/7vuf4fuklylo70mkf+hluchyxgbay2vxedbu2sxusohyn08cntu+xuninqplg5lcfxrw1/tjoxssmqnofyqabrjnrpsnsmcdoqtvjfe0z6ueubbgwoqpkzyqujdgicdgpjaz7qaol+nshwpnqwckxnhhvpzdbg5n+1zqrdmz9jikk1fws6kew50jeax4e6tfki+daajpkzvylswxitbuirmrdc2zpnwtuunffc25ny9tjpowj7cabh4mipvoeaauabgqd4ghd4tr6tz+vnep+2fqx8zhf+ypr4bhbolt8=</latexit> <latexit sha1_base64="wbxyijmaiemebe6qqkqhmxzfhpu=">aaacahicbzdnssnafivv6l+tf1e3gpvbirgqiqjqqii6csnumlbqhjkzttqhk0mymrrkqbtfxy0lfbc+hjvfxmkbufspdhycey937gkszpr2nc+rslc4tlxsxc2trw9sbtnbo/cqtiwhhol5lbsbvpqzqt3nnkenrficbzzwg/7vuf4fuklylo70mkf+hluchyxgbay2vxedbu2sxusohyn08cntu+xuninqplg5lcfxrw1/tjoxssmqnofyqabrjnrpsnsmcdoqtvjfe0z6ueubbgwoqpkzyqujdgicdgpjaz7qaol+nshwpnqwckxnhhvpzdbg5n+1zqrdmz9jikk1fws6kew50jeax4e6tfki+daajpkzvylswxitbuirmrdc2zpnwtuunffc25ny9tjpowj7cabh4mipvoeaauabgqd4ghd4tr6tz+vnep+2fqx8zhf+ypr4bhbolt8=</latexit> <latexit sha1_base64="wbxyijmaiemebe6qqkqhmxzfhpu=">aaacahicbzdnssnafivv6l+tf1e3gpvbirgqiqjqqii6csnumlbqhjkzttqhk0mymrrkqbtfxy0lfbc+hjvfxmkbufspdhycey937gkszpr2nc+rslc4tlxsxc2trw9sbtnbo/cqtiwhhol5lbsbvpqzqt3nnkenrficbzzwg/7vuf4fuklylo70mkf+hluchyxgbay2vxedbu2sxusohyn08cntu+xuninqplg5lcfxrw1/tjoxssmqnofyqabrjnrpsnsmcdoqtvjfe0z6ueubbgwoqpkzyqujdgicdgpjaz7qaol+nshwpnqwckxnhhvpzdbg5n+1zqrdmz9jikk1fws6kew50jeax4e6tfki+daajpkzvylswxitbuirmrdc2zpnwtuunffc25ny9tjpowj7cabh4mipvoeaauabgqd4ghd4tr6tz+vnep+2fqx8zhf+ypr4bhbolt8=</latexit> Random Walks of the Annoying Fly Room 1 Room 2 Room 3 p(x t+1 = i x t = j) =M ij Stationary distribution: Mv 1 = v 1 Eigen vector of the Markov matrix
9 Exploiting the structure GIBBS SAMPLING 9
10 Gibbs Sampling Sample one (block of) variable at the time x 2 p(x) x (t+1) x (t) p(x P (x) 1 x (t) 2 ) a) x 1 ( 10
11 Gibbs Sampling x 2 p(x) x (t+2) x (t+1) P (x) p(x 2 x (t+1) x (t) 1 ) a) x 1 ( 11
12 Gibbs Sampling x 2 p(x) x (t+2) x (t+1) x (t+3) x (t+4) x (t) P (x) a) x 1 ( 12
13 Gibbs Sampling Link:
14 Figure from Jordan Ch. 21 Ingredients for Gibb Recipe Full conditionals only need to condition on the Markov Blanket MRF Bayes Net Must be easy to sample from conditionals 14
15 Gibbs Sampling Sample one (block of) variable at the time Easy to compute The proposal distribution: Markov Blanket Make sure other variables do not change Choose one of the variables randomly with probability q(i) 15
16 Figure from Jordan Ch. 21 Again. Full conditionals only need to condition on the Markov Blanket MRF Bayes Net Must be easy to sample from conditionals Many conditionals are log-concave and are amenable to adaptive rejection sampling 16
17 Whiteboard Gibbs Sampling as M-H 17
18 Case Study: LDA 18
19 Bayesian Approach LDA Inference Dirichlet Document-specific topic distribution m Topic Dirichlet Topic Intractable assignment z mn Exact Inference? Observed word x mn k N m M K 19
20 LDA Inference Explicit Gibbs Sampler Dirichlet Document-specific topic distribution m Topic Dirichlet Topic assignment z mn Sampled Observed word x mn k N m M K 20
21 LDA Inference Collapsed Gibbs Sampler Dirichlet Document-specific topic distribution m Topic Dirichlet Integrated out Topic assignment z mn Sampled Observed word x mn k N m K M 21
22 Goal: Sampling Draw samples from the posterior p(z X,, ) Integrate out topics ϕ and document-specific distribution over topics θ Algorithm: While not done For each document, m: For each word, n:» Resample a single topic assignment using the full conditionals for z mn 22
23 Sampling What queries can we answer with samples of! "#? Mean of z mn Mode of z mn Estimate posterior over z mn Estimate of topics ϕ and document-specific distribution over topics θ 23
24 <latexit sha1_base64="hfiqb911fmjq3kvk18jsqedtuia=">aaaconicbvfda9swfjw9bu3sfwtb414udywuzceehw0pg9lbkpshkwvaqjwzwzybtbikjhk09fzh9jp21n9t2fega3zb6hdpuufsuai4mzyi7jz/0cbjj5tbtzvbz56/enl99frcyeitoiassz1jskgcctq2zhi6uzripoh0irn+wvmxp6k2tiozu1b0lunlwtjgshwtuptb9w9jbl/gcn7bbvy+z9vgmoaiczxhbk+oxxsqks2vlrblgpns1llbvfwj7n/ebk+cd0tdvqlachmrvnqghrolaqccdzp0r0lz6iply7cqgonwvbvf3v4wdjqcdrc2oifagsxdp1eqszftyqnhxkzdqnlzibvlhnoqexwgkkyu8swdoihwts2sbdkuynd1usikdktyalqreyxojvnkivpm2m7nq65u/o+bfjb7ncuzuiwlgiwpygoolu76wyblmhllfw5gopm7k5a5dhfa960df0l48mnrypxh+hkynu73dg7bnlbqw7sd+iheh9ebokijnebea++bd+kn/f3/2d/1vy+lvtfoveh/lb/dazayybg=</latexit> <latexit sha1_base64="hfiqb911fmjq3kvk18jsqedtuia=">aaaconicbvfda9swfjw9bu3sfwtb414udywuzceehw0pg9lbkpshkwvaqjwzwzybtbikjhk09fzh9jp21n9t2fega3zb6hdpuufsuai4mzyi7jz/0cbjj5tbtzvbz56/enl99frcyeitoiassz1jskgcctq2zhi6uzripoh0irn+wvmxp6k2tiozu1b0lunlwtjgshwtuptb9w9jbl/gcn7bbvy+z9vgmoaiczxhbk+oxxsqks2vlrblgpns1llbvfwj7n/ebk+cd0tdvqlachmrvnqghrolaqccdzp0r0lz6iply7cqgonwvbvf3v4wdjqcdrc2oifagsxdp1eqszftyqnhxkzdqnlzibvlhnoqexwgkkyu8swdoihwts2sbdkuynd1usikdktyalqreyxojvnkivpm2m7nq65u/o+bfjb7ncuzuiwlgiwpygoolu76wyblmhllfw5gopm7k5a5dhfa960df0l48mnrypxh+hkynu73dg7bnlbqw7sd+iheh9ebokijnebea++bd+kn/f3/2d/1vy+lvtfoveh/lb/dazayybg=</latexit> <latexit sha1_base64="hfiqb911fmjq3kvk18jsqedtuia=">aaaconicbvfda9swfjw9bu3sfwtb414udywuzceehw0pg9lbkpshkwvaqjwzwzybtbikjhk09fzh9jp21n9t2fega3zb6hdpuufsuai4mzyi7jz/0cbjj5tbtzvbz56/enl99frcyeitoiassz1jskgcctq2zhi6uzripoh0irn+wvmxp6k2tiozu1b0lunlwtjgshwtuptb9w9jbl/gcn7bbvy+z9vgmoaiczxhbk+oxxsqks2vlrblgpns1llbvfwj7n/ebk+cd0tdvqlachmrvnqghrolaqccdzp0r0lz6iply7cqgonwvbvf3v4wdjqcdrc2oifagsxdp1eqszftyqnhxkzdqnlzibvlhnoqexwgkkyu8swdoihwts2sbdkuynd1usikdktyalqreyxojvnkivpm2m7nq65u/o+bfjb7ncuzuiwlgiwpygoolu76wyblmhllfw5gopm7k5a5dhfa960df0l48mnrypxh+hkynu73dg7bnlbqw7sd+iheh9ebokijnebea++bd+kn/f3/2d/1vy+lvtfoveh/lb/dazayybg=</latexit> <latexit sha1_base64="hfiqb911fmjq3kvk18jsqedtuia=">aaaconicbvfda9swfjw9bu3sfwtb414udywuzceehw0pg9lbkpshkwvaqjwzwzybtbikjhk09fzh9jp21n9t2fega3zb6hdpuufsuai4mzyi7jz/0cbjj5tbtzvbz56/enl99frcyeitoiassz1jskgcctq2zhi6uzripoh0irn+wvmxp6k2tiozu1b0lunlwtjgshwtuptb9w9jbl/gcn7bbvy+z9vgmoaiczxhbk+oxxsqks2vlrblgpns1llbvfwj7n/ebk+cd0tdvqlachmrvnqghrolaqccdzp0r0lz6iply7cqgonwvbvf3v4wdjqcdrc2oifagsxdp1eqszftyqnhxkzdqnlzibvlhnoqexwgkkyu8swdoihwts2sbdkuynd1usikdktyalqreyxojvnkivpm2m7nq65u/o+bfjb7ncuzuiwlgiwpygoolu76wyblmhllfw5gopm7k5a5dhfa960df0l48mnrypxh+hkynu73dg7bnlbqw7sd+iheh9ebokijnebea++bd+kn/f3/2d/1vy+lvtfoveh/lb/dazayybg=</latexit> Gibbs Sampling for LDA Full conditionals p(z i = j z i,x,, ) / n(x i) i,j + n ( ) i,j + T (d n i ) i,j + n (d i) i, + K n (x i) i,j n ( ) i,j n (d i) i,j n (d i) i, the number of instances of word! " assigned to topic j, not including current word. total number of words assigned to topic j, not including the current one. the number of words for document # " assigned to topic j. total number of words in the document # " not including the current one. Link: 24
25 Gibbs Sampling for LDA Sketch of the derivation of the full conditionals p(z i = k Z i,x,, ) = p(x, Z, ) p(x, Z i, ) p(x, Z, ) = p(x Z, )p(z ) = p(x Z, )p( ) d = K k=1 B( n k + ) B( ) + p(z i = j z i,x,, ) / n(x i) i,j + n ( ) i,j + T n M m=1 p(z )p( ) d B( n m + ) B( ) + i,j + (d i ) n (d i) i, + K 25
26 Definitions and Theoretical Justification for MCMC MARKOV CHAINS 28
27 MCMC Goal: Draw approximate, correlated samples from a target distribution p(x) MCMC: Performs a biased random walk to explore the distribution 29
28 Simulations of MCMC Visualization of Metroplis-Hastings, Gibbs Sampling, and Hamiltonian MCMC: 30
29 Metropolis-Hastings Sampling Consider this mixturefor the proposal Stay where you are Or. Sample from a distribution depends on current location (x) Of course! It should be a proper density! Choose between those options with a probability that depends on a proposed point and current point (0 # $ %, $ 1) 31
30 Metropolis-Hastings Sampling Consider this mixturefor the proposal Is it a proper density? 32
31 Metropolis-Hastings Sampling Consider this mixturefor the proposal How to choose!(#, #) and '((# ) #)? p(x) must be the Stationary distribution 33
32 Designing!(# $, #) MH acceptance function: 34
33 Designing!(# $, #) MH acceptance function: Detailed Balance: 35
34 Detailed Balance Detailed balance means that, for each pair of states x and x, arriving at x then x and arriving at x then x are equiprobable. x x x' x' 36
35 Figure from Bishop (2006) A choice for!(# #) For Metropolis-Hastings, a generic proposal distribution is: If ϵ is large, many rejections If ϵ is small, slow mixing q(x x (t) )=N (0, 2 ) max p(x) min q(x x (t) ) 37
36 Figure from Bishop (2006) A choice for!(# #) For Rejection Sampling, the accepted samples are are independent But for Metropolis-Hastings, the samples are correlated Question: How long must we wait to get effectively independent samples? min max q(x x (t) ) p(x) A: independent states in the M-H random walk are separated by roughly steps ( max / min ) 2 38
37 Metropolis-Hastings Algorithm 39
38 Practical Issues Question: Is it better to move along one dimension or many? Answer: For Metropolis-Hasings, it is sometimes better to sample one dimension at a time Q: Given a sequence of 1D proposals, compare rate of movement for one-at-a-time vs. concatenation. Answer: For Gibbs Sampling, sometimes better to sample a block of variables at a time Q: When is it tractable to sample a block of variables? 42
39 Practical Issues Question: How do we assess convergence of the Markov chain? Answer: It s not easy! Compare statistics of multiple independent chains Ex: Compare log-likelihoods Chain 1 Chain 2 Log-likelihood Log-likelihood # of MCMC steps # of MCMC steps 43
40 Practical Issues Question: How do we assess convergence of the Markov chain? Answer: It s not easy! Compare statistics of multiple independent chains Ex: Compare log-likelihoods Chain 1 Chain 2 Log-likelihood Log-likelihood # of MCMC steps # of MCMC steps 44
41 Practical Issues Question: Is one long Markov chain better than many short ones? Note: typical to discard initial samples (aka. burnin ) since the chain might not yet have mixed Answer: Often a balance is best: Compared to one long chain: More independent samples Compared to many small chains: Less samples discarded for burn-in We can still parallelize Allows us to assess mixing by comparing chains 45
Markov Chain Monte Carlo (MCMC)
School of Computer Science 10-708 Probabilistic Graphical Models Markov Chain Monte Carlo (MCMC) Readings: MacKay Ch. 29 Jordan Ch. 21 Matt Gormley Lecture 16 March 14, 2016 1 Homework 2 Housekeeping Due
More informationMonte Carlo Methods. Leon Gu CSD, CMU
Monte Carlo Methods Leon Gu CSD, CMU Approximate Inference EM: y-observed variables; x-hidden variables; θ-parameters; E-step: q(x) = p(x y, θ t 1 ) M-step: θ t = arg max E q(x) [log p(y, x θ)] θ Monte
More informationThe Particle Filter. PD Dr. Rudolph Triebel Computer Vision Group. Machine Learning for Computer Vision
The Particle Filter Non-parametric implementation of Bayes filter Represents the belief (posterior) random state samples. by a set of This representation is approximate. Can represent distributions that
More informationApril 20th, Advanced Topics in Machine Learning California Institute of Technology. Markov Chain Monte Carlo for Machine Learning
for for Advanced Topics in California Institute of Technology April 20th, 2017 1 / 50 Table of Contents for 1 2 3 4 2 / 50 History of methods for Enrico Fermi used to calculate incredibly accurate predictions
More informationComputer Vision Group Prof. Daniel Cremers. 11. Sampling Methods: Markov Chain Monte Carlo
Group Prof. Daniel Cremers 11. Sampling Methods: Markov Chain Monte Carlo Markov Chain Monte Carlo In high-dimensional spaces, rejection sampling and importance sampling are very inefficient An alternative
More informationGraphical Models and Kernel Methods
Graphical Models and Kernel Methods Jerry Zhu Department of Computer Sciences University of Wisconsin Madison, USA MLSS June 17, 2014 1 / 123 Outline Graphical Models Probabilistic Inference Directed vs.
More information27 : Distributed Monte Carlo Markov Chain. 1 Recap of MCMC and Naive Parallel Gibbs Sampling
10-708: Probabilistic Graphical Models 10-708, Spring 2014 27 : Distributed Monte Carlo Markov Chain Lecturer: Eric P. Xing Scribes: Pengtao Xie, Khoa Luu In this scribe, we are going to review the Parallel
More information17 : Markov Chain Monte Carlo
10-708: Probabilistic Graphical Models, Spring 2015 17 : Markov Chain Monte Carlo Lecturer: Eric P. Xing Scribes: Heran Lin, Bin Deng, Yun Huang 1 Review of Monte Carlo Methods 1.1 Overview Monte Carlo
More informationComputer Vision Group Prof. Daniel Cremers. 14. Sampling Methods
Prof. Daniel Cremers 14. Sampling Methods Sampling Methods Sampling Methods are widely used in Computer Science as an approximation of a deterministic algorithm to represent uncertainty without a parametric
More informationMachine Learning for Data Science (CS4786) Lecture 24
Machine Learning for Data Science (CS4786) Lecture 24 Graphical Models: Approximate Inference Course Webpage : http://www.cs.cornell.edu/courses/cs4786/2016sp/ BELIEF PROPAGATION OR MESSAGE PASSING Each
More informationSTA 4273H: Statistical Machine Learning
STA 4273H: Statistical Machine Learning Russ Salakhutdinov Department of Computer Science! Department of Statistical Sciences! rsalakhu@cs.toronto.edu! h0p://www.cs.utoronto.ca/~rsalakhu/ Lecture 7 Approximate
More informationResults: MCMC Dancers, q=10, n=500
Motivation Sampling Methods for Bayesian Inference How to track many INTERACTING targets? A Tutorial Frank Dellaert Results: MCMC Dancers, q=10, n=500 1 Probabilistic Topological Maps Results Real-Time
More informationComputer Vision Group Prof. Daniel Cremers. 11. Sampling Methods
Prof. Daniel Cremers 11. Sampling Methods Sampling Methods Sampling Methods are widely used in Computer Science as an approximation of a deterministic algorithm to represent uncertainty without a parametric
More informationProbabilistic Graphical Models Lecture 17: Markov chain Monte Carlo
Probabilistic Graphical Models Lecture 17: Markov chain Monte Carlo Andrew Gordon Wilson www.cs.cmu.edu/~andrewgw Carnegie Mellon University March 18, 2015 1 / 45 Resources and Attribution Image credits,
More information16 : Approximate Inference: Markov Chain Monte Carlo
10-708: Probabilistic Graphical Models 10-708, Spring 2017 16 : Approximate Inference: Markov Chain Monte Carlo Lecturer: Eric P. Xing Scribes: Yuan Yang, Chao-Ming Yen 1 Introduction As the target distribution
More informationCS242: Probabilistic Graphical Models Lecture 7B: Markov Chain Monte Carlo & Gibbs Sampling
CS242: Probabilistic Graphical Models Lecture 7B: Markov Chain Monte Carlo & Gibbs Sampling Professor Erik Sudderth Brown University Computer Science October 27, 2016 Some figures and materials courtesy
More informationComputer Vision Group Prof. Daniel Cremers. 10a. Markov Chain Monte Carlo
Group Prof. Daniel Cremers 10a. Markov Chain Monte Carlo Markov Chain Monte Carlo In high-dimensional spaces, rejection sampling and importance sampling are very inefficient An alternative is Markov Chain
More informationMarkov Networks.
Markov Networks www.biostat.wisc.edu/~dpage/cs760/ Goals for the lecture you should understand the following concepts Markov network syntax Markov network semantics Potential functions Partition function
More informationMarkov Chain Monte Carlo Inference. Siamak Ravanbakhsh Winter 2018
Graphical Models Markov Chain Monte Carlo Inference Siamak Ravanbakhsh Winter 2018 Learning objectives Markov chains the idea behind Markov Chain Monte Carlo (MCMC) two important examples: Gibbs sampling
More informationMarkov chain Monte Carlo Lecture 9
Markov chain Monte Carlo Lecture 9 David Sontag New York University Slides adapted from Eric Xing and Qirong Ho (CMU) Limitations of Monte Carlo Direct (unconditional) sampling Hard to get rare events
More information19 : Slice Sampling and HMC
10-708: Probabilistic Graphical Models 10-708, Spring 2018 19 : Slice Sampling and HMC Lecturer: Kayhan Batmanghelich Scribes: Boxiang Lyu 1 MCMC (Auxiliary Variables Methods) In inference, we are often
More information16 : Markov Chain Monte Carlo (MCMC)
10-708: Probabilistic Graphical Models 10-708, Spring 2014 16 : Markov Chain Monte Carlo MCMC Lecturer: Matthew Gormley Scribes: Yining Wang, Renato Negrinho 1 Sampling from low-dimensional distributions
More informationCPSC 540: Machine Learning
CPSC 540: Machine Learning MCMC and Non-Parametric Bayes Mark Schmidt University of British Columbia Winter 2016 Admin I went through project proposals: Some of you got a message on Piazza. No news is
More informationBayesian Inference and MCMC
Bayesian Inference and MCMC Aryan Arbabi Partly based on MCMC slides from CSC412 Fall 2018 1 / 18 Bayesian Inference - Motivation Consider we have a data set D = {x 1,..., x n }. E.g each x i can be the
More informationMCMC: Markov Chain Monte Carlo
I529: Machine Learning in Bioinformatics (Spring 2013) MCMC: Markov Chain Monte Carlo Yuzhen Ye School of Informatics and Computing Indiana University, Bloomington Spring 2013 Contents Review of Markov
More information13: Variational inference II
10-708: Probabilistic Graphical Models, Spring 2015 13: Variational inference II Lecturer: Eric P. Xing Scribes: Ronghuo Zheng, Zhiting Hu, Yuntian Deng 1 Introduction We started to talk about variational
More information18 : Advanced topics in MCMC. 1 Gibbs Sampling (Continued from the last lecture)
10-708: Probabilistic Graphical Models 10-708, Spring 2014 18 : Advanced topics in MCMC Lecturer: Eric P. Xing Scribes: Jessica Chemali, Seungwhan Moon 1 Gibbs Sampling (Continued from the last lecture)
More informationThe Ising model and Markov chain Monte Carlo
The Ising model and Markov chain Monte Carlo Ramesh Sridharan These notes give a short description of the Ising model for images and an introduction to Metropolis-Hastings and Gibbs Markov Chain Monte
More informationApproximate Inference using MCMC
Approximate Inference using MCMC 9.520 Class 22 Ruslan Salakhutdinov BCS and CSAIL, MIT 1 Plan 1. Introduction/Notation. 2. Examples of successful Bayesian models. 3. Basic Sampling Algorithms. 4. Markov
More information28 : Approximate Inference - Distributed MCMC
10-708: Probabilistic Graphical Models, Spring 2015 28 : Approximate Inference - Distributed MCMC Lecturer: Avinava Dubey Scribes: Hakim Sidahmed, Aman Gupta 1 Introduction For many interesting problems,
More informationMarkov Chain Monte Carlo
1 Motivation 1.1 Bayesian Learning Markov Chain Monte Carlo Yale Chang In Bayesian learning, given data X, we make assumptions on the generative process of X by introducing hidden variables Z: p(z): prior
More informationSampling Rejection Sampling Importance Sampling Markov Chain Monte Carlo. Sampling Methods. Oliver Schulte - CMPT 419/726. Bishop PRML Ch.
Sampling Methods Oliver Schulte - CMP 419/726 Bishop PRML Ch. 11 Recall Inference or General Graphs Junction tree algorithm is an exact inference method for arbitrary graphs A particular tree structure
More informationMarkov chain Monte Carlo
Markov chain Monte Carlo Markov chain Monte Carlo (MCMC) Gibbs and Metropolis Hastings Slice sampling Practical details Iain Murray http://iainmurray.net/ Reminder Need to sample large, non-standard distributions:
More informationPattern Recognition and Machine Learning. Bishop Chapter 11: Sampling Methods
Pattern Recognition and Machine Learning Chapter 11: Sampling Methods Elise Arnaud Jakob Verbeek May 22, 2008 Outline of the chapter 11.1 Basic Sampling Algorithms 11.2 Markov Chain Monte Carlo 11.3 Gibbs
More informationAnswers and expectations
Answers and expectations For a function f(x) and distribution P(x), the expectation of f with respect to P is The expectation is the average of f, when x is drawn from the probability distribution P E
More informationIntroduction to Machine Learning CMU-10701
Introduction to Machine Learning CMU-10701 Markov Chain Monte Carlo Methods Barnabás Póczos & Aarti Singh Contents Markov Chain Monte Carlo Methods Goal & Motivation Sampling Rejection Importance Markov
More informationBayes Nets: Sampling
Bayes Nets: Sampling [These slides were created by Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley. All CS188 materials are available at http://ai.berkeley.edu.] Approximate Inference:
More information(5) Multi-parameter models - Gibbs sampling. ST440/540: Applied Bayesian Analysis
Summarizing a posterior Given the data and prior the posterior is determined Summarizing the posterior gives parameter estimates, intervals, and hypothesis tests Most of these computations are integrals
More informationParticle-Based Approximate Inference on Graphical Model
article-based Approimate Inference on Graphical Model Reference: robabilistic Graphical Model Ch. 2 Koller & Friedman CMU, 0-708, Fall 2009 robabilistic Graphical Models Lectures 8,9 Eric ing attern Recognition
More informationProbabilistic Machine Learning
Probabilistic Machine Learning Bayesian Nets, MCMC, and more Marek Petrik 4/18/2017 Based on: P. Murphy, K. (2012). Machine Learning: A Probabilistic Perspective. Chapter 10. Conditional Independence Independent
More informationBayesian Methods for Machine Learning
Bayesian Methods for Machine Learning CS 584: Big Data Analytics Material adapted from Radford Neal s tutorial (http://ftp.cs.utoronto.ca/pub/radford/bayes-tut.pdf), Zoubin Ghahramni (http://hunch.net/~coms-4771/zoubin_ghahramani_bayesian_learning.pdf),
More informationMarkov Chain Monte Carlo, Numerical Integration
Markov Chain Monte Carlo, Numerical Integration (See Statistics) Trevor Gallen Fall 2015 1 / 1 Agenda Numerical Integration: MCMC methods Estimating Markov Chains Estimating latent variables 2 / 1 Numerical
More informationBayesian Phylogenetics:
Bayesian Phylogenetics: an introduction Marc A. Suchard msuchard@ucla.edu UCLA Who is this man? How sure are you? The one true tree? Methods we ve learned so far try to find a single tree that best describes
More informationBayesian networks: approximate inference
Bayesian networks: approximate inference Machine Intelligence Thomas D. Nielsen September 2008 Approximative inference September 2008 1 / 25 Motivation Because of the (worst-case) intractability of exact
More informationLecture 13 : Variational Inference: Mean Field Approximation
10-708: Probabilistic Graphical Models 10-708, Spring 2017 Lecture 13 : Variational Inference: Mean Field Approximation Lecturer: Willie Neiswanger Scribes: Xupeng Tong, Minxing Liu 1 Problem Setup 1.1
More informationSampling Algorithms for Probabilistic Graphical models
Sampling Algorithms for Probabilistic Graphical models Vibhav Gogate University of Washington References: Chapter 12 of Probabilistic Graphical models: Principles and Techniques by Daphne Koller and Nir
More informationMonte Carlo in Bayesian Statistics
Monte Carlo in Bayesian Statistics Matthew Thomas SAMBa - University of Bath m.l.thomas@bath.ac.uk December 4, 2014 Matthew Thomas (SAMBa) Monte Carlo in Bayesian Statistics December 4, 2014 1 / 16 Overview
More informationProbabilistic Graphical Models
2016 Robert Nowak Probabilistic Graphical Models 1 Introduction We have focused mainly on linear models for signals, in particular the subspace model x = Uθ, where U is a n k matrix and θ R k is a vector
More informationVariational Inference. Sargur Srihari
Variational Inference Sargur srihari@cedar.buffalo.edu 1 Plan of discussion We first describe inference with PGMs and the intractability of exact inference Then give a taxonomy of inference algorithms
More informationMonte Carlo Methods. Geoff Gordon February 9, 2006
Monte Carlo Methods Geoff Gordon ggordon@cs.cmu.edu February 9, 2006 Numerical integration problem 5 4 3 f(x,y) 2 1 1 0 0.5 0 X 0.5 1 1 0.8 0.6 0.4 Y 0.2 0 0.2 0.4 0.6 0.8 1 x X f(x)dx Used for: function
More informationInference in Bayesian Networks
Andrea Passerini passerini@disi.unitn.it Machine Learning Inference in graphical models Description Assume we have evidence e on the state of a subset of variables E in the model (i.e. Bayesian Network)
More informationQuantifying Uncertainty
Sai Ravela M. I. T Last Updated: Spring 2013 1 Markov Chain Monte Carlo Monte Carlo sampling made for large scale problems via Markov Chains Monte Carlo Sampling Rejection Sampling Importance Sampling
More information14 : Approximate Inference Monte Carlo Methods
10-708: Probabilistic Graphical Models 10-708, Spring 2018 14 : Approximate Inference Monte Carlo Methods Lecturer: Kayhan Batmanghelich Scribes: Biswajit Paria, Prerna Chiersal 1 Introduction We have
More informationCalibration of Stochastic Volatility Models using Particle Markov Chain Monte Carlo Methods
Calibration of Stochastic Volatility Models using Particle Markov Chain Monte Carlo Methods Jonas Hallgren 1 1 Department of Mathematics KTH Royal Institute of Technology Stockholm, Sweden BFS 2012 June
More informationIntroduction to Machine Learning
Introduction to Machine Learning Brown University CSCI 1950-F, Spring 2012 Prof. Erik Sudderth Lecture 25: Markov Chain Monte Carlo (MCMC) Course Review and Advanced Topics Many figures courtesy Kevin
More informationMarkov Chain Monte Carlo
Markov Chain Monte Carlo (and Bayesian Mixture Models) David M. Blei Columbia University October 14, 2014 We have discussed probabilistic modeling, and have seen how the posterior distribution is the critical
More informationMarkov Chains and MCMC
Markov Chains and MCMC CompSci 590.02 Instructor: AshwinMachanavajjhala Lecture 4 : 590.02 Spring 13 1 Recap: Monte Carlo Method If U is a universe of items, and G is a subset satisfying some property,
More informationLecture 7 and 8: Markov Chain Monte Carlo
Lecture 7 and 8: Markov Chain Monte Carlo 4F13: Machine Learning Zoubin Ghahramani and Carl Edward Rasmussen Department of Engineering University of Cambridge http://mlg.eng.cam.ac.uk/teaching/4f13/ Ghahramani
More informationParticle Filtering a brief introductory tutorial. Frank Wood Gatsby, August 2007
Particle Filtering a brief introductory tutorial Frank Wood Gatsby, August 2007 Problem: Target Tracking A ballistic projectile has been launched in our direction and may or may not land near enough to
More informationCS 343: Artificial Intelligence
CS 343: Artificial Intelligence Bayes Nets: Sampling Prof. Scott Niekum The University of Texas at Austin [These slides based on those of Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley.
More informationComputational statistics
Computational statistics Markov Chain Monte Carlo methods Thierry Denœux March 2017 Thierry Denœux Computational statistics March 2017 1 / 71 Contents of this chapter When a target density f can be evaluated
More information13 : Variational Inference: Loopy Belief Propagation and Mean Field
10-708: Probabilistic Graphical Models 10-708, Spring 2012 13 : Variational Inference: Loopy Belief Propagation and Mean Field Lecturer: Eric P. Xing Scribes: Peter Schulam and William Wang 1 Introduction
More informationCS 188: Artificial Intelligence. Bayes Nets
CS 188: Artificial Intelligence Probabilistic Inference: Enumeration, Variable Elimination, Sampling Pieter Abbeel UC Berkeley Many slides over this course adapted from Dan Klein, Stuart Russell, Andrew
More informationSequential Monte Carlo and Particle Filtering. Frank Wood Gatsby, November 2007
Sequential Monte Carlo and Particle Filtering Frank Wood Gatsby, November 2007 Importance Sampling Recall: Let s say that we want to compute some expectation (integral) E p [f] = p(x)f(x)dx and we remember
More informationMCMC algorithms for fitting Bayesian models
MCMC algorithms for fitting Bayesian models p. 1/1 MCMC algorithms for fitting Bayesian models Sudipto Banerjee sudiptob@biostat.umn.edu University of Minnesota MCMC algorithms for fitting Bayesian models
More informationMARKOV CHAIN MONTE CARLO
MARKOV CHAIN MONTE CARLO RYAN WANG Abstract. This paper gives a brief introduction to Markov Chain Monte Carlo methods, which offer a general framework for calculating difficult integrals. We start with
More informationTheory of Stochastic Processes 8. Markov chain Monte Carlo
Theory of Stochastic Processes 8. Markov chain Monte Carlo Tomonari Sei sei@mist.i.u-tokyo.ac.jp Department of Mathematical Informatics, University of Tokyo June 8, 2017 http://www.stat.t.u-tokyo.ac.jp/~sei/lec.html
More informationConvex Optimization CMU-10725
Convex Optimization CMU-10725 Simulated Annealing Barnabás Póczos & Ryan Tibshirani Andrey Markov Markov Chains 2 Markov Chains Markov chain: Homogen Markov chain: 3 Markov Chains Assume that the state
More informationMarkov chain Monte Carlo methods for visual tracking
Markov chain Monte Carlo methods for visual tracking Ray Luo rluo@cory.eecs.berkeley.edu Department of Electrical Engineering and Computer Sciences University of California, Berkeley Berkeley, CA 94720
More informationProbabilistic Graphical Networks: Definitions and Basic Results
This document gives a cursory overview of Probabilistic Graphical Networks. The material has been gleaned from different sources. I make no claim to original authorship of this material. Bayesian Graphical
More informationSampling Methods (11/30/04)
CS281A/Stat241A: Statistical Learning Theory Sampling Methods (11/30/04) Lecturer: Michael I. Jordan Scribe: Jaspal S. Sandhu 1 Gibbs Sampling Figure 1: Undirected and directed graphs, respectively, with
More informationRANDOM TOPICS. stochastic gradient descent & Monte Carlo
RANDOM TOPICS stochastic gradient descent & Monte Carlo MASSIVE MODEL FITTING nx minimize f(x) = 1 n i=1 f i (x) Big! (over 100K) minimize 1 least squares 2 kax bk2 = X i 1 2 (a ix b i ) 2 minimize 1 SVM
More informationMarkov chain Monte Carlo
Markov chain Monte Carlo Probabilistic Models of Cognition, 2011 http://www.ipam.ucla.edu/programs/gss2011/ Roadmap: Motivation Monte Carlo basics What is MCMC? Metropolis Hastings and Gibbs...more tomorrow.
More informationMarkov Chain Monte Carlo methods
Markov Chain Monte Carlo methods By Oleg Makhnin 1 Introduction a b c M = d e f g h i 0 f(x)dx 1.1 Motivation 1.1.1 Just here Supresses numbering 1.1.2 After this 1.2 Literature 2 Method 2.1 New math As
More informationAn introduction to Sequential Monte Carlo
An introduction to Sequential Monte Carlo Thang Bui Jes Frellsen Department of Engineering University of Cambridge Research and Communication Club 6 February 2014 1 Sequential Monte Carlo (SMC) methods
More informationStochastic optimization Markov Chain Monte Carlo
Stochastic optimization Markov Chain Monte Carlo Ethan Fetaya Weizmann Institute of Science 1 Motivation Markov chains Stationary distribution Mixing time 2 Algorithms Metropolis-Hastings Simulated Annealing
More informationIntroduction to Stochastic Gradient Markov Chain Monte Carlo Methods
Introduction to Stochastic Gradient Markov Chain Monte Carlo Methods Changyou Chen Department of Electrical and Computer Engineering, Duke University cc448@duke.edu Duke-Tsinghua Machine Learning Summer
More informationArtificial Intelligence
ICS461 Fall 2010 Nancy E. Reed nreed@hawaii.edu 1 Lecture #14B Outline Inference in Bayesian Networks Exact inference by enumeration Exact inference by variable elimination Approximate inference by stochastic
More informationPattern Recognition and Machine Learning
Christopher M. Bishop Pattern Recognition and Machine Learning ÖSpri inger Contents Preface Mathematical notation Contents vii xi xiii 1 Introduction 1 1.1 Example: Polynomial Curve Fitting 4 1.2 Probability
More informationBayesian Inference for Dirichlet-Multinomials
Bayesian Inference for Dirichlet-Multinomials Mark Johnson Macquarie University Sydney, Australia MLSS Summer School 1 / 50 Random variables and distributed according to notation A probability distribution
More informationStochastic Simulation
Stochastic Simulation Idea: probabilities samples Get probabilities from samples: X count x 1 n 1. x k total. n k m X probability x 1. n 1 /m. x k n k /m If we could sample from a variable s (posterior)
More informationSimulation - Lectures - Part III Markov chain Monte Carlo
Simulation - Lectures - Part III Markov chain Monte Carlo Julien Berestycki Part A Simulation and Statistical Programming Hilary Term 2018 Part A Simulation. HT 2018. J. Berestycki. 1 / 50 Outline Markov
More informationLECTURE 15 Markov chain Monte Carlo
LECTURE 15 Markov chain Monte Carlo There are many settings when posterior computation is a challenge in that one does not have a closed form expression for the posterior distribution. Markov chain Monte
More informationMCMC Sampling for Bayesian Inference using L1-type Priors
MÜNSTER MCMC Sampling for Bayesian Inference using L1-type Priors (what I do whenever the ill-posedness of EEG/MEG is just not frustrating enough!) AG Imaging Seminar Felix Lucka 26.06.2012 , MÜNSTER Sampling
More informationBayesian Inference in GLMs. Frequentists typically base inferences on MLEs, asymptotic confidence
Bayesian Inference in GLMs Frequentists typically base inferences on MLEs, asymptotic confidence limits, and log-likelihood ratio tests Bayesians base inferences on the posterior distribution of the unknowns
More informationLecture 6: Markov Chain Monte Carlo
Lecture 6: Markov Chain Monte Carlo D. Jason Koskinen koskinen@nbi.ku.dk Photo by Howard Jackman University of Copenhagen Advanced Methods in Applied Statistics Feb - Apr 2016 Niels Bohr Institute 2 Outline
More informationSAMPLING ALGORITHMS. In general. Inference in Bayesian models
SAMPLING ALGORITHMS SAMPLING ALGORITHMS In general A sampling algorithm is an algorithm that outputs samples x 1, x 2,... from a given distribution P or density p. Sampling algorithms can for example be
More informationLatent Dirichlet Allocation
Latent Dirichlet Allocation 1 Directed Graphical Models William W. Cohen Machine Learning 10-601 2 DGMs: The Burglar Alarm example Node ~ random variable Burglar Earthquake Arcs define form of probability
More informationDAG models and Markov Chain Monte Carlo methods a short overview
DAG models and Markov Chain Monte Carlo methods a short overview Søren Højsgaard Institute of Genetics and Biotechnology University of Aarhus August 18, 2008 Printed: August 18, 2008 File: DAGMC-Lecture.tex
More informationSampling Methods. Bishop PRML Ch. 11. Alireza Ghane. Sampling Rejection Sampling Importance Sampling Markov Chain Monte Carlo
Sampling Methods Bishop PRML h. 11 Alireza Ghane Sampling Methods A. Ghane /. Möller / G. Mori 1 Recall Inference or General Graphs Junction tree algorithm is an exact inference method for arbitrary graphs
More informationMCMC Methods: Gibbs and Metropolis
MCMC Methods: Gibbs and Metropolis Patrick Breheny February 28 Patrick Breheny BST 701: Bayesian Modeling in Biostatistics 1/30 Introduction As we have seen, the ability to sample from the posterior distribution
More informationMH I. Metropolis-Hastings (MH) algorithm is the most popular method of getting dependent samples from a probability distribution
MH I Metropolis-Hastings (MH) algorithm is the most popular method of getting dependent samples from a probability distribution a lot of Bayesian mehods rely on the use of MH algorithm and it s famous
More informationLecture 8: Bayesian Networks
Lecture 8: Bayesian Networks Bayesian Networks Inference in Bayesian Networks COMP-652 and ECSE 608, Lecture 8 - January 31, 2017 1 Bayes nets P(E) E=1 E=0 0.005 0.995 E B P(B) B=1 B=0 0.01 0.99 E=0 E=1
More informationPhylogenetics: Bayesian Phylogenetic Analysis. COMP Spring 2015 Luay Nakhleh, Rice University
Phylogenetics: Bayesian Phylogenetic Analysis COMP 571 - Spring 2015 Luay Nakhleh, Rice University Bayes Rule P(X = x Y = y) = P(X = x, Y = y) P(Y = y) = P(X = x)p(y = y X = x) P x P(X = x 0 )P(Y = y X
More informationMCMC for big data. Geir Storvik. BigInsight lunch - May Geir Storvik MCMC for big data BigInsight lunch - May / 17
MCMC for big data Geir Storvik BigInsight lunch - May 2 2018 Geir Storvik MCMC for big data BigInsight lunch - May 2 2018 1 / 17 Outline Why ordinary MCMC is not scalable Different approaches for making
More informationReminder of some Markov Chain properties:
Reminder of some Markov Chain properties: 1. a transition from one state to another occurs probabilistically 2. only state that matters is where you currently are (i.e. given present, future is independent
More informationI. Bayesian econometrics
I. Bayesian econometrics A. Introduction B. Bayesian inference in the univariate regression model C. Statistical decision theory D. Large sample results E. Diffuse priors F. Numerical Bayesian methods
More informationMonte Carlo Inference Methods
Monte Carlo Inference Methods Iain Murray University of Edinburgh http://iainmurray.net Monte Carlo and Insomnia Enrico Fermi (1901 1954) took great delight in astonishing his colleagues with his remarkably
More informationLecture 8: Bayesian Estimation of Parameters in State Space Models
in State Space Models March 30, 2016 Contents 1 Bayesian estimation of parameters in state space models 2 Computational methods for parameter estimation 3 Practical parameter estimation in state space
More informationLecture 2: From Linear Regression to Kalman Filter and Beyond
Lecture 2: From Linear Regression to Kalman Filter and Beyond Department of Biomedical Engineering and Computational Science Aalto University January 26, 2012 Contents 1 Batch and Recursive Estimation
More information