Tamás Linder

collaborators

3 papers

cs.IT2026

Rejection Sampling is Optimal for Relative Entropy Coding

Spencer Hill, Fady Alajaji, TamÃ¡s Linder +1

In relative entropy coding, a sender aims to design a stochastic code such that, on input $X \sim P_{X}$ , the receiver can generate a sample $Y \sim P_{Y ∣ X}$ . It is a standard r…

cs.IT2026

Communication Complexity of Exact Sampling under RÃ©nyi Information

Spencer Hill, Fady Alajaji, TamÃ¡s Linder

We study the problem of exact sampling under an exponential communication cost, specifically Campbell's average codeword length $L (t)$ of order $t$ , and RÃ©nyi's entropy. We provid…

cs.IT2025

Bounds on the Excess Minimum Risk via Generalized Information Divergence Measures

Ananya Omanwar, Fady Alajaji, TamÃ¡s Linder

Given finite-dimensional random vectors $Y$ , $X$ , and $Z$ that form a Markov chain in that order (i.e., $Y \to X \to Z$ ), we derive upper bounds on the excess minimum risk using ge…