515 karma · joined February 20, 2022
Just be nice with the usage because the billing is going on my personal OpenAI API key!
I am also really interested to see if CHEES HMC (https://proceedings.mlr.press/v130/hoffman21a.html) makes it as a viable in-the-wild inference technique since it gets around the nastiness of writing NUTS as a recursive algorithm on hardware (GPU / TPU) generally not friendly to that type of control flow.
The methods listed in this project (EM algorithm, VI) tend not to provide this as well but usually produce something that looks like a good posterior mean (global optimum under mean square loss) in my experience.
Most importantly though, does anyone know how they made the animation with the data sources? I feel like that came from something lightweight and convenient and I'd like to know what it was.
For example, I've noticed that of the managers I've had, the good ones and bad ones are cleanly separated by one trait or property. This is a sample size of maybe 7 or smaller.
Depending on your priors, my P(Hypothesis | Data) is maybe 0.6-0.7 which is terrible from a research and scientific point of view.
I'll take that level of certainty for day-to-day decision making anytime, though. Make enough of these weakly-backed hypotheses and you can avoid a lot of trouble.
For example, if my top K docs aren’t answering the question but each are linked to neighbors, I’d want to know some folk wisdom or tricks for structuring the neighbor graph to cheaply expand the set of useful results.
I’m broadly interested in this field and have done some prototypes for NLU as applied to development regulations.