Toward Bayesian Data Compression

Abstract

In order to handle large datasets omnipresent in modern science, efficient compression algorithms are necessary. Here, a Bayesian data compression (BDC) algorithm that adapts to the specific measurement situation is derived in the context of signal reconstruction. BDC compresses a dataset under conservation of its posterior structure with minimal information loss given the prior knowledge on the signal, the quantity of interest. Its basic form is valid for Gaussian priors and likelihoods. For constant noise standard deviation, basic BDC becomes equivalent to a Bayesian analog of principal component analysis. Using metric Gaussian variational inference, BDC generalizes to non‐linear settings. In its current form, BDC requires the storage of effective instrument response functions for the compressed data and corresponding noise encoding the posterior covariance structure. Their memory demand counteract the compression gain. In order to improve this, sparsity of the compressed responses can be obtained by separating the data into patches and compressing them separately. The applicability of BDC is demonstrated by applying it to synthetic data and radio astronomical data. Still the algorithm needs further improvement as the computation time of the compression and subsequent inference exceeds the time of the inference with the original data.

Construction of Teaching Management Platform for Universities Based on Big Data

“…As the data volume of online education resources is increasing, there is a need to improve the efficiency of data utilization while protecting the data operation and maintenance costs of online education resources. In a database system, the architecture is divided into application layer, logical layer, and physical layer [13]. For the online education management platform, the database infrastructure is widely used, as shown in Figure 1.…”

Attention to Entropic Communication

“…More specifically, in the problem of Bayesian data compression one tries to find compressed data that imply an approximate posterior that is as similar as possible to the original one, which is measured by their relative entropy. [ 62 ] However, there can be cases in which the relative attention entropy is a better choice as it permits for importance weighting of the potential situations.…”