Searcharxiv⌕ Search

arXiv subjects

Antti Pöllänen

Publications and source records attributed to Antti Pöllänen.

3 recordsLinked to original sources

Identifiable causal inference with noisy treatment and no side information

In some causal inference scenarios, the treatment variable is measured inaccurately, for instance in epidemiology or econometrics. Failure to correct for the effect of this measurement error can lead to biased causal effect estimates. Previous research has not studied methods that address this issue from a causal viewpoint while allowing for complex nonlinear dependencies and without assuming access to side information. For such a scenario, this study proposes a model that assumes a continuous treatment variable that is inaccurately measured. Building on existing results for measurement error models, we prove that our model's causal effect estimates are identifiable, even without side information and knowledge of the measurement error variance. Our method relies on a deep latent variable model in which Gaussian conditionals are parameterized by neural networks, and we develop an amortized importance-weighted variational objective for training the model. Empirical results demonstrate the method's good performance with unknown measurement error. More broadly, our work extends the range of applications in which reliable causal inference can be conducted.

cs.LG↗

Bounds on the Maximal Minimum Distance of Linear Locally Repairable Codes

Locally repairable codes (LRCs) are error correcting codes used in distributed data storage. Besides a global level, they enable errors to be corrected locally, reducing the need for communication between storage nodes. There is a close connection between almost affine LRCs and matroid theory which can be utilized to construct good LRCs and derive bounds on their performance. A generalized Singleton bound for linear LRCs with parameters $(n,k,d,r,δ)$ was given in [N. Prakash et al., "Optimal Linear Codes with a Local-Error-Correction Property", IEEE Int. Symp. Inf. Theory]. In this paper, a LRC achieving this bound is called perfect. Results on the existence and nonexistence of linear perfect $(n,k,d,r,δ)$-LRCs were given in [W. Song et al., "Optimal locally repairable codes", IEEE J. Sel. Areas Comm.]. Using matroid theory, these existence and nonexistence results were later strengthened in [T. Westerbäck et al., "On the Combinatorics of Locally Repairable Codes", Arxiv: 1501.00153], which also provided a general lower bound on the maximal achievable minimum distance $d_{\rm{max}}(n,k,r,δ)$ that a linear LRC with parameters $(n,k,r,δ)$ can have. This article expands the class of parameters $(n,k,d,r,δ)$ for which there exist perfect linear LRCs and improves the lower bound for $d_{\rm{max}}(n,k,r,δ)$. Further, this bound is proved to be optimal for the class of matroids that is used to derive the existence bounds of linear LRCs.

cs.IT↗

Locally Repairable Codes and Matroid Theory

Locally repairable codes (LRCs) are error correcting codes used in distributed data storage. A traditional approach is to look for codes which simultaneously maximize error tolerance and minimize storage space consumption. However, this tends to yield codes for which error correction requires an unrealistic amount of communication between storage nodes. LRCs solve this problem by allowing errors to be corrected locally. This thesis reviews previous results on the subject presented in [1]. These include that every almost affine LRC induces a matroid such that the essential properties of the code are determined by the matroid. Also, the generalized Singleton bound for LRCs can be extended to matroids as well. Then, matroid theory can be used to find classes of matroids that either achieve the bound, meaning they are optimal in a certain sense, or at least come close to the bound. This thesis presents an improvement to the results of [1] in both of these cases. [1] T. Westerbäck, R. Freij, T. Ernvall and C. Hollanti, "On the Combinatorics of Locally Repairable Codes via Matroid Theory", arXiv:1501.00153 [cs.IT], 2014.

cs.IT↗