/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

jeremykun.com
| | www.jeremykun.com
2.1 parsecs away

Travel
| | When addressing the question of what it means for an algorithm to learn, one can imagine many different models, and there are quite a few. This invariably raises the question of which models are "the same" and which are "different," along with a precise description of how we're comparing models. We've seen one learning model so far, called Probably Approximately Correct (PAC), which espouses the following answer to the learning question:
| | lucatrevisan.wordpress.com
3.5 parsecs away

Travel
| | Today we will see how to use the analysis of the multiplicative weights algorithm in order to construct pseudorandom sets. The method will yield constructions that are optimal in terms of the size of the pseudorandom set, but not very efficient, although there is at least one case (getting an ``almost pairwise independent'' pseudorandom generator)...
| | fa.bianp.net
3.6 parsecs away

Travel
| | 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 ...
| | kevinlynagh.com
10.2 parsecs away

Travel
| [AI summary] The author discusses their experience developing a simple neural network for sensor data processing on a microcontroller, highlighting challenges with quantization and inference optimization.