Inverse CDF transformation of “Bit Shuffling” creates arbitrary Xi∼fθ(x)
Reminder: If the CDF of Xi is FX(x), then the PDF of Xi is fX(x)=dxdFX(x)if it exists...
FX(x)=Pr(Xi≤x)∫−∞xfθ(x~)dx~=Pr(FX−1(Ui)≤x)Suppose Xi=FX−1(Ui) If the inverse exists...=Pr(FX(FX−1(Ui)≤FX(x))=Pr(Ui≤∈[0,1]FX(x))=FX(x)⟹FX−1(Ui)∼fθ(x)
Good “Bit Shuffling” Ui∼U(0,1) Pseudorandomness is indistinguishable from (actual true) Randomness
Rejection sampling changes the univariate sampling problem X∼fθ(x) into a two-dimensional problem (X~,U)∼f~(x~,u)=f~θ~(x~)f~(u) that samples according to the desired probabilities