Denoising diffusion probabilistic models
We present high quality image synthesis results using diffusion probabilistic models, a class
of latent variable models inspired by considerations from nonequilibrium thermodynamics …
of latent variable models inspired by considerations from nonequilibrium thermodynamics …
An introduction to neural data compression
Neural compression is the application of neural networks and other machine learning
methods to data compression. Recent advances in statistical machine learning have opened …
methods to data compression. Recent advances in statistical machine learning have opened …
[BUCH][B] Communication Complexity: and Applications
A Rao, A Yehudayoff - 2020 - books.google.com
Communication complexity is the mathematical study of scenarios where several parties
need to communicate to achieve a common goal, a situation that naturally appears during …
need to communicate to achieve a common goal, a situation that naturally appears during …
The two kinds of free energy and the Bayesian revolution
S Gottwald, DA Braun - PLoS computational biology, 2020 - journals.plos.org
The concept of free energy has its origins in 19th century thermodynamics, but has recently
found its way into the behavioral and neural sciences, where it has been promoted for its …
found its way into the behavioral and neural sciences, where it has been promoted for its …
Application of heuristic search and information theory to sequential fault diagnosis
KR Pattipati, MG Alexandridis - IEEE Transactions on Systems …, 1990 - ieeexplore.ieee.org
The problem of constructing optimal and near-optimal test sequences to diagnose
permanent faults in electronic and electromechanical systems is considered. The test …
permanent faults in electronic and electromechanical systems is considered. The test …
Faster relative entropy coding with greedy rejection coding
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 …
using a proposal distribution $ P $ using as few bits as possible. Unlike entropy coding, REC …
Distributed channel synthesis
P Cuff - IEEE Transactions on Information Theory, 2013 - ieeexplore.ieee.org
Two familiar notions of correlation are rediscovered as the extreme operating points for
distributed synthesis of a discrete memoryless channel, in which a stochastic channel output …
distributed synthesis of a discrete memoryless channel, in which a stochastic channel output …
How to compress interactive communication
We describe new ways to simulate 2-party communication protocols to get protocols with
potentially smaller communication. We show that every communication protocol that …
potentially smaller communication. We show that every communication protocol that …
Universally quantized neural compression
E Agustsson, L Theis - Advances in neural information …, 2020 - proceedings.neurips.cc
A popular approach to learning encoders for lossy compression is to use additive uniform
noise during training as a differentiable approximation to test-time quantization. We …
noise during training as a differentiable approximation to test-time quantization. We …
Information equals amortized communication
M Braverman, A Rao - IEEE Transactions on Information …, 2014 - ieeexplore.ieee.org
We show how to efficiently simulate the sending of a single message M to a receiver who
has partial information about the message, so that the expected number of bits …
has partial information about the message, so that the expected number of bits …