@BoydStephenSmithJr@hachyderm.io
Post #2450312
2026-04-25 02:22 UTC
@steven_pigeon@mstdn.ca @rk@mastodon.well.com There's a criteria https://en.wikipedia.org/wiki/Benford's_law#Benford's_law_compliance_theorem though I don't know why it would apply to "inputs to a FPU" in general -- it seems like you'd have to assume (or prove) something about what is generating those inputs (the workload or programs).
Replies (1)
-
@steven_pigeon@mstdn.ca 2026-04-25 02:32
@BoydStephenSmithJr@hachyderm.io @rk@mastodon.well.com Clearly not all inputs are Zipf- or Benford-like. Weights in NN seem to be vaguely gaussian. I'm trying to figure out what the literature on the topic is. (and, no, Google doesn't help, it's being as stupid as usual, giving me links on how floats work instead of something actually useful)