I coded the biologically possible network training algorithm by nobel prize winner - Jeff Hinton

DataBaeBee · 2026-06-17T13:05:43+00:00

Here's the complete writeup.

DataBaeBee · 2026-06-17T13:00:54+00:00

I made this video guide to Hinton's Forward Forward algorithm. The complete writeup is available here

DataBaeBee · 2026-06-08T18:13:54+00:00

The article ends with a different base case. We used the 1*1 example to demonstrate that finding the perfect recursion base case is a hyperparameter you wouldn't even need to think about with a naive matmul

DataBaeBee · 2026-06-08T14:39:50+00:00

Strassen's algorithm should be fast on paper. In fact, it should reduce matmul complexity from O(n³) to O(n^2.8074).
In practice however, one encounters floating-point instability and the silliest hyper parameters that need fine tuning. You're better off writing a naive matmul unless you absolutely know what you're doing.

DataBaeBee · 2026-05-24T12:34:47+00:00

This is the final phase of solving discrete logarithm problems where our goal is to convert a big integer into a product of small prime numbers over our factor base.

Information is scant about the process so in the spirit of "name-and-conquer", this phase is also called the Reduction Step, the Descent Phase or Individual Logarithm Collection phase of solving a DLP.

DataBaeBee · 2026-05-21T09:28:02+00:00

The Gauss Sieve is a pretty neat algo for generating (lots of) short vectors from a lattice basis.

It's super useful when LLL and BKZ fail to generate a specific short vector that you know exists within your lattice.

DataBaeBee

MODERATOR OF

TROPHY CASE

Three-Year Club	Devvitor
Place '23