“All we have so far is a tree of depth one, essentially…” — Dwarkesh Podcast at 47:19
“All we have so far is a tree of depth one, essentially, right? So our first move is to select by maximizing or argmaxing the Pucked criteria, which is basically, you know, Q, QsA plus C Pucked times P of A divided by N over one plus N A. So for each of these, we're going to, you know, N A is zero for all the”
0:00
2:37:29