/explore
|
You are here 
|
www.ethanepperly.com | ||
| | | | |
elijahpotter.dev
Back in my day, we used math for autocomplete. |
|
| | | | | ||
| | | | |
www.daniellowengrub.com
|
|
| | | | | ||
| | | | |
jdlm.info
How many moves does it take to win a game of 2048? Find out using Markov chains! |
|
| | | | | ||
| | | | |
yang-song.net
This blog post focuses on a promising new direction for generative modeling. We can learn score functions (gradients of log probability density functions) on a large number of noise-perturbed data distributions, then generate samples with Langevin-type sampling. The resulting generative models, often called score-based generative models, has several important advantages over existing model families: GAN-level sample quality without adversarial training, flexible model architectures, exact log-likelihood ... |
|
| | | |||
