2026-03-173 saved articles | Back | Library |
|---|
| Article | Read |
|---|---|
| Thompson sampling From Wikipedia, the free encyclopedia | |
| www.k-a.in | |
| Recurrent Parameterless Attention is a Consensus Algorithm In another post, I wrote about parameterless (boneless) attention as a means of mixing information across datapoints weighted by their correlation. Doing this recurrently until convergence yields what I'd like to call a consensus algorithm. A consensus algorithm smells a lot like unsupervised clustering algorithms in that they identify groupings of points, but with the added component that the values of points themselves are modified at each iteration to move closer to their neighbors until all |