Efficient Bayesian inference with Hamiltonian Monte Carlo -- Michael Betancourt (Part 1)
MLSS Iceland 20143 HN recommenders · recommended in 3 months, 2017-2024
48K views · 11 years ago · lecture · evergreen
Michael Betancourt's lecture at MLSS Iceland 2014 on efficient Bayesian inference with Hamiltonian Monte Carlo. It covers MCMC concepts and motivation and the problems of sampling in high-dimensional distributions.
HN people return to it as a clear primer on MCMC and HMC and on why high dimensions behave counterintuitively.
10:37The Bayesian Trap
Veritasium
4.5M views • 9 years ago
11:25A visual guide to Bayesian thinking
Julia Galef
2.2M views • 11 years ago
1:21:28Lecture 01 - The Learning Problem
caltech
1.5M views • 14 years ago
11:48John Rauser keynote: "Statistics Without the Agonizing Pain" -- Strata + Hadoop 2014
O'Reilly
61K views • 12 years ago
32:32The Strange Math That Predicts (Almost) Anything
Veritasium
13.1M views • 1 year ago
4:12Correlation CAN Imply Causation! | Statistics Misconceptions
minutephysics
744K views • 9 years ago
46:29Lecture 1: Probability and Counting | Statistics 110
Harvard University
1.8M views • 13 years ago
1:08:40Lecture 1 | Machine Learning (Stanford)
Stanford
2.7M views • 18 years ago
1:01:51Lecture 1: Introduction to Information Theory
Jakob Foerster
411K views • 12 years ago
9:36Dance p 3 Mar09
Geoff Cumming
83K views • 17 years ago
10:08Naive empiricism, terrorism & Ebola.
N N Taleb's Probability Questions
52K views • 9 years ago
1:02:57Peter Norvig - The Unreasonable Effectiveness of Data
UBC Computer Science
74K views • 15 years ago
21:14The medical test paradox, and redesigning Bayes' rule
3Blue1Brown
1.4M views • 5 years ago
15:11Bayes theorem, the geometry of changing beliefs
3Blue1Brown
6M views • 6 years ago
40:45Jake Vanderplas - Statistics for Hackers - PyCon 2016.mp4
PyCon 2016
93K views • 10 years ago
1:20:33Lecture 1 | Convex Optimization I (Stanford)
Stanford
753K views • 18 years ago
1:03:32John Schulman - Reinforcement Learning from Human Feedback: Progress and Challenges
UC Berkeley EECS
88K views • 3 years ago
1:19:08CS231n Winter 2016: Lecture1: Introduction and Historical Context
Andrej Karpathy
462K views • 10 years ago
40:19Physics in Clojure - Colin Smith
ClojureTV
13K views • 9 years ago
24:07AI can't cross this line and we don't know why.
Welch Labs
2.5M views • 2 years ago
3 comments from Hacker News
Not an expert in this field, but I'm guessing this is related to unintuitive nature of geometry in high-dimensional spaces. One rough example I can think of is the fact that the number of ways to move away from the origin increases exponentially (or even faster?) as the dimensionality goes up. There is _way_ more volume away from the origin than near it, I've seen this explained as something like "most of the volume of a high-dimensional orange is in the peel". One result of this is the fact that samples of a standard gaussian end up forming a "shell" as opposed to a "ball" that you would expect (this phenomenon is called the concentration of measure in general). Also, very roughly, high-dimensional objects have lots of corners, and these corners are also very sharp. I would guess that gradient descent would get stuck in these corners and have a hard time getting out. Some links related to this: - Spikey Spheres: link - Thinking outside the 10-dimensional box - 3blue1brown: link - This is a fairly long talk about HMC, but it does talk about some problems that come up when sampling high-dimensional distributions: ▶ this video
Recently watched this on Hamiltonian Monte Carlo, and it was a fantastic primer on the basic concepts and motivations of mcmc, and later hmc ▶ this video
This is an interesting take and kudos to the author for relaying a helpful way to think about high dimensional distributions. I really like and often come back to this talk by Michael Betancourt where the theme is quite similar: ▶ this video