dab1263d1e6a88c9ba5e7e294def5e8b-Supplemental.pdf

Supplementary Material for "T ensor Completion Made Practical" Run Jennrich's algorithm (see Section F.2.1) to decompose T Here we give an outline of the proof of Theorem 3.2. This is our main contribution. A robust analysis of Jennrich's algorithm implies that we can then estimate the rank one See Section F and Section G for details. C.1 Basic Facts We use the following notation: The following claim gives us a simple relation for this. C.4 Concentration Inequalities Claim C.8. Say we have real numbers γ x In particular we will prove Theorem B.1.