|
You are here |
vladfeinberg.com | ||
| | | | |
www.johndcook.com
|
|
| | | | | About how many items can you expect to hash with a secure hash function before risking into collisions? Here's a rule of thumb and a proof. | |
| | | | |
francisbach.com
|
|
| | | | | ||
| | | | |
fa.bianp.net
|
|
| | | | | The Langevin algorithm is a simple and powerful method to sample from a probability distribution. It's a key ingredient of some machine learning methods such as diffusion models and differentially private learning. In this post, I'll derive a simple convergence analysis of this method in the special case when the ... | |
| | | | |
wordrefiner.wordpress.com
|
|
| | | https://bluebirdofbitterness.com/2025/09/27/happy-caturday-autumn-leaves-edition-3/#like-122585?page_id=122585 | ||