Explore >> Select a destination
|
You are here 
|
iclr-blogposts.github.io | ||
| | | | |
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 ... | |
| | | | |
blog.evjang.com
|
|
| | | | | This is a tutorial on common practices in training generative models that optimize likelihood directly, such as autoregressive models and ... | |
| | | | |
akosiorek.github.io
|
|
| | | | | Machine learning is all about probability.To train a model, we typically tune its parameters to maximise the probability of the training dataset under the mo... | |
| | | | |
sander.ai
|
|
| | | More thoughts on diffusion guidance, with a focus on its geometry in the input space. | ||
