* compile time rather than runtime portability
* lack of dynamic modifications of the runtime
not to be too contrary, but i'm not sure that these two things
are all that safe, in the security sense that i'd like for, say, a
kernel to be safe. perhaps i'm misunderstanding what they imply.
s.
In Remi's paper on ELO ratings of moves, how is mean log evidence computed?
Is that looking at the probability of the training set? e.g. if the
selected moves have estimated probabilities of 1/e, 1/e^2, 1/e, and 1/e,
then the log evidences would be -1,-2,-1, and -1 for a mean log evidence of
Jason House wrote:
In Remi's paper on ELO ratings of moves, how is mean log evidence
computed? Is that looking at the probability of the training set?
e.g. if the selected moves have estimated probabilities of 1/e, 1/e^2,
1/e, and 1/e, then the log evidences would be -1,-2,-1, and -1 for a
