Re:Ranked programming: Probabilistic programming without pro...
by anentropic on Friday November 20, 2020 @06:26AM
(#25159408)
I really have no idea... but what I think I understood is:
Probabilities have a magnitude, i.e. 0.5 is twice as likely as 0.25
But "surprise ranks" only have an ordering: 0 (inevitable) < 1 < 2 < 3 ... < inf (impossible)
The one difference I saw was that total possibility is not normalised, in principle for a continuous variable the total can be infinity. But I'm not sure what effect this has in practice besides making it tricky to work with some contrived examples.