/explore
|
You are here |
seanzhang.me | ||
| | | | |
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 ... |
|
| | | | | ||
| | | | |
kyunghyuncho.me
|
|
| | | | | ||
| | | | |
francisbach.com
[AI summary] This text discusses the scaling laws of optimization in machine learning, focusing on asymptotic expansions for both strongly convex and non-strongly convex cases. It covers the derivation of performance bounds using techniques like Laplace's method and the behavior of random minimizers. The text also explains the 'weird' behavior observed in certain plots, where non-strongly convex bounds become tight under specific conditions. The analysis connects theoretical results to practical considerations in optimization algorithms. |
|
| | | | | ||
| | | | |
values.utdallas.edu
Links to videos from the 2024 VMST-12 conference ("Paul K. Feyerabend: A Centennial Celebration") are posted below. This four-day conference w... |
|
| | | |||