Browsing by Author "Theran, Louis"

Now showing 1 - 3 of 3
  • Thumbnail Image
    Item
    The algebraic combinatorial approach for low-rank matrix completion
    (Oberwolfach : Mathematisches Forschungsinstitut Oberwolfach, 2013) Király, Franz J.; Theran, Louis; Tomioka, Ryota; Uno, Takeaki
    We propose an algebraic combinatorial framework for the problem of completing partially observed low-rank matrices. We show that the intrinsic properties of the problem, including which entries can be reconstructed, and the degrees of freedom in the reconstruction, do not depend on the values of the observed entries, but only on their position. We associate combinatorial and algebraic objects, differentials and matroids, which are descriptors of the particular reconstruction task, to the set of observed entries, and apply them to obtain reconstruction bounds. We show how similar techniques can be used to obtain reconstruction bounds on general compressed sensing problems with algebraic compression constraints. Using the new theory, we develop several algorithms for low-rank matrix completion, which allow to determine which set of entries can be potentially reconstructed and which not, and how, and we present algorithms which apply algebraic combinatorial methods in order to reconstruct the missing entries.
  • Thumbnail Image
    Item
    Algebraic matroids with graph symmetry
    (Oberwolfach : Mathematisches Forschungsinstitut Oberwolfach, 2014) Király, Franz J.; Rosen, Zvi; Theran, Louis
    This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite and infinite matroids whose ground set have some canonical symmetry, for example row and column symmetry and transposition symmetry. For (a) algebraic matroids, we expose cryptomorphisms making them accessible to techniques from commutative algebra. This allows us to introduce for each circuit in an algebraic matroid an invariant called circuit polynomial, generalizing the minimal polynomial in classical Galois theory, and studying the matroid structure with multivariate methods. For (b) matroids with symmetries we introduce combinatorial invariants capturing structural properties of the rank function and its limit behavior, and obtain proofs which are purely combinatorial and do not assume algebraicity of the matroid; these imply and generalize known results in some specific cases where the matroid is also algebraic. These results are motivated by, and readily applicable to framework rigidity, low-rank matrix completion and determinantal varieties, which lie in the intersection of (a) and (b) where additional results can be derived. We study the corresponding matroids and their associated invariants, and for selected cases, we characterize the matroidal structure and the circuit polynomials completely.
  • Thumbnail Image
    Item
    Obtaining error-minimizing estimates and universal entry-wise error bounds for low-rank matrix completion
    (Oberwolfach : Mathematisches Forschungsinstitut Oberwolfach, 2013) Király, Franz J.; Theran, Louis
    We propose a general framework for reconstructing and denoising single entries of incomplete and noisy entries. We describe: effective algorithms for deciding if and entry can be reconstructed and, if so, for reconstructing and denoising it; and a priori bounds on the error of each entry, individually. In the noiseless case our algorithm is exact. For rank-one matrices, the new algorithm is fast, admits a highly-parallel implementation, and produces an error minimizing estimate that is qualitatively close to our theoretical and the state-of-the-art Nuclear Norm and OptSpace methods.