Two-terminal source coding with common sum reconstruction

Abstract--We present the problem of two-terminal source coding with Common Sum Reconstruction (CSR). Both terminals want to reconstruct the sum of the two sources under some average distortion constraint, and the reconstructions at two terminals must be identical with high probability. We employ existing achievability results for Steinberg's common reconstruction and Wyner-Ziv's source Figure 1: The dashed line separates the two terminals. For example, let for some distortion measure d(,) and D 0. We obtain the two terminals in Figure 1 be two compute nodes optimizing the "Two-terminal Source Coding with Common Sum Reconstruction" some function with synchronous SGD, and let X Two stochastic gradients are correlated since must produce a Common Reconstruction (CR) of the sum they are noisy estimates of the gradient of the function. The butterfly all-reduce algorithm employs is a Doubly Symmetric Binary Source (DSBS) and d(,) is the two-terminal communication setup as a basic building Hamming distortion measure.