按年被提到
20112017 · 1 次2026
数学、逻辑与理论›数值分析与偏微分方程·arXiv:1111.4246 · stat.CO

The No-U-Turn Sampler: Adaptively Setting Path Lengths in Hamiltonian Monte Carlo

Matthew D. Hoffman, Andrew Gelman · 2011
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2017-05-28 · 最近 2018-08-02
2不同的人
2活跃月份
2讨论串
2,575被引(OpenAlex)
arXiv 摘要(候选层不写导读)

Hamiltonian Monte Carlo (HMC) is a Markov chain Monte Carlo (MCMC) algorithm that avoids the random walk behavior and sensitivity to correlated parameters that plague many MCMC methods by taking a series of steps informed by first-order gradient information. These features allow it to converge to high-dimensional target distributions much more quickly than simpler methods such as random walk Metropolis or Gibbs sampling. However, HMC's performance is highly sensitive to two user-specified parameters: a step size ε and a desired number of steps L. In particular, if L is too small then the algorithm exhibits undesirable random walk behavior, while if L is too large the algorithm wastes computation. We introduce the No-U-Turn Sampler (NUTS), an extension to HMC that eliminates the need to set a number of steps L. NUTS uses a recursive algorithm to build a set of likely candidate points that spans a wide swath of the target distribution, stopping automatically when it starts to double back and retrace its steps. Empirically, NUTS perform at least as efficiently as and sometimes more efficiently than a well tuned standard HMC method, without requiring user intervention or costly tuning runs. We also derive a method for adapting the step size parameter ε on the fly based on primal-dual averaging. NUTS can thus be used with no hand-tuning at all. NUTS is also suitable for applications such as BUGS-style automatic inference engines that require efficient "turnkey" sampling algorithms.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论SpaceManNabs · 2018-08

“https://arxiv.org/abs/1111.4246 I believe the above was used in sk-learn or PyMC3 at some point. Like I said, the list was a bit too theory focused and not just for ML. Hope that clears things up. Also, maybe a bit out of place, but it makes my day happier when I assume good intentions out of random tidbits posted online.”

Learning Math for Machine Learning原评论 ↗
被提交为 story · 1 次