Matrix Completion for the Independence Model

  • Kaie Kubjas Aalto University
  • Zvi Rosen University of Pennsylvania

Abstract

We investigate the problem of completing partial matrices to rank-one matrices in the standard simplex $\Delta^{mn-1}$. The motivation for studying this problem comes from statistics: A lack of eligible completion can provide a falsification test for partial observations to come from the independence model. For each pattern of specified entries, we give equations and inequalities which are satisfied if and only if an eligible completion exists. We also describe the set of valid completions, and we optimize over this set.

Author Biographies

Kaie Kubjas, Aalto University
Aalto Science Institute, postdoctoral researcher
Zvi Rosen, University of Pennsylvania
postdoctoral researcher
Published
2017-02-08
How to Cite
KUBJAS, Kaie; ROSEN, Zvi. Matrix Completion for the Independence Model. Journal of Algebraic Statistics, [S.l.], v. 8, n. 1, feb. 2017. ISSN 1309-3452. Available at: <http://www.jalgstat.com/jalgstat/article/view/50>. Date accessed: 21 sep. 2017. doi: https://doi.org/10.18409/jas.v8i1.50.
Section
Articles - regular submission

Keywords

matrix completion; independence model; weighted graphs; tensor completion; real algebraic geometry; optimal completions