In this paper, based on the factorization framework, we propose a novel robust matrix completion scheme via using the truncated-quadratic loss function, which is non-convex and non-smooth, and ...

Abstract: Robust matrix completion refers to recovering a low-rank matrix given a subset of the entries corrupted by gross errors, and has various applications since many real-world signals can be ...

This paper presents the preliminary results of a broader program to estimate the probabilities of factoring more general polynomials over ℤ . We anticipate that subsequent research will develop along ...

ABSTRACT: Factoring quadratics over Z is a staple of introductory algebra and textbooks tend to create the impression that doable factorizations are fairly common. To the contrary, if coefficients of ...