Does anyone know of any analytic approximations for the relationship between the efficiency of either a) source/compression coding algorithms, b) channel/error-correction coding algos, or even c) rate-distortion curves *AND* their computational/Big-O complexity (time or space)?
#infoTheory #rateDistortion #computationalComplexity #bigO #compression #errorCorrectingCodes #tractability #Shannon
tl;dr: classical #PGMs can be compiled into #circuits #PCs and then #overparameterized to increase #expressiveness but retaining #tractability.
A gentle introduction for #probabilistic and #PGM folks is this paper https://web.cs.ucla.edu/~guyvdb/papers/ProbCirc20.pdf
A companion #video #tutorial is here https://www.youtube.com/watch?v=2RAG5-L9R70
I will do a new version of this tutorial with YooJung Choi and Robert Peharz at #NeurIPS2022 in a month!
Showing latest advancements in #reliable #inference with #PCs!