Distributed Arithmetic Coding Over Binary Erasure Channel

In this paper, the Binary Erasure Channel (BEC) is researched by Distributed Arithmetic Coding (DAC) based on Slepian-Wolf coding framework. The source and side information are modelled as a virtual BEC. The DAC decoder uses maximum a posteriori (MAP) as the criterion to recover the source. A deep residual network is used to boost the DAC decoding process. The experimental results show that our algorithm nearly achieves the same performance with LT codes under different erasure probabilities.

Regularization, Bayesian Inference and Machine Learning methods for Inverse Problems†

Classical methods for inverse problems are mainly based on regularization theory. In particular those which are based on optimization of a criterion with two parts: a data-model matching and a regularization term. Different choices for these two terms and great number of optimization algorithms have been proposed. When these two terms are distance or divergence measures, they can have a Bayesian Maximum A Posteriori (MAP) interpretation where these two terms correspond, respectively, to the likelihood and prior probability models.

Constrained Adjusted Maximum a Posteriori Estimation of Bayesian Network Parameters

Maximum a posteriori estimation (MAP) with Dirichlet prior has been shown to be effective in improving the parameter learning of Bayesian networks when the available data are insufficient. Given no extra domain knowledge, uniform prior is often considered for regularization. However, when the underlying parameter distribution is non-uniform or skewed, uniform prior does not work well, and a more informative prior is required. In reality, unless the domain experts are extremely unfamiliar with the network, they would be able to provide some reliable knowledge on the studied network. With that knowledge, we can automatically refine informative priors and select reasonable equivalent sample size (ESS). In this paper, considering the parameter constraints that are transformed from the domain knowledge, we propose a Constrained adjusted Maximum a Posteriori (CaMAP) estimation method, which is featured by two novel techniques. First, to draw an informative prior distribution (or prior shape), we present a novel sampling method that can construct the prior distribution from the constraints. Then, to find the optimal ESS (or prior strength), we derive constraints on the ESS from the parameter constraints and select the optimal ESS by cross-validation. Numerical experiments show that the proposed method is superior to other learning algorithms.