Unrestricted Orderings
n
Sample orderings*
n
Use MCMC Metropolis Algorithm
n
Suppose want to compute expected
posterior loss of asking query
Q
:=
q
n
For each ordering, compute expected quality
n
Average over all sampled orderings