arXiv Analytics

Sign in

arXiv:2110.12805 [cs.IT]AbstractReferencesReviewsResources

Algorithms for the Communication of Samples

Lucas Theis, Noureldin Yosri

Published 2021-10-25, updated 2022-05-25Version 3

The efficient communication of noisy data has applications in several areas of machine learning, such as neural compression or differential privacy, and is also known as reverse channel coding or the channel simulation problem. Here we propose two new coding schemes with practical advantages over existing approaches. First, we introduce ordered random coding (ORC) which uses a simple trick to reduce the coding cost of previous approaches. This scheme further illuminates a connection between schemes based on importance sampling and the so-called Poisson functional representation. Second, we describe a hybrid coding scheme which uses dithered quantization to more efficiently communicate samples from distributions with bounded support.

Comments: Proceedings of the 39th International Conference on Machine Learning, 2022
Categories: cs.IT, math.IT, stat.ML
Related articles: Most relevant | Search more
arXiv:2401.14805 [cs.IT] (Published 2024-01-26)
Pointwise Redundancy in One-Shot Lossy Compression via Poisson Functional Representation
arXiv:1705.09590 [cs.IT] (Published 2017-05-26)
Fourier Phase Retrieval: Uniqueness and Algorithms
arXiv:2104.00861 [cs.IT] (Published 2021-04-02)
Algorithms for Poisson Phase Retrieval