Some Notes on the Sample Complexity of Approximate Channel Simulation
Some Notes on the Sample Complexity of Approximate Channel Simulation
Channel simulation algorithms can efficiently encode random samples from a prescribed target distribution $Q$ and find applications in machine learning-based lossy data compression. However, algorithms that encode exact samples usually have random runtime, limiting their applicability when a consistent encoding time is desirable. Thus, this paper considers approximate schemes with …