Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
For given random variables (X, Y), functional representation lemma states that there exists a random variable Z and a deterministic function g such that Y = g(X, Z), and X is independent of Z. In other words, Z captures all the information about Y not contained in X. We refer to Z as a ‘perfect functional representation’ if it satisfies I(Y ;Z) = H(Y |X). We show that the existence of perfect representation depends solely on the conditional distribution pY|X and define the corresponding conditional distributions as perfectly representable. We provide a necessary and sufficient condition for pY|X to be perfectly representable. Finally, we cast the problem of checking perfect representability as a linear program and discuss its computational tractability.