Explore >> Select a destination

You are here

 djalil.chafai.net
How to speed up MCMC algorithms - Libres pensées d'un mathématicien ordinaire
| | jmlr.org
Optimal Transport for Stationary Markov Chains via Policy Iteration
7.8 parsecs away

Travel
| |
| | blog.jordan.matelsky.com
Tender is the Insight - Jordan Matelsky - Code, Coffee, & Cortex
11.2 parsecs away

Travel
| | The Short Story: I made a web-app that, given some starting text, naively tries to predict what words come next. Because the 'training' text was taken from F. Scott Fitzgerald's Tender is the Night (the first 10 chapters), we can (inaccurately) say that this robot talks like Fitzgerald.
| | darrenjw.wordpress.com
Unbiased MCMC with couplings - Darren Wilkinson's blog
7.0 parsecs away

Travel
| | Yesterday there was an RSS Read Paper meeting for the paper Unbiased Markov chain Monte Carlo with couplings by Pierre Jacob, John O'Leary and Yves F. Atchadé. The paper addresses the bias in MCMC estimates due to lack of convergence to equilibrium (the "burn-in" problem), and shows how it is possible to modify MCMC algorithms...
| | healeycodes.com
My First Golang Program - Andrew Healey
90.4 parsecs away

Travel
| Conway's Game of Life in Ebiten.