-
Notifications
You must be signed in to change notification settings - Fork 37
Open
Description
There is a class of MCMC algorithms like Hamiltonian Monte Carlo or HMC (https://arxiv.org/pdf/1701.02434) which numerically integrate Hamiltonian's equations (with some noise) to generate random walks which converge to a desired stationary distribution (this is basically the same thing as molecular dynamics, and I came across this also: https://www.nsf.gov/awardsearch/showAward?AWD_ID=2236769).
I work on algorithms like HMC, and over the next year or so, I'm quite interested in trying to write implementations in SciLean. There are a few extra ingredients this would need, and I'm curious about how difficult you think these would be to add:
- symplectic integrators
- some handling of probability (e.g. ability to sample from bernoulli and gaussian distributions), some probability monad (if that's how Lean does probability)
- some differential geometry (optional): there are variants of these algorithms which are naturally expressed in the language of differential geometry: https://arxiv.org/abs/1410.5110
Reactions are currently unavailable
Metadata
Metadata
Assignees
Labels
No labels