Related papers: Correction to "The Generalized Stochastic Likeliho…
We discuss the prediction accuracy of assumed statistical models in terms of prediction errors for the generalized linear model and penalized maximum likelihood methods. We derive the forms of estimators for the prediction errors, such as…
Paper withdrawn due to an error into the equations of the probability amplitudes.
The performance of maximum-likelihood (ML) decoded binary linear block codes is addressed via the derivation of tightened upper bounds on their decoding error probability. The upper bounds on the block and bit error probabilities are valid…
Abstract. The purpose of this paper is twofold. We introduce the theory of random tensors, which naturally extends the method of random averaging operators in our earlier work arXiv:1910.08492, to study the propagation of randomness under…
This paper has been withdrawn by the author, due to a crucial error in the proof of Lemma 3.1.
In this paper we derive the equations for Loop Corrected Belief Propagation on a continuous variable Gaussian model. Using the exactness of the averages for belief propagation for Gaussian models, a different way of obtaining the…
In this paper we obtain a lower bound of exponent of average probability of error for classical quantum multiple access channel, which implies that for all rate pairs in the capacity region is achievable by a code with exponential…
A recent Comment by W. T. Kranz is shown to be plagued by a serious mathematical error which makes its conclusions invalid.
The proof of Theorem 11 of the paper M. Scheepers, Remarks on countable tightness, Topology and its Applications 161 (2014), 407 - 432 relies on Lemma 10 of that paper. The offered proof of Lemma 10 had shortcomings, and I was recently…
It is well known that a random q-ary code of rate \Omega(\epsilon^2) is list decodable up to radius (1 - 1/q - \epsilon) with list sizes on the order of 1/\epsilon^2, with probability 1 - o(1). However, until recently, a similar statement…
This paper presents a general methodology for deriving information-theoretic generalization bounds for learning algorithms. The main technical tool is a probabilistic decorrelation lemma based on a change of measure and a relaxation of…
A modification of Koetter-Kschischang codes for random networks is presented (these codes were also studied by Wang et al. in the context of authentication problems). The new codes have higher information rate, while maintaining the same…
The main purpose of this paper is to correct an error in the previously submitted version [*] := arXiv:2004.13749v1. [*] had been already accepted for publication in a scientific journal, but withdrawn by the author after the discovery of…
The purpose of this erratum is to fill a gap in the proof of the `Composite Braid Theorem' in the manuscript "Studying Links Via Closed Braids IV: Composite Links and Split Links (SLVCB-IV)", Inventiones Math, \{bf 102\} Fasc. 1 (1990),…
In the successive refinement problem, a fixed-length sequence emitted from an information source is encoded into two codewords by two encoders in order to give two reconstructions of the sequence. One of two reconstructions is obtained by…
This paper presents foundational theoretical results on distributed parameter estimation for undirected probabilistic graphical models. It introduces a general condition on composite likelihood decompositions of these models which…
We consider error decoding of locally repairable codes (LRC) and partial MDS (PMDS) codes through interleaved decoding. For a specific class of LRCs we investigate the success probability of interleaved decoding. For PMDS codes we show that…
The first aim of this paper is to wonder to what extent we can generalize the central limit theorem of Gordin [5] under the so-called L 1-projective criteria to ergodic stationary random fields when completely commuting filtrations are…
The article treats some questions around Gromov's filling area conjecture. It intended to show that any filling with volume $< 2 \pi$ would not be attained and to show a local systolic inequality, implying an a priori lower estimate on the…
In this short commentary we provide our comment on the article "Explicit Analytical Solution for Random Close Packing in $d=2$ and $d=3$" and its subsequent Erratum that are recently published in Physical Review Letters. In that Letter, the…