Faster Relative Entropy Coding with Greedy Rejection Coding

Gergely Flamich, Stratis Markou, Jose Miguel Hernandez Lobato

Relative entropy coding (REC) algorithms encode a sample from a target distribution $Q$ using a proposal distribution $P$ using as few bits as possible. Unlike entropy coding, REC…