<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>MCMC using Hamiltonian dynamics · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1206.1901/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1206.1901/feed.xml" rel="self" type="application/rss+xml" /><item><title>MCMC using Hamiltonian dynamics — mentioned by yt-sdb</title><link>https://news.ycombinator.com/item?id=28963404</link><guid isPermaLink="false">urn:hackerpapers:mention:1206.1901:28963404</guid><pubDate>Fri, 22 Oct 2021 22:11:40 GMT</pubDate><description>&lt;p&gt;Probabilistic programming uses computer science techniques to do automated statistical modeling. For example, imagine I have a coin, and I want to discover if it is biased, i.e. if it lands on heads more often than tails. In a probabilistic programming framework, I can express my model as a simple Bernoulli model, `x ~ Bernoulli(p)`, and then automatically estimate the bias parameter `p` given some data (do &amp;quot;inference&amp;quot;). You can easily do this calculation by hand or in Python, but this does not generalize to more complex real-world scenarios. For complex probabilistic models, we must rely on…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1206.1901/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.CO</category></item><item><title>MCMC using Hamiltonian dynamics — mentioned by activatedgeek</title><link>https://news.ycombinator.com/item?id=19634974</link><guid isPermaLink="false">urn:hackerpapers:mention:1206.1901:19634974</guid><pubDate>Thu, 11 Apr 2019 14:43:20 GMT</pubDate><description>&lt;p&gt;Markov chains in essence are simple. Instead of diverging and reading all the theory, I&amp;#x27;d recommend do it on a need basis. Learn as you go. So pick up a problem and move ahead. I don&amp;#x27;t think it is fruitful to just learn everything about Markov Chains just for the sake of it. Markov Chain Monte Carlo to sample from probability distributions is a good start - https://arxiv.org/abs/1206.1901 if you are into sampling.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1206.1901/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.CO</category></item><item><title>MCMC using Hamiltonian dynamics — HN submission</title><link>https://news.ycombinator.com/item?id=17064864</link><guid isPermaLink="false">urn:hackerpapers:submission:1206.1901:17064864</guid><pubDate>Mon, 14 May 2018 12:35:28 GMT</pubDate><description>&lt;p&gt;MCMC using Hamiltonian dynamics (2012)&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1206.1901/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>stat.CO</category></item><item><title>MCMC using Hamiltonian dynamics — mentioned by soVeryTired</title><link>https://news.ycombinator.com/item?id=13754084</link><guid isPermaLink="false">urn:hackerpapers:mention:1206.1901:13754084</guid><pubDate>Tue, 28 Feb 2017 14:51:11 GMT</pubDate><description>&lt;p&gt;Radford Neal&amp;#x27;s expository paper [1] on HMC is a beautiful overview of the area, and honestly one of the most enlightening papers I&amp;#x27;ve ever read. Conceptually, HMC really isn&amp;#x27;t that difficult. The broad idea is as follows: Borrowing from statistical physics, it&amp;#x27;s possible to link energy and probability as E(x) = exp(-P(x)). So you can interpret your MCMC target as an &amp;quot;energy landscape&amp;quot;. Highpoints in the landscape correspond to low probabilities in the target distribution, and valleys to high-probability regions. Now add a source of kinetic energy (an auxiliary probability distribution), and…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1206.1901/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.CO</category></item></channel></rss>
