Hyper Binning for Distributed Function Coding

We consider the distributed source encoding problem with 2 correlated sources X1 and X2 and a destination that seeks the outcome of a continuous function f(X1, X2). We develop a compression scheme called hyper binning in order to quantize f. Hyper binning is a natural generalization of Cover’s random code construction for the asymptotically optimal Slepian-Wolf encoding scheme that makes use of binning. The key idea behind this approach is to use linear discriminant analysis in order to characterize different source feature combinations. This scheme captures the correlation between the sources and function’s structure as a means of dimensionality reduction. We investigate the performance of hyper binning for different source distributions, and identify which classes of sources entail more partitioning to achieve better function approximation.